An exact solution framework for a broad class of vehicle routing problems
From MaRDI portal
Publication:993700
DOI10.1007/S10287-009-0118-3zbMATH Open1194.90011OpenAlexW1994328923MaRDI QIDQ993700FDOQ993700
Authors: Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Roberto Roberti 
Publication date: 20 September 2010
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-009-0118-3
Recommendations
- A unified exact method for solving different classes of vehicle routing problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Publication:4955264
- Recent advances in vehicle routing exact algorithms
- A generic exact solver for vehicle routing and related problems
Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- The pickup and delivery problem with time windows
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- DRIVE: Dynamic routing of independent vehicles
- New route relaxation and pricing strategies for the vehicle routing problem
- An exact algorithm for the period routing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The period routing problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Routing a heterogeneous fleet of vehicles
- The period vehicle routing problem and its extensions
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An exact method for the vehicle routing problem with backhauls
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- A unified exact method for solving different classes of vehicle routing problems
- An exact algorithm for the pickup and delivery problem with time windows
- Recent models and algorithms for one-to-one pickup and delivery problems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- 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
- State-space relaxation procedures for the computation of bounds to routing problems
- The multi-depot vehicle routing problem with inter-depot routes
- A multiphase approach to the period routing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved heuristic for the period vehicle routing problem
- The periodic Vehicle routing problem: classification and heuristic
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
- An exact algorithm for the simplified multiple depot crew scheduling problem
Cited In (38)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- Cutting planes for branch-and-price algorithms
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
- Solving a real-world multi-attribute VRP using a primal-based approach
- New state-space relaxations for solving the traveling salesman problem with time windows
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- A generic exact solver for vehicle routing and related problems
- A generic exact solver for Vehicle Routing and related problems
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
- Title not available (Why is that?)
- A branch-price-and-cut algorithm for the workover rig routing problem
- An open source spreadsheet solver for vehicle routing problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Thirty years of heterogeneous vehicle routing
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- Routing optimization with time windows under uncertainty
- An exact solution framework for multitrip vehicle-routing problems with time windows
- Deep infeasibility exploration method for vehicle routing problems
- Robust data-driven vehicle routing with time windows
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- A unified exact approach for clustered and generalized vehicle routing problems
- Extensions of the Petal Method for Vehicle Routeing
- The vehicle routing-allocation problem: A unifying framework
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- A unified exact method for solving different classes of vehicle routing problems
Uses Software
This page was built for publication: An exact solution framework for a broad class of vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993700)
