scholarly journals A New Genetic Algorithm for Set Covering Problems

2000 ◽  
Author(s):  
Uwe Aickelin
Keyword(s):  
Genetic Algorithm ◽  
Set Covering ◽  
Covering Problems ◽  
Set Covering Problems

scholarly journals A FRAMEWORK FOR MEMETIC ALGORITHMS

2009 ◽  
Vol 12 (11) ◽  
pp. 27-38
Author(s):  
Tuan Anh Phan ◽  
Anh Tuan Duong
Keyword(s):  
Genetic Algorithm ◽  
Design Patterns ◽  
Memetic Algorithm ◽  
Optimization Problems ◽  
Object Oriented ◽  
Memetic Algorithms ◽  
Set Covering ◽  
Covering Problems ◽  
Set Covering Problems ◽  
Combinatorial Optimization Problems

Memetic algorithm, a combination of genetic algorithm with local search, is one of the most successful metaheuristics to solve complex combinatorial optimization problems. In this paper, we will introduce an object-oriented framework which allows the construction of memetic algorithms with a maximum reuse. This framework has been developed in Java using design patterns to allow its easy extension and utilization in different problem domains. Our framework has been experimented through the development of a memetic algorithm for solving set covering problems.

Hyperbolic set covering problems with competing ground-set elements

2011 ◽  
Vol 134 (2) ◽  
pp. 323-348 ◽  
Author(s):  
Edoardo Amaldi ◽  
Sandro Bosio ◽  
Federico Malucelli
Keyword(s):  
Set Covering ◽  
Covering Problems ◽  
Set Covering Problems ◽  
Hyperbolic Set
Sign in / Sign up

Export Citation Format

Share Document