Methods for routing with time windows

DOI10.1016/0377-2217(86)90243-2MaRDI QIDQ1068008zbMATH OpenOpenAlexFDO

Authors Jacques Desrosiers, Martin Desrochers, Michel Sauvé, 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

branch-and-boundColumn generationm-travelling salesmanroutingschedulingset partitioningshortest path algorithmsimplextime windowstransportation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Vehicle routing and scheduling with time windows
• Routing with time windows by column generation
• Vehicle Routing with Time Windows
• scientific article; zbMATH DE number 4047423
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

Cites work

• scientific article; zbMATH DE number 3438384 (Why is no real title available?)
• Integer Programming Formulation of Traveling Salesman Problems
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• Plus court chemin avec contraintes d'horaires
• Routing with time windows by column generation
• Scheduling School Buses
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• State-space relaxation procedures for the computation of bounds to routing problems
• Vehicle routing and scheduling with time windows

Cited in

(18)

• The school bus routing problem: a review
• Vehicles scheduling with sliding time windows
• Solving binary cutting stock problems by column generation and branch- and-bound
• Visiting a network of services with time constraints.
• Time-dependent routing
• School-bus routing for program scheduling
• Routing problems: A bibliography
• Data mining-based dispatching system for solving the local pickup and delivery problem
• A LP-based heuristic for a time-constrained routing problem
• A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
• A Heuristic Algorithm for Multi-Period Delivery Planning Problems
• scientific article; zbMATH DE number 3912132 (Why is no real title available?)
• Routing with time windows by column generation
• Vehicle routing and scheduling with time windows
• A school bus scheduling problem
• Comparison of dynamic routeing techniques for automated guided vehicle system
• Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity
• The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon

Describes a project that uses

Uses Software

• Mathematica

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068008)