New route relaxation and pricing strategies for the vehicle routing problem
From MaRDI portal
Publication:2879522
Recommendations
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Integer Programming and Combinatorial Optimization
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
Cited in
(only showing first 100 items - show all)- Estimating the marginal cost to deliver to individual customers
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
- An exact solution framework for a broad class of vehicle routing problems
- Robust data-driven vehicle routing with time windows
- The arc-item-load and related formulations for the cumulative vehicle routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Exact algorithms for the chance-constrained vehicle routing problem
- Approximation schemes for Euclidean vehicle routing problems with time windows
- The vehicle routing problem with service level constraints
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- Freight railway operator timetabling and engine scheduling
- Integrating dock-door assignment and vehicle routing with cross-docking
- Addressing orientation symmetry in the time window assignment vehicle routing problem
- Combined maintenance and routing optimization for large-scale sewage cleaning
- On the exact solution of vehicle routing problems with backhauls
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
- Branch-and-price for a multi-attribute technician routing and scheduling problem
- Preprocessing to reduce vehicle capacity for routing problems
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- The electric two-echelon vehicle routing problem
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Exact algorithms for the traveling salesman problem with draft limits
- Combined location and routing problems for drug distribution
- A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows
- A unified exact approach for clustered and generalized vehicle routing problems
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
- Scheduling heterogeneous delivery tasks on a mixed logistics platform
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
- An exact solution method for home health care scheduling with synchronized services
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- A survey of resource constrained shortest path problems: exact solution approaches
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- Battery electric vehicle traveling salesman problem with drone
- Adaptive large neighborhood search on the graphics processing unit
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- Route relaxations on GPU for vehicle routing problems
- Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times
- Numerically safe lower bounds for the capacitated vehicle routing problem
- A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
- Exact solution method for vehicle-and-drone cooperative delivery routing of blood products
- Exact algorithms for electric vehicle-routing problems with time windows
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- Finding the nucleolus of the vehicle routing game with time windows
- A multiphase dynamic programming algorithm for the shortest path problem with resource constraints
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- A column generation approach for a multi-attribute vehicle routing problem
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Robust vehicle routing under uncertainty via branch-price-and-cut
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
- A Joint Vehicle Routing and Speed Optimization Problem
- A survey of attended home delivery and service problems with a focus on applications
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Total distance approximations for routing solutions
- New state-space relaxations for solving the traveling salesman problem with time windows
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- Network-based approximate linear programming for discrete optimization
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- On the exact solution of a large class of parallel machine scheduling problems
- Selective arc‐ng pricing for vehicle routing
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- A generic exact solver for vehicle routing and related problems
- An exact solution approach for the inventory routing problem with time windows
- A column generation approach for the location-routing problem with time windows
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- Efficient elementary and restricted non-elementary route pricing
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- Pricing routines for vehicle routing with time windows on road networks
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Improved branch-cut-and-price for capacitated vehicle routing
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- New benchmark instances for the capacitated vehicle routing problem
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- A rollout algorithm for the resource constrained elementary shortest path problem
This page was built for publication: New route relaxation and pricing strategies for the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879522)
