Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. (12th August 2013)

• Record Type: Journal Article
• Authors: Afsar, H. Murat; Prins, Christian; Santos, Andréa Cynthia
• Is Part Of: International transactions in operational research. Volume 21:Number 1(2014:Jan.)
• Page Start: 153
• Page End: 175
• Publication Date: 2013-08-12
• Subjects: Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12041
• Languages: English
• ISSNs: 0969-6016

Abstract

<abstract abstract-type="main"> <title>Abstract</title> <p>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.</p> </abstract>