Applying the attribute based hill climber heuristic to the vehicle routing problem

DOI10.1016/j.ejor.2005.11.038zbMath1109.90011OpenAlexW2055775959MaRDI QIDQ856266

N. E. Zubov

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.038

zbMATH Keywords

heuristicscombinatorial optimizationtabu searchmeta-heuristicsroutinglogistics

Mathematics Subject Classification ID

Search theory (90B40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (max. 100)

The close-open mixed vehicle routing problem ⋮ Tabu search heuristics for the order batching problem in manual order picking systems ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ Efficient metaheuristics to solve the intermodal terminal location problem ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation ⋮ Integrated distribution and loading planning via a compact metaheuristic algorithm ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• BoneRoute
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The attribute based hill climber
• A parallel algorithm for the vehicle routing problem with time window constraints
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Guided local search and its application to the traveling salesman problem
• BoneRoute: An adaptive memory-based method for effective fleet management
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Routing problems: A bibliography
• Very large-scale vehicle routing: new test problems, algorithms, and results
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Tabu Search—Part I
• Tabu Search—Part II
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A guide to vehicle routing heuristics
• A unified tabu search heuristic for vehicle routing problems with time windows
• A new hybrid genetic algorithm for the capacitated vehicle routing problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search

This page was built for publication: Applying the attribute based hill climber heuristic to the vehicle routing problem