Vehicle routing and scheduling with time windows

DOI10.1007/BFb0121107zbMath0585.90067OpenAlexW125404256MaRDI QIDQ3712128

François Soumis, Michel Sauvé, Jacques Desrosiers, Martin Desrochers

Publication date: 1986

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121107

zbMATH Keywords

column generationvehicle routingbranch-and-boundtime windowslogisticsset partitioningshortest path algorithmfleet sizeasymmetric travelling salesmanm-travelling salesmanrelaxing scheduling constraintstotal travel costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ A heuristic approach to hard constrained shortest path problems ⋮ Methods for routing with time windows

This page was built for publication: Vehicle routing and scheduling with time windows