A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem

DOI10.1007/978-3-319-08377-3_15zbMath1327.90269arXiv1304.7607OpenAlexW1492883942MaRDI QIDQ2942467

Xiaolin Tang, Xiaojun Zhou, Wei Hua Gui, Chun Hua Yang

Publication date: 11 September 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7607

zbMATH Keywords

generalized traveling salesman problemdiscrete state transition algorithmdouble R-probabilityK-circle

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• GTSP Instances Library

Cites Work

• Unnamed Item
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• A memetic algorithm for the generalized traveling salesman problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• State transition algorithm
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The symmetric generalized traveling salesman polytope
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem