A randomized granular tabu search heuristic for the split delivery vehicle routing problem
DOI10.1007/S10479-012-1282-3zbMATH Open1303.90008OpenAlexW1996764736MaRDI QIDQ490211FDOQ490211
Authors: Leonardo Berbotto, Sergio García, Francisco J. Nogales 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1282-3
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
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
- Title not available (Why is that?)
- Integer Programming Formulation of Traveling Salesman Problems
- Split delivery routing
- The split delivery vehicle routing problem: A survey
- Savings by Split Delivery Routing
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- Vehicle routing problems with split deliveries
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
- A column generation approach for the split delivery vehicle routing problem
- A ring-based diversification scheme for routing problems
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Vehicle routing with split deliveries
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A column generation approach for the split delivery vehicle routing problem
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- The granular tabu search and its application to the vehicle-routing problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Routing helicopters for crew exchanges on off-shore locations
- Vehicle routing in the 1-skip collection problem
- Split-delivery routeing heuristics in livestock feed distribution
Cited In (14)
- Robust optimisation approach for vehicle routing problems with uncertainty
- The granular tabu search and its application to the vehicle-routing problem
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- New exact solution approaches for the split delivery vehicle routing problem
- Achieving better solutions for vehicle routing problem involving split deliveries and pickups using a competitive decision algorithm
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- Particle swarm optimization for split delivery vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Tabu search algorithm for the discrete split delivery vehicle routing problem
- 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
Uses Software
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)
