An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
DOI10.3390/a11100143zbMath1461.90158OpenAlexW2890540194MaRDI QIDQ2283818
Furqan Hussain Essani, Sajjad A. Haider
Publication date: 13 January 2020
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a11100143
mappingalgorithmsimulationreachability analysisfeasible solutionmodelcolored Petri nets (CPN)cpntoolsmultiple traveling salesman problem (mTSP)
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Uses Software
Cites Work
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- A neural network algorithm for the multiple traveling salesman problem
- Switched LAN simulation by colored Petri nets
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- Integer linear programming formulations of multiple salesman problems and its variations
- Petri net based scheduling
- Coloured Petri Nets
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Technical Note—A Note on the Multiple Traveling Salesmen Problem
- Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
This page was built for publication: An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
