Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size - Archive ouverte HAL Access content directly
Journal Articles International Transactions in Operational Research Year : 2014

Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size

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

Abstract

The generalized vehicle routing problem with flexible fleet size (GVRP‐flex) extends the classical capacitated vehicle routing problem (CVRP) by partitioning the set of required nodes into clusters and has interesting applications such as humanitarian logistics. The problem aims at minimizing the total cost for a set of routes, such that each cluster is visited exactly once and its total demand is delivered to one of its nodes. An exact method based on column generation (CG) and two metaheuristics derived from iterated local search are proposed for the case with flexible fleet size. On five sets of benchmarks, including a new one, the CG approach often provides good upper and lower bounds, whereas the metaheuristics find, in a few seconds, solutions with small optimality gaps.

Dates and versions

hal-02291644 , version 1 (19-09-2019)

Identifiers

Cite

Hasan Murat Afsar, Christian Prins, Andréa Cynthia Santos. Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. International Transactions in Operational Research, 2014, 21 (1), pp.153-175. ⟨10.1111/itor.12041⟩. ⟨hal-02291644⟩

Collections

CNRS UTT LOSI
17 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More