2011Unpublished venueRequires access

Vehicle routing problem in dynamic urban traffic network

Yanfeng Li, Gao Ziyou, Jun Li

Open publisher page 8 citations

Abstract

This paper presents a vehicle routing problem in dynamic urban traffic network with real-time traffic information. Both re-current and non-recurrent congestion are considered in the problem. We develop a method to solve the problem by combining the initial routes arrangement with the real-time route adjustment. The initial route planning is made by solving a time-dependent vehicle routing problem under recurrent congestion conditions. The genetic algorithm is applied. During the plan implementation, a new mechanism updating at the critical node is proposed to adjust the routes with real-time traffic information subject to the unexpected traffic accidents in non-recurrent congestion environment. Through the numerical simulation, the results show that the new route updating mechanism is more effective than others in the literatures, and the advantage by adopting the new mechanism becomes more prominent when the network becomes more dynamic.

About this research paper

What this paper is about

This paper presents a vehicle routing problem in dynamic urban traffic network with real-time traffic information. Both re-current and non-recurrent congestion are considered in the problem. We develop a method to solve the problem by combining the initial routes arrangement with the real-time route adjustment. The initial route planning is made by solving a time-dependent vehicle routing problem under recurrent congestion conditions. The genetic algorithm is applied. During the plan implementation, a new mechanism updating at the critical node is proposed to adjust the routes with real-time traffic information subject to the unexpected traffic accidents in non-recurrent congestion environment. Through the numerical simulation, the results show that the new route updating mechanism is more effective than others in the literatures, and the advantage by adopting the new mechanism becomes more prominent when the network becomes more dynamic.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a vehicle routing problem in dynamic urban traffic network with real-time traffic information. Both re-current and non-recurrent congestion are considered in the problem. We develop a method to solve the problem by combining the initial routes arrangement with the real-time route adjustment. The initial route planning is made by solving a time-dependent vehicle routing problem under recurrent congestion conditions. The genetic algorithm is applied. During the plan implementation, a new mechanism updating at the critical node is proposed to adjust the routes with real-time traffic information subject to the unexpected traffic accidents in non-recurrent congestion environment. Through the numerical simulation, the results show that the new route updating mechanism is more effective than others in the literatures, and the advantage by adopting the new mechanism becomes more prominent when the network becomes more dynamic.

Key concepts: Computer science, Routing (electronic design automation), Traffic congestion, Node (physics), Adaptive routing, Plan (archaeology), Computer network, Traffic network

Related papers

Back to paper searchBrowse research topicsOriginal source
Vehicle routing problem in dynamic urban traffic network — Research Paper | ScholarLens