Compounded genetic algorithms for the quadratic assignment problem

被引：32

作者：

Drezner, Z ^{[1
]}

机构：

[1] Calif State Univ Fullerton, Coll Business & Econ, Dept ISDS, Fullerton, CA 92834 USA

来源：

OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 05期

关键词：

quadratic assignment; genetic algorithm; compounded approach;

D O I：

10.1016/j.orl.2004.11.001

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We introduce the compounded genetic algorithm. We propose to run a quick genetic algorithm several times as Phase 1, and compile the best solutions in each run to create a starting population for Phase 2. This new approach was tested on the quadratic assignment problem with very good results. (c) 2004 Elsevier B.V. All rights reserved.

引用

页码：475 / 480

页数：6

共 8 条

[1] A greedy genetic algorithm for the quadratic assignment problem [J].

Ahuja, RK ;

Orlin, JB ;

Tiwari, A .

COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (10) :917-934

[2]

[Anonymous], J APPL MATH DECIS SC

[3]

BURKARD RE, 1990, DISCRETE LOCATION TH

[4]

Cela E., 1998, The Quadratic Assignment Problem: Theory and Algorithms

[5] A new genetic algorithm for the quadratic assignment problem [J].

Drezner, Z .

INFORMS JOURNAL ON COMPUTING, 2003, 15 (03) :320-330

[6] The extended concentric tabu for the quadratic assignment problem [J].

Drezner, Z .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (02) :416-422

[7]

Rendl F, 2002, FACILITY LOCATION APPLICATIONS AND THEORY, P439

[8]

Taillard E. D., 1995, Location Science, V3, P87, DOI 10.1016/0966-8349(95)00008-6

← 1 →