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)- 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
- 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
- Minimum makespan vehicle routing problem with compatibility constraints
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- Exact approaches for single machine total weighted tardiness batch scheduling
- A matheuristic approach for the pollution-routing problem
- The discrete time window assignment vehicle routing problem
- Two-echelon vehicle routing problems: a literature review
- A branch-price-and-cut algorithm for the workover rig routing problem
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- An open source spreadsheet solver for vehicle routing problems
- A branch-and-price algorithm for the minimum latency problem
- The inventory routing problem with demand moves
- Column elimination for capacitated vehicle routing problems
- Limited memory rank-1 cuts for vehicle routing problems
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- 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-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and 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
- Algorithms and implementation of a set partitioning approach for modular machining line design
- Exact algorithms for the chance-constrained vehicle routing problem
- Planning robust drone-truck delivery routes under road traffic uncertainty
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- An exact solution framework for multitrip vehicle-routing problems with time windows
- Adapting the \textit{ng}-path relaxation for bike balancing problems
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
- 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
- Patient appointment scheduling at hemodialysis centers: an exact branch and price approach
- Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
- A branch-and-price algorithm for the ring-tree facility location problem
- 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
- Solving large-scale dynamic vehicle routing problems with stochastic requests
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- 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
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
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)
