A path relinking algorithm for a multi-depot periodic vehicle routing problem |
| |
Authors: | Alireza Rahimi-Vahed Teodor Gabriel Crainic Michel Gendreau Walter Rei |
| |
Institution: | 1. Département Informatique et recherche opérationnelle and Interuniversity Research Centre on Enterprise Networks, Logistics, and Transportation (CIRRELT), Université de Montréal, C.P. 8888, succ. Centre-ville, Montreal, QC, H3C 3P8, Canada 2. Département Management et technologie, ESG and Interuniversity Research Centre on Enterprise Networks, Logistics, and Transportation (CIRRELT), Université du Québec à Montréal, C.P. 8888, succ. Centre-ville, Montreal, QC, H3C 3P8, Canada 3. Département de mathématiques et génie Industriel and Interuniversity Research Centre on Enterprise Networks, Logistics, and Transportation (CIRRELT), école Polytechnique, C.P. 6079, succ. Centre-ville, Montreal, QC, H3C 3A7, Canada
|
| |
Abstract: | In this paper, we consider a multi-depot periodic vehicle routing problem which is characterized by the presence of a homogeneous fleet of vehicles, multiple depots, multiple periods, and two types of constraints that are often found in reality, i.e., vehicle capacity and route duration constraints. The objective is to minimize total travel costs. To tackle the problem, we propose an efficient path relinking algorithm whose exploration and exploitation strategies enable the algorithm to address the problem in two different settings: (1) As a stand-alone algorithm, and (2) As a part of a co-operative search algorithm called integrative co-operative search. The performance of the proposed path relinking algorithm is evaluated, in each of the above ways, based on standard benchmark instances. The computational results show that the developed PRA performs well, in both solution quality and computational efficiency. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|