Vehicle routing problem: light-robust-optimization model and algorithm

被引:0
|
作者
Sun L. [1 ,2 ]
Pan Q.-K. [1 ]
Zou W.-Q. [1 ]
Wang Y.-M. [3 ]
机构
[1] School of Mechatronic Engineering and Automation, Shanghai University, Shanghai
[2] School of Transportation and Vehicle Engineering, Shandong University of Technology School, Zibo
[3] School of Information Engineering, Nanjing Audit University, Nanjing
基金
中国国家自然科学基金;
关键词
Hyper-heuristics; Particle swarm optimization; Robust optimization; Vehicle routing problem;
D O I
10.7641/CTA.2020.90957
中图分类号
学科分类号
摘要
A light-robust-optimization model is proposed for a vehicle routing problem with uncertain travel times (VRP-UT) with the objective of minimizing total variable cost. A hyper particle swarm optimization (HPSO) including problem-specific knowledge is proposed to solve the model. The proposed HPSO algorithm uses an initialized strategy based on deep first search in graph theory to accelerate the convergent speed at the early stage, and adopts two novel updating rules to generate efficient constructive algorithms, as well as employs some search algorithms based on balance strategy to enhance the optimization capability. Experimental results show that HPSO is an efficient algorithm to solve VRP-UT. © 2021, Editorial Department of Control Theory & Applications South China University of Technology. All right reserved.
引用
收藏
页码:206 / 212
页数:6
相关论文
共 17 条
  • [1] OYOLA J, ARNTZEN H, WOODRUFF D L., The stochastic vehicle routing problem, a literature review, parts I: Models, EURO Journal on Transportation and Logistics, 7, 3, pp. 193-221, (2018)
  • [2] SUNGUR I, ORDO' EZ F, DESSOUKY M., A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty, IIE Transactions, 40, 5, pp. 509-523, (2008)
  • [3] LEE C, LEE K, PARK S., Robust vehicle routing problem with deadlines and travel time/demand uncertainty, Journal of the Operational Research Society, 63, 9, pp. 1294-1306, (2011)
  • [4] SCHO BEL A., Generalized light robustness and the trade-off between robustness and nominal quality, Mathematical Methods of Operations Research, 80, 2, pp. 161-191, (2014)
  • [5] WUL, HIFI M, BEDERINA H., A new robust criterion for the vehicle routing problem with uncertain travel time, Computers and Industrial Engineering, 112, pp. 607-615, (2017)
  • [6] HAN J, LEE C, PARK S., A robust scenario approach for the vehicle routing problem with uncertain travel times, Transportation Science, 48, 3, pp. 373-390, (2013)
  • [7] DUAN Zhengyu, LEI Zengxiang, SUN Shuo, Et al., Multi-objective robust optimization model and algorithm for stochastic timedependent vehicle routing problem, Journal of Southwest JiaoTong University, 54, 3, pp. 565-572, (2019)
  • [8] HU C, LU J, LIU X, Et al., Robust vehicle routing problem with hard time windows under demand and travel time uncertainty, Computers and Operations Research, 9, pp. 139-153, (2018)
  • [9] CHRYSANTHOS E, GOUNARI S, PANAGIOTIS P, Et al., An adaptive memory programming framework for the robust capacitated vehicle routing problem, Transportation Science, 50, 4, pp. 1239-1260, (2016)
  • [10] LI Yang, FAN Houming, ZHANG Xiaonan, Et al., Two-phase variable neighborhood scatter search for the capacitated vehicle routing problem with stochastic demand, Control Theory & Applications, 34, 12, pp. 1564-1604, (2017)