Next Article in Journal
Multi-Branch Deep Residual Network for Single Image Super-Resolution
Previous Article in Journal
Estimating the Volume of the Solution Space of SMT(LIA) Constraints by a Flat Histogram Method
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(10), 143; https://doi.org/10.3390/a11100143

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

Artificial Intelligence Lab, Department of Computer Science, Institute of Business Administration, Garden/Kayani Shaheed Road, Karachi 74400, Pakistan
*
Author to whom correspondence should be addressed.
Received: 30 July 2018 / Revised: 4 September 2018 / Accepted: 14 September 2018 / Published: 25 September 2018
Full-Text   |   PDF [4856 KB, uploaded 25 September 2018]   |  

Abstract

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. View Full-Text
Keywords: multiple traveling salesman problem (mTSP); colored Petri nets (CPN); algorithm; feasible solution; mapping; model; simulation; CPNTools; reachability analysis multiple traveling salesman problem (mTSP); colored Petri nets (CPN); algorithm; feasible solution; mapping; model; simulation; CPNTools; reachability analysis
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Essani, F.H.; Haider, S. An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets. Algorithms 2018, 11, 143.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top