A New Ant Colony Optimization Approach for the Orienteering Problem

被引：1

作者：

Ke, Liangjun ^{[1
]}

Feng, Zuren ^{[1
]}

机构：

[1] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi Prov, Peoples R China

来源：

2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23 | 2008年

关键词：

Ant colony optimization; orienteering problem;

D O I：

10.1109/WCICA.2008.4593236

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this paper, a novel ant colony optimization algorithm is proposed for the orienteering problem. This algorithm can adaptively choose the lower trail limit to avoid stagnation. To study its performance, we compare the proposed algorithm to max-min ant system with and without reinitialization. The experimental results demonstrate that the performance of our algorithm is competitive.

引用

页码：2027 / 2032

页数：6

共 15 条

[1]

[Anonymous], 2004, Ant colony optimization

[2] A fast and effective heuristic for the orienteering problem [J].

Chao, IM ;

Golden, BL ;

Wasil, EA .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (03) :475-489

[3] Ant colony optimization theory: A survey [J].

Dorigo, M ;

Blum, C .

THEORETICAL COMPUTER SCIENCE, 2005, 344 (2-3) :243-278

[4] Ant system: Optimization by a colony of cooperating agents [J].

Dorigo, M ;

Maniezzo, V ;

Colorni, A .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41

[5]

Fischetti M., 1998, INFORMS Journal on Computing, V10, P133, DOI 10.1287/ijoc.10.2.133

[6]

GOLDEN BL, 1987, NAV RES LOG, V34, P307, DOI 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO

[7]

2-D

[8]

GOLDEN BL, 1988, NAV RES LOG, V35, P359, DOI 10.1002/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO

[9]

2-H

[10] ALGORITHMS TO SOLVE THE ORIENTEERING PROBLEM - A COMPARISON [J].

KELLER, CP .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 41 (02) :224-231

← 1 2 →