Enhancing the performance of memetic algorithms by using a matching-based recombination algorithm

Title: Enhancing the performance of memetic algorithms by using a matching-based recombination algorithm
Creator: Berretta, Regina; Cotta, Carlos; Moscato, Pablo
Relation: Metaheuristics: Computer Decision Making p. 65-90
Relation: Applied Optimization 86
Relation: http://www.springer.com/math/book/978-1-4020-7653-4
Publisher: Kluwer Academic Publishers
Resource Type: book chapter
Date: 2003
Description: The Number Partitioning Problem (MNP) remains as one of the simplest-to-describe yet hardest-to-solve combinatorial optimization problems. In this paper we use the MNP as a surrogate for several related real-world problems, to test new heuristics ideas. To be precise, we study the use of weightmatching techniques to devise smart memetic operators. Several options are considered and evaluated for that purpose. The positive computational results indicate that - despite the MNP may be not the best scenario for exploiting these ideas - the proposed operators can be really promising tools for dealing with more complex problems of the same family.
Subject: memetic algorithms; tabu search; number partitioning problem; weight matching
Identifier: http://hdl.handle.net/1959.13/35282
Identifier: uon:3851
Identifier: ISBN:1-4020-7653-3
Language: eng

		Thumbnail	File	Description	Size	Format