Multi-constrained vehicle routing optimization based on improved hybrid shuffled frog leaping algorithm

被引：0
|
作者：
Lu J.-S. [1 ]
Zhai W.-Q. [1 ]
Li J.-F. [1 ]
Yi W.-C. [1 ]
Tang H.-T. [1 ]
机构：
[1] College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou
来源：
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) | 2021年 / 55卷 / 02期
关键词：
Heterogeneous vehicle; Hybrid shuffled frog leaping algorithm; Multi-depot; Product cost; Vehicle scheduling;
D O I：
10.3785/j.issn.1008-973X.2021.02.006
中图分类号：
学科分类号：
摘要：
Aiming at the product cost differentiation problem of multi-center distributed enterprises, a multi-constrained vehicle routing model including product cost, multi-depot and heterogeneous vehicle was established, and an improved hybrid shuffled frog leaping algorithm was designed to solve the problem. The initial frog population was constructed by improved clustering algorithm and adjacency matrix according to the characteristics of the problem. The concept of subgroup was proposed to design the evolution model of communication from inside to outside. The guided local search was performed in the subgroups according to the distance matrix. The designed algorithm was subjected to many different sets of comparative experiments. Results show that the designed algorithm is highly versatile and practical. Compared with traditional classical algorithms such as genetic algorithm and ant colony algorithm, it has better convergence speed and accuracy, which can effectively solve the problems. The total cost of the solution considering the product cost was reduced by an average of 6%, accounting for 13% of the total product cost, which can provide more reasonable vehicle distribution plan for enterprises. Copyright ©2021 Journal of Zhejiang University (Engineering Science). All rights reserved.
引用
收藏
页码：259 / 270
页数：11
相关论文
共 29 条
  • [1] DANTZIG G B, RAMSER J H., The truck dispatching problem, Management Science, 6, 1, pp. 80-91, (1959)
  • [2] FLORIAN A, KENNETH S., Knowledge-guided local search for the vehicle routing problem, Computers and Operations Research, 105, pp. 32-46, (2019)
  • [3] SALHI S, SARI M., A multi-level composite heuristic for the multi-depot vehicle fleet mix problem, European Journal of Operational Research, 103, 1, pp. 95-112, (1997)
  • [4] SALHI S, WASSAN N, HAJARAT M., The fleet size and mix vehicle routing problem with backhauls: formulation and set partitioning-based heuristics, Transportation Research Part E: Logistics and Transportation Review, 56, pp. 22-35, (2013)
  • [5] SUNDAR K, VENKATACHALAM S, RATHINAM S., Formulations and algorithms for the multiple-depot, fuel-constrained, multiple vehicle routing problem, American Control Conference 2016, pp. 66-91, (2016)
  • [6] LUO J, CHEN M R., Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW, Computers and Industrial Engineering, 72, pp. 84-97, (2014)
  • [7] DAYARIAN I, CRAINIC T G, GENDREAU M, Et al., A column generation approach for a multi-attribute vehicle routing problem, European Journal of Operational Research, 241, 3, pp. 888-906, (2015)
  • [8] CALVET L, FERRER A, GOMES M, Et al., Combining statistical learning with metaheuristics for the multi-depot vehicle routing problem with market segmentation, Computers and Industrial Engineering, 94, pp. 93-104, (2016)
  • [9] DE OLIVEIRA F B, ENAYATIFA R, SADAEI H J, Et al., A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem, Expert System with Applications, 54, pp. 398-402, (2016)
  • [10] CALVET L, WANG D, JUAN A, Et al., Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands, International Transactions in Operation Research, 26, 2, pp. 458-484, (2019)
123