Computer Engineering and Applications ›› 2006, Vol. 42 ›› Issue (29): 20-.

• 博士论坛 • Previous Articles    

Solving Vehicle Routing Problem with Stochastic Demands Based on Adaptive Cross-Entropy Method

Shanzuo Lou,   

  1. 西北工业大学空中交通管理研究所
  • Received:2006-07-21 Revised:1900-01-01 Online:2006-10-11 Published:2006-10-11
  • Contact: Shanzuo Lou




  1. 西北工业大学空中交通管理研究所
  • 通讯作者: 娄山佐 lshanzuo

Abstract: A new method is proposed for solving vehicle routing problem with stochastic demands (VRPSD). Firstly, a mathematical model for VRPSD is established by using preventive recourse action. Secondly, in order to improve the performance of standard cross-entropy (SCE) algorithm, an adaptive adjustment scheme is developed for the routes used to update Markov transition matrix in terms of the improvement level of quintiles. Finally, simulation results prove the validity of the proposed method for solving VRPSD.

Key words: stochastic programming, vehicle routing, cross-entropy

摘要: 提出一种解决随机需求车辆路径问题(VRPSD)新方法。首先,采用预防性补救措施,建立了VRPSD模型,其次,为提高标准交叉熵(SCE)法性能,对用于更新Markov转移矩阵的路径,设计了根据分位值改变大小的自适应调整方法。最后,仿真结果验证了该算法解决VRPSD的有效性。

关键词: 随机规划, 车辆路径, 交叉熵