q - Rosario Toscano - Free

More documents

Recommendations

Info

REFERENCES Angeline, P. J. (1998). Using selection improve particle swarm optimization. In Proceedings of the IEEE International Conference on Evolutionary Computation (pp. 84-89). Piscataway, New Jersey, USA: IEEE Press. Ben-Ameur, W. (2004). Computing the Initial Temperature of Simulated Annealing. Computational Optimization and Applications, 29(3), 369-385. Bilbro, G. L., & Snyder, W.E. (1991). Optimization of Functions with Many Minima. IEEE Transactions on Systems, Man, and Cybernetics, 24(4), 840-849 Blum, C., & Li, X. (2008). Swarm Intelligence in Optimization. In C. Blum & D. Merkle (Eds.), Swarm Intelligence Introduction and Applications (pp. 43-85). Springer Berlin Heidelberg. Bohachevsky, I. O., Johnson, M. E., & Stein M. L. (1986). Generalized simulated annealing for function optimization. Technometrics, 28(3), 209-217. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. New York: Cambridge University Press. Boyd, R., & Richardson, P. (1985). Culture and the evolutionary process. Chicago: University of Chicago Press. Brook, S. P., & Morgan, B. J. T. (1995). Optimization using simulated annealing. The statistician, 44(2), 241-257. Cerny, V. (1985). A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 43(1), 41-51. Chelouah, R., & Siarry, P. (1999). Enhanced Continuous Tabu Search: An Algorithm for the Global Optimization of Multiminima Function. In S. Voss, S. Martello, I.H. Osman & C. Roucairol (Ed.), Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization (pp. 49-61). Kluwer Academic Publishers. Chelouah, R., & Siarry, P. (2000). A continuous genetic algorithm designed for the global optimization of multimodal functions. Journal of Heuristics, 6(2), 191-213. year=2000} Chipperfield, A., Fleming, P., Pohlheim, H., & Fonseca, C. (1995). Genetic Algorithm TOOLBOX For Use with MATLAB. Clerc M., & Kennedy, J. (2002). The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary computation, 6(1), 58-73. Coello, C.A.C. (2000). Use of a self-adaptive penalty approach for engineering optimization problems. Computers in Industry, 41(2), 113-127.
Coello, C.A.C. (2002). 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), 1245-1287. Coello, C.A.C. & Montes, E.M. (2002). Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Advanced Engineering Informatics, 16(3), 193- 203. Corana, A., Marchesi, M., Martini, C., & Ridella, S. (1987). Minimising Multimodal Functions of Continuous Variables with the Simulated Annealing Algorithm. ACM Transactions on Mathematical Software, 13(3), 262-280. Deb, K. (1991). Optimal design of a welded beam via genetic algorithms. AIAA Journal, 29(11), 2013-2015. Devicharan, D., (2003). pso.m. Available at http://web.syr.edu/~ddevicha/pso.m. Dréo, J., Pétrowski, A., Siarry, P., & Taillard, E. (2006). Metaheuristic for hard optimization. Berlin: Springer-Verlag. Eiben, A.E., & Schoener, M. (2002). Evolutionary computing. Information processing letter, 82(1), 1-6. Fogel, D.B. (2006). Evolutionary computation: towards a new philosophy of machine intelligence. Wiley-IEEE Press. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: <strong>Free</strong>man, CA. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer Academic Publishers, Boston, MA. Hajek, B. (1988). Cooling schedules for optimal annealing. Mathematics of Operation Research, 13(2), 311-329. He, Q., & Wang, L. (2007). An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Engineering Applications of Artificial Intelligence, 20(1), 89-99. Holland, J. H. (1962). Outline for logical theory of adaptive systems. Journal of the ACM, 9(3), 297-394. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press. Ingber, L. (1994). Simulated annealing: practice versus theory. Math. Comput. Modelling, 18(11), 29-57. Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks (pp. 1942-1948). Piscataway, NJ, USA: IEEE Press.
Page 1 and 2: Stochastic Stochastic Methods Metho
Page 3 and 4: The problem is then how to tune the
Page 5 and 6: where k T > 0 is a normalizing cons
Page 7 and 8: Number of repetitions of the Metrop
Page 9 and 10: where q1 and q2 are coded with 12 b
Page 11 and 12: i i i i Inversely, the decoding of
Page 13 and 14: Each individual of the population o
Page 15 and 16: 3. Particle Swarm Optimization (PSO
Page 17 and 18: The inertia weight. The inertia coe
Page 19 and 20: 3.3. Advantages and disadvantages o
Page 21 and 22: Our ignorance about the optimum can
Page 23 and 24: Note that all the matrices used in
Page 25 and 26: 5.1. Comparison of HKA with SA, GA
Page 27 and 28: 5.2. Comparison of HKA with other m
Page 29 and 30: and: c ( q) = 1 0. 10471, 7 G = 1.
Page 31 and 32: and K(s) is, for instance, the tran
Page 33 and 34: where [ ] T q = q1 q2 q3 q is the v
Page 35 and 36: where q is the decision vector whic
Page 37 and 38: We want the residual r insensitive
Page 39 and 40: For comparison, Figure 14 shows the
Page 41: Constrained test problem (F8) (3 va
Page 45: Siarry, P., Berthiau, G., Durbin, F

q - Rosario Toscano - Free

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?