Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:3801320
DOI10.1287/mnsc.34.8.1005zbMath0654.90038OpenAlexW2100526970MaRDI QIDQ3801320
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
relaxationNP-completenetwork flowLagrangian methodstime window constraintsmultiple traveling salesmanminimal fleet size
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
Lagrangean relaxation. (With comments and rejoinder). ⋮ 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 ⋮ Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ Routing problems: A bibliography ⋮ Integrated planning of loaded and empty container movements ⋮ Shipping problems with body clock constraints. ⋮ On the computational complexity of the probabilistic traveling salesman problem with deadlines ⋮ Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft ⋮ An intelligent algorithm for mixed-integer programming models ⋮ New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ School-bus routing for program scheduling ⋮ A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows ⋮ Determining the optimal starting times in a cyclic schedule with a given route ⋮ Minimizing the fleet size with dependent time-window and single-track constraints
