research

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

Abstract

International audienceThis paper presents a truck routing and scheduling problem faced by a public works company. Itconsists of optimizing the collection and delivery of materials between sites, using a heterogeneousfleet 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 tofulfill them. As a result, demands are split into full truckloads. A set of trucks routes are needed toserve a set of demands sharing a set of resources, available at pickup or delivery sites, which can beloaders or asphalt finishers in our application cases. Thus, these routes need to be synchronized ateach 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

    Similar works