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

被引：29

作者：

Derigs, U. ^{[1
]}

Kaiser, R. ^{[1
]}

机构：

[1] Univ Cologne, WINFORS, D-50969 Cologne, Germany

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 177卷 / 02期

关键词：

combinatorial optimization; heuristics; logistics; meta-heuristics; routing; tabu search;

D O I：

10.1016/j.ejor.2005.11.038

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：719 / 732

页数：14