LARES: An artificial chemical process approach for optimization

Evolutionary Computation

Volumn 12, Issue 4, 2004, Pages 435-459

  Irizarry, Roberto ^a  

^a DUPONT COMPANY   (United States)

Author keywords

Global optimization; Stochastic Algorithms

Indexed keywords

ARTIFICAL CHEMICAL PROCESS (ACP); PROBABILITY DENSITY FUNCTION (PDF); STOCHASTIC ALGORITHMS;

CHEMICAL REACTIONS; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; PERTURBATION TECHNIQUES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY; SIMULATED ANNEALING;

GLOBAL OPTIMIZATION;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHEMICAL MODEL; COMPUTER SIMULATION; STATISTICS; THEORETICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; MODELS, CHEMICAL; MODELS, GENETIC; MODELS, THEORETICAL; STOCHASTIC PROCESSES;

EID: 10044251655     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/1063656043138897     Document Type: Article

References (18)

1. Carroll, D. L. (1996). Chemical laser modeling with genetic algorithms. AIAA Journal, 34(6):1216-1223.
2. De Jong, K. A., Potter, M. A., and Spears, W. M. (1997). Using problem generators to explore the effects of epistasis. In Proceedings of the Int'l Conference on Genetic Algorithms.
3. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading. Addison-Wesley, MA.
4. Gottlieb, J., Matchiori, E., and Rossi, C. (2002). Evolutionary algorithms for the satisfiability problem. Evolutionary Computation, 10(l):25-49.
5. Hansen, N., Muller, S. D., and Koumoutsakos, P. (2003). Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (cmaes). Evolutionary Computation, 11(1):1-18.
6. Ingber, L. (1993). Simulated annealing: Practice versus theory. J. Mathl. Comput. Modelling, 18(11):29-57.
7. Ingber, L. and Rosen, B. (1992). Genetic algorithms and very fast simulated reannealing: A comparison. J. of Mathematical and Computer Modeling, 16(11):87-100.
8. Kirkpatrick, S., Gelatt Jr, C. D., and Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598):671-680.
9. Mathur, M., Karale, S. B., Jayaraman, V. K., and D., K. B. (2000). Ant colony approach for continuous optimization. Ind. Eng. Chem. Res., 39:3814-3822.
10. Mitchell, D., B., S., and H., L. (1992). Hard and easy distributions of sat problems. In Proceedings of the Tenth National Conference in Artificial Intelligence, pages 459-465. AAAI Press/The MIT Press.
11. Mühlenbein, H. and Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm, i. continuous parameter optimization. Evolutionary Computation, 1(1):25-49.
12. Schwefel, H. P. (1995). Evolution and Optimum Seeking. John Wiley.
13. Selman, B. and Kautz, H. (1993). An empirical study of greedy local search for satisfiability testing. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), Washington, D.C.
14. Spears, W. M. (1998). The Role of Mutation and Recombination in Evolutionary Algorithms. PhD thesis, George Mason University, Fairfax, VA.
15. Storn, R. and Price, K. (1997). Differential evolution- a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11:341-359.
16. Voigt, H. M. (1995). Soft Genetic Operators in Evolutionary Computation, Evolution and Biology Computation, Lecture Notes in Computer Science 899, pages 123-141. Springer, Berlin.
17. Yan, L. and Ma, D. (2001). Global optimization of non-convex nonlinear programs using line-up competition algorithm. Computers and Chemical Engineering, 25:1601-1610.
18. Yip, P. and Pao, Y. H. (1995). Combinatorial optimization with the use of guided evolutionary simulated annealing. IEEE Transactions on Neural Networks, 6(2):290-295.