A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem

DOI10.1016/0270-0255(87)90004-2zbMath0634.90029OpenAlexW1964196426MaRDI QIDQ3773682

Serge Taillefer, Gilbert Laporte, Yves Nobert

Publication date: 1987

Published in: Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0270-0255(87)90004-2

zbMATH Keywords

Computational resultsbranch-and-bound treeasymmetrical distance-constrained vehicle routingmodified assignment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Vehicle routing with full loads ⋮ Routing problems: A bibliography ⋮ Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem ⋮ A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times ⋮ The multiagent planning problem ⋮ A personalized walking bus service requiring optimized route decisions: a real case ⋮ Development and implementation of algorithms for vehicle routing during a no-notice evacuation