Separating capacity constraints in the CVRP using tabu search
From MaRDI portal
Publication:1609917
DOI10.1016/S0377-2217(97)00290-7zbMath0991.90028OpenAlexW2055942436MaRDI QIDQ1609917
P. Augerat, José-Manuel Belenguer, Angel Corberán, Enrique Benavent, Denis Naddef
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00290-7
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items
Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm, A queueing framework for routing problems with time-dependent travel times, On service consistency in multi-period vehicle routing, The \(k\)-dissimilar vehicle routing problem, Disrupted capacitated vehicle routing problem with order release delay, A min-max vehicle routing problem with split delivery and heterogeneous demand, The static bike relocation problem with multiple vehicles and visits, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture, Estimating the marginal cost to deliver to individual customers, A Branch-and-Cut method for the Capacitated Location-Routing Problem, Vehicle routing with dynamic travel times: a queueing approach, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, The Distributionally Robust Chance-Constrained Vehicle Routing Problem, Bike sharing systems: solving the static rebalancing problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Recent advances in vehicle routing exact algorithms, An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems, Balancing the stations of a self service “bike hire” system, The separation problem of rounded capacity inequalities: some polynomial cases, On the complexity of the separation problem for rounded capacity inequalities, Combining metaheuristics with mathematical programming, constraint programming and machine learning, A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints, Exact algorithms for routing problems under vehicle capacity constraints, Vehicle routing with stochastic time-dependent travel times, Self-imposed time windows in vehicle routing problems, Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation, Variable neighborhood search for the stochastic and dynamic vehicle routing problem, On the shortest path problem with negative cost cycles, Stronger \(K\)-tree relaxations for the vehicle routing problem, The school bus routing problem: a review, Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times, Hybridizing exact methods and metaheuristics: a taxonomy, Arc routing in a node routing environment, Time window optimization for attended home service delivery under multiple sources of uncertainties, Separating capacity constraints in the CVRP using tabu search, Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral study of the capacitated vehicle routing problem
- On the mixed Chinese postman problem
- A branch-and-cut algorithm for vehicle routing problems
- Separating capacity constraints in the CVRP using tabu search
- A user's guide to tabu search
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Optimal Routing under Capacity and Distance Restrictions
- TSPLIB—A Traveling Salesman Problem Library
- Tabu Search—Part I
- Tabu Search—Part II
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
