Journal of System Simulation ›› 2015, Vol. 27 ›› Issue (12): 2942-2947.

Previous Articles     Next Articles

Simulation Study on Scheduling Strategy of Dynamic Vehicle Routing Problem

Ning Tao1,2, Guo Chen2, Chen Rong2, Jin Hua1   

  1. 1. Institute of Software, Dalian Jiaotong University, Dalian 116045, China;
    2. School of Management, Dalian University of Technology, Dalian 116026, China
  • Received:2014-10-20 Revised:2015-01-21 Online:2015-12-08 Published:2020-07-30

Abstract: For the purpose of solving the rescheduling of dynamic vehicle routing problem, the simulation model was established to minimize the cost and optimize the stability. The method of double chains structure coding was proposed. An improved hybrid multi-phases quantum particle swarm algorithm was proposed. An AHP (Analytic hierarchy process strategy) was introduced to obtain the optimal strategy from the Pareto solution. A novel method was applied to a dynamic simulation and the result of comparing with other classical algorithms verifies its effectiveness.

Key words: dynamic vehicle routing problem, multi-phases quantum particle swarm algorithm, double chains coding, Analytic hierarchy process strategy

CLC Number: