A randomized granular tabu search heuristic for the split delivery vehicle routing problem

DOI10.1007/s10479-012-1282-3zbMath1303.90008OpenAlexW1996764736MaRDI QIDQ490211

Francisco J. Nogales, Leonardo Berbotto, Sergio García

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

zbMATH Keywords

tabu searchvehicle routing problemsplit deliveriesgranular neighborhood

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (10)

Branch-and-cut algorithms for the split delivery vehicle routing problem ⋮ Robust optimisation approach for vehicle routing problems with uncertainty ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ Designing granular solution methods for routing problems with time windows ⋮ A novel approach to solve the split delivery vehicle routing problem ⋮ Particle Swarm Optimization for Split Delivery Vehicle Routing Problem ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints

Uses Software

• VRP
• Tabu search

Cites Work

• Unnamed Item
• A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
• A ring-based diversification scheme for routing problems
• An adaptive memory algorithm for the split delivery vehicle routing problem
• Vehicle routing with split deliveries
• Routing helicopters for crew exchanges on off-shore locations
• 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
• Split delivery routing
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Integer Programming Formulation of Traveling Salesman Problems
• The Split Delivery Vehicle Routing Problem: A Survey
• Savings by Split Delivery Routing
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Split-delivery routeing heuristics in livestock feed distribution
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• Vehicle routing in the 1-skip collection problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Vehicle routing problems with split deliveries
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• A column generation approach for the split delivery vehicle routing problem
• A column generation approach for the split delivery vehicle routing problem

This page was built for publication: A randomized granular tabu search heuristic for the split delivery vehicle routing problem