An Evolutionary Approach for the TSP and the TSP with Backhauls

Abstract

AbstractThis 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.KeywordsNetworks-GraphsTraveling Salesman ProblemsEvolutionary AlgorithmsCrossover OperatorMutation OperatorHeuristics