Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms

Kheiri, Ahmed and Dragomir, Alina and Mueller, David and Gromicho, Joaquim and Jagtenberg, Caroline and van Hoorn, Jelke J. (2019) Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms. EURO Journal on Transportation and Logistics, 8 (5). pp. 561-595. ISSN 2192-4376

[img]
Preview
PDF (EJTL2019)
EJTL2019.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (433kB)

Abstract

This paper reports on the results of the VeRoLog Solver Challenge 2016–2017: the third solver challenge facilitated by VeRoLog, the EURO Working Group on Vehicle Routing and Logistics Optimization. The authors are the winners of second and third places, combined with members of the challenge organizing committee. The problem central to the challenge was a rich VRP: expensive and, therefore, scarce equipment was to be redistributed over customer locations within time windows. The difficulty was in creating combinations of pickups and deliveries that reduce the amount of equipment needed to execute the schedule, as well as the lengths of the routes and the number of vehicles used. This paper gives a description of the solution methods of the above-mentioned participants. The second place method involves sequences of 22 low level heuristics: each of these heuristics is associated with a transition probability to move to another low level heuristic. A randomly drawn sequence of these heuristics is applied to an initial solution, after which the probabilities are updated depending on whether or not this sequence improved the objective value, hence increasing the chance of selecting the sequences that generate improved solutions. The third place method decomposes the problem into two independent parts: first, it schedules the delivery days for all requests using a genetic algorithm. Each schedule in the genetic algorithm is evaluated by estimating its cost using a deterministic routing algorithm that constructs feasible routes for each day. After spending 80 percent of time in this phase, the last 20 percent of the computation time is spent on Variable Neighborhood Descent to further improve the routes found by the deterministic routing algorithm. This article finishes with an in-depth comparison of the results of the two approaches.

Item Type:
Journal Article
Journal or Publication Title:
EURO Journal on Transportation and Logistics
Additional Information:
The final publication is available at Springer via http://dx.doi.org/10.1007/s13676-019-00143-8
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1800/1803
Subjects:
ID Code:
133230
Deposited By:
Deposited On:
26 Apr 2019 08:35
Refereed?:
Yes
Published?:
Published
Last Modified:
22 Sep 2020 04:32