Finding the Minimum Ratio Traveling Salesman Tour by Artificial Ants

被引：3
|
作者：
Ma Liang
机构：
来源：
Journal of Systems Engineering and Electronics | 2003年 / 03期
关键词：
Minimum ratio; TraveLing salesman problem; Ant algorithm;
D O I：
暂无
中图分类号：
F224 [经济数学方法];
学科分类号：
0701 ; 070104 ;
摘要：
Ants of artificial colony are able to generate good solutions to the famous traveling salesman problem (TSP). We propose an artificial ants algorithm for solving the minimum ratio TSP, which is more general than the standard TSP in combinatorial optimization area. In the minimum ratio TSP, another criterion concerning each edge is added, that is, the traveling salesman can have a benefit if he travels from one city to another. The objective is to minimize the ratio be-
引用
收藏
页码：24 / 27
页数：4
相关论文
共 50 条
  • [1] FINDING THE OPTIMAL A PRIORI TOUR AND LOCATION OF A TRAVELING SALESMAN WITH NONHOMOGENEOUS CUSTOMERS
    BERMAN, O
    SIMCHILEVI, D
    [J]. TRANSPORTATION SCIENCE, 1988, 22 (02) : 148 - 154
  • [2] GENI Ants for the Traveling Salesman Problem
    François-Xavier Le Louarn
    Michel Gendreau
    Jean-Yves Potvin
    [J]. Annals of Operations Research, 2004, 131 : 187 - 201
  • [3] GENI ants for the traveling salesman problem
    Le Louarn, FX
    Gendreau, M
    Potvin, JY
    [J]. ANNALS OF OPERATIONS RESEARCH, 2004, 131 (1-4) : 187 - 201
  • [4] OPERATIONAL ESTIMATORS FOR THE LENGTH OF A TRAVELING SALESMAN TOUR
    CHIEN, TW
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (06) : 469 - 478
  • [5] SMART ANTS SOLVE TRAVELING SALESMAN PROBLEM
    ARTHUR, C
    [J]. NEW SCIENTIST, 1994, 142 (1928) : 6 - 6
  • [6] Simple cubic graphs with no short traveling salesman tour
    Lukot'ka, Robert
    Mazak, Jan
    [J]. DISCRETE APPLIED MATHEMATICS, 2018, 244 : 218 - 222
  • [7] Estimating the Tour Length for the Close Enough Traveling Salesman Problem
    Sinha Roy, Debdatta
    Golden, Bruce
    Wang, Xingyin
    Wasil, Edward
    [J]. ALGORITHMS, 2021, 14 (04)
  • [8] An effective tour construction and improvement procedure for the traveling salesman problem
    Zweig, G
    [J]. OPERATIONS RESEARCH, 1995, 43 (06) : 1049 - 1057
  • [9] Modeling Quartiles and Variance of Optimal Traveling Salesman Tour Lengths
    Yang, Hongtai
    Liang, Xiuqin
    Zhang, Zhaolin
    Zhang, Xu
    Abid, Malik Muneeb
    Liu, Yugang
    [J]. 2019 5TH INTERNATIONAL CONFERENCE ON TRANSPORTATION INFORMATION AND SAFETY (ICTIS 2019), 2019, : 897 - 902
  • [10] COMBINATORIAL ALGORITHM FOR M-TOUR TRAVELING SALESMAN PROBLEMS
    MARTINEC, I
    [J]. EKONOMICKO-MATEMATICKY OBZOR, 1979, 15 (03): : 320 - 341
12345