Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms

NIPS 1995: Proceedings of the 8th International Conference on Neural Information Processing Systems

Volumn , Issue , 1995, Pages 430-436

  Juels, Ari ^a   Wattenberg, Martin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STOCHASTIC SYSTEMS;

BASELINE METHODS; COMBINATORIAL FUNCTIONS; ENCODINGS; HILL-CLIMBING ALGORITHM; HILL-CLIMBING METHODS; JOB-SHOP; OPTIMIZERS; PERFORMANCE; SIMPLE STOCHASTIC; STOCHASTIC HILL-CLIMBING;

GENETIC ALGORITHMS;

EID: 0001722513     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. D. Ackley. A Connectionist Machine for Genetic HillcUmbing. Kluwer Academic Publishers, 1987.
2. D. Applegate and W. Cook. A computational study of the job-shop problem. ORSA Journal of Computing, 3 (2), 1991.
3. J. Carlier and E. Pinson. An algorithm for solving the jobshop problem. Mngmnt. Sci., 35; (2):164-176, 1989.
4. L. Davis. Bit-climbing, representational bias, and test suite design. In Belew and Booker, editors, ICGA-4, pages 18-23, 1991.
5. H. Fang, P. Ross, and D. Corne. A promising GA approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In Forrest, editor, ICGA-5, 1993.
6. M. Garey and D. Johnson. Computers and Intractability. W. H. Freeman and Co., 1979.
7. D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989.
8. D. Goldberg and K. Deb. A comparative analysis of selection schemes used in GAs, In FOGA-2, pages 69-93, 1991.
9. K. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, 1975.
10. A. Juels and M. Wattenberg. Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. Technical Report CSD-94-834, UC Berkeley, CS Division, 1994.
11. S. Khuri, T. Bäck, and J. Heitkötter. An evolutionary approach to combinatorial optimization problems. In Procs. of CSC 1994, 1994.
12. J. Koza. FOGA, chapter A Hierarchical Approach to Learning the Boolean Multiplexer Function, pages 171-192. 1991.
13. J. Koza. Genetic Programming. MIT Press, Cambridge, MA, 1991.
14. J. Koza. The GP paradigm: Breeding computer programs. In Branko Souček and the IRIS Group, editors, Dynamic, Genetic, and Chaotic Prog., pages 203-221. John Wiley and Sons, Inc., 1992.
15. M. Mitchell, J. Holland, and S. Forrest. When will a GA outperform hill-climbing? In J. D. Cowen, G. Tesauro, and J. Alspector, editors, Advances in Neural Inf. Processing Systems 6, 1994.
16. J. Muth and G. Thompson. Industrial Scheduling. Prentice Hall, 1963.
17. U. O'Reilly and F. Oppacher. Program search with a hierarchical variable length representation: Genetic programing, simulated annealing and hill climbing. In PPSN-3, 1994.
18. S. Wilson. GA-easy does not imply steep est-ascent optimizable. In Belew and Booker, editors, ICGA-4, pages 85-89, 1991.