Time-Dependent Multi-Depot Heterogeneous Vehicle Routing Problem Considering Temporal–Spatial Distance

Dengkai Hou, Houming Fan, Xiaoxue Ren, Panjun Tian and Yingchun Lv
Additional contact information
Dengkai Hou: College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China
Houming Fan: College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China
Xiaoxue Ren: College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China
Panjun Tian: College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China
Yingchun Lv: College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China

Sustainability, 2021, vol. 13, issue 9, 1-16

Abstract: Aiming at the multi-depot heterogeneous vehicle routing problem under the time-dependent road network and soft time window, considering vehicle fixed cost, time window penalty cost and vehicle transportation cost, an optimization model of time-dependent multi-depot heterogeneous vehicle routing problem is established with the objective of minimizing distribution cost. According to the characteristics of the problem, a hybrid genetic algorithm with variable neighborhood search considering the temporal–spatial distance is designed. Customers are clustered according to the temporal–spatial distance to generate initial solutions, which improves the quality of the algorithm. The depth search capability of the variable neighborhood search algorithm is applied to the local search strategy of the genetic algorithm to enhance the local search capability of the algorithm. An adaptive neighborhood search number strategy and a new acceptance mechanism of simulated annealing are proposed to balance the breadth and depth required for population evolution. The validity of the model and algorithm is verified by several sets of examples of different scales. The research results not only deepen and expand the relevant research on vehicle routing problem, but also provide theoretical basis for logistics enterprises to optimize distribution scheme.

Keywords: vehicle routing problem; temporal–spatial distance; time-dependent road network; hybrid genetic algorithm with variable neighborhood search (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2071-1050/13/9/4674/pdf (application/pdf)
https://www.mdpi.com/2071-1050/13/9/4674/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:13:y:2021:i:9:p:4674-:d:541245

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().