Enhanced Branch-Cut-and-Price Algorithm for Heterogeneous Fleet Vehicle Routing Problems - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2018

Enhanced Branch-Cut-and-Price Algorithm for Heterogeneous Fleet Vehicle Routing Problems

(1) , (2) , (1)
1
2

Abstract

This paper considers a family of Vehicle Routing Problem (VRP) variants that generalize the classical Capacitated VRP by taking into account the possibility that vehicles di↵er by capacity, costs, depot allocation, or even by the subset of customers that they can visit. This work proposes a branch- cut-and-price algorithm that adapts advanced features found in the best performing exact algorithms for homogeneous fleet VRPs. The original con- tributions include: (i) the use of Extended Capacity Cuts, defined over a pseudo-polynomially large extended formulation, together with Rank-1 Cuts, defined over the Set Partitioning Formulation; (ii) the concept of vehicle-type dependent memory for Rank-1 Cuts; and (iii) a new family of lifted Extended Capacity Cuts that takes advantage of the vehicle-type dependent route enumeration. The algorithm was extensively tested in in- stances of the literature and was shown to be significantly better than pre- vious exact algorithms, finding optimal solutions for many instances with up to 200 customers and also for some larger instances. A new set of set of benchmark instances is also proposed.
Not file

Dates and versions

hal-01664844 , version 1 (15-12-2017)

Identifiers

Cite

Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa. Enhanced Branch-Cut-and-Price Algorithm for Heterogeneous Fleet Vehicle Routing Problems. European Journal of Operational Research, 2018, 270 (2), pp.530-543. ⟨10.1016/j.ejor.2018.04.009⟩. ⟨hal-01664844⟩
197 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More