skip to main content
10.1145/3503823.3503878acmotherconferencesArticle/Chapter ViewAbstractPublication PagespciConference Proceedingsconference-collections
research-article

Fast Heuristics for Mixed Fleet Capacitated Multiple TSP with Applications to Location Based Games and Drone Assisted Transportation

Published: 22 February 2022 Publication History

Abstract

The Travelling Salesman Problem (TSP) is one of the most known problems in combinatorics and consists of finding a route so that a salesman visits all destination points exactly once with minimum cost. Applications of the problem have long been studied in various fields of computer science, however, with the modernization of transportation means as manifested by autonomous vehicles and drone based delivery, variations of TSP have seen renewed interest. Simultaneously, in location based games such as Pokemon GO, the problem of defining optimal routes in order to direct a single player or a team of players into visiting a set of locations, leads to solving TSP variations. Inspired by the above, in this paper we tackle the problem of Mixed Fleet Capacitated Multiple TSP (mfcmTSP), whereby a set of couriers (using different vehicle types or drones) must deliver a set of homogeneous parcels to predefined destinations with minimum makespan. All transportation means have capacity measured as the number of parcels they can carry. We motivate mfcmTSP considering a scenario whereby all parcels are available at a single base station and a fleet of one truck with unlimited capacity, a motorbike with k capacity and a drone with capacity of one parcel are available to fulfill delivery orders. We present a fast heuristic to obtain good solution quality with negligible running time overhead and compare it against a yardstick strategy whereby only the truck is used. Experiments demonstrate the merits of our approach.

References

[1]
Omar Cheikhrouhou and Ines Khoufi. 2021. A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy. Computer Science Review 40 (2021), 100369.
[2]
Joao Carlos Namorado Climaco and Ernesto Queiros Vieira Martins. 1982. A bicriterion shortest path algorithm. European Journal of Operational Research 11, 4 (1982), 399–404.
[3]
Mauro Dell’Amico, Roberto Montemanni, and Stefano Novellani. 2020. Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. Annals of Operations Research 289, 2 (2020), 211–226.
[4]
Vasileios Dimitriadis, Panagiotis Oikonomou, Panos K Papadopoulos, Natalia Panagou, Antonios N Dadaliaris, and Thanasis Loukopoulos. 2020. GeoMakeIt!: A Platform for Developing Location Based Games. In 2020 15th International Workshop on Semantic and Social Media Adaptation and Personalization (SMA. IEEE, 1–6.
[5]
Keld Helsgaun. 2000. An effective implementation of the Lin–Kernighan traveling salesman heuristic. European journal of operational research 126, 1 (2000), 106–130.
[6]
Sungwoo Kim and Ilkyeong Moon. 2018. Traveling salesman problem with a drone station. IEEE Transactions on Systems, Man, and Cybernetics: Systems 49, 1(2018), 42–52.
[7]
Raïssa G Mbiadou Saleu, Laurent Deroussi, Dominique Feillet, Nathalie Grangeon, and Alain Quilliot. 2018. An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem. Networks 72, 4 (2018), 459–474.
[8]
L Pinedo Michael. 2018. Scheduling: theory, algorithms, and systems. Springer.
[9]
Chase C Murray and Amanda G Chu. 2015. The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transportation Research Part C: Emerging Technologies 54 (2015), 86–109.
[10]
Alena Otto, Niels Agatz, James Campbell, Bruce Golden, and Erwin Pesch. 2018. Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey. Networks 72, 4 (2018), 411–458.
[11]
Heinrich Paessens. 1988. The savings algorithm for the vehicle routing problem. European Journal of Operational Research 34, 3 (1988), 336–344.
[12]
Daniel Schermer, Mahdi Moeini, and Oliver Wendt. 2019. The traveling salesman drone station location problem. In World congress on global optimization. Springer, 1129–1138.
[13]
Suraj Suman, Sidharth Kumar, and Swades De. 2019. UAV-assisted RFET: A novel framework for sustainable WSN. IEEE Transactions on Green Communications and Networking 3, 4 (2019), 1117–1131.
[14]
Madjid Tavana, Kaveh Khalili-Damghani, Francisco J Santos-Arteaga, and Mohammad-Hossein Zandi. 2017. Drone shipping versus truck delivery in a cross-docking system with multiple fleets and products. Expert systems with applications 72 (2017), 93–107.
[15]
Thomas Tregel, Philipp Müller, Stefan Göbel, and Ralf Steinmetz. 2018. Where’s Pikachu: Route Optimization in Location-Based Games. In 2018 10th International Conference on Virtual Worlds and Games for Serious Applications (VS-Games). IEEE, 1–8.
[16]
Phan Anh Tu, Nguyen Tuan Dat, and Pham Quang Dung. 2018. Traveling salesman problem with multiple drones. In Proceedings of the Ninth International Symposium on Information and Communication Technology. 46–53.
[17]
Marlin W Ulmer and Barrett W Thomas. 2018. Same-day delivery with heterogeneous fleets of drones and vehicles. Networks 72, 4 (2018), 475–505.
[18]
Xiaolong Xu, Hao Yuan, Mark Liptrott, and Marcello Trovati. 2018. Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Computing 22, 19 (2018), 6567–6581.

Index Terms

  1. Fast Heuristics for Mixed Fleet Capacitated Multiple TSP with Applications to Location Based Games and Drone Assisted Transportation
          Index terms have been assigned to the content through auto-classification.

          Recommendations

          Comments

          Information & Contributors

          Information

          Published In

          cover image ACM Other conferences
          PCI '21: Proceedings of the 25th Pan-Hellenic Conference on Informatics
          November 2021
          499 pages
          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          Published: 22 February 2022

          Permissions

          Request permissions for this article.

          Check for updates

          Author Tags

          1. PDSTSP
          2. city logistics
          3. drone delivery
          4. heuristic
          5. mixed fleet delivery

          Qualifiers

          • Research-article
          • Research
          • Refereed limited

          Funding Sources

          • T1EDK-05529

          Conference

          PCI 2021

          Acceptance Rates

          Overall Acceptance Rate 190 of 390 submissions, 49%

          Contributors

          Other Metrics

          Bibliometrics & Citations

          Bibliometrics

          Article Metrics

          • 0
            Total Citations
          • 51
            Total Downloads
          • Downloads (Last 12 months)4
          • Downloads (Last 6 weeks)0
          Reflects downloads up to 30 Jan 2025

          Other Metrics

          Citations

          View Options

          Login options

          View options

          PDF

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format.

          HTML Format

          Figures

          Tables

          Media

          Share

          Share

          Share this Publication link

          Share on social media