An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows

被引：5

作者：

Shi, Xiaohu ^{[1
]}

Wang, Liupu ^{[1
]}

Zhou, You ^{[1
]}

Liang, Yanchun ^{[1
]}

机构：

[1] Jilin Univ, Coll Comp Sci & Technol, Key Lab Symbol Computat & Knowledge Engn, Minist Educ, Changchun 130012, Peoples R China

来源：

ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS | 2008年

关键词：

D O I：

10.1109/ICNC.2008.470

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Focused on a variation of the Euclidean Traveling Salesman Problem (TSP), namely the prize-collecting traveling salesman problem with time windows (PCTSPTW), this paper presents a novel ant colony optimization solving method. The time window constraints are considered in the computation for the probability of selection of the next city. The parameters of the algorithm are analyzed by experiments. Numerical results also show that the proposed method is effective for the PCTSPTW problem.

引用

页码：480 / 484

页数：5

共 14 条

[1] Algorithms for the on-line Quota Traveling Salesman Problem [J].

Ausiello, G ;

Demange, M ;

Laura, L ;

Paschos, V .

INFORMATION PROCESSING LETTERS, 2004, 92 (02) :89-94

[2]

BELLMORE M, 1968, OPER RES, P538

[3]

Deb Kalyanmoy, 1989, Complex systems

[4]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[5] 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

[6]

Dorigo M., 1999, NEW IDEAS OPTIMIZATI, P11

[7]

Dorigo M., 1992, THESIS POLITECNICO M, P140

[8]

DROR M, 1994, OPER RES, P977

[9]

Huang L, 2003, PROG NAT SCI-MATER, V13, P295

[10]

MUNAKATA T, 2001, PHYS REV E

← 1 2 →