Optimizing Global-Local Search Hybrids

This paper develops a framework for optimizing global-local hybrids of search or optimization procedures. The paper starts by idealizing the search problem as a search by a global algorithm G for either (1) acceptable targets—solutions that meet a specified criterion—or for (2) basins of attraction that then lead to acceptable targets under a specified local search algorithm L. The paper continues by abstracting two sets of parameters—probabilities of successfully hitting targets and basins and time-to-criterion coefficients—and writing equations to account for the total time of search and for the reliability in reaching an acceptable solution. A two-basin optimality criterion is derived and applied to important representative problems. Continuations and extensions of the work are suggested, but the theory appears to be useful immediately in better understanding the economy of effective hybridization.

[1]  Takeshi Yamada,et al.  Optimal Population Size under Constant Computation Cost , 1994, PPSN.

[2]  Michael M. Skolnick,et al.  EnGENEous Domain IndependentMachine Learning for Design Optimization , 1989, International Conference on Genetic Algorithms.

[3]  Darrell Whitley,et al.  Modeling Hybrid Genetic Algorithms , 1995 .

[4]  C. G. Shaefer,et al.  The ARGOT Strategy: Adaptive Representation Genetic Optimizer Technique , 1987, ICGA.

[5]  William H. Press,et al.  Numerical Recipes in C, 2nd Edition , 1992 .

[6]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[7]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[8]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[9]  David E. Goldberg,et al.  Genetic and evolutionary algorithms come of age , 1994, CACM.

[10]  David E. Goldberg,et al.  Decision making in a hybrid genetic algorithm , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[11]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

[12]  Derek Smith,et al.  Bin Packing with Adaptive Search , 1985, ICGA.

[13]  Geoffrey E. Hinton,et al.  How Learning Can Guide Evolution , 1996, Complex Syst..

[14]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

[15]  David E. Goldberg,et al.  Real-coded Genetic Algorithms, Virtual Alphabets, and Blocking , 1991, Complex Syst..