Indirect search for the vehicle routing problem with pickup and delivery and time windows

DOI10.1007/s00291-006-0072-1zbMath1133.90307OpenAlexW1963787795MaRDI QIDQ2480796

Thomas Döhmer, Ulrich Derigs

Publication date: 3 April 2008

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-006-0072-1

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Rich vehicle routing problems: from a taxonomy to a definition ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ An indirect search algorithm for disaster restoration with precedence and synchronization constraints

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• A grouping genetic algorithm for the pickup and delivery problem with time windows
• A gA-based decision support system for professional course scheduling at ford service organisation
• Heuristic methods for evolutionary computation techniques
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Multiobjective Metaheuristics for the Bus Driver Scheduling Problem
• The General Pickup and Delivery Problem