Uncertain time-dependent vehicle routing problem with time window

被引:0
|
作者
Li B.-F. [1 ,2 ]
Xiong Z.-Y. [1 ]
Zhang J.-Y. [2 ]
Mao S. [2 ]
Zhao X.-L. [2 ]
机构
[1] Laboratory of Science and Technology on Avionics Integration Technologies, Shanghai
[2] School of Aeronautics and Astronautics Engineering, Air Force Engineering University, Xi'an
来源
Kongzhi yu Juece/Control and Decision | 2017年 / 32卷 / 05期
关键词
Double evolutional artificial bee colony algorithm; Time window; Uncertainty;
D O I
10.13195/j.kzyjc.2016.0453
中图分类号
学科分类号
摘要
The uncertain time dependent vehicle routing problems with time windows(UTDVRPTW) is proposed by introducing the uncertain theory and obtaining the minimal expected total cost as the goal. A variation of artificial bee colony algorithm is proposed to solve the problem. In the search process of requiring two points operating, the half stochastic optimal searching strategy is used to improve the traditional insertion operator and inversion operator, in which one point is randomly selected, and another point is selected by traversing the feasible solution space. Cross search is done respectively in the sum of the distance between different cities in the solution space and applied to the dual evolution form of local search. Experimental results show the effectiveness and feasibility of the proposed algorithm for solving the UTDVRPTW. © 2017, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:804 / 810
页数:6
相关论文
共 17 条
  • [1] Huang Z., Luo Z.L., Huang S.W., Application research of hybrid ant colony algorithm in vehicle routing problem with time windows, University SunYatseni: ACTA Scientiarum Naturalium, 54, 1, pp. 41-46, (2015)
  • [2] Braysy O., Gendreau M., Vehicle routing problem with time windows, Part I: Route construction and local search algorithms, Trans Science, 39, 1, pp. 104-118, (2005)
  • [3] Chiang W.C., Russell R.A., A reactive tabu search metaheuristics for the vehicle routing problem with time windows, J of Heuristics, 14, 5, pp. 425-455, (2008)
  • [4] Russell R.A., Chiang W.C., Scatter search for the vehicle routing problem with time windows, European J of Opeartional Research, 169, 2, pp. 606-622, (2006)
  • [5] Tang J.F., Pan Z.D., Richard Y.K., Et al., Vehicle routing problem with fuzzy time windows, Fuzzy Sets and Systems, 160, 5, pp. 683-695, (2009)
  • [6] Ma H.W., Yang S.L., Improved tabu search algorithm for vehicle routing problem with alternative time windows, J of System Simulation, 20, 16, pp. 4454-4457, (2008)
  • [7] Toth P., Vigo D., The Vehicle Routing Problem, pp. 155-181, (2002)
  • [8] Tan Y.Y., Wei Z., Wang S., Et al., Optimization algorithm for ladle scheduling based on the VRPTW-AT model, J of System Engineering, 28, 1, pp. 94-100, (2013)
  • [9] Gendreau M., Laporte G., Seguin R., Stochastic vehicle routing, European J of Opeartional Research, 8, 1, pp. 3-12, (1996)
  • [10] Campbell M.A., The orienteering problem with stochastic travel and service times, Ann Oper Res, 186, 1, pp. 61-81, (2011)