Genetic local search in combinatorial optimization
CO89 Selected papers of the conference on Combinatorial Optimization
A genetic approach to the quadratic assignment problem
Computers and Operations Research - Special issue on genetic algorithms
Genetic Algorithms Plus Data Structures Equals Evolution Programs
Genetic Algorithms Plus Data Structures Equals Evolution Programs
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms and Simulated Annealing
Genetic Algorithms and Simulated Annealing
Genetic Algorithms and Manufacturing Systems Design
Genetic Algorithms and Manufacturing Systems Design
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Genetic Local Search Algorithms for the Travelling Salesman Problem
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
A novel genetic algorithm based on immunity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
In this paper, immunity based genetic algorithm is proposed to solve quadratic assignment problem (QAP). The QAP problem, known as NP-hard problem, is a combinatorial problem found in the optimal assignment of facilities to allocations. The proposed algorithm is to enhance the performance of genetic algorithms by embedded immune systems so as to have locally optimal offspring, and it is successfully applied to solve QAP. From our simulations for those tested problems, the proposed algorithm has the best performances when compared to other existing search algorithms.