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

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.

@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},
  volume    = {9},
  number    = {12},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Asaad Shakir Hameed and Burhanuddin Mohd Aboobaider and Ngo Hea Choon and Modhi Lafta Mutar},
  doi       = {10.14569/IJACSA.2018.091261},
  url       = {https://doi.org/10.14569/IJACSA.2018.091261}
}