Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs

DOI10.1016/S1007-0214(07)70068-8zbMath1174.90863OpenAlexW1978101274MaRDI QIDQ3610468

Miao He, Ye Cheng, Chao Ding

Publication date: 6 March 2009

Published in: Tsinghua Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1007-0214(07)70068-8

zbMATH Keywords

Hamiltonian cyclegenetic algorithmclustered traveling salesman problemintegrated evolutionary optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ A fast two-level variable neighborhood search for the clustered vehicle routing problem ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ A transformation technique for the clustered generalized traveling salesman problem with applications to logistics ⋮ Heuristics for a cash-collection routing problem with a cluster-first route-second approach ⋮ The Clustered Selected-Internal Steiner Tree Problem ⋮ New mathematical models of the generalized vehicle routing problem and extensions ⋮ An exact algorithm for the clustered travelling salesman problem ⋮ Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming ⋮ Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems ⋮ Time series forecasting using a two-level multi-objective genetic algorithm: a case study of maintenance cost data for tunnel fans

This page was built for publication: Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs