Abstract
This paper introduces and formulates a covering traveling salesman problem with profit arose in the last mile delivery. In this problem, a set of vertices including a central depot, customers and parcel lockers (PL) are given, and the goal is to construct a Hamiltonian cycle within a pre-defined cost over a subset of customers and/or PLs to collect maximum profits, each unvisited customer is covered by a PL in the cycle or outsourced. To solve the problem, a two-phase heuristic combined with a feasible solution construction procedure and an improvement procedure is proposed. The algorithm is evaluated on two sets of instances, and the computational results indicated its efficiency.
Similar content being viewed by others
References
Zhou, L., Baldacci, R., Vigo, D., Wang, X.: A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution. Eur. J. Oper. Res. 265, 765–778 (2018)
Gendreau, M., Laporte, G., Vigo, D.: Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26, 699–714 (1999)
Hoos, H.H., Stützle, T.: On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances. Optimization Letters 9, 1247–1254 (2015)
Bernardino, R., Paias, A.: Solving the family traveling salesman problem. Eur. J. Oper. Res. 267, 453–466 (2018)
Current, J.R., Schilling, D.A.: The Covering Salesman Problem. Transportation Science 23, 208–213 (1989)
Gendreau, M., Laporte, G., Semet, F.: The Covering Tour Problem. Oper. Res. 45, 568–576 (1997)
Hachicha, M., Hodgson, M.J., Laporte, G., Semet, F.: Heuristics for the multi-vehicle covering tour problem. Computers Operations Research 27, 29–42 (2000)
Ozbaygin, G., Yaman, H., Karasan, O.E.: Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput. Oper. Res. 76, 226–237 (2016)
Salari, M., Naji-Azimi, Z.: An integer programming-based local search for the covering salesman problem. Comput. Oper. Res. 39, 2594–2602 (2012)
Salari, M., Reihaneh, M., Sabbagh, M.S.: Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Computers Industrial Engineering 83, 244–251 (2015)
Perez, J.A.M., Moreno-Vega, J.M., Martin, I.R.: Variable neighborhood tabu search and its application to the median cycle problem. Eur. J. Oper. Res. 151, 365–378 (2003)
Renaud, J., Boctor, F.F., Laporte, G.: Efficient heuristics for Median Cycle Problems. Journal of the Operational Research Society 55, 179–186 (2004)
Labbe, M., Laporte, G., Martin, I.R., Gonzalez, J.J.S.: The Ring Star Problem: Polyhedral analysis and exact algorithm. Networks 43, 177–189 (2004)
Simonetti, L., Frota, Y., de Souza, C.C.: The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Discrete Applied Mathematics 159, 1901–1914 (2011)
S. Kedad-Sidhoum, N. Viet Hung, An exact algorithm for solving the ring star problem, Optimization, 59 (2010) 125–140.
Calvete, H.I., Gale, C., Iranzo, J.A.: An efficient evolutionary algorithm for the ring star problem (vol 231, pg 22. Eur. J. Oper. Res. 246(2015), 343–343 (2013)
Baldacci, R., Dell’Amico, M., Gonzalez, J.S.: The capacitated m-ring-star problem. Oper. Res. 55, 1147–1162 (2007)
Sundar, K., Rathinam, S.: Multiple depot ring star problem: a polyhedral study and an exact algorithm. J. Global Optim. 67, 527–551 (2017)
Hoshino, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discrete Applied Mathematics 160, 2728–2741 (2012)
Naji-Azimi, Z., Salari, M., Toth, P.: A heuristic procedure for the Capacitated m-Ring-Star problem. Eur. J. Oper. Res. 207, 1227–1234 (2010)
Naji-Azimi, Z., Salari, M., Toth, P.: An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem. Eur. J. Oper. Res. 217, 17–25 (2012)
Baldacci, R., Hill, A., Hoshino, E.A., Lim, A.: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur. J. Oper. Res. 262, 879–893 (2017)
J. Edwards, A. McKinnon, T. Cherrett, F. McLeod, L.Y. Song, Carbon Dioxide Benefits of Using Collection-Delivery Points for Failed Home Deliveries in the United Kingdom, Transp. Res. Record, (2010) 136–143.
McLeod, F., Cherrett, T., Song, L.: Transport impacts of local collection/delivery points. International Journal of Logistics Research and Applications 9, 307–317 (2006)
X. Wang, L. Zhan, J. Ruan, J. Zhang, How to Choose "Last Mile'' Delivery Modes for E-Fulfillment, Mathematical Problems in Engineering, (2014).
A.T. Collins, Behavioural Influences on the Environmental Impact of Collection/Delivery Points, in: Green Logistics and Transportation, Springer International Publishing Switzerland, 2015.
Shaelaie, M.H., Salari, M., Naji-Azimi, Z.: The generalized covering traveling salesman problem. Applied Soft Computing 24, 867–878 (2014)
Pandiri, V., Singh, A.: An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Applied Soft Computing 78, 481–495 (2019)
Desrochers, M., Laporte, G.: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10, 27–36 (1991)
Kara, I., Laporte, G., Bektas, T.: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158, 793–795 (2004)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)
Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195, 791–802 (2009)
Jarboui, B., Derbel, H., Hanafi, S., Mladenovic, N.: Variable neighborhood search for location routing. Comput. Oper. Res. 40, 47–57 (2013)
Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovic, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Global Optim. 63, 515–536 (2015)
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling-salesman problem. Oper. Res. 21, 498–516 (1973)
Reinelt, G.: TSPLIB—A Traveling Salesman Problem Library. ORSA Journal on Computing 3, 376–384 (1991)
Acknowledgments
This work was supported by the Ministry of Chinese Education, Humanities, and Social Sciences project (Grant No. 17YJA630037).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Jiang, L., Zang, X., Dong, J. et al. A covering traveling salesman problem with profit in the last mile delivery. Optim Lett 16, 375–393 (2022). https://doi.org/10.1007/s11590-021-01709-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-021-01709-0