The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …

In this paper, a Quantum-inspired Ant Colony Optimization (Qi-ACO) is proposed to solve a
sustainable four-dimensional traveling salesman problem (4DTSP). In 4DTSP, various paths …

Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

This paper presents a new solver for the exactly one-in-a-set Generalized Traveling
Salesman Problem (GTSP). In the GTSP, we are given as input a complete directed graph …

In this paper, we present an improved two-level heuristic to solve the clustered vehicle
routing problem (CluVRP). The CluVRP is a generalization of the classical capacitated …

A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …

This paper considers a new variant of traveling salesman problem (TSP), called tabu
clustered TSP (TCTSP). The nodes in TCTSP are partitioned into two kinds of subsets …

The capacitated vehicle routing problem (CVRP) is an NP-hard problem with both
engineering and theoretical interests. In this paper, a hybrid bat algorithm with path relinking …

In this study, we present a new hybrid heuristic algorithm for the Clustered Traveling
Salesman Problem (CTSP). The CTSP is NP-hard because it includes the well-known …

Along with the development of manufacture and services, the problem of distribution network
optimization has been growing in importance, thus receiving much attention from the …