Solving NP-Complete Problems Using Genetic Algorithms

被引：10
|
作者：
Arabi, Bander Hassan [1 ]
机构：
[1] King Abdulaziz Univ, Dept Res & Dev, Distance Learning, POB 80254, Jeddah, Saudi Arabia
来源：
2016 UKSIM-AMSS 18TH INTERNATIONAL CONFERENCE ON COMPUTER MODELLING AND SIMULATION (UKSIM) | 2016年
关键词：
component; NP-Complet Problem; Genetic Algorithm; Traveling Salesman Problem;
D O I：
10.1109/UKSim.2016.65
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Genetic Algorithms are designed to find the accuracy of approximated solutions in order to perform as effectively as possible. This paper present a new way for genetic algorithm to solve NP-Complete problem. We study genetic algorithm to find an optimal solution for instances of the Traveling Salesman Problem. To overcome this solution, we have to see what is the shortest path that satisfies all of these conditions? We review the paradigms of design of genetic algorithm and demonstrate how they can be applied for the Traveling Salesman Problem. The experiments are presented in which the performance of genetic algorithm is compared to that of Exhaustive Searches.
引用
收藏
页码：43 / 48
页数：6
相关论文
共 50 条
  • [1] USING GENETIC ALGORITHMS TO SOLVE NP-COMPLETE PROBLEMS
    DEJONG, KA
    SPEARS, WM
    PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, 1989, : 124 - 132
  • [2] POLYNOMIAL TIME ALGORITHMS FOR SOLVING NP-COMPLETE PROBLEMS
    Sinchev, B.
    Sinchev, A. B.
    Akzhanova, Zh.
    Issekeshev, Y.
    Mukhanova, A. M.
    NEWS OF THE NATIONAL ACADEMY OF SCIENCES OF THE REPUBLIC OF KAZAKHSTAN-SERIES OF GEOLOGY AND TECHNICAL SCIENCES, 2020, (03): : 97 - 101
  • [3] Scheduling algorithms and NP-complete problems
    Kiselyov, O
    DR DOBBS JOURNAL, 1997, 22 (02): : 107 - 109
  • [4] Solving some NP-complete problems using split decomposition
    Rao, Michael
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (14) : 2768 - 2780
  • [5] Solving NP-Complete problems with quantum search
    Furer, Martin
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 784 - 792
  • [6] NEW EVOLUTIONARY GENETIC ALGORITHMS FOR NP-COMPLETE COMBINATORIAL OPTIMIZATION PROBLEMS
    BAC, FQ
    PEROV, VL
    BIOLOGICAL CYBERNETICS, 1993, 69 (03) : 229 - 234
  • [7] DNA models and algorithms for NP-complete problems
    Bach, E
    Condon, A
    Glaser, E
    Tanguay, C
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (02) : 172 - 186
  • [8] DNA models and algorithms for NP-complete problems
    Univ of Wisconsin, Madison, United States
    J Comput Syst Sci, 2 (172-186):
  • [9] DNA models and algorithms for NP-complete problems
    Bach, E
    Condon, A
    Glaser, E
    Tanguay, C
    ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1996, : 290 - 300
  • [10] SUPERCOMPUTING FOR SOLVING A CLASS OF NP-COMPLETE AND ISOMORPHIC COMPLETE PROBLEMS
    KAPRALSKI, A
    COMPUTING SYSTEMS, 1992, 7 (04): : 218 - 228
12345