Pages that link to "Item:Q490211"
From MaRDI portal
The following pages link to A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211):
Displaying 9 items.
- Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
- Robust optimisation approach for vehicle routing problems with uncertainty (Q1666879) (← links)
- Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
