A randomized granular tabu search heuristic for the split delivery vehicle routing problem
type: Item
instance of: scholarly article
title: A randomized granular tabu search heuristic for the split delivery vehicle routing problem
zbMATH Open document ID: 1303.90008
author: Leonardo Berbotto
author: Sergio García
author: Francisco J. Nogales
published in: Annals of Operations Research
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6389166
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: split deliveries
zbMATH Keywords: tabu search
zbMATH Keywords: granular neighborhood
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10479-012-1282-3
OpenAlex ID: W1996764736
cites work: A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
cites work: An adaptive memory algorithm for the split delivery vehicle routing problem
cites work: A ring-based diversification scheme for routing problems
cites work: Vehicle routing in the 1-skip collection problem
cites work: The Split Delivery Vehicle Routing Problem: A Survey
cites work: Vehicle routing problems with split deliveries
cites work: A column generation approach for the split delivery vehicle routing problem
cites work: A Lower Bound for the Split Delivery Vehicle Routing Problem
cites work: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
cites work: Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
cites work: Savings by Split Delivery Routing
cites work: Split delivery routing
cites work: Vehicle routing with split deliveries
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4354785
cites work: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Split-delivery routeing heuristics in livestock feed distribution
cites work: Routing helicopters for crew exchanges on off-shore locations
cites work: The granular tabu search and its application to the vehicle-routing problem
DOI: 10.1007/S10479-012-1282-3
description: scientific article; zbMATH DE number 6389166