An iterated tabu search for the multi-compartment vehicle routing problem
type: Item
instance of: scholarly article
title: An iterated tabu search for the multi-compartment vehicle routing problem
zbMATH Open document ID: 1391.90085
author: Paulo Vitor Silvestrin
author: Marcus Ritt
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6901384
zbMATH Keywords: vehicle routing
zbMATH Keywords: multiple compartments
zbMATH Keywords: split demands
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: tabu search
zbMATH Keywords: iterated local search
describes a project that uses: METSlib
describes a project that uses: VRPH
describes a project that uses: Tabu search
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2016.12.023
OpenAlex ID: W2567474168
cites work: Solving a fuel delivery problem by heuristic and exact approaches.
cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
cites work: Scheduling deliveries in vehicles with multiple compartments
cites work: Q3048611
cites work: Classification, models and exact algorithms for multi-compartment delivery problems
cites work: A guide to vehicle routing heuristics
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Heuristics for the multi-depot petrol station replenishment problem with time windows
cites work: A heuristic for the multi-period petrol station replenishment problem
cites work: Vehicle routing with compartments: applications, modelling and heuristics
cites work: Benchmarking optimization software with performance profiles.
cites work: Savings by Split Delivery Routing
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
cites work: A variable neighborhood search for the multi-period collection of recyclable materials
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: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: Q4354785
cites work: Q4955265
cites work: A library of local search heuristics for the vehicle routing problem
cites work: A parallel algorithm for the vehicle routing problem
cites work: Vehicle Routing
cites work: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
cites work: On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
cites work: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
cites work: A tabu search approach for the livestock collection problem
cites work: A general heuristic for vehicle routing problems
cites work: A hybrid algorithm for a class of vehicle routing problems
cites work: Solving the vehicle routing problem with adaptive memory programming methodology
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Wikidata QID: Q56524148
DOI: 10.1016/J.COR.2016.12.023
description: scientific article; zbMATH DE number 6901384