The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Digital Archiving Policy
  • Promote your Publication
  • Metadata Harvesting (OAI2)

IJACSA

  • About the Journal
  • Call for Papers
  • Editorial Board
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Fees/ APC
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors
  • SUSAI-EE 2025
  • ICONS-BA 2025
  • IoT-BLOCK 2025

Future of Information and Communication Conference (FICC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Editorial Board
  • Guidelines
  • Submit
  • Current Issue
  • Archives
  • Indexing
  • Fees
  • Reviewers
  • Subscribe

DOI: 10.14569/IJACSA.2018.091261
PDF

Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for best Solutions

Author 1: Asaad Shakir Hameed
Author 2: Burhanuddin Mohd Aboobaider
Author 3: Ngo Hea Choon
Author 4: Modhi Lafta Mutar

International Journal of Advanced Computer Science and Applications(IJACSA), Volume 9 Issue 12, 2018.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

Abstract: The combinatorial optimization problems are very important in the branch of optimization or in the field of operation research in mathematics. The quadratic assignment problem (QAP) is in the category of facilities location problems and is considered as one of the significant complex’s combinatorial optimization problems since it has many applications in the real world. The QAP is involved in allocating N facilities to N locations with specified distances amid the locations and the flows between the facilities. The modified discrete differential evolution algorithm has been presented in this study based on the crossover called uniform like a crossover (ULX). The proposed algorithm used to enhance the QAP solutions through finding the best distribution of the N facilities to N locations with the minimized total cost. The employed criteria in this study for the evaluation of the algorithm were dependent on the accuracy of the algorithm by using the relative percent deviation (PRD). The proposed algorithm was applied to 41 different sets of the benchmark QAPLIB, while the obtained results indicated that the proposed algorithm was more efficient and accurate compared with Tabu Search, Differential Evolution, and Genetic algorithm.

Keywords: Quadratic assignment problem; combinatorial optimization problems; differential evolution algorithm

Asaad Shakir Hameed, Burhanuddin Mohd Aboobaider, Ngo Hea Choon and Modhi Lafta Mutar, “Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for best Solutions” International Journal of Advanced Computer Science and Applications(IJACSA), 9(12), 2018. http://dx.doi.org/10.14569/IJACSA.2018.091261

@article{Hameed2018,
title = {Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for best Solutions},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2018.091261},
url = {http://dx.doi.org/10.14569/IJACSA.2018.091261},
year = {2018},
publisher = {The Science and Information Organization},
volume = {9},
number = {12},
author = {Asaad Shakir Hameed and Burhanuddin Mohd Aboobaider and Ngo Hea Choon and Modhi Lafta Mutar}
}



Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

IJACSA

Upcoming Conferences

IntelliSys 2025

28-29 August 2025

  • Amsterdam, The Netherlands

Future Technologies Conference 2025

6-7 November 2025

  • Munich, Germany

Healthcare Conference 2026

21-22 May 2026

  • Amsterdam, The Netherlands

Computing Conference 2026

9-10 July 2026

  • London, United Kingdom

IntelliSys 2026

3-4 September 2026

  • Amsterdam, The Netherlands

Computer Vision Conference 2026

15-16 October 2026

  • Berlin, Germany
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© The Science and Information (SAI) Organization Limited. All rights reserved. Registered in England and Wales. Company Number 8933205. thesai.org