An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets

The Multiple Traveling Salesman Problem is an extension of the famous Traveling Salesman Problem. Finding an optimal solution to the Multiple Traveling Salesman Problem (mTSP) is a difficult task as it belongs to the class of NP-hard problems. The problem becomes more complicated when the cost matrix is not symmetric. In such cases, finding even a feasible solution to the problem becomes a challenging task. In this paper, an algorithm is presented that uses Colored Petri Nets (CPN)—a mathematical modeling language—to represent the Multiple Traveling Salesman Problem. The proposed algorithm maps any given mTSP onto a CPN. The transformed model in CPN guarantees a feasible solution to the mTSP with asymmetric cost matrix. The model is simulated in CPNTools to measure two optimization objectives: the maximum time a salesman takes in a feasible solution and the collective time taken by all salesmen. The transformed model is also formally verified through reachability analysis to ensure that it is correct and is terminating.

[1]  Mandell Bellmore,et al.  Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

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

[3]  Tolga Bektas,et al.  Integer linear programming formulations of multiple salesman problems and its variations , 2006, Eur. J. Oper. Res..

[4]  A. Volgenant,et al.  Technical Note - An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem , 1988, Oper. Res..

[5]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[6]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[7]  D. A. Zaitsev.  Switched LAN simulation by colored Petri nets , 2004, Math. Comput. Simul..

[8]  Maria L. Gini.  Multi-Robot Allocation of Tasks with Temporal and Ordering Constraints , 2017, AAAI.

[9]  E. Wacholder,et al.  A neural network algorithm for the multiple traveling salesmen problem , 1989, Biological Cybernetics.

[10]  Mohammad Reza Meybodi,et al.  An Efficient Scheduling Method for Grid Systems Based on a Hierarchical Stochastic Petri Net , 2013, J. Comput. Sci. Eng..

[11]  Shahaboddin Shamshirband,et al.  GELS-GA: Hybrid metaheuristic algorithm for solving Multiple Travelling Salesman Problem , 2014, 2014 14th International Conference on Intelligent Systems Design and Applications.

[12]  Miquel Angel Piera Eroles,et al.  Optimization of Logistic and Manufacturing Systems through Simulation: A Colored Petri Net-Based Methodology , 2004, Simul..

[13]  P. Bhave,et al.  Integer programming formulations of vehicle routing problems , 1985 .

[14]  W.M.P. van der Aalst,et al.  Petri net based scheduling , 1996 .

[15]  Naiqi Wu,et al.  Necessary and sufficient conditions for deadlock-free operation in flexible manufacturing systems using a colored Petri net model , 1999, IEEE Trans. Syst. Man Cybern. Part C.

[16]  Gilbert Laporte,et al.  A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .

[17]  Michael Westergaard,et al.  CPN Tools for Editing, Simulating, and Analysing Coloured Petri Nets , 2003, ICATPN.

[18]  C. Petri.  Kommunikation mit Automaten , 1962 .

[19]  Mukesh Singhal,et al.  ALATO: An efficient intelligent algorithm for time optimization in an economic grid based on adaptive stochastic Petri net , 2015, J. Intell. Manuf..

[20]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[21]  Lars Michael Kristensen,et al.  Coloured Petri Nets - Modelling and Validation of Concurrent Systems , 2009 .

[22]  Kurt Jensen,et al.  Coloured Petri nets: A high level language for system design and analysis , 1991, Applications and Theory of Petri Nets.

[23]  Leena Jain,et al.  Traveling Salesman Problem: A Case Study , 2012, BIOINFORMATICS 2012.

[24]  Manfred W. Padberg,et al.  Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges , 1977, Oper. Res..

[25]  M. R. Rao,et al.  Technical Note - A Note on the Multiple Traveling Salesmen Problem , 1980, Oper. Res..

[26]  Chi-Hwa Song,et al.  Extended simulated annealing for augmented TSP and multi-salesmen TSP , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[27]  Agha Iqbal Ali,et al.  The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm , 1986, Discret. Appl. Math..