An exact solution framework for a broad class of vehicle routing problems
From MaRDI portal
(Redirected from Publication:993700)
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)
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
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3883903 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- scientific article; zbMATH DE number 1749225 (Why is no real title available?)
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A multiphase approach to the period routing 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
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- An exact algorithm for the period routing problem
- An exact algorithm for the pickup and delivery problem with time windows
- An exact algorithm for the simplified multiple depot crew scheduling problem
- 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 improved heuristic for the period vehicle routing problem
- DRIVE: Dynamic routing of independent vehicles
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- New route relaxation and pricing strategies for the vehicle routing problem
- Recent advances in vehicle routing exact algorithms
- Recent models and algorithms for one-to-one pickup and delivery problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Routing a heterogeneous fleet of vehicles
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- State-space relaxation procedures for the computation of bounds to routing problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The multi-depot vehicle routing problem with inter-depot routes
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- The period routing problem
- The period vehicle routing problem and its extensions
- The periodic Vehicle routing problem: classification and heuristic
- The pickup and delivery problem with time windows
Cited in
(38)- Routing optimization with time windows under uncertainty
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- Deep infeasibility exploration method for vehicle routing problems
- Extensions of the Petal Method for Vehicle Routeing
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- 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
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- An open source spreadsheet solver for vehicle routing problems
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
- A unified exact approach for clustered and generalized vehicle routing problems
- An exact solution framework for multitrip vehicle-routing problems with time windows
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Solving a real-world multi-attribute VRP using a primal-based approach
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- The vehicle routing-allocation problem: A unifying framework
- A generic exact solver for Vehicle Routing and related problems
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- 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
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- 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
- A generic exact solver for vehicle routing and related problems
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Cutting planes for branch-and-price algorithms
- Robust data-driven vehicle routing with time windows
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
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)