中文

Operations Research Transactions ›› 2015, Vol. 19 ›› Issue (2): 72-82.doi: 10.15960/j.cnki.issn.1007-6093.2015.02.008

Previous Articles     Next Articles

A scheduling strategy for dynamic vehicle routing problem based on double chains coding

NING Tao1,2,*, CHEN Rong1, GUO Chen1, LIANG Xu2   

  1. 1.College of Information and Technology, Dalian Maritime University, Dalian   116026, Liaoning, China; 2.Institute of Software, Dalian Jiaotong University, Dalian  116045, Liaoning, China
  • Received:2014-09-28 Online:2015-06-15 Published:2015-06-15

PDF

1314

Cited

3

Abstract:

For the purpose of solving the scheduling of dynamic vehicle routing problem, this paper establishes the simulation model to minimize the cost and stability value and maximize the freight rate, and an improved hybrid multi-phases quantum particle swarm algorithm was proposed. Firstly, it proposes the method of double chains structure coding including vehicle allocation chain and goods chain. Secondly, it proposes a dynamic scheduling strategy based on period-driven and event-driven. Finally, a novel method is applied to a dynamic simulation and the result of comparing with other classical algorithms verifies its effectiveness.

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