Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming

Abstract This study describes a single phase algorithm for the fixed destination multi-depot multiple traveling salesman problem with multiple tours (mdmTSP). This problem widely appears in the field of logistics mostly in connection with maintenance networks. The general model of the technical inspection and maintenance systems is shown in the first part, where the solution of this problem is an important question. A mathematical model of the system’s object expert assignment is proposed with the constraints typical of the system, like experts’ capacity minimum and maximum and constraints on maximum and daily tours of the experts. In the second part, the developed evolutionary programming algorithm is described which solves the assignment, regarding the constraints introducing penalty functions in the algorithm. In the last part of the paper, the convergence of the algorithm and the run times and some examination of the parallelization are presented.

[1]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[2]  Nikbakhsh Javadian,et al.  An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems , 2011, Appl. Soft Comput..

[3]  Cliff T. Ragsdale,et al.  A new approach to solving the multiple traveling salesperson problem using genetic algorithms , 2006, Eur. J. Oper. Res..

[4]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[5]  P. Parthiban,et al.  Optimization of Non-Linear Multiple Traveling Salesman Problem Using K-Means Clustering, Shrink Wrap Algorithm and Meta-Heuristics , 2009 .

[6]  Andrei Horvat Marc,et al.  New mathematical models of the generalized vehicle routing problem and extensions , 2012 .

[7]  Joel Levitt,et al.  The handbook of maintenance management , 1997 .

[8]  John Mittenthal,et al.  Capacitated hierarchical clustering heuristic for multi depot location-routing problems , 2013 .

[9]  János Abonyi,et al.  Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm , 2011, Intelligent Computational Optimization in Engineering.

[10]  Martti Mäntylä,et al.  Logistics from IMS towards virtual factory , 2000 .

[11]  Gur Mosheiov,et al.  Vehicle routing with pick-up and delivery: tour-partitioning heuristics , 1998 .

[12]  Gyu-Sung Cho,et al.  Integrated GA-VRP solver for multi-depot system , 2007, Comput. Ind. Eng..

[13]  R. Hinterding.  Self-adaptation using multi-chromosomes , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[14]  János Abonyi,et al.  A novel approach to solve multiple traveling salesmen problem by genetic algorithm , 2010 .

[15]  José Elias Laier,et al.  Localising and quantifying damage by means of a multi-chromosome genetic algorithm , 2012, Adv. Eng. Softw..

[16]  N. Baine,et al.  A simple multi-chromosome genetic algorithm optimization of a Proportional-plus-Derivative Fuzzy Logic Controller , 2008, NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society.

[17]  C. Ding,et al.  Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs , 2007 .

[18]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[19]  D. Simchi-Levi,et al.  The Logic of Logistics: Theory, Algorithms, and Applications for Logistics and Supply Chain Management , 1999 .

[20]  L. Kota.  Optimisation of Large Scale Maintenance Networks with Evolutionary Programming , 2011 .

[21]  Kang Tai,et al.  Probability Collectives: A multi-agent approach for solving combinatorial optimization problems , 2010, Appl. Soft Comput..