The vehicle routing problem with coupled time windows

DOI10.1007/s10100-006-0166-5zbMath1203.90023OpenAlexW2061810949MaRDI QIDQ926344

Armin Fügenschuh

Publication date: 27 May 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-006-0166-5

zbMATH Keywords

mixed-integer programmingrich vehicle routing problemimproving hit-and-runcoupled time windowsparametrized greedy

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Rich vehicle routing problems: from a taxonomy to a definition ⋮ Type-2 zigzag uncertain multi-objective fixed-charge solid transportation problem: time window vs. preservation technology ⋮ Optimizing integrated aircraft assignment and turnaround handling ⋮ A set partitioning reformulation of a school bus scheduling problem ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes ⋮ The vehicle routing problem with time windows and temporal dependencies

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal lines for railway systems
• Cost optimal allocation of rail passenger lines
• Discrete optimization in public rail transport
• Stochastic adaptive search for global optimization.
• Improving hit-and-run for global optimization
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Efficient algorithms for integer programs with two variables per constraint.

This page was built for publication: The vehicle routing problem with coupled time windows