Minimizing customers’ waiting time in a vehicle routing problem with unit demands
- 215 Downloads
In this paper we study a new variant of the unit demand vehicle routing problem with the aim of minimizing the sum of customers waiting times to receive service. These kinds of problems are relevant in applications where the customers’ waiting time is essential or is more important than the vehicles’ travel time. We modify a known formulation for the multiple traveling salesman problem adapting it to the addressed problem. The derived mixed integer formulation is able to solve to optimality instances up to 40 nodes. We also develop a metaheuristic algorithm based on Iterated Greedy approach. We implement two variants of the metaheuristic algorithm using two different strategies in the constructive phase. For instances up to 40 nodes the proposed algorithms found almost all the optimal solutions and outperformed the results obtained by the formulation for instances with unknown optimal solution. In general, both versions of the metaheuristic algorithm are very fast and have a good performance too for instances ranging from 50 to 100 nodes.
KeywordsLocal Search System Science International Vehicle Rout Problem Metaheuristic Algorithm Complete Eval
Unable to display preview. Download preview PDF.
- 2.S. Kumar and R. Panneerselvam, “A survey on the vehicle routing problem and its variants,” Intell. Inform. Manag. 4, 66–74 (2012).Google Scholar
- 24.A. Salehipour, K. Sörensen, P. Goos, and O. Bräysy, “An efficient GRASP + VND metaheuristic for the traveling repairman problem,” Tech. Report (University of Antwerpen, Faculty of Applied Economics, 2008).Google Scholar
- 31.B. Gavish and S. C. Graves, “The travelling salesman problem and related problems,” Working Paper (Operations Research Center, Massachusetts Institute of Technology, 1978).Google Scholar
- 40.A. Hamacher and C. Moll, “A new heuristic for vehicle routing with narrow time windows,” in Selected papers of the Symposium on Operations Research (SOR), Braunschweig, September 3–6, 1996 (Springer, 1997), pp. 301–306.Google Scholar
- 42.M. Sevaux and K. Sörensen, “Hamiltonian paths in large clustered routing problems,” in Proceedings of the EU/MEeting 2008 Workshop on Metaheuristics for Logistics and Vehicle Routing, EU/ME’08 (2008), pp. 411–417.Google Scholar
- 45.T. Barthelemy, “A bi-objective inventory routing problem with periodic and clustered deliveries,” Master Thesis (Universite de Nantes, France, 2012).Google Scholar
- 51.A. A. Mironov and V. I. Tsurkov, “Minimax under nonlinear transportation constraints,” Dokl. Math. 64, 351 (2001).Google Scholar
- 52.A. A. Mironov and V. I. Tsurkov, “Open transportation models with a minimax criterion,” Dokl. Math. 64, 374 (2001).Google Scholar