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.

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

A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints

A simulated annealing algorithm SA is presented that incorporates several local search techniques to deal with a variant of the vehicle routing problem VRP in which a time window is associated with each customer service and some services require simultaneous visits from different vehicles to be accomplished.

Heuristic solutions for the vehicle routing problem with time windows and synchronized visits

We present a simulated annealing based algorithm for a variant of the vehicle routing problem (VRP), in which a time window is associated with each client service and some services require



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

Fleet assignment and routing with schedule synchronization constraints

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.

Vehicle Routing Problems with Inter-Tour Resource Constraints

This chapter introduces a generic model for VRPs with inter-tour constraints based on the giant-tours representation and resource-constrained paths and provides results for some new types of studies where VRP with time-varying processing capacities are analyzed.