Solving vehicle routing problems with intermediate stops using VRPSolver models
From MaRDI portal
Publication:6179690
DOI10.1002/net.22137zbMath1529.90070OpenAlexW4311843705MaRDI QIDQ6179690
Ruslan Sadykov, Marcos Costa Roboredo, Eduardo Uchoa
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22137
Cites Work
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- The multi-depot vehicle routing problem with inter-depot routes
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- The periodic vehicle routing problem with intermediate facilities
- A path-based solution approach for the green vehicle routing problem
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Limited memory rank-1 cuts for vehicle routing problems
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- Multi-trip time-dependent vehicle routing problem with time windows
- A generic exact solver for vehicle routing and related problems
- Resource extension functions: properties, inversion, and generalization to segments
- Lower and upper bounds for the mixed capacitated arc routing problem
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
- The capacitated arc routing problem with intermediate facilities
- The Truck Dispatching Problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows
- Vehicle routing problems with multiple trips
This page was built for publication: Solving vehicle routing problems with intermediate stops using VRPSolver models
