Methods for routing with time windows

DOI10.1016/0377-2217(86)90243-2zbMath0579.90095OpenAlexW2055629447MaRDI QIDQ1068008

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

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90243-2

zbMATH Keywords

transportationschedulingbranch-and-boundsimplextime windowsroutingColumn generationset partitioningshortest path algorithmm-travelling salesman

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) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Solving binary cutting stock problems by column generation and branch- and-bound ⋮ A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem ⋮ Routing problems: A bibliography ⋮ Data mining-based dispatching system for solving the local pickup and delivery problem ⋮ Vehicles scheduling with sliding time windows ⋮ Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity ⋮ A Heuristic Algorithm for Multi-Period Delivery Planning Problems ⋮ A school bus scheduling problem ⋮ Comparison of dynamic routeing techniques for automated guided vehicle system ⋮ School-bus routing for program scheduling ⋮ The school bus routing problem: a review

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Integer Programming Formulation of Traveling Salesman Problems
• Plus court chemin avec contraintes d'horaires
• Scheduling School Buses
• Routing with time windows by column generation
• Vehicle routing and scheduling with time windows
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• State-space relaxation procedures for the computation of bounds to routing problems
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms

This page was built for publication: Methods for routing with time windows