Abstract
This chapter presents an evolutionary approach for solving the traveling salesman problem (TSP) and the TSP with backhauls (TSPB). We propose two evolutionary algorithms for solving the difficult TSPs. Our focus is on developing evolutionary operators based on conventional heuristics. We rely on a set of detailed computational experiments and statistical tests for developing an effective algorithm.
The chapter starts with a careful survey of the algorithms for the TSP and the TSPB, with a special emphasis on crossover and mutation operators and applications on benchmark test instances. The second part addresses our first evolutionary algorithm. We explore the use of two tour construction heuristics, nearest neighbor and greedy, in developing new crossover operators.We focus on preserving the edges in the union graph constructed by edges of the parent tours.We let the heuristics exploit the building blocks found in this graph. This way, new solutions can inherit good blocks from both parents. We also combine the two crossover operators together in generating offspring to explore the potential gain due to synergy. In addition, we make use of 2-edge exchange moves as the mutation operator to incorporate more problem specific information in the evolution process. Our reproduction strategy is based on the generational approach. Experimental results indicate that our operators are promising in terms of both solution quality and computation time.
In the third part of the chapter, we present the second evolutionary algorithm developed. This part can be thought of as an enhancement of the first algorithm. A common practice with such algorithms is to generate one child or two children from two parents. In the second implementation, we investigate the preservation of good edges available in more than two parents and generate multiple children.We use the steady-state evolution as a reproduction strategy this time and test the replacement of the worst parent or the worst population member to find the better replacement strategy. Our two mutation operators try to eliminate the longest and randomly selected edges and a third operator makes use of the cheapest insertion heuristic. The algorithm is finalized after conducting a set of experiments for best parameter settings and testing on larger TSPLIB instances. The second evolutionary algorithm is also implemented for solving randomly generated instances of the TSPB. Our experiments reveal that the algorithm is significantly better than the competitors in the literature. The last part concludes the chapter.
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
References
Traveling Salesman Problem, http://www.tsp.gatech.edu/ (last access: July 2009)
Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations (Combinatorial Optimization). Kluwer Academic, Dordrecht (2002)
Jünger, M., Reinelt, G., Rinaldi, G.: The Traveling Salesman Problem. In: Monma, C.L., Ball, M.O., Magnanti, T., Nemhauser, G. (eds.) Network Models. Handbook on Operations Research and Management Science, vol. 7, pp. 225–230. Elsevier Science, Amsterdam (1995)
Johnson, D.S., Mcgeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. John Wiley, New York (1997)
Leung, K.S., Jin, H.D., Xu, Z.B.: An Expanding Self-Organizing Neural Network for the Traveling Salesman Problem. Neurocomputing 62, 267–292 (2004)
DePuy, G.W., Moraga, R.J., Whitehouse, G.E.: Meta-RaPS: A Simple and Effective Approach for Solving Traveling Salesman Problem. Transportation Research Part E 41(1), 115–130 (2005)
Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, New York (2000)
Nagata, Y., Kobayashi, S.: Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem. In: Bäck, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 450–457. Morgan Kaufmann, San Mateo (1997)
Schmitt, L.J., Amini, M.M.: Performance Characteristics of Alternative Genetic Algorithmic Approaches to the Traveling Salesman Problem Using Path Representation: An Empirical Study. European Journal of Operational Research 108(3), 551–570 (1998)
Xiaoming, D., Runmin, Z., Rong, S., Rui, F., Shao, H.: Convergence Properties of Non-Crossover Genetic Algorithm. In: Proceedings of the Fourth World Congress on Intelligent Control and Automation, pp. 1822–1826 (2002)
Potvin, J.J.: Genetic Algorithms for the Traveling Salesman Problem. Annals of Operations Research 63, 339–370 (1996)
Reinelt, G.: TSPLIB-A Traveling Salesman Problem Library. INFORMS Journal on Computing 3(4), 376–384 (1991)
Chen, S.Y.: Is the Common Good? A New Perspective Developed in Genetic Algorithms. PhD thesis, Carnegie Mellon University, Pittsburgh, USA (1999)
Jung, S., Moon, B.R.: Toward Minimal Restriction of Genetic Encoding and Crossovers for the Two-Dimensional Euclidean TSP. IEEE Transactions on Evolutionary Computation 6(6), 557–565 (2002)
Merz, P.: A Comparison of Memetic Recombination Operators for the Traveling Salesman Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 472–479. Morgan Kaufmann, San Francisco (2002)
Ray, S.S., Bandyopadhyay, S., Pal, S.K.: New Operators of Genetic Algorithms for Traveling Salesman Problem. In: Proceedings of the 17th International Conference on Pattern Recognition, pp. 497–500. IEEE Computer Society, Washington (2004)
Chisman, J.A.: The Clustered Traveling Salesman Problem. Computers and Operations Research 22, 115–119 (1975)
Gendreau, M., Hertz, A., Laporte, G.: The Traveling Salesman Problem with Backhauls. Computers and Operations Research 23(5), 501–508 (1996)
Gendreau, M., Hertz, A., Laporte, G.: New Insertion and Post-Optimization Procedures for the Traveling Salesman Problem. Operations Research 40, 1086–1094 (1992)
Mladenoviċ, N., Hansen, P.P.: Variable Neighborhood Search. Computers and Operations Research 24, 1097–1100 (1997)
Ghaziri, H., Osman, I.H.: A Neural Network Algorithm for the Traveling Salesman Problem with Backhauls. Computers and Industrial Engineering 44(2), 267–281 (2003)
Potvin, J.J., Bengio, S.: The Vehicle Routing Problem with Time Windows. Part II: Genetic search. INFORMS Journal on Computing 8, 619–632 (1996)
Reinelt, G.: The Traveling Salesman Problem, Computational Solutions for TSP Applications. Springer, Berlin (1994)
Baraglia, R., Hidalgo, J.I., Perego, R.: A Hybrid Heuristic for the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 5(6), 613–622 (2001)
Merz, P., Freisleben, B.: Genetic Local Search for the TSP: New Results. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 159–164 (1997)
Yang, R.: Solving Large Traveling Salesman Problems with Small Population. In: Genetic Algorithms in Engineering Systems: Innovations and Applications Conference, pp. 157–162 (1997)
Tsai, H.K., Yang, J.M., Tsai, Y.F., Kao, C.Y.: A Heterogeneous Selection Genetic Algorithm for Traveling Salesman Problems. Engineering Optimization 35(3), 297–311 (2003)
Mühlenbein, H.: Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization. In: Proceedings of the Third International Conference on Genetic algorithms, pp. 416–421. Morgan Kaufmann, San Francisco (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Süral, H., Özdemirel, N.E., Önder, Ý., Turan, M.S. (2010). An Evolutionary Approach for the TSP and the TSP with Backhauls. In: Tenne, Y., Goh, CK. (eds) Computational Intelligence in Expensive Optimization Problems. Adaptation Learning and Optimization, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10701-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-10701-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10700-9
Online ISBN: 978-3-642-10701-6
eBook Packages: EngineeringEngineering (R0)