Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints

  title={Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints},
  author={Michael Drexl},
  journal={Transp. Sci.},
This paper presents a survey of vehicle routing problems with multiple synchronization constraints. These problems exhibit, in addition to the usual task covering constraints, further synchronization requirements between the vehicles, concerning spatial, temporal, and load aspects. They constitute an emerging field in vehicle routing research and are becoming a “hot” topic. The contribution of the paper is threefold: (i) It presents a classification of different types of synchronization. (ii… 

Figures and Tables from this paper

A Generic Heuristic for Vehicle Routing Problems with Multiple Synchronization Constraints

A generic heuristic is described that allows to solve many important types of VRPMSs, concerning spatial, temporal, and load aspects.

Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints

A definition and a classification of different types of synchronization constraints considered in the VRP literature are presented and a constructive heuristics and an iterated local search metaheuristic are provided to solve the considered problem.

A Greedy Heuristic for the Vehicle Routing Problem with Time Windows, Synchronization Constraints and Heterogeneous Fleet

Although the complexity of the AHTS-routing problem is higher than the VRPTWSyn, the proposed method could produce a diverse set of feasible solutions, which in the future may be improved by a meta-heuristic-based algorithm.

Efficient handling of synchronization in three vehicle routing problems

This paper presents a synthesis of contributions to the solving of three vehicle routing problems involving synchronization constraints. These problems are: the Pickup and Delivery Problem with

Linear Formulations for the Vehicle Routing Problem with Synchronization Constraints

Three new mixed integer linear formulations for a vehicle routing problem with synchronization constraints and time windows allow solving larger instances in a shorter computational time than the ones previously proposed in the literature.

Rich vehicle routing problems: From a taxonomy to a definition




The vehicle routing problem with coupled time windows

It is solved using a new meta-heuristic that combines classical construction aspects with mixed-integer preprocessing techniques, and improving hit-and-run, a randomized search strategy from global optimization.

A two-phase tabu search approach to the location routing problem

Hybrid scheduling methods for paratransit operations

Models and Algorithms for Integration of Vehicle and Crew Scheduling

This paper deals with models, relaxations, and algorithms for an integrated approach to vehicle and crew scheduling for an urban mass transit system with a single depot, and proposes new mathematical formulations for integrated vehicle andCrew scheduling problems and corresponding Lagrangian relaxations and Lagrangia heuristics.

The vehicle routing problem

The Vehicle Routing Problem covers both exact and heuristic methods developed for the VRP and some of its main variants, emphasizing the practical issues common to VRP. The book is composed of three

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.

Fleet assignment and routing with schedule synchronization constraints

Transshipment and time windows in vehicle routing

  • C. MuesS. Pickl
  • Computer Science
    8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
  • 2005
Two approaches are developed for merged problems of transshipment problems and vehicle routing problems with time windows as a generalization of the VRPTW.

A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics

A new unified modeling and heuristic solution framework for vehicle-routing problems (VRPs) with complex side constraints with strong modeling capabilities as well as efficient solution procedures to be used in all kinds of metaheuristics is presented.