Egyptian Informatics Journal · 2017 · 26 citations · 48 references
Natural SciencesComputer ScienceAlgorithmsFacility LocationOptimizationAssignment ProblemsCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingMetaheuristic OptimizationCombinatorial Optimization HeuristicsFacility AllocationFacility Location OptimizationLocation-allocation ProblemsUniform Crossover
The bat algorithm is one of the recent nature-inspired algorithms, which has been emerged as a powerful search method for solving continuous as well as discrete problems. The quadratic assignment problem is a well-known NP-hard problem in combinatorial optimization. The goal of this problem is to assign n facilities to n locations in such a way as to minimize the assignment cost. For that purpose, this paper introduces a novel discrete variant of bat algorithm to deal with this combinatorial optimization problem. The proposed algorithm was evaluated on a set of benchmark instances from the QAPLIB library and the performance was compared to other algorithms. The empirical results of exhaustive experiments were promising and illustrated the efficacy of the suggested approach.
48
A Simple Sequentially Rejective Multiple Test Procedure
Sture Holm · Scandinavian Journal of Statistics · 1979 · 21.8K citations
Individual Comparisons by Ranking Methods
Frank Wilcoxon · Biometrics Bulletin · 1945 · 14.4K citations
Business, Computer Science, Multi-criteria Decision Making +8
Joaquín Derrac, Salvador García, Daniel Molina et al. · Swarm and Evolutionary Computation · 2011 · 5.4K citations