Optimal Routing under Capacity and Distance Restrictions
From MaRDI portal
Publication:3694981
DOI10.1287/opre.33.5.1050zbMath0575.90039MaRDI QIDQ3694981
Gilbert Laporte, Martin Desrochers, Yves Nobert
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.5.1050
vehicle routing; integer linear programming; subtour elimination; constraint relaxation; capacity and distance constraints
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
On the vehicle routing problem, A generalized exchange heuristic for the capacitated vehicle routing problem, Branch and cut methods for network optimization, Polyhedral study of the capacitated vehicle routing problem, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Integer linear programming formulation for a vehicle routing problem, A note on ``Coordination of production and distribution planning by P. Chandra and M. L. Fisher, Recent advances in vehicle routing exact algorithms, Models and exact solutions for a class of stochastic location-routing problems, A result on projection for the vehicle routing problem, Polyhedral results for a vehicle routing problem, The vehicle routing problem: An overview of exact and approximate algorithms, A new subtour elimination constraint for the vehicle routing problem, Planning models for freight transportation, Vehicle routing with split deliveries, A heuristic solution to the warehouse location-routing problem, A branch-and-cut algorithm for vehicle routing problems, Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees., Resource planning and a depot location model for electric power restoration., Optimization of printed circuit board manufacturing: Integrated modeling and algorithms, Planning models for long-haul operations of postal and express shipment companies, A real delivery problem dealt with Monte Carlo techniques, Separating capacity constraints in the CVRP using tabu search, A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations, Routing problems: A bibliography, Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, Formulations and exact algorithms for the vehicle routing problem with time windows, The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem, Decomposition and dynamic cut generation in integer linear programming, Projection results for vehicle routing, Vehicle routing with stochastic demands and restricted failures
