A column generation based heuristic for the generalized vehicle routing problem with time windows - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Transportation Research Part E: Logistics and Transportation Review Year : 2021

A column generation based heuristic for the generalized vehicle routing problem with time windows

Abstract

The generalized vehicle routing problem with time windows (GVRPTW) is defined on a directed graph G = (V, A) where the vertex set V is partitioned into clusters. One cluster contains only the depot, where is located a homogeneous fleet of vehicles, each with a limited capacity. The other clusters represent customers. A demand is associated with each cluster. Inside a cluster, the vertices represent the possible locations of the customer. A time window is associated with each vertex, during which the visit must take place if the vertex is visited. The objective is to find a set of routes such that the total traveling cost is minimized, exactly one vertex per cluster is visited, and all the capacity and time constraints are respected. This paper presents a set covering formulation for the GVRPTW which is used to provide a column generation based heuristic to solve it. The proposed solving method combines several components including a construction heuristic, a route optimization procedure, local search operators and the generation of negative reduced cost routes. Experimental results on benchmark instances show that the proposed algorithm is efficient and high-quality solutions for instances with up to 120 clusters are obtained within short computation times.
Fichier principal
Vignette du fichier
2021_A column generation heuristic for the GVRPTW.pdf (595.2 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03439212 , version 1 (29-11-2021)

Identifiers

Cite

Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet, Daniele Vigo. A column generation based heuristic for the generalized vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 2021, 152, pp.102391. ⟨10.1016/j.tre.2021.102391⟩. ⟨hal-03439212⟩
52 View
682 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More