New route relaxation and pricing strategies for the vehicle routing problem
From MaRDI portal
Publication:2879522
DOI10.1287/OPRE.1110.0975zbMATH Open1233.90059OpenAlexW1965032790MaRDI QIDQ2879522FDOQ2879522
Authors: Roberto Baldacci, Aristide Mingozzi, Roberto Roberti 
Publication date: 26 March 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1110.0975
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
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cited In (only showing first 100 items - show all)
- 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
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Robust vehicle routing under uncertainty via branch-price-and-cut
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- A Joint Vehicle Routing and Speed Optimization Problem
- Exact solution of the soft-clustered vehicle-routing problem
- 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
- An exact solution approach for the inventory routing problem with time windows
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- A rollout algorithm for the resource constrained elementary shortest path problem
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- The inventory routing problem with demand moves
- An open source spreadsheet solver for vehicle routing problems
- A branch-and-price algorithm for the minimum latency problem
- Limited memory rank-1 cuts for vehicle routing problems
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Exact algorithms for the chance-constrained vehicle routing problem
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- An exact solution framework for multitrip vehicle-routing problems with time windows
- Patient appointment scheduling at hemodialysis centers: an exact branch and price approach
- Adapting the \textit{ng}-path relaxation for bike balancing problems
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- Solving large-scale dynamic vehicle routing problems with stochastic requests
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- The arc-item-load and related formulations for the cumulative vehicle routing problem
- Exact algorithms for the chance-constrained vehicle routing problem
- The vehicle routing problem with service level constraints
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Freight railway operator timetabling and engine scheduling
- Combined maintenance and routing optimization for large-scale sewage cleaning
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- Exact algorithms for the traveling salesman problem with draft limits
- An exact solution method for home health care scheduling with synchronized services
- Scheduling heterogeneous delivery tasks on a mixed logistics platform
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- Adaptive large neighborhood search on the graphics processing unit
- Route relaxations on GPU for 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
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
- New state-space relaxations for solving the traveling salesman problem with time windows
- Total distance approximations for routing solutions
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- 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
- A generic exact solver for vehicle routing and related problems
- New enhancements for the exact solution of the vehicle routing problem with time windows
- A column generation approach for the location-routing problem with time windows
- Improved branch-cut-and-price for capacitated vehicle routing
- 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
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- 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
- New benchmark instances for the capacitated vehicle routing problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Minimum makespan vehicle routing problem with compatibility constraints
- Two-echelon vehicle routing problems: a literature review
- A matheuristic approach for the pollution-routing problem
- The discrete time window assignment vehicle routing problem
- A branch-price-and-cut algorithm for the workover rig routing problem
- Column elimination for capacitated vehicle routing problems
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- A branch-and-cut algorithm for the capacitated profitable tour problem
- 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
- 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
- Algorithms and implementation of a set partitioning approach for modular machining line design
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- A vehicle routing problem with flexible time windows
- A new formulation and approach for the black and white traveling salesman problem
- Multi-neighborhood local search optimization for machine reassignment problem
- A branch-and-price algorithm for the ring-tree facility location problem
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
Uses Software
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)
