A two-stage algorithm for bi-objective logistics model of cash-in-transit vehicle routing problems with economic and environmental optimization based on real-time traffic data

2021 ◽  
pp. 100273
Author(s):  
Yuanzhi Jin ◽  
Xianlong Ge ◽  
Long Zhang ◽  
Jingzheng Ren
Keyword(s):  
Vehicle Routing ◽  
Real Time ◽  
Traffic Data ◽  
Vehicle Routing Problems ◽  
Two Stage ◽  
Routing Problems ◽  
Real Time Traffic ◽  
In Transit

Study of Solution Approach for Dynamic Vehicle Routing Problems with Real-Time Information

2003 ◽  
Vol 1857 (1) ◽  
pp. 102-108 ◽  
Author(s):  
Ta-Yin Hu ◽  
Tsai-Yun Liao ◽  
Ying-Chih Lu
Keyword(s):  
Vehicle Routing ◽  
Real Time ◽  
Information Technologies ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Solution Approach ◽  
Traffic Conditions ◽  
Real Time Information ◽  
Time Information

Recent advances in commercial vehicle operations (CVO), especially in communication and information technologies, allow the study of dynamic vehicle routing problems under new and updated information, such as traffic conditions and new customers. Two major operational benefits of CVO include ( a) dynamically assigning vehicles to time-sensitive demands, and ( b) efficiently rerouting vehicles according to current traffic conditions. In this research, stochastic vehicle routing problems (SVRP) are considered and extended to incorporate real-time information for dynamic vehicle routing problems. The SVRP model is formulated by a chance-constrained model and is solved by CPLEX with branch-and-bound techniques. Numerical experiments are conducted in a Taichung city network to investigate dynamic vehicle routing strategies under real-time information supply strategies and to assess the effectiveness of such strategies in a dynamic perspective.

scholarly journals Real-Time Vehicle Routing for Repairing Damaged Infrastructures Due to Natural Disasters

2011 ◽  
Vol 2011 ◽  
pp. 1-25 ◽  
Author(s):  
Huey-Kuo Chen ◽  
Huey-Wen Chou ◽  
Ping-Shan Ho ◽  
Hsuan Wang
Keyword(s):  
Natural Disasters ◽  
Vehicle Routing ◽  
Real Time ◽  
Time Windows ◽  
Network Size ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Affected Area ◽  
Objective Value

We address the task of repairing damaged infrastructures as a series of multidepot vehicle-routing problems with time windows in a time-rolling frame. The network size of the tackled problems changes from time to time, as new disaster nodes will be added to and serviced disaster nodes will be deleted from the current network. In addition, an inaccessible disaster node would become accessible when one of its adjacent disaster nodes has been repaired. By the “take-and-conquer” strategy, the repair sequence of the disaster nodes in the affected area can be suitably scheduled. Thirteen instances were tested with our proposed heuristic, that is, Chen et al.'s approach. For comparison, Hsueh et al.'s approach (2008) with necessary modification was also tested. The results show that Chen et al.'s approach performs slightly better for larger size networks in terms of objective value.

Sign in / Sign up

Export Citation Format

Share Document