scientific article; zbMATH DE number 4012343
[For the entire collection see Zbl 0619.00006.] This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters, in the case where the distance matrix is asymmetrical. The problem is formulated as an integer linear program. A relaxation of this program possessing a network structure is then considered. The relaxed problem is solved by embedding a network flow routine into a branch and bound algorithm. Some versions of the algorithm make use of Lagrangan relaxation. Computational results are reported.
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- The traveling salesman problem. II: Exact methods
- The symmetric clustered traveling salesman problem
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- A lower bound for the shortest Hamiltonean path in directed graphs
- Discrete/Binary approach
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- A comprehensive survey on the generalized traveling salesman problem
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- A random-key genetic algorithm for the generalized traveling salesman problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762096)