Exact algorithms for routing problems under vehicle capacity constraints
From MaRDI portal
Publication:970191
DOI10.1007/S10479-009-0650-0zbMATH Open1185.90033OpenAlexW2025391876MaRDI QIDQ970191FDOQ970191
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
Cites Work
- Title not available (Why is that?)
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Title not available (Why is that?)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- The truck dispatching problem
- On the symmetric travelling salesman problem I: Inequalities
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A fast algorithm for the maximum clique problem
- Multistars, partial multistars and the capacitated vehicle routing problem
- Title not available (Why is that?)
- On the capacitated vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Title not available (Why is that?)
- Routing a Heterogeneous Fleet of Vehicles
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- 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
- Separating capacity constraints in the CVRP using tabu search
- A unified exact method for solving different classes of vehicle routing problems
- Projection results for vehicle routing
- Title not available (Why is that?)
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A column generation approach to the heterogeneous fleet vehicle routing problem
- Recent advances in vehicle routing exact algorithms
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- 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
- Title not available (Why is that?)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Optimal Routing under Capacity and Distance Restrictions
- Implementing vehicle routing algorithms
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edmonds polytopes and weakly hamiltonian graphs
- Polyhedral study of the capacitated vehicle routing problem
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Title not available (Why is that?)
Cited In (42)
- The family capacitated vehicle routing problem
- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery
- The consistent vehicle routing problem with heterogeneous fleet
- Improved load balancing and resource utilization for the skill vehicle routing problem
- A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
- A genetic algorithm for a green vehicle routing problem
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approximation algorithm for vehicle routing with compatibility constraints
- The pyramidal capacitated vehicle routing problem
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Optimal capacitated ring trees
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- The demand weighted vehicle routing problem
- Approximation Algorithms for Conflict-Free Vehicle Routing
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- 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
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- Title not available (Why is that?)
- Capacitated vehicle routing with nonuniform speeds
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Computational Science – ICCS 2005
- Thirty years of heterogeneous vehicle routing
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- A PTAS for bounded-capacity vehicle routing in planar graphs
- Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization
- Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
- Preprocessing to reduce vehicle capacity for routing problems
- Combined route capacity and route length models for unit demand vehicle routing problems
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Special issue on vehicle routing and scheduling: recent trends and advances
Uses Software
Recommendations
- Recent advances in vehicle routing exact algorithms 👍 👎
- Models, relaxations and exact approaches for the capacitated vehicle routing problem 👍 👎
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems 👍 👎
- Title not available (Why is that?) 👍 👎
- On the capacitated vehicle routing problem 👍 👎
This page was built for publication: Exact algorithms for routing problems under vehicle capacity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970191)
