Abstract
Given a connected, undirected graph G whose edges are labeled (or colored), the colorful traveling salesman problem (CTSP) seeks a Hamiltonian tour of G with the minimum number of distinct labels (or colors). We prove that the CTSP is NP-complete and we present a heuristic algorithm and a genetic algorithm to solve the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
7. References
Chang, R. S. and Leu, S.-J., 1997, The minimum labeling spanning trees. Inform. Process. Lett., 63: 277–282.
Chou, H., Premkumar, G., and Chu, C.-H., 2001, Genetic algorithms for communications network design-An empirical study of the factors that influence performance. IEEE Transactions on Evolutionary Computation, 5: 236–249.
Golden, B., Raghavan, S., and Stanojevic, D., 2005, Heuristic search for the generalized minimum spanning tree problem. INFORMS Journal on Computing, 17(3):290–304.
Krumke, S. O., and Wirth, H. C., 1998, On the minimum label spanning tree problem. Inform. Process. Lett., 66:81–85.
Palmer, C. C. and Kershenbaum, A., 1995, An approach to a problem in network design using genetic algorithms. Networks, 26:151–163.
Wan, Y., Chen, G., and Xu, Y., 2002, A note on the minimum label spanning tree. Inform. Process. Lett., 84:99–101.
Xiong, Y., Golden, B., and Wasil, E., 2005a, Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem. Operations Research Lett., 33:77–80.
Xiong, Y., Golden, B., and Wasil, E., 2005b, A one-parameter genetic algorithm for the minimum labeling spanning tree problem. IEEE Transactions on Evolutionary Computation, 9:55–60.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Xiong, Y., Golden, B., Wasil, E. (2007). The Colorful Traveling Salesman Problem. In: Baker, E.K., Joseph, A., Mehrotra, A., Trick, M.A. (eds) Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-48793-9_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-48793-9_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-48790-8
Online ISBN: 978-0-387-48793-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)