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 条
  • [41] MARTINGALE INEQUALITIES AND NP-COMPLETE PROBLEMS
    RHEE, WT
    TALAGRAND, M
    MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (01) : 177 - 181
  • [42] Neural networks for NP-complete problems
    Budinich, M
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1997, 30 (03) : 1617 - 1624
  • [43] On Some NP-complete SEFE Problems
    Angelini, Patrizio
    Da Lozzo, Giordano
    Neuwirth, Daniel
    ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 200 - 212
  • [44] Generic complexity of NP-complete problems
    GROUP-BASED CRYPTOGRAPHY, 2008, : 129 - 134
  • [45] INFEASIBLE COMPUTATION - NP-COMPLETE PROBLEMS
    LAMAGNA, EA
    ABACUS-NEW YORK, 1987, 4 (03): : 18 - 33
  • [46] Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions
    Oltean, Mihai
    Muntean, Oana
    OPTICAL SUPERCOMPUTING, PROCEEDINGS, 2008, 5172 : 115 - 127
  • [47] Solving NP-Complete Problems by Spiking Neural P Systems with Budding Rules
    Ishdorj, Tseren-Onolt
    Leporati, Alberto
    Pan, Linqiang
    Wang, Jun
    MEMBRANE COMPUTING, 2010, 5957 : 335 - +
  • [48] QUANTUM COMPUTING ALGORITHMS FOR INVERSE PROBLEMS ON GRAPHS AND AN NP-COMPLETE INVERSE PROBLEM
    Ilmavirta, Joonas
    Lassas, Matti
    Lu, Jinpeng
    Oksanen, Lauri
    Ylinen, Lauri
    arXiv, 2023,
  • [49] OPTP AS THE NORMAL BEHAVIOR OF NP-COMPLETE PROBLEMS
    GASARCH, WI
    KRENTEL, MW
    RAPPOPORT, KJ
    MATHEMATICAL SYSTEMS THEORY, 1995, 28 (06): : 487 - 514
  • [50] ON CHAOTIC BEHAVIOR OF SOME NP-COMPLETE PROBLEMS
    PERL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 149 - 161
12345