Vehicle Routing Problems with Inter-Tour Resource Constraints

  • Hempsch C
  • Irnich S
  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Inter-tour constraints are constraints in a vehicle-routing problem (VRP) on globally limited resources that different vehicles compete for.% Real-world examples are a limited number of ‘‘long’’ tours, where long is defined with respect to the traveled distance, the number of stops, the arrival time at the depot etc. % Moreover, a restricted number of docking stations or limited processing capacities for incoming goods at the destination depot can be modeled by means of inter-tour resource constraints.% In this chapter, we introduce a generic model for VRPs with inter-tour constraints based on the giant-tour representation and resource-constrained paths.% Furthermore, solving the model by efficient local search techniques is addressed: % Tailored preprocessing procedures and feasibility tests are combined into local-search algorithms, that are attractive from a worst-case point of view and are superior to traditional search techniques in the average case. % In the end, the chapter provides results for some new types of studies where VRPs with time-varying processing capacities are analyzed.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Christoph Hempsch

  • Stefan Irnich

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free