Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem

被引：0
作者：
Liu, X [1 ]
He, HM [1 ]
Sykora, O [1 ]
机构：
[1] Univ Loughborough, Dept Comp Sci, Loughborough LE11 3TU, Leics, England
来源：
ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS | 2005年 / 3584卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String Problem. Our implementation and experiments show usefulness of the parallel CA and SA algorithms.
引用
收藏
页码：591 / 597
页数：7
相关论文
共 50 条
[41]   Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum [J].
Czapinski, Michal .
COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (04) :778-785
[42]   The Selective Fixing Algorithm for the closest string problem [J].
Della Croce, Federico ;
Garraffa, Michele .
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 :24-30
[43]   Exact algorithm and heuristic for the Closest String Problem [J].
Liu, Xiaolan ;
Liu, Shenghan ;
Hao, Zhifeng ;
Mauch, Holger .
Computers and Operations Research, 2011, 38 (11) :1513-1520
[44]   Exact algorithm and heuristic for the Closest String Problem [J].
Liu, Xiaolan ;
Liu, Shenghan ;
Hao, Zhifeng ;
Mauch, Holger .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) :1513-1520
[45]   A PARALLEL SIMULATED ANNEALING ALGORITHM FOR THE DESIGN OF MAGNETIC-STRUCTURES [J].
MARCHESI, ML ;
MOLINARI, G ;
REPETTO, M .
IEEE TRANSACTIONS ON MAGNETICS, 1994, 30 (05) :3439-3442
[46]   Solving TDVRP based on parallel-simulated annealing algorithm [J].
Mu, Dong ;
Wang, Chao ;
Wang, Shengchun ;
Zhou, Shengchuan .
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2015, 21 (06) :1626-1636
[47]   A recursive exact algorithm for the Closest String Problem [J].
Vilca, Omar Latorre ;
Júnior, Mário Salvatierra .
Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 115 :111-125
[48]   A speculative parallel simulated annealing algorithm based on Apache Spark [J].
Wang, Zhoukai ;
Zhao, Yinliang ;
Liu, Yang ;
Lv, Cuocuo .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2018, 30 (14)
[49]   A high eficiency parallel algorithm for the VRPTW based on simulated annealing [J].
Arbelaitz, O ;
Rodriguez, C .
PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2, 2000, :411-416
[50]   A new heuristic algorithm for the closest string problem [J].
Chen, Jingchao .
3RD INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 1, PROCEEDINGS, 2005, :323-327
12345