Cooperative Parallel Tabu Search for Capacitated Network Design
Journal of Heuristics
A dynamic vehicle routing problem with time-dependent travel times
Computers and Operations Research
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Computers and Industrial Engineering
The Dynamic Assignment Problem
Transportation Science
Dynamic Vehicle Routing Based on Online Traffic Information
Transportation Science
The A Priori Dynamic Traveling Salesman Problem with Time Windows
Transportation Science
Waiting Strategies for Dynamic Vehicle Routing
Transportation Science
Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows
Transportation Science
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching
Transportation Science
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
Dynamic vehicle routing using genetic algorithms
Applied Intelligence
A multiperiod set covering location model for dynamic redeployment of ambulances
Computers and Operations Research
Adaptive granular local search heuristic for a dynamic vehicle routing problem
Computers and Operations Research
Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem
Transportation Science
The degree of dynamism for workforce scheduling problem with stochastic task duration
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
An Improved Tabu Search (ITS) Algorithm Based on Open Cover Theory for Global Extremums
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Waiting and relocation strategies in online stochastic vehicle routing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Dynamic vehicle routing with stochastic requests
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Computers and Operations Research
A comparison of problem decomposition techniques for the FAP
Journal of Heuristics
On the partitioning of dynamic workforce scheduling problems
Journal of Scheduling
Online rescheduling of multiple picking agents for warehouse management
Robotics and Computer-Integrated Manufacturing
A dynamic vehicle routing problem based on real-time traffic information
International Journal of Innovative Computing and Applications
International Journal of Innovative Computing and Applications
Multidimentional self-organization for online time-constrained vehicle routing problems
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II
A multi-agent approach to load consolidation in transportation
Advances in Engineering Software
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Fleet organization models for online vehicle routing problems
Transactions on Computational Collective Intelligence VII
Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
Journal of Combinatorial Optimization
An event-driven optimization framework for dynamic vehicle routing
Decision Support Systems
Service and Management Oriented Traffic Information Grid
International Journal of Distributed Systems and Technologies
An adaptive evolutionary approach for real-time vehicle routing and dispatching
Computers and Operations Research
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
An abundant literature about vehicle routing and scheduling problems is available in the scientific community. However, a large fraction of this work deals with static problems where all data are known before the routes are constructed. Recent technological advances now create environments where decisions are taken quickly, using new or updated information about the current routing situation. This paper describes such a dynamic problem, motivated from courier service applications, where customer requests with soft time windows must be dispatched in real time to a fleet of vehicles in movement. A tabu search heuristic, initially designed for the static version of the problem, has been adapted to the dynamic case and implemented on a parallel platform to increase the computational effort. Numerical results are reported using different request arrival rates, and comparisons are established with other heuristic methods.