(Enter summary)
Abstract: In this paper we provide an introduction to genetic algorithms and how they are used to solve
combinatorial optimization problems. We describe LibGA, a genetic algorithm development library.
LibGA is used to solve three simple combinatorial optimization problems: bin packing, the traveling
salesman problem, and multiprocessor scheduling. Sufficient details of LibGA are provided to enable
the reader to easily use LibGA as a tool for solving additional combinatorial optimization problems.
1 (Update)
Similar documents based on text: More All
0.9: The Performance of a Genetic Algorithm on a Chaotic Objective.. - Corcoran
(Correct)
0.8: Chromosome Reduction in Genetic Algorithms - Corcoran, Wainwright (1994)
(Correct)
0.8: Solving The Subset Interconnection Design Problem Using Genetic .. - AbuAli, al. (1996)
(Correct)
BibTeX entry: (Update)
A.L. Corcoran and R.L. Wainwright. Using LibGA to develop genetic algorithms for solving combinatorial optimization problems. In Lance Chambers, editor, The Application Handbook of Genetic Algorithms, pages 143--172. CRC Press, 1995. http://citeseer.ist.psu.edu/corcoran95using.html More
@misc{ corcoran95using,
author = "A. Corcoran and R. Wainwright",
title = "Using LibGA to develop genetic algorithms for solving combinatorial optimization
problems",
text = "A.L. Corcoran and R.L. Wainwright. Using LibGA to develop genetic algorithms
for solving combinatorial optimization problems. In Lance Chambers, editor,
The Application Handbook of Genetic Algorithms, pages 143--172. CRC Press,
1995.",
year = "1995",
url = "citeseer.ist.psu.edu/corcoran95using.html" }
Citations (may not include all citations):
2138
Genetic Algorithms in Search (context) - Goldberg - 1989
1931
Adaptation in Natural and Artificial Systems (context) - Holland - 1975
482
Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
151
Fundamentals of Computer Algorithms (context) - Horowitz, Sahni - 1984
80
Worst-case performance bounds for simple one-dimensional pac.. (context) - Johnson, Demers et al. - 1974
68
Algorithms for the vehicle routing and scheduling problems w.. (context) - Solomon - 1987
54
Scheduling problems and traveling salesman: The genetic edge.. (context) - Whitley, Starkweather et al. - 1989
50
A comparison of genetic sequencing operators
- Starkweather, McDaniel et al.
47
GENITOR II: A distributed genetic algorithm (context) - Whitley, Starkweather - 1990
44
Parallel Problem Solving from Nature (context) - Manner, Manderick - 1992
42
Orthogonal packings in two dimensions (context) - Baker, Coffman et al. - 1980
41
GENITOR: A different genetic algorithm (context) - Whitley, Kauth - 1988
38
A promising genetic algorithm approach to job-shop schedulin..
- Fang, Ross et al.
37
Discrete Optimization (context) - Parker, Rardin - 1988
36
A genetic algorithm applicable to large-scale job-shop probl.. (context) - Yamada, Nakano
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mcs.utulsa.edu/~rogerw/publications.html): More
Solving Facility Layout Problems Using Genetic.. - Garces-Perez..
(Correct)
Detecting Multiple Outliers in Regression Data Using Genetic.. - Crawford (1995)
(Correct)
A Heuristic for Improved Genetic Bin Packing - Arthur Corcoran And (1993)
(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