Abstract
In this paper, a multiple depot, multiple traveling salesman problem is transformed into a single, asymmetric traveling salesman problem if the cost of the edges satisfy the triangle inequality. This improves on the previously known transformation for a 2-depot, multiple traveling salesman problem in the literature. To test the effectiveness of the transformation, some computational results are presented by applying the well known LKH heuristic on the transformed problem for instances involving Dubins vehicles. Results show that the transformation is effective and high quality solutions can be found for large instances in a relatively short time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
