Active-guided evolution strategies for large-scale capacitated vehicle routing problems
type: Item
instance of: scholarly article
title: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
zbMATH Open document ID: 1185.90176
author: David Mester
author: Olli Bräysy
published in: Computers \& Operations Research
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5146799
zbMATH Keywords: vehicle routing
zbMATH Keywords: heuristics
zbMATH Keywords: evolution strategies
zbMATH Keywords: guided local search
Wikidata QID: Q110038531
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2005.11.006
OpenAlex ID: W1995235889
cites work: Q4532227
cites work: Q4532228
cites work: A guide to vehicle routing heuristics
cites work: Q5431823
cites work: Q4532224
cites work: Q4532225
cites work: Q4532226
cites work: Active guided evolution strategies for large-scale vehicle routing problems with time windows
cites work: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
cites work: Q4117322
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: The Traveling-Salesman Problem
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Fast and high precision algorithms for optimization in large-scale genomic problems
cites work: Q3048611
cites work: Q4955265
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: Solving the vehicle routing problem with adaptive memory programming methodology
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: A general heuristic for vehicle routing problems
DOI: 10.1016/J.COR.2005.11.006
Recommended article: Active guided evolution strategies for large-scale vehicle routing problems with time windows
Recommended article: A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
Recommended article: A hybrid evolution strategy for the open vehicle routing problem
Recommended article: Q5482508
Recommended article: An adaptive evolutionary approach for real-time vehicle routing and dispatching
Recommended article: A simple and effective evolutionary algorithm for the vehicle routing problem
Recommended article: Q4436879
Recommended article: A simple and effective evolutionary algorithm for the capacitated location-routing problem
description: scientific article; zbMATH DE number 5146799