Skip to Main content Skip to Navigation
Journal articles

Adaptive large neighborhood search Algorithm for route planning of freight buses with pickup and delivery

Abstract : Freight bus is a new public transportation means for city logistics, and each freight bus can deliver and pick up goods at each customer/supplier location it passes. In this paper, we study the route planning problem of freight buses in an urban distribution system. Since each freight bus makes a tour visiting a set of pickup/delivery locations once at every given time interval in each day following a fixed route, the route planning problem can be considered a new variant of periodic vehicle routing problem with pickup and delivery. In order to solve the problem, a Mixed-Integer Linear Programming (MILP) model is formulated and an Adaptive Large Neighborhood Search (ALNS) algorithm is developed. The development of our algorithm takes into consideration specific characteristics of this problem, such as fixed route for each freight bus, possibly serving a demand in a later period but with a late service penalty, etc. The relevance of the mathematical model and the effectiveness of the proposed ALNS algorithm are proved by numerical experiments.
Document type :
Journal articles
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-03272882
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Monday, June 28, 2021 - 4:33:32 PM
Last modification on : Wednesday, August 31, 2022 - 6:55:18 PM

Links full text

Identifiers

Collections

Citation

Zheng Chang, Haoxun Chen, Farouk Yalaoui, Bo Dai. Adaptive large neighborhood search Algorithm for route planning of freight buses with pickup and delivery. Journal of Industrial & Management Optimization, 2021, 17 (4), pp.1771. ⟨10.3934/jimo.2020045⟩. ⟨hal-03272882⟩

Share

Metrics

Record views

19