Solving a new type of TSP using genetic algorithm

In this paper, a new type of TSP, i.e. PTSP (Polymorphic Traveling Salesman Problem) is proposed. The problem is discovered from the research of scan field route optimization. As for PTSP, every node is polymorphic, which means each node can have several states, but obtains only a determined state in a determined loop, moreover a path which connects a pair of nodes can be different and have different distances when either of the node is in a different state in this pair of nodes. Aiming at the particularity of PTSP, hierarchical mapping operator is proposed. By reasonable partition, PTSP weight matrix can be translated to TSP weight matrix formally. A combination of hierarchical mapping operator with classical TSP algorithms is a valid way to solve PTSP. To optimize the search process of GA(genetic algorithm), the select operator of GA is improved. In this paper, a combination of hierarchical mapping operator with improved genetic algorithm is used. Finally, four types of select operators are compared to evaluate their convergent results and performances.

[1]  Marvin D. Troutt,et al.  Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem , 2003, Eur. J. Oper. Res..

[2]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[3]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[4]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[5]  Xin Yu,et al.  An optimization approach for planning robotic field coverage , 2015, IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society.

[6]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[7]  Gilbert Laporte,et al.  The Black and White Traveling Salesman Problem , 2006, Oper. Res..

[8]  H. A. Mallot,et al.  Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving , 2009, Psychological research.

[9]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[10]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[11]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[12]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[13]  Luo Xiong.  Status and Prospect of Ant Colony Optimization Algorithm , 2004 .

[14]  Aravind Seshadri,et al.  A FAST ELITIST MULTIOBJECTIVE GENETIC ALGORITHM: NSGA-II , 2000 .

[15]  Ji-jun Zhang.  Solving TSP with improved multi-Agent genetic algorithm: Solving TSP with improved multi-Agent genetic algorithm , 2008 .

[16]  K. P. Sudheer,et al.  Modelling evaporation using an artificial neural network algorithm , 2002 .

[17]  Yoshikane Takahashi,et al.  A mathematical framework for solving dynamic optimization problems with adaptive networks , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[18]  Elias Kyriakides,et al.  Hybrid Ant Colony-Genetic Algorithm (GAAPI) for Global Continuous Optimization , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[19]  Li Xiao.  Solving TSP with improved multi-Agent genetic algorithm , 2008 .

[20]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..