A randomized granular tabu search heuristic for the split delivery vehicle routing problem
From MaRDI portal
(Redirected from Publication:490211)
Recommendations
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A hybrid VND method for the split delivery vehicle routing problem
- Vehicle routing problems with split deliveries
- Tabu search algorithm for the discrete split delivery vehicle routing problem
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A column generation approach for the split delivery vehicle routing problem
- A column generation approach for the split delivery vehicle routing problem
- A ring-based diversification scheme for routing problems
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- Integer Programming Formulation of Traveling Salesman Problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Routing helicopters for crew exchanges on off-shore locations
- Savings by Split Delivery Routing
- Split delivery routing
- Split-delivery routeing heuristics in livestock feed distribution
- The granular tabu search and its application to the vehicle-routing problem
- The split delivery vehicle routing problem: A survey
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- Vehicle routing in the 1-skip collection problem
- Vehicle routing problems with split deliveries
- Vehicle routing with split deliveries
Cited in
(14)- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- Robust optimisation approach for vehicle routing problems with uncertainty
- Designing granular solution methods for routing problems with time windows
- A novel approach to solve the split delivery vehicle routing problem
- The split delivery vehicle routing problem with three-dimensional loading constraints
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- Achieving better solutions for vehicle routing problem involving split deliveries and pickups using a competitive decision algorithm
- Particle swarm optimization for split delivery vehicle routing problem
- The granular tabu search and its application to the vehicle-routing problem
- New exact solution approaches for the split delivery vehicle routing problem
- Tabu search algorithm for the discrete split delivery vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
This page was built for publication: A randomized granular tabu search heuristic for the split delivery vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490211)