최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기한국시뮬레이션학회논문지 = Journal of the Korea Society for Simulation, v.32 no.1, 2023년, pp.23 - 34
이동훈 , 황근철 (국방과학연구소 해양기술연구원) , 이상일 (국방과학연구소 해양기술연구원) , 윤원영 (부산대학교)
The purpose of this paper is to review global stochastic optimization algorithms(GSOA) in case binary response experimentation is used and to compare the performances of them. GSOAs utilise estimator of probability of success
Akimoto Y., S. A. Morales, and O. Teytaud(2015),?"Analysis of runtime of optimization algorithms for?noisy functions over discrete codomains", Theoretical?Computer Science, vol. 605, pp. 42-50.
Alarie S., et al(2021), "Digabel Two decades of?blackbox optimization applications", EURO Journal?on Computational Optimization 9.
Back T.(1996), "Evolutionary Algorithms in Theory?and Practice: Evolution Strategies, Evolutionary?Programming", Genetic Algorithms. Oxford University?Press, Oxford, UK.
Back T., and U. Hammel(1994), "Evolution strategies?applied to perturbed objective functions," in?Proceedings of IEEE Congress on Evolutionary?Computation, pp. 40-45.
Brooks S. H.(1958), "A Discussion of Random Methods?for Seeking Maxima," Operations Research, 6, 244-251.
Cai T., F. Pan, and J. Chen(2004), "Adaptive particle?swarm optimization algorithm." In Proceedings of?Fifth World Congress on Intelligent Control and?Automation, 2004. WCICA 2004, volume 3, pages"2245-2247
Chandran S. and R. R. Rhinehart.(2002) "Heuristic?random optimizer-version II." In Proceedings of the?American Control Conference, volume 4, pages?2589-2594. IEEE, Piscataway NJ, US
Eberhart R. C. and J. Kennedy(1995), "A new optimizer?using particle swarm theory." In Proceedings of the?Sixth International Symposium on Micro Machine?and Human Science MHS'95, pages 39-43. IEEE?Press
Gao Y. and Y. Duan(2007), "An adaptive particle?swarm optimization algorithm with new random?inertia weight." In Advanced Intelligent Computing?Theories and Applications. With Aspects of?Contemporary Intelligent Computing Techniques,?volume 2, pages 342-350.
Gao Y. and Z. Ren(2007), "Adaptive particle swarm?optimization algorithm with genetic mutation?operation." In Proceedings of the Third International?Conference on Natural Computation (ICNC 2007),?volume 2, pages 211-215.
Glover F.(1986), "Future Paths for Integer Programming?and Links to Artificial Intelligence". Computers?and Operations Research, 13(5), 533-549.
Gurin and A. R. Leonard(1965), "Convergence of the?random search method in the presence of noise",?Automation and Remote Control, 26, 1505-1511.
Kirkpatrick S., C. D. Gelatt, Jr., and M. P. Vecchi?(1983), "Optimization by simulated annealing."?Science, 220(4598), 671-680.
Li J. and R. R. Rhinehart(1998). "Heuristic random?optimization." Computers and Chemical Engineering,?22(3), 427-444.
Matyas J.(1965) "Random optimization." Automation?and Remote Control, 26(2), 244-251.
Metropolis N., et. al.(1953), "Equation of state?calculations by fast computing machines." The?Journal of Chemical Physics, 21(6), 1087-1092.
Nelder J. A. and R. Mead,(1965), "A simplex method?for function minimization", Comput. J., 7, pp. 308-313.
Rastrigin L. A.(1963), "The convergence of the random?search method in the extremal control of manyparameter system". Automation and Remote Control,?24, 1337-1342.
Russel S. and P. Novic(2002), Artificial Intelligence: A?Modern Approach, Prentice Hall, second edition,?December.
Schumer M. A. and K. Steiglitz(1968), "Adaptive step?size random search." IEEE Transactions on Automatic?Control, AC-13(3), 270-276.
Schumer M. A(1967). Optimization by adaptive random?search. PhD thesis, Princeton University, NJ,?Supervisor Kenneth Steiglitz.
Spall J. C.(2000), Introduction to Stochastic Search and?Optimization.
Estimation, Simulation, and Control (2003), Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, first edition.
Venter G. and J. Sobieszczanski-Sobieski(2003), "Particle?swarm optimization." AIAA Journal, 41(8), 1583-1589.
Worakul N., W. Wongpoowarak, and P. Boonme(2002)?"Optimization in development of acetaminophen?syrup formulation." Drug Development and Industrial?Pharmacy, 28(3), 345-351.
Yuret D. and Michael de la Maza(1993), "Dynamic hill?climbing: Overcoming the limitations of optimization?techniques", In Proceedings of the Second Turkish?Symposium on Artificial Intelligence and Neural?Networks, pages 208-212, June 24-25, Bogazici?University, Istanbul, Turky.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.