Optimal Routing under Capacity and Distance Restrictions
From MaRDI portal
Publication:3694981
DOI10.1287/OPRE.33.5.1050zbMath0575.90039OpenAlexW2038583281MaRDI QIDQ3694981
Gilbert Laporte, Yves Nobert, Martin Desrochers
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 routinginteger linear programmingsubtour eliminationconstraint relaxationcapacity and distance constraints
Programming involving graphs or networks (90C35) 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)
Related Items (64)
Vehicle routing with split deliveries ⋮ A heuristic solution to the warehouse location-routing problem ⋮ Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem ⋮ A branch-and-cut algorithm for vehicle routing problems ⋮ An overview of graph covering and partitioning ⋮ Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ A note on ``Coordination of production and distribution planning by P. Chandra and M. L. Fisher ⋮ An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size ⋮ A bi-objective model for the used oil location-routing problem ⋮ A branch-and-cut algorithm for the time window assignment vehicle routing problem ⋮ A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations ⋮ Routing problems: A bibliography ⋮ Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account ⋮ Models and exact solutions for a class of stochastic location-routing problems ⋮ A symmetry-free polynomial formulation of the capacitated vehicle routing problem ⋮ A result on projection for the vehicle routing problem ⋮ The joint network vehicle routing game with optional customers ⋮ Visual attractiveness in vehicle routing via bi-objective optimization ⋮ The close-open mixed vehicle routing problem ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem ⋮ Selective arc‐ng pricing for vehicle routing ⋮ Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows ⋮ Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots ⋮ Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees. ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ The Distributionally Robust Chance-Constrained Vehicle Routing Problem ⋮ Resource planning and a depot location model for electric power restoration. ⋮ Recent advances in vehicle routing exact algorithms ⋮ Polyhedral results for a vehicle routing problem ⋮ The inventory routing problem with demand moves ⋮ A genetic algorithm for a green vehicle routing problem ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ On the vehicle routing problem ⋮ The vehicle routing problem: An overview of exact and approximate algorithms ⋮ Polyhedral study of the capacitated vehicle routing problem ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ Models, relaxations and exact approaches for the capacitated vehicle routing problem ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Branch and cut methods for network optimization ⋮ The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem ⋮ Decomposition and dynamic cut generation in integer linear programming ⋮ Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints ⋮ A flow-based model for the multivehicle covering tour problem with route balancing ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ A generalized exchange heuristic for the capacitated vehicle routing problem ⋮ Travelling on graphs with small highway dimension ⋮ A new subtour elimination constraint for the vehicle routing problem ⋮ Planning models for freight transportation ⋮ Vehicle routing with stochastic demands and restricted failures ⋮ 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 ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem ⋮ Projection results for vehicle routing ⋮ Integer linear programming formulation for a vehicle routing problem ⋮ Separating capacity constraints in the CVRP using tabu search ⋮ A heuristic for cumulative vehicle routing using column generation
This page was built for publication: Optimal Routing under Capacity and Distance Restrictions
