An adaptive large neighborhood search for a full truckload routing problem in public works - Archive ouverte HAL Access content directly
Conference Papers Year :

An adaptive large neighborhood search for a full truckload routing problem in public works

Abstract

This paper presents a truck routing and scheduling problem faced by a public works company. It consists of optimizing the collection and delivery of materials between sites, using a heterogeneous fleet of vehicles. These flows of materials arise in levelling works and construction of roads networks. As the quantity of demands usually exceeds the capacity of a truck, several trucks are needed to fulfill them. As a result, demands are split into full truckloads. A set of trucks routes are needed to serve a set of demands sharing a set of resources, available at pickup or delivery sites, which can be loaders or asphalt finishers in our application cases. Thus, these routes need to be synchronized at each resource. We propose an Adaptive Large Neighborhood Search (ALNS) to solve this problem. This approach is evaluated on real instances from a public work company in France.
Fichier principal
Vignette du fichier
ODYSSEUS2015_AGSoumission_V3.pdf (364.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01168035 , version 1 (25-06-2015)

Identifiers

  • HAL Id : hal-01168035 , version 1

Cite

Axel Grimault, Nathalie Bostel, Willy Lambert, Fabien Lehuédé. An adaptive large neighborhood search for a full truckload routing problem in public works. Odysseus 2015, May 2015, Ajaccio, France. ⟨hal-01168035⟩
145 View
402 Download

Share

Gmail Facebook Twitter LinkedIn More