Exact algorithms for routing problems under vehicle capacity constraints
From MaRDI portal
Publication:970191
DOI10.1007/s10479-009-0650-0zbMath1185.90033OpenAlexW2025391876MaRDI QIDQ970191
Paolo Toth, Roberto Baldacci, Daniele Vigo
Publication date: 10 May 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0650-0
Related Items
Optimal capacitated ring trees, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Thirty years of heterogeneous vehicle routing, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem, Vehicle routing problem with stochastic travel times including soft time windows and service costs, A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows, Special issue on vehicle routing and scheduling: recent trends and advances, The consistent vehicle routing problem with heterogeneous fleet, Improved load balancing and resource utilization for the skill vehicle routing problem, Approximating the chance-constrained capacitated vehicle routing problem with robust optimization, Multi-objective vehicle routing and loading with time window constraints: a real-life application, Unnamed Item, Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW, Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, A genetic algorithm for a green vehicle routing problem, A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches, The demand weighted vehicle routing problem, Branch-price-and-cut for the mixed capacitated general routing problem with time windows, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem, Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem, Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet, Approximation algorithms for the load-balanced capacitated vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral study of the capacitated vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A column generation approach to the heterogeneous fleet vehicle routing problem
- Recent advances in vehicle routing exact algorithms
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A result on projection for the vehicle routing problem
- Multistars, partial multistars and the capacitated vehicle routing problem
- On the capacitated vehicle routing problem
- Separating capacity constraints in the CVRP using tabu search
- A fast algorithm for the maximum clique problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Projection results for vehicle routing
- The Truck Dispatching Problem
- On the symmetric travelling salesman problem I: Inequalities
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
- Routing a Heterogeneous Fleet of Vehicles
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Optimal Routing under Capacity and Distance Restrictions
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Implementing vehicle routing algorithms
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Edmonds polytopes and weakly hamiltonian graphs
