Mosul University
  • Register
  • Login
  • العربیة

AL-Rafidain Journal of Computer Sciences and Mathematics

Notice

As part of Open Journals’ initiatives, we create website for scholarly open access journals. If you are responsible for this journal and would like to know more about how to use the editorial system, please visit our website at https://ejournalplus.com or
send us an email to info@ejournalplus.com

We will contact you soon

  1. Home
  2. Volume 1, Issue 1
  3. Author

Current Issue

By Issue

By Subject

Keyword Index

Author Index

Indexing Databases XML

About Journal

Aims and Scope

Editorial Board

Editorial Staff

Publication Ethics

Indexing and Abstracting

Related Links

Peer Review Process

News

A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms

    Najla Akram Al-Saati

AL-Rafidain Journal of Computer Sciences and Mathematics, 2004, Volume 1, Issue 1, Pages 120-137
10.33899/csmj.2004.164101

  • Show Article
  • Download
  • Cite
  • Statistics
  • Share

Abstract

This work is based on the process of modifying an intelligent heuristic rule used in solving NP-Complete problems, where a study and a modification of a Flow Shop assignment heuristic has been carried out to solve a well-known classic Artificial Intelligent problem, which is the traveling Salesman problem. For this modification to be carried out successfully, the problem’s mathematical formulation had to be studied carefully and the possibility of reformulating the problem to be more suitable for the heuristic procedure. This may require some changes in the heuristic procedure itself, these adjustments were due to the noticeable differences like the symmetric property present in the traveling salesman problem environment and some other differences.
Genetic Algorithm is added to improve the results obtained by the used heuristic, where the use of crossover and mutation procedures will provide better chances for the near optimal solution to be improved towards optimal solutions.
The test problem is made on cities that lie on the regular square grid, which simplify the calculations of distance traveled between any two cities. Programs were written using C programming language, and timers were used to measure the elapsed time of calculations in order to assess the efficiency of the program.
 
Keywords:
    heuristic NP-Complete Problems Genetic Algorithms
Main Subjects:
  • Artificial Intelligence
  • Computer Science
  • PDF (365 K)
  • XML
(2004). A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms. AL-Rafidain Journal of Computer Sciences and Mathematics, 1(1), 120-137. doi: 10.33899/csmj.2004.164101
Najla Akram Al-Saati. "A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms". AL-Rafidain Journal of Computer Sciences and Mathematics, 1, 1, 2004, 120-137. doi: 10.33899/csmj.2004.164101
(2004). 'A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms', AL-Rafidain Journal of Computer Sciences and Mathematics, 1(1), pp. 120-137. doi: 10.33899/csmj.2004.164101
A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms. AL-Rafidain Journal of Computer Sciences and Mathematics, 2004; 1(1): 120-137. doi: 10.33899/csmj.2004.164101
  • RIS
  • EndNote
  • BibTeX
  • APA
  • MLA
  • Harvard
  • Vancouver
  • Article View: 33
  • PDF Download: 36
  • LinkedIn
  • Twitter
  • Facebook
  • Google
  • Telegram
  • Home
  • Glossary
  • News
  • Aims and Scope
  • Privacy Policy
  • Sitemap
This journal is licensed under a Creative Commons Attribution 4.0 International (CC-BY 4.0)

Powered by eJournalPlus