A new hybrid approach based on discrete differential evolution algorithm to enhancement solutions of quadratic assignment problem
- 1 January 2020
- journal article
- research article
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 11 (1), 51-72
- https://doi.org/10.5267/j.ijiec.2019.6.005
Abstract
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. (C) 2020 by the authors; licensee Growing Science, CanadaKeywords
This publication has 22 references indexed in Scilit:
- Comparison of Two Diversification Methods to Solve the Quadratic Assignment ProblemProcedia Computer Science, 2015
- An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platformJournal of Parallel and Distributed Computing, 2013
- Breakout local search for the quadratic assignment problemApplied Mathematics and Computation, 2013
- Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problemInformation Sciences, 2012
- Location allocation modeling for healthcare facility planning in MalaysiaComputers & Industrial Engineering, 2012
- The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristicsComputers & Operations Research, 2012
- A bilevel model for preventive healthcare facility network design with congestionIIE Transactions, 2010
- A location–allocation model for service providers with application to not-for-profit health care organizationsOmega, 2010
- A discrete differential evolution algorithm for the permutation flowshop scheduling problemComputers & Industrial Engineering, 2008
- Multicriteria tour planning for mobile healthcare facilities in a developing countryEuropean Journal of Operational Research, 2007