A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit - Archive ouverte HAL Access content directly
Journal Articles Annals of Operations Research Year : 2020

A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit

Abstract

The multiperiod vehicle routing problem with profit (mVRPP) is a selective vehicle routing problem where the planning horizon of each vehicle is divided into several periods. The aim of solving mVRPP is to design service itineraries so that the total amount of collected profit is maximized and the travel time limit of each period is respected. This problem arises in many real life applications, as the one encountered in cash-in-transit industry. In this paper, we present a metaheuristic approach based on the particle swarm optimization algorithm (PSO) to solve the mVRPP. Our approach incorporates an efficient optimal split procedure and dedicated local search operators proposed to guarantee high search intensification. Experiments conducted on an mVRPP benchmark show that our algorithm outperforms the state of the art metaheuristic approaches in terms of performance and robustness. Our PSO algorithm determines all the already known optimal solutions within a negligible computational time and finds 88 strict improvements among the 177 instances of the benchmark.
No file

Dates and versions

hal-02495002 , version 1 (29-02-2020)

Identifiers

Cite

Racha El-Hajj, Rym Nesrine Guibadj, Aziz Moukrim, Mehdi Serairi. A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit. Annals of Operations Research, 2020, 291 (1-2), pp.281-316. ⟨10.1007/s10479-020-03540-9⟩. ⟨hal-02495002⟩
48 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More