Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Transportation Science
Diversion Issues in Real-Time Vehicle Dispatching
Transportation Science
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Transportation Science
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Real-Time Multivehicle Truckload Pickup and Delivery Problems
Transportation Science
A Hybrid Approach for the Dynamic Vehicle Routing Problem with Time Windows
HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
Dynamic Vehicle Routing Based on Online Traffic Information
Transportation Science
The A Priori Dynamic Traveling Salesman Problem with Time Windows
Transportation Science
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows
Transportation Science
A Solution of Dynamic Vehicle Routing Problem with Time Window via Ant Colony System Metaheuristic
SBRN '08 Proceedings of the 2008 10th Brazilian Symposium on Neural Networks
A Multiple Ant Colony System for Dynamic Vehicle Routing Problem with Time Window
ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 02
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
International Journal of Applied Logistics
Restricted dynamic heterogeneous fleet vehicle routing problem with time windows
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
This paper studies the dynamic vehicle routing problem with hard time windows (DVRPTW). The main study course of this problem was briefly reviewed. The solving strategy and algorithm of the problem are put forward. First of all, DVRPTW problem is decomposed into a series of static VRPTW. When and how to decompose the DVRP is the issue, that must be addressed. An event-trigger mechanism has been proposed and used to decompose the DVRPTW into a series of system delay-snapshots. The trigger event to be adopted is a new request arrival during the stable operation. And each snapshot is regarded as a static VRPTW. Whether each static VRPTW can quickly and efficiently be solved within a given time or a shorter time, i.e. the solving time is another issue for the DVRPTW. In the solving process, how to merge the latest requirement to the current solution is the third issue that must be solved. An improved large neighborhood search (LNS) algorithm is proposed to solve the static problem. Utilizing the remove-reinsert process of the LNS, the latest request nodes are regarded as a part of the removed nodes; these nodes can be inserted into the original or current solution in good time in the reinsertion process; meanwhile, its computing speed is high and effective for it does not need to resolve primal problem each time. Computational results of a large number of test problems, which cited from Solomon's static benchmarks and Lacker's dynamic data set, show that our method is superior to other methods in most instances.