On a Feasible-Infeasible Two-Population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch

European Journal of Operational Research

Volumn 190, Issue 2, 2008, Pages 310-327

  Kimbrough, Steven Orla ^a   Koehler, Gary J ^b   Lu, Ming ^a   Wood, David Harlan ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

^c UNIVERSITY OF DELAWARE   (United States)

Author keywords

Blackbox search; Constrained optimization; Heuristics; No free lunch

Indexed keywords

BOUNDARY CONDITIONS; CONSTRAINED OPTIMIZATION; HEURISTIC ALGORITHMS; PROBLEM SOLVING; THEOREM PROVING;

BLACKBOX SEARCH; DISTANCE TRACING; NO FREE LUNCH;

GENETIC ALGORITHMS;

EID: 41849112044     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.06.028     Document Type: Article

References (44)

1. Bäck T. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms (1996), Oxford University Press, New York, NY
2. In: Bäck T., Fogel D., and Michalewicz Z. (Eds). Handbook of Evolutionary Computation (1997), Institute of Physics Publishing.
3. In: Bäck T., Fogel D., and Michalewicz Z. (Eds). Advanced Algorithms and Operators (2000), Institute of Physics Publishing, Bristol, UK
4. BenHamida S., and Schoenauer M. An Adaptive Algorithm for constrained optimization problems. Parallel Problem Solving in Nature (PPSN 2000) (2000), Springer-Verlag, Berlin, Germany 529-539
5. BenHamida S., and Schoenauer M. ASCHEA: New results using adaptive segregational constraint handling. Congress on Evolutionary Computing (CEC 2002) (2002), IEEE Press 884-889
6. Branley B., Fradin R., Kimbrough S.O., and Shafer T. On heuristic mapping of decision surfaces for post-evaluation analysis. In: Sprague Jr. R.H. (Ed). Proceedings of the Thirtieth Annual Hawaii International Conference on System Sciences (1997), IEEE Press, Los Alamitos, CA
7. Chu P.C., and Beasley J.E. A genetic algorithm for the generalized assignment problem. Computers and Operations Research 24 1 (1997) 17-23
8. Chu P.C., and Beasley J.E. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4 1 (1998) 63-86
9. Coello, C.A.C., 1999. A survey of constraint handling techniques used with evolutionary algorithms. Technical Report Lania-RI-99-04, Laboratorio Nacional de Inform'atica Avanzada, Veracruz, M'exico. .
10. Coello C. Theoretical and numerical constraint handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191 11-12 (2002) 1245-1287
11. Coello, C.A.C., 2003. List of references on constraint-handling techniques used with evolutionary algorithms. World Wide Web. (Accessed January 2007).
12. Eiben A.E. Evolutionary algorithms and constraint satisfaction: Definitions, survey, methodology, and research directions. In: Kallel L., Naudts B., and Rogers A. (Eds). Theoretical Aspects of Evolutionary Computing (2001), Springer-Verlag, Berlin, Germany 13-30
13. Eiben A.E., and Smith J.E. Introduction to Evolutionary Computing (2003), Springer-Verlag, Berlin, Germany
14. Floudas C.A., Pardalos P.M., Adjiman C.S., Esposito W.R., Gumus Z.H., Harding S.T., Klepeis J.L., Meyer C.A., and Schweiger C.A. Handbook of Test Problems in Local and Global Optimization (1999), Kluwer Academic Publishers, Dordrecht, The Netherlands
15. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley Longman Publishing Co., Inc., Boston, MA
16. Igel C., and Toussaint M. On classes of functions for which no free lunch results hold. Information Processing Letters 86 6 (2003) 317-321
17. Kimbrough S.O., and Oliver J.R. On automating candle lighting analysis: Insight from search with genetic algorithms and approximate models. In: Nunamaker Jr. J.F., and Sprague Jr. R.H. (Eds). Proceedings of the Twenty-Sixth Annual Hawaii International Conference on System Sciences. Information Systems: Decision Support and Knowledge-Based Systems vol. III (1994), IEEE Computer Society Press, Los Alamitos, CA 536-544
18. Kimbrough, S.O., Wood, D.H., 2006. On how solution populations can guide revision of model parameters. Late breaking papers, GECCO 2006, July 2006. lbp133.pdf at GECCO 2006. Available from: .
19. Kimbrough S.O., Oliver J.R., and Pritchett C.W. On post-evaluation analysis: Candlelighting and surrogate models. Interfaces 23 7 (1993) 17-28
20. Kimbrough S.O., Lu M., Wood D.H., and Wu D.J. Exploring a two-market genetic algorithm. In: Langdon W.B., Cant'u-Paz E., et al. (Eds). Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002) (2002), Morgan Kaufmann, San Francisco, CA 415-421
21. Kimbrough S.O., Lu M., Wood D.H., and Wu D.J. Exploring a twopopulation genetic algorithm. In: Cant'u-Paz Erick., et al. (Ed). Genetic and Evolutionary Computation (GECCO 2003). LNCS vol. 2723 (2003), Springer, Berlin, Germany 1148-1159
22. Kimbrough S.O., Lu M., and Safavi S.M. Exploring a financial product model with a two-population genetic algorithm. Proceedings of the 2004 Congress on Evolutionary Computation, Piscataway, NJ, June 19-23 (2004), IEEE Neural Network Society, IEEE Service Center. 0-7803-8515-2 855-862
23. Kimbrough, S.O., Lu, M., Wood, D.H., 2004b. Exploring the evolutionary details of a Feasible-Infeasible Two-Population GA. In: Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), Birmingham, UK, 18-22 September.
24. Koehler G.J. Conditions that obviate the no free lunch theorems for optimization. Informs Journal on Computing. 19 2 (2007) 273-279
25. Le Riche R., and Haftka R.T. Improved genetic algorithm for minimum thickness composite laminate design. Composites Engineering 3 1 (1995) 121-139
26. Le Riche R., Knopf-Lenoir C., and Haftka R.T. A segregated genetic algorithm for constrained structural optimization. Proceedings of the Sixth International Conference on Genetic Algorithms (1995), Morgan Kaufmann 558-565
27. Mahalanobis P.C. On the generalised distance in statistics. Proceedings of the National Institute of Science of India 12 (1936) 49-55
28. Michalewicz Z. A survey of constraint handling techniques in evolutionary computation methods. Proceedings of the 4th Annual Conference on Evolutionary Programming (1995), MIT Press, Cambridge, MA 135-155.
29. Michalewicz, Z., 1995a. Do not kill unfeasible individuals. In: Dabrowski, Michalewicz, Ras, (Eds.), Proceedings of the Fourth Intelligent Information Systems Workshop (IIS'95), Augustow, Poland, June 5-9, pp. 110-123.
30. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs. third ed. (1996), Springer, Berlin, Germany
31. Michalewicz Z. Numerical optimization: Handling nonlinear constraints. In: Bäck T., Fogel David., and Michalewicz Zbigniew. (Eds). Handbook of Evolutionary Computation (1997), Institute of Physics Publishing G9.9.
32. Michalewicz, Z., 2003. Genocop - Optimization via genetic algorithms. World Wide Web. (Accessed January).
33. Michalewicz Z., and Fogel D.B. How to Solve It: Modern Heuristics (2000), Springer, Berlin, Germany
34. Michalewicz Z., Dasgupta D., Le Riche R.G., and Schoenauer M. Evolutionary algorithms for constrained engineering problems. Computers & Industrial Engineering Journal 30 2 (1996) 851-870
35. Radcliffe N.J., and Surry P.D. Fundamental imitations on search algorithms: Evolutionary computing in perspective. In: van Leeuwen J. (Ed). Lecture Notes in Computer Science vol. 1000 (1995), Springer-Verlag
36. In: Sarker R., Mohammadian M., and Yao X. (Eds). Evolutionary Optimization (2002), Kluwer, Boston, MA
37. Schoenauer M., and Michalewicz Z. Evolutionary computation at the edge of feasibility. In: Voigt H.-M., Ebeling W., Rechenberg I., and Schwefel H.-P. (Eds). Proceedings of the 4th Parallel Problem Solving from Nature. Lecture Notes in Computer Science vol. 1141 (1996), Springer-Verlag, Berlin, Germany 245-254
38. Schoenauer M., and Michalewicz Z. Sphere operators and their applicability for constrained parameter optimization problems. In: Voigt H.-M., Ebeling W., Rechenberg I., and Schwefel H.-P. (Eds). Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming. Lecture Notes in Computer Science vol. 1447 (1998), Springer-Verlag, Berlin, Germany 214-250
39. Schuhmacher C., Vose M.D., and Whitley L.D. The no free lunch and description length. In: Spector L., Goodman E., Wu A., Langdon W., Voigt H.-M., Gen M., Sen S., Dorigo M., Pezeshk S., Garzon M., and Burke E. (Eds). Genetic and Evolutionary Computation Conference (GECCO 2001) (2001), Morgan Kaufmann 565-570
40. Smith A.E., and Coit D.W. Penalty functions. In: Bäck T., Fogel D., and Michalewicz Z. (Eds). Handbook of Evolutionary Computation (1997), Institute of Physics Publishing C5.2. 6.
41. Wolpert, D.H., Macready, W.G., 1995. No free lunch theorems for search. Working paper sfi-tr-95-02-010, Santa Fe Institute.
42. Wolpert D.H., and Macready W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 1 (1997) 67-82
43. Yuan X., Zhang S., and Pibouleau L. A mixed-integer nonlinear-programming method for process design. RAIRO - Recherche Operationnelle-Operations Research 22 3 (1988) 331-346
44. Yuchi M., and Kim J. Grouping-based evolutionary algorithm: Seeking balance between feasible and infeasible individuals of constrained optimization problems. Proceedings of the 2004 Congress on Evolutionary Computation, Piscataway, NJ, June 19-23 (2004), IEEE Neural Network Society, IEEE Service Center 280-287