Thomas Bäck, Martin Schütz, Sami Khuri  Home/Search
Context
Related
| ls11www.informatik.unido...ea95.ps.gz sjsu.edu/faculty/khuri/set_cov96.ps ls11www.informatik.unid...BSK96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ls11www.informa...ea_application (more) From: sjsu.edu/faculty/k...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we compare the effects of using various stochastic operators with the non-unicost set-covering problem. Four different crossover operators are compared to a repair heuristic which consists in transforming infeasible strings into feasible ones. These stochastic operators are incorporated in GENEsYs, the genetic algorithm we apply to problem instances of the set-covering problem we draw from well known test problems. GENEsYs uses a simple fitness function that has a graded penalty... (Update)
Active bibliography (related documents): More All
0.7: A Genetic Algorithm for the Set Covering Problem - Beasley, Chu (1996) (Correct)
0.5: An Indexed Bibliography of Genetic Algorithms in the.. - Jarmo T. Alander (2000) (Correct)
0.3: Transitive Packing - Müller, Schulz (Correct)
Similar documents based on text: More All
0.3: An Evolutionary Heuristic for the Maximum Independent Set Problem - Bäck, Khuri (1994) (Correct)
0.3: Applying Evolutionary Algorithms to Combinatorial Optimization .. - Torres, Khuri (Correct)
0.3: Randomness of Finite Strings: A Reconstructive Approach - Khuri, Stern, Chiu (Correct)
BibTeX entry: (Update)
@misc{ ck-comparative,
author = "Thomas Bäck and Martin Schütz and Sami Khuri",
title = "A Comparative Study of a Penalty Function, a Repair Heuristic, and Stochastic
Operators with the Set-Covering Problem",
url = "citeseer.ist.psu.edu/20460.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1051 optimization and machine learning (context) - Goldberg, in - 1989
773 Reducibility among combinatorial problems (context) - Karp - 1972
275 Uniform crossover in genetic algorithms (context) - Syswerda - 1989
129 OR-Library: Distributing test problems by electronic mail (context) - Beasley - 1990
104 Some guidelines for genetic algorithms with penalty function.. (context) - Richardson, Palmer et al. - 1989
59 An analysis of the behaviour of a class of genetic adaptive .. (context) - De Jong - 1975
57 How genetic algorithms really work (context) - Muhlenbein - 1992
39 A genetic algorithm for the set covering problem - Beasley, Chu - 1994
37 and self-adaptation within a genetic algorithm (context) - Back, of et al. - 1992
36 An evolutionary approach to combinatorial optimization probl.. - Khuri, Back et al. - 1994
29 Genesis: A system for using genetic search procedures (context) - Grefenstette - 1984
22 A lagrangian heuristic for set-covering problems (context) - Beasley - 1990
17 and feasibility constraints (context) - Orvosh, Davis et al. - 1993
14 A genetic algorithm for the set partitioning problem (context) - Levine - 1993
13 An Introduction to the Design and Analysis of Algorithms (context) - Stinson - 1987
11 Genetic algorithms applications to set covering and travelin.. (context) - Liepins, Hilliard et al. - 1990
11 An evolutionary heuristic for the maximum independent set pr.. - Back, Khuri - 1994
9 A technique for the solution of massive set-covering problem.. (context) - Rubin - 1973
8 Minimal cost set covering using probabilistic methods (context) - Sen - 1993
5 This article was processed using the L A T E X macro package.. (context) - Walker, set-covering et al. - 1974
3 All the facets with coefficients in f0; 1; 2g (context) - Balas, Ng et al. - 1989
2 A genetic algorithm approach for set covering problems (context) - Huang, Kao et al. - 1994
2 Simplification of the covering problem with application ot b.. (context) - Breuer - 1970
Documents on the same site (http://ls11-www.informatik.uni-dortmund.de/people/baeck/ea_application.html): More
Evolution Strategies Applied to Perturbed Objective Functions - Thomas Bäck, Ulrich Hammel (1994) (Correct)
Evolution Strategies on Noisy Functions How to Improve.. - Ulrich Hammel, Thomas.. (1994) (Correct)
An Evolutionary Approach to Combinatorial Optimization.. - Khuri, Bäck, Heitkötter (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC