Benchmark for Euclidean Single-Depot Bounded Multiple Travelling Salesman Problem instances
Description
This repository introduces 168 novel instances (file: instances-168.csv) designed for solving the Euclidean Single-Depot Bounded Multiple Traveling Salesman Problem (Bounded MTSP). These instances are adapted from the TSP library, with city '1' designated as the depot, and the remaining 'n-1' cities representing destinations to be visited by 'k' salesmen. To define the tour constraints, we establish 'm_{min}' (minimum) and 'm_{max}' (maximum) values, informed by real-world surveys reflecting client visits ranging from 15 to 60. Our repository provides three sets of 'm_{min}' and 'm_{max}' pairs: 30, 50; 24, 40; and 18, 30. Additionally, the value for 'k' is calculated using the formula: ⎡ 1.3 x n ⎤ k( n , m_{max} ) = ⎜ ⎼⎼⎼⎼⎼⎼⎼ ⎥ ⎜ m_{max} ⎥ In addition to the 168 new instances, we have included 6 instances proposed by (Junjie & Dingwei, 2006) (file instances-6.csv) and 16 instances proposed by (Necula et al. 2015) (instances-16.csv), raising the total to 190 instances. For each instance, we provide the best solution delivered by our 3-phase algorithm (folders: solutions-22 and solutions-163) and its corresponding solution graph (folder: graphs), along with a table detailing the minimum, average and maximum costs, the run number in which the best cost was obtained and the time elapsed to obtain that best cost, as well as the average processing time, the best cost and the lower bound achieved by the CPLEX solver (IBM, 2024), as well as the elapsed processing time, limited to 2 hours (file: results.xlsx). These instances serve as valuable benchmarks for researchers exploring MTSP variants. R. Necula, M. Breaban, and M. Raschip, "Performance evaluation of ant colony systems for the single-depot multiple traveling salesman problem", In International Conference on Hybrid Artificial Intelligence Systems, Springer, Cham. pp. 257--268, 2015. Available: \url{https://doi.org/10.1007/978-3-319-19644-2\_22} P. Junjie and W. Dingwei, "An ant colony optimization algorithm for multiple travelling salesman problem", In First International Conference on Innovative Computing, Information and Control-Volume I (ICICIC'06), Vol. 1, pp. 210--213, IEEE, 2006 Available: \url{https://doi.org/10.1109/ICICIC.2006.40} V. H. Pacheco-Valencia, N. Vakhania and J. A. Hernández-Aguilar, "An Algorithm to Solve the Euclidean Single-Depot Bounded Multiple Traveling Salesman Problem", In 2023 IEEE World Conference on Applied Intelligence and Computing (AIC), Sonbhadra, India, 2023, pp. 7-12, Available: https://doi.org/10.1109/AIC57670.2023.10263920. IBM, "IBM Ilog CPLEX optimization studio versión 22.1.1", Available at https://www.ibm.com/academic/home, Last accessed 15 march 2024. TSPLIB Available: http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/tsp/ Last consulted 30 sep 2023
Files
Steps to reproduce
To execute the program included in this repository, the 'stepsToReproduce.txt' file has been included with the steps for its execution within the 'code' folder.