Sciweavers

AE
2005
Springer

Memetic Algorithms for the MinLA Problem

13 years 9 months ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA heuristic used to create the initial population and a local search operator based on a fine tuned Simulated Annealing algorithm. Its performance is investigated through extensive experimentation over well known benchmarks and compared with other state-of-the-art algorithms. Key words: Memetic Algorithms, Linear Arrangement, Heuristics.
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where AE
Authors Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
Comments (0)