A new hybrid approach based on discrete differential evolution algorithm to enhancement solutions of quadratic assignment problem

Article history: Received April 1 2019 Received in Revised Format June 19 2019 Accepted June 19 2019 Available online June 19 2019 The Combinatorial Optimization Problem (COPs) is one of the branches of applied mathematics and computer sciences, which is accompanied by many problems such as Facility Layout Problem (FLP), Vehicle Routing Problem (VRP), etc. Even though the use of several mathematical formulations is employed for FLP, Quadratic Assignment Problem (QAP) is one of the most commonly used. One of the major problems of Combinatorial NP-hard Optimization Problem is QAP mathematical model. Consequently, many approaches have been introduced to solve this problem, and these approaches are classified as Approximate and Exact methods. With QAP, each facility is allocated to just one location, thereby reducing cost in terms of aggregate distances weighted by flow values. The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. The performance of the proposed approach has been tested on several sets of instances from the data set of QAP and the results obtained have shown the effective performance of the proposed algorithm in improving several solutions of QAP in reasonable time. Afterwards, the proposed approach is compared with other recent methods in the literature review. Based on the computation results, the proposed hybrid approach outperforms the other methods. © 2020 by the authors; licensee Growing Science, Canada

[1]  Doaa El-Shahat,et al.  Integrating the whale algorithm with Tabu search for quadratic assignment problem: A new approach for locating hospital departments , 2018, Appl. Soft Comput..

[2]  Siddhartha S. Syam,et al.  A location–allocation model for service providers with application to not-for-profit health care organizations , 2010 .

[3]  Mitat Uysal,et al.  Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem , 2012, Inf. Sci..

[4]  Gerhard J. Woeginger,et al.  New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices , 2016, Eur. J. Oper. Res..

[5]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[6]  Giuseppe Vincenzo Marannano,et al.  Firefly algorithm based upon slicing structure encoding for unequal facility layout problem , 2019, International Journal of Industrial Engineering Computations.

[7]  Yongquan Zhou,et al.  Elite opposition-flower pollination algorithm for quadratic assignment problem , 2017, J. Intell. Fuzzy Syst..

[8]  Zakir Hussain Ahmed,et al.  A hybrid algorithm combining lexisearch and genetic algorithms for the quadratic assignment problem , 2018 .

[9]  Mario Inostroza-Ponta,et al.  A memetic algorithm for the quadratic assignment problem with parallel local search , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[10]  Laura Bahiense,et al.  The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics , 2012, Comput. Oper. Res..

[11]  Apurv Shukla,et al.  A modified bat algorithm for the Quadratic Assignment Problem , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[12]  Yuren Zhou,et al.  Performance Analysis of ACO on the Quadratic Assignment Problem , 2018 .

[13]  Mohd Omar,et al.  Location allocation modeling for healthcare facility planning in Malaysia , 2012, Comput. Ind. Eng..

[14]  P. Marcotte,et al.  A bilevel model for preventive healthcare facility network design with congestion , 2010 .

[15]  Habibollah Haron,et al.  A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem , 2015, Comput. Intell. Neurosci..

[16]  Lhassane Idoumghar,et al.  Comparison of Two Diversification Methods to Solve the Quadratic Assignment Problem , 2015, ICCS.

[17]  Tetsuyuki Takahama,et al.  Solving quadratic assignment problems by differential evolution , 2012, The 6th International Conference on Soft Computing and Intelligent Systems, and The 13th International Symposium on Advanced Intelligence Systems.

[18]  Ümit Bilge,et al.  Facility layout problem with QAP formulation under scenario-based uncertainty , 2018, INFOR Inf. Syst. Oper. Res..

[19]  Congying Lv A hybrid strategy for the quadratic assignment problem , 2012, 2012 International Conference on Information Management, Innovation Management and Industrial Engineering.

[20]  Karl F. Doerner,et al.  Multicriteria tour planning for mobile healthcare facilities in a developing country , 2007, Eur. J. Oper. Res..

[21]  R. Sridharan,et al.  Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems , 2018 .

[22]  Mohammed Essaid Riffi,et al.  Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem , 2017 .

[23]  Mehmet Fatih Tasgetiren,et al.  Metaheuristic algorithms for the quadratic assignment problem , 2013, 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS).

[24]  Boulevard Lavoisier,et al.  Breakout local search for the quadratic assignment problem , 2013 .

[25]  Shankar Chakraborty,et al.  Bi-objective dependent location quadratic assignment problem: Formulation and solution using a modified artificial bee colony algorithm , 2018, Comput. Ind. Eng..

[26]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[27]  Mohamad Amin Kaviani,et al.  A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem , 2014 .

[28]  Mohamed Abdel-Basset,et al.  A comprehensive review of quadratic assignment problem: variants, hybrids and applications , 2018, Journal of Ambient Intelligence and Humanized Computing.

[29]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

[30]  El-Ghazali Talbi,et al.  Parallel hybrid evolutionary algorithms on GPU , 2010, IEEE Congress on Evolutionary Computation.

[31]  Michal Czapinski,et al.  An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform , 2013, J. Parallel Distributed Comput..

[32]  R. Sridharan,et al.  Parameter Selection of Discrete Particle Swarm Optimization Algorithm for the Quadratic Assignment Problems , 2016 .

[33]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..