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 条
  • [31] Rough Sets and Genetic Algorithm Using for Diagnostic Problems Solving
    Altahr, Sakena Saied Alsadig
    Gallova, Stefania
    WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2015, VOL II, 2015, : 787 - 790
  • [32] Solving cross-matching puzzles using intelligent genetic algorithms
    Orhan Kesemen
    Eda Özkul
    Artificial Intelligence Review, 2018, 49 : 211 - 225
  • [33] Solving cross-matching puzzles using intelligent genetic algorithms
    Kesemen, Orhan
    Ozkul, Eda
    ARTIFICIAL INTELLIGENCE REVIEW, 2018, 49 (02) : 211 - 225
  • [34] A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP
    Alkhayri, Wael Raef
    Owais, Suhail Sami
    Shkoukani, Mohammad
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2016, 7 (10) : 62 - 66
  • [35] Two-dimensional packing problems using Genetic Algorithms
    Jain, S
    Gea, HC
    ENGINEERING WITH COMPUTERS, 1998, 14 (03) : 206 - 213
  • [36] Two-dimensional packing problems using genetic algorithms
    Sakait Jain
    Hae Chang Gea
    Engineering with Computers, 1998, 14 : 206 - 213
  • [37] A Comparative Study of Mixed-Integer Linear Programming and Genetic Algorithms for Solving Binary Problems
    Kuendee, Punyisa
    Janjarassuk, Udom
    2018 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS (ICIEA), 2018, : 284 - 288
  • [38] Solving Job-Shop Scheduling Problems by Genetic Algorithms Based on Building Block Hypothesis
    CHENG Rong~1
    International Journal of Plant Engineering and Management, 2006, (02) : 119 - 123
  • [39] Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
    Florios, Kostas
    Mavrotas, George
    Diakoulaki, Danae
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (01) : 14 - 21
  • [40] Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms
    Deb, Kalyanmoy
    Sinha, Ankur
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION: 5TH INTERNATIONAL CONFERENCE, EMO 2009, 2009, 5467 : 110 - 124
12345