Dynamic vehicle routing and dispatching problem
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A vehicle routing and dispatching problem in a dynamic traffic network with real-time traffic information is discussed in this paper.Both re-current and non-recurrent congestion are considered in the problem.The initial route planning is made by solving a time-dependent vehicle routing problem under re-current congestion conditions.The genetic algorithm is applied.During the planning implementation,a new mechanism updating at the critical node is proposed to adjust the routes with real-time traffic information subject to the un_x005fexpected traffic accidents in non-recurrent congestion environment.It is conducted by solving a special traveling salesman problem with Dynasearch algorithm.The numerical simulation results with the Sioux Falls network show the efficiency of the new mechanism.The new strategy can improve the other strategies in a short time,and it becomes more efficient when the network becomes more dynamic.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: April 17,2018
  • Published:
You are the th visitor Address:Room 908, Building A, 25th Teaching Building, Tianjin University, 92 Weijin Road, Nankai District, Tianjin Postcode:300072
Telephone:022-27403197 Email:jmsc@tju.edu.cn