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)- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Numerically safe lower bounds for the capacitated vehicle routing problem
- A branch-and-price algorithm for the ring-tree facility location problem
- Pricing routines for vehicle routing with time windows on road networks
- New state-space relaxations for solving the traveling salesman problem with time windows
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- The electric two-echelon vehicle routing problem
- Combined location and routing problems for drug distribution
- Exact algorithms for electric vehicle-routing problems with time windows
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Branch-and-price for a multi-attribute technician routing and scheduling problem
- Minimum makespan vehicle routing problem with compatibility constraints
- Integrating dock-door assignment and vehicle routing with cross-docking
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- On the exact solution of vehicle routing problems with backhauls
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- A column generation approach for the location-routing problem with time windows
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Two-echelon vehicle routing problems: a literature review
- Total distance approximations for routing solutions
- A unified exact approach for clustered and generalized vehicle routing problems
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- A survey of resource constrained shortest path problems: exact solution approaches
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- An exact solution framework for a broad class of vehicle routing problems
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
- Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- A matheuristic approach for the pollution-routing problem
- The discrete time window assignment vehicle routing problem
- Network-based approximate linear programming for discrete optimization
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Improved branch-cut-and-price for capacitated vehicle routing
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A vehicle routing problem with flexible time windows
- A new formulation and approach for the black and white traveling salesman problem
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- A branch-and-price approach for a multi-period vehicle routing problem
- 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 branch-and-price algorithm for a vehicle routing with demand allocation problem
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Algorithms and implementation of a set partitioning approach for modular machining line design
- On the exact solution of a large class of parallel machine scheduling problems
- A generic exact solver for vehicle routing and related problems
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- 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
- Multi-neighborhood local search optimization for machine reassignment problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- New benchmark instances for the capacitated vehicle routing problem
- Column elimination for capacitated vehicle routing problems
- A column generation approach for a multi-attribute vehicle routing problem
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Freight railway operator timetabling and engine scheduling
- An exact solution approach for the inventory routing problem with time windows
- Exact algorithms for the chance-constrained vehicle routing problem
- Route relaxations on GPU for vehicle routing problems
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Adapting the \textit{ng}-path relaxation for bike balancing problems
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- An exact solution method for home health care scheduling with synchronized services
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Exact algorithms for the traveling salesman problem with draft limits
- Combined maintenance and routing optimization for large-scale sewage cleaning
- Exact algorithms for the chance-constrained vehicle routing problem
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- The inventory routing problem with demand moves
- Scheduling heterogeneous delivery tasks on a mixed logistics platform
- An open source spreadsheet solver for vehicle routing problems
- A branch-and-price algorithm for the minimum latency problem
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
- Finding the nucleolus of the vehicle routing game with time windows
- A Joint Vehicle Routing and Speed Optimization Problem
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
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)
