Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem
Authors:
- Mohammed Essaid RiffiMRMohammed Essaid Riffi
- Yassine SajiYSYassine Saji
- Mohammed BarkatouMBMohammed Barkatou
Open Access
- 1 November 2017
- journal article
- Published by Elsevier in Egyptian Informatics Journal
- Vol. 18 (3) , 221-232
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- Iterated local search for the quadratic assignment problemEuropean Journal of Operational Research, 2006
- An improved hybrid genetic algorithm: new results for the quadratic assignment problemKnowledge-Based Systems, 2004
- Fitness landscape analysis and memetic algorithms for the quadratic assignment problemIEEE Transactions on Evolutionary Computation, 2000
- A greedy genetic algorithm for the quadratic assignment problemComputers & Operations Research, 2000
- Ant colonies for the quadratic assignment problemJournal of the Operational Research Society, 1999
- Solving Quadratic Assignment Problems by ‘Simulated Annealing’IIE Transactions, 1987
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957
- Individual Comparisons by Ranking MethodsBiometrics Bulletin, 1945