Vehicle Routing Problems with Inter-Tour Resource Constraints
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.
Key wordsVehicle routing global and inter-tour resources efficient local search
Unable to display preview. Download preview PDF.
- 1.E. Aarts and J. Korst.Simulated Annealing and Boltzmann Machines. Wiley, Chichester, 1989.Google Scholar
- 5.N. Christofides and S. Eilon. An algorithm for the vehicle-dispatching problem.Operational Research Quarterly, 20:309–318, 1969.Google Scholar
- 6.N. Christofides and S. Eilon. Algorithms for large-scale travelling salesman problems.Operational Research Quarterly, 23:511–518, 1972.Google Scholar
- 7.G. Desaulniers, J. Desrosiers, I. Ioachim, M.M. Solomon, F. Soumis, and D. Villeneuve. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems, Chapter 3 inFleet Management and Logistics, T. Crainic and G. Laporte, eds., Kluwer Academic Publisher, Boston, 1998.Google Scholar
- 10.S. Irnich. Resource extension functions: Properties, inversion, and generalization to segments. Technical Report 2006-01, Deutsche Post Endowed Chair of Optimization of Distribution Networks, RWTH Aachen University, Aachen, Germany, 2006. Available at www.dpor.rwth-aachen.de, forthcoming in OR Spectrum.Google Scholar
- 11.S. Irnich. A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. Technical Report 2006-02, Deutsche Post Endowed Chair of Optimization of Distribution Networks, RWTH Aachen University, Aachen, Germany, 2006. Available at www.dpor.rwth-aachen.de, accepted with minor modifications for publication in INFORMS Journal on Computing.Google Scholar
- 12.S. Irnich and G. Desaulniers. Shortest path problems with resource constraints, Chapter 2 inColumn Generation, G. Desaulniers, J. Desrosiers, and M.M. Solomon, eds., Springer, 2005.Google Scholar
- 14.B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs.Bell Syst. Tech. J., 49:291–307, 1970.Google Scholar
- 15.G.A.P. Kindervater and M.W.P. Savelsbergh. Vehicle routing: Handling edge exchanges, Chapter 10 inLocal Search in Combinatorial Optimization, E. Aarts and J. Lenstra, eds., Wiley, Chichester, 1997.Google Scholar
- 20.J.-Y. Potvin, G. Lapalme, and J.-M. Rousseau. A generalized k-opt exchange procedure for the MTSP.Information Systems and Operations Research, 27:474–481, 1989.Google Scholar
- 22.M.W.P. Savelsbergh. Local search for routing problems with time windows. inAlgorithms and Software for Optimization, Part I, C.L. Monma, ed., Baltzer, Basel, Volume 4:285–305, 1986.Google Scholar