![Applying the attribute based hill climber heuristic to the vehicle routing problem [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PB/bigB000PBZXRO.jpg)
Applying the attribute based hill climber heuristic to the vehicle routing problem [An article from: European Journal of Operational Research]
Price not available for Canada
You can still browse on Amazon. Try another country above.
Book Details
Author(s)
U. Derigs, R. Kaiser
Publisher
Elsevier
ISBN / ASIN
B000PBZXRO
ISBN-13
978B000PBZXR2
Marketplace
Canada 🇨🇦
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
The attribute based hill climber (ABHC) is a variant of the general tabu-search principle which has shown to be competitive with respect to quality as well as efficiency to other local search heuristics for the two corner stone problems in combinatorial optimization: the travelling salesman problem and the quadratic assignment problem. ABHC is completely parameter-free, and its generic logic depends on the concept of partitioning the solution space based on solution ''attributes'', which is the problem-specific choice. In this paper we analyze the effectiveness of this concept and the efficiency of the ABHC heuristic for the general vehicle routing problem.
Description:
The attribute based hill climber (ABHC) is a variant of the general tabu-search principle which has shown to be competitive with respect to quality as well as efficiency to other local search heuristics for the two corner stone problems in combinatorial optimization: the travelling salesman problem and the quadratic assignment problem. ABHC is completely parameter-free, and its generic logic depends on the concept of partitioning the solution space based on solution ''attributes'', which is the problem-specific choice. In this paper we analyze the effectiveness of this concept and the efficiency of the ABHC heuristic for the general vehicle routing problem.
