Abstract
The Delivery Man Problem with Time Windows (DMPTW) is an extension of the Delivery Man Problem. The objective of DMPTW is to minimize the sum of customers’ arrival time while the deliveries are made during a specific time window given by the customers. Another close variant of objective is a travel duration. In the case, the problem minimizes the sum of travel durations between a depot and customer locations. It has many practical applications to network problems, e.g., whenever servers have to accommodate a set of requests to minimize clients’ total (or average) waiting time. To solve medium to large-sized instances, a two-phase metaheuristic algorithm is proposed. A construction stage generates a feasible solution using Neighborhood Descent with Random neighborhood ordering (RVND), and the optimization stage improves the feasible solution with an Iterated Local Search. Moreover, Tabu Search (TS) is incorporated in the proposed algorithm to prevent it from getting trapped into cycles. Therefore, our algorithm is prevented from becoming stuck at local optima. The results of experimental simulations are compared with well-known and successful metaheuristic algorithms. These results show that the proposed algorithm reaches better solutions in many cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ajama M, Akbari V, Salmana FS (2019) Minimizing latency in post-disaster road clearance operations. J Oper Res 277:1098–1112
Avci M, Avci MG (2017) A GRASP with iterated local search for the traveling repairman problem with profits. J Comput Ind Eng 113:323–332
Ban HB, Nguyen DN (2010) Improved genetic algorithm for Minimum Latency Problem. Proc. SOICT 9–15
Ban HB, Nguyen K, Ngo MC, Nguyen DN (2013) An efficient exact algorithm for Minimum Latency Problem. J PI 10:1–8
Ban HB, Nghia ND (2017) A Meta-Heuristic algorithm combining between Tabu and variable neighborhood search for the minimum latency problem. J FI 156(1):21–44
Ban HB, Nghia ND (2017) Metaheuristic for the Traveling Repairman Problem with Time Windows. Proc. RIVF 1–6
Beraldi P, Bruni ME, Lagana D, Musmanno R (2018) The Risk-Averse Traveling Repairman Problem with Profits. J. Soft Computing 1–15
Bertsimas D, Ryzin G (1989) “The Dynamic Traveling Repairman Problem, MIT Sloan School of Management Working Paper No. 3036-89-MS
Blum A, Chalasani P, Coppersmith D, Pulleyblank W, Raghavan P, Sudan M (1994) The Minimum Latency Problem. Proc. STOC 163–171
Bruni ME, Beraldi P, Khodaparasti S (2018) A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty. J ENDM 69:221–228
Bruni ME, Beraldi P, Khodaparasti S (2019) A Hybrid Reactive GRASP Heuristic for the Risk-Averse k-Traveling Repairman Problem with Profits. J Comput Oper Res 115:1–16
Bruni ME (2020) Sara Khodaparasti and Samuel Nucamendi-Guillén, “The bi-objective Minimum Latency Problem with Profit Collection and Uncertain Travel Times’’. Proc. ICORES 2020:109–118
Chaudhuri K, Goldfrey B, Rao S, Talwar K (2003) Path, Tree and Minimum Latency Tour. Proc. FOCS 36–45
Dewilde T, Cattrysse D, Coene S, Frits CR, Spieksma FCR, Vansteenwegen P (2013) Heuristics for the Traveling Repairman Problem with Profits. J Comput Oper Res 40:1700–1707
Dumas Y, Desrosiers J, Gélinas E (1995) An optimal algorithm for the Traveling Salesman Problem with Time Windows. J Oper Res 43:367–371
Dongarra JJ (2011) Performance of various computers using standard linear equations software. Tech. Rep. CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN, USA
Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. J Oper Res. 41:1055–1064
Feo TA, Resende MGC (1995) “Greedy Randomized Adaptive Search Procedures”, J. Global Opt., pp. 109-133
Gendreau M, Hertz A, Laporte G, Stan M (1998) A generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. J. Oper Res 43:330–335
Goemans M, Kleinberg J (1996) An improved approximation ratio for the Minimum Latency Problem. Proc. SIAM SODA 152–158
Heilporna G, Cordeaua Jean-François, Laporte Gilbert (2010) The Delivery Man Problem with Time Windows. 7:269–282
Ibaraki T, Imahori S, Nonobe K, Sobue K, Uno T, Yagiura M (2008) An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. J Discrete Appl Math 11(156):2050–2069
Johnson DS, McGeoch LA. “The traveling salesman problem: A Case Study in Local Optimization in Local Search in Combinatorial Optimization”, E. Aarts and J. K. Lenstra, eds., pp. 215-310
Martin O, Otto SW, Felten EW (1991) Large-step Markov Chains for the Traveling Salesman Problem. J Complex Syst 5(3):299–326
Mladenovic N, Hansen P (1997) Variable neighborhood search. J. Oper. Res. 24(11 24):1097–1100
Mladenovic N, Urosevi D, Hanafi S (2012) Variable neighborhood search for the Travelling Deliveryman Problem. J. 4OR 11:1–17
Salehipour A, Sorensen K, Goos P, Braysy O (2011) Efficient GRASP+VND and GRASP+VNS metaheuristics for the Traveling Repairman Problem. J Oper Res 9(2):189–209
Silva M, Subramanian A, Vidal T, Ochi L (2012) A simple and effective metaheuristic for the minimum latency problem. J EOR 221(3):513–520
Silva RF, Urrutia S (2010) A general VNS Heuristic for the Traveling Salesman Problem with Time Windows. J. Discrete Optim 7(4):203–211
Tsitsiklis JN (1992) Special cases of Traveling Salesman and Repairman Problems with time windows. J Netw 22:263–283
Talbi EG (2009) Metaheuristics: from Design to Implementation. Wiley, New Jersey
Ohlmann JW, Thomas BW (2007) A compressed-annealing heuristic for the traveling salesman problem with time windows. J Informs 19(1):80–90
Salvesbergh MW (1985) Local search in routing problems with time windows. J Ann Oper Res 4:285–305
Reeves CR (1999) Landscapes, operators and heuristic search. Ann Oper Res 86:473–490
Acknowledgements
This research was supported by the Asahi Glass Foundation under grant number AGF.2020-02.
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.
