An exact solution framework for a broad class of vehicle routing problems
From MaRDI portal
Publication:993700
DOI10.1007/s10287-009-0118-3zbMath1194.90011OpenAlexW1994328923MaRDI QIDQ993700
Aristide Mingozzi, Roberto Roberti, Enrico Bartolini, Roberto Baldacci
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
Optimality conditions and duality in mathematical programming (90C46) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, 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, A branch-price-and-cut algorithm for the workover rig routing problem, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen, Routing optimization with time windows under uncertainty, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem, Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem, An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem, An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, Robust Data-Driven Vehicle Routing with Time Windows, Cutting planes for branch-and-price algorithms, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-depot vehicle routing problem with inter-depot routes
- 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
- The pickup and delivery problem with time windows
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- An exact algorithm for the simplified multiple depot crew scheduling 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
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Drive: Dynamic Routing of Independent Vehicles
- An Exact Method for the Vehicle Routing Problem with Backhauls
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An Exact Algorithm for the Period Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- The period routing problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The periodic Vehicle routing problem: classification and heuristic
- Routing a Heterogeneous Fleet of Vehicles
- The Period Vehicle Routing Problem and its Extensions
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A multiphase approach to the period routing problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An improved heuristic for the period vehicle routing problem
- 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 Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
