An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
type: Item
instance of: scholarly article
title: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
zbMATH Open document ID: 0882.90031
DOI: 10.1016/S0305-0548(96)00065-2
author: Bruce Golden
author: G. Laporte
author: Éric D. Taillard
published in: Computers \& Operations Research
publication date: 1998-03-10T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1045732
zbMATH Keywords: heuristic
zbMATH Keywords: vehicle routing
zbMATH Keywords: minmax objective
zbMATH Keywords: tabu search
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Vehicle Routeing with Multiple Use of Vehicles
cites work: The m-Traveling Salesman Problem with Minmax Objective
cites work: Parallel iterative search methods for vehicle routing problems
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4350082
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Q3048611
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
description: scientific article; zbMATH DE number 1045732