Solving vehicle routing problems with intermediate stops using VRPSolver models
From MaRDI portal
Recommendations
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities
- A generic exact solver for vehicle routing and related problems
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- A generic exact solver for Vehicle Routing and related problems
- The multi-depot vehicle routing problem with inter-depot routes
Cites work
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
- A generic exact solver for vehicle routing and related problems
- A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- A path-based solution approach for the green vehicle routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- An exact solution framework for multitrip vehicle-routing problems with time windows
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Exact algorithms for electric vehicle-routing problems with time windows
- Limited memory rank-1 cuts for vehicle routing problems
- Lower and upper bounds for the mixed capacitated arc routing problem
- Multi-trip time-dependent vehicle routing problem with time windows
- New route relaxation and pricing strategies for the vehicle routing problem
- Resource extension functions: properties, inversion, and generalization to segments
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- The capacitated arc routing problem with intermediate facilities
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- The multi-depot vehicle routing problem with inter-depot routes
- The periodic vehicle routing problem with intermediate facilities
- The truck dispatching problem
- Vehicle routing problems with multiple trips
Cited in
(6)- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- New cuts and a branch-cut-and-price model for the multi-vehicle covering tour problem
- An exact approach for the vehicle routing problem with demand allocation
- Multi-day routes in a multi-depot vehicle routing problem with intermediate replenishment facilities and time windows
- Enhancing waste collection: a branch-and-cut-and-price approach for the periodic vehicle routing problem with intermediate facilities applied to a real-world case study
- Exact methods for two vehicle routing problems with lockers in last-mile delivery
This page was built for publication: Solving vehicle routing problems with intermediate stops using VRPSolver models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179690)
