Skip to Main content Skip to Navigation
Journal articles

A Hybrid Algorithm for Collaborative Transportation Planning among Carriers

Abstract : In this paper, there is concentration on collaborative transportation planning (CTP) among multiple carriers with pickup and delivery requests and time windows. This problem is a vehicle routing problem with constraints from standard vehicle routing problems and new constraints from a real-world application. In the problem, each carrier has a finite number of vehicles, and each request is a pickup and delivery request with time window. Moreover, each carrier has reserved requests, which must be served by itself, whereas its exchangeable requests can be outsourced to and served by other carriers. This collaboration among carriers can help them to reduce total transportation costs. A mixed integer programming model is proposed to the problem. To solve the model, a hybrid algorithm that combines Genetic Algorithm and Simulated Annealing (GASA) is proposed. This algorithm takes advantages of GASA at the same time. After tuning the parameters of the algorithm with the Taguchi method, the experiments are conducted and experimental results are provided for the hybrid algorithm. The results are compared with those obtained by a commercial solver. The comparison indicates that the GASA significantly outperforms the commercial solver. Keywords-Centralized collaborative transportation, collaborative transportation with pickup and delivery, collaborative transportation with time windows, hybrid algorithm of GA and SA.
Document type :
Journal articles
Complete list of metadata
Contributor : Jean-Baptiste VU VAN Connect in order to contact the contributor
Submitted on : Wednesday, November 6, 2019 - 3:01:51 PM
Last modification on : Sunday, June 26, 2022 - 1:37:51 AM


  • HAL Id : hal-02351688, version 1




Elham Jelodari Mamaghani, Christian Prins, Haoxun Chen. A Hybrid Algorithm for Collaborative Transportation Planning among Carriers. International Journal of Economics and Management Engineering, 2018, 12 (3), pp.383-391. ⟨hal-02351688⟩



Record views