A comparative study of sampling methods in node histogram models with Probabilistic model-building genetic algorithms

被引：11

作者：

Tsutsui, Shigeyoshi ^{[1
]}

机构：

[1] Hannan Univ, Dept Management Informat, Osaka 5808502, Japan

来源：

2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS | 2006年

关键词：

D O I：

10.1109/ICSMC.2006.384597

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In a previous paper we proposed a node histogram based sampling algorithm (NHBSA) and compared it with edge histogram based sampling algorithm (EHBSA). The results showed NHBSA outperforms EHBSA on the permutation problems where absolute position of each node in a string is related to its performance. However, we used only a limited variation of sampling methods for NHBSA. In this paper, we propose several variations of sampling methods for NHBSA and explore conditions for them to work well with NHBSA.

引用

页码：3132 / 3137

页数：6

共 19 条

[1]

[Anonymous], 1989, GENETIC ALGORITHM SE

[2]

[Anonymous], DIMACS SERIES DISCRE

[3]

Bosman P. A. N., 2002, Parallel Problem Solving from Nature - PPSN VII. 7th International Conference. Proceedings (Lecture Notes in Computer Science Vol.2439), P331

[4] AN IMPROVED ANNEALING SCHEME FOR THE QAP [J].

CONNOLLY, DT .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (01) :93-100

[5] Ant colonies for the quadratic assignment problem [J].

Gambardella, LM ;

Taillard, ÉD ;

Dorigo, M .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (02) :167-176

[6]

Larra├a┬▒aga P., 2002, ESTIMATION DISTRIBUT

[7]

MUEHLENBEIN H, 1996, PARALLEL PROBLEM SOL, P178

[8] A survey of optimization by building and using probabilistic models [J].

Pelikan, M ;

Goldberg, DE ;

Lobo, FG .

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 21 (01) :5-20

[9]

Robles V., 2002, GE AL EV CO, P211

[10] MAX-MIN Ant System [J].

Stützle, T ;

Hoos, HH .

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2000, 16 (08) :889-914

← 1 2 →