In this part of my home page, I share some test data sets that we used in some of our research papers.
The multiple traveling salesman problem in presence of drone- and robot-supported packet stations: we used these instances in the following paper:
Konstantin Kloster, Mahdi Moeini, Daniele Vigo, Oliver Wendt: The multiple traveling salesman problem in presence of drone- and robot-supported packet stations, European Journal of Operational Research (Elsevier), Vol. 305, Issue 2, pp. 630-643, (2023).
The data sets are available from: Instances for the multiple traveling salesman problem with drone stations (mTSP-DS)
Kloster, K., Moeini, M., Vigo, D., & Wendt, O. (2022). Instances for the multiple traveling salesman problem with drone stations (mTSP-DS). doi: 10.5281/zenodo.6380739
The Traveling Salesman Drone Station Location Problem: we used these instances in the following paper:
Daniel Schermer, Mahdi Moeini, Oliver Wendt: The Traveling Salesman Drone Station Location Problem, Advances in Intelligent Systems and Computing, Vol. 991, pp. 1129-1138, Springer (2019).
The data sets are available from: Instances for the traveling salesman drone station location problem (TSDSLP) (2019)
Schermer, D., Moeini, M., Wendt, O.: Instances for the traveling salesman drone station location problem (TSDSLP) (2019). https://doi.org/10.5281/zenodo.2594795
A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem: we used these instances in the following paper:
Mahdi Moeini, Hagen Salewski: A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem, Advances in Intelligent Systems and Computing, Vol. 991, pp. 1023-1032, Springer (2019).
The data sets are available from: Instances for the truck-drone-ATV routing problem
Salewski, H., Moeini, M.: Instances for the truck-drone-ATV routing problem. https://doi.org/10.5281/zenodo.2600809
Maximum Dispersion Problem: we used these instances in the following article:
Mahdi Moeini, David Goerzen, Oliver Wendt: A Local Search Heuristic for Solving the Maximum Dispersion Problem, Lecture Notes in Artificial Intelligence (Springer), Vol. 10751, pp. 362–371, 2018.
DOI: 10.1007/978-3-319-75417-8_34
The instances are available on this page (for downloading them, please see the bottom of the page. The name of the file is: Instances_MaxDP.zip).
Maximum Ratio Clique Problem: we used these instances in the following article:
Dominik Goeke, Mahdi Moeini, David Poganiuch: A Variable Neighborhood Search Heuristic for the Maximum Ratio Clique Problem, Computers & Operations Research (Elsevier), Volume 87, pp. 283 - 291, (2017).
The instances are available on this page (for downloading them, please see the bottom of the page. The name of the file is: MRCP Instances.zip).
Last update: 2022-10-09