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)- 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
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- An exact solution framework for multitrip vehicle-routing problems with time windows
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- The vehicle routing problem with service level constraints
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Solving large-scale dynamic vehicle routing problems with stochastic requests
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- The arc-item-load and related formulations for the cumulative vehicle routing problem
- Adaptive large neighborhood search on the graphics processing unit
- Robust vehicle routing under uncertainty via branch-price-and-cut
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- A rollout algorithm for the resource constrained elementary shortest path problem
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- Limited memory rank-1 cuts for vehicle routing problems
- Patient appointment scheduling at hemodialysis centers: an exact branch and price approach
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- The joint network vehicle routing game with optional customers
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
- Selective routing problem with synchronization
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- 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
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
- Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
- Analytic centre stabilization of column generation algorithm 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
- A survey of attended home delivery and service problems with a focus on applications
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
- Estimating the marginal cost to deliver to individual customers
- Battery electric vehicle traveling salesman problem with drone
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- Exact approaches for single machine total weighted tardiness batch scheduling
- A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows
- Addressing orientation symmetry in the time window assignment vehicle routing problem
- Selective arc‐ng pricing for vehicle routing
- Preprocessing to reduce vehicle capacity for routing problems
- A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
- Planning robust drone-truck delivery routes under road traffic uncertainty
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- Robust data-driven vehicle routing with time windows
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem
- 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
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)
