Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
DOI10.1287/MNSC.34.8.1005zbMATH Open0654.90038OpenAlexW2100526970MaRDI QIDQ3801320FDOQ3801320
Jacques Desrosiers, François Soumis, Michel Sauvé
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.8.1005
Recommendations
- scientific article; zbMATH DE number 3912132
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- New state-space relaxations for solving the traveling salesman problem with time windows
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Vehicle Routing with Time Windows: Two Optimization Algorithms
network flowNP-completerelaxationLagrangian methodstime window constraintsmultiple traveling salesmanminimal fleet size
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cited In (17)
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
- Integrated planning of loaded and empty container movements
- School-bus routing for program scheduling
- Shipping problems with body clock constraints.
- Title not available (Why is that?)
- Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft
- Industrial aspects and literature survey: fleet composition and routing
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Lagrangean relaxation. (With comments and rejoinder).
- Determining the optimal starting times in a cyclic schedule with a given route
- Routing problems: A bibliography
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Minimizing the fleet size with dependent time-window and single-track constraints
- An intelligent algorithm for mixed-integer programming models
- A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows
This page was built for publication: Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801320)
