Applying the attribute based hill climber heuristic to the vehicle routing problem
type: Item
instance of: scholarly article
title: Applying the attribute based hill climber heuristic to the vehicle routing problem
zbMATH Open document ID: 1109.90011
author: N. E. Zubov
published in: European Journal of Operational Research
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5078511
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: heuristics
zbMATH Keywords: logistics
zbMATH Keywords: meta-heuristics
zbMATH Keywords: routing
zbMATH Keywords: tabu search
describes a project that uses: BoneRoute
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.11.038
OpenAlex ID: W2055775959
cites work: A new hybrid genetic algorithm for the capacitated vehicle routing problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: A guide to vehicle routing heuristics
cites work: Q5431823
cites work: Q4495172
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4955265
cites work: Q4495205
cites work: Optimization by Simulated Annealing
cites work: Routing problems: A bibliography
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: Active guided evolution strategies for large-scale vehicle routing problems with time windows
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: The Vehicle Routing Problem with Time Windows Part I: Tabu Search
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: A parallel algorithm for the vehicle routing problem with time window constraints
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
cites work: Guided local search and its application to the traveling salesman problem
cites work: The attribute based hill climber
DOI: 10.1016/J.EJOR.2005.11.038
description: scientific article; zbMATH DE number 5078511