hrcak mascot   Srce   HID

Izvorni znanstveni članak

A novel iterative optimization algorithm based on dynamic random population

Seyyed Meysam Hosseini ; Department of Communication Engineering, Faculty of Electrical Engineering, Shahid Beheshti University, Evin, 19839, Tehran, Iran
Hamid Reza Mirsalari ; Shoushtar Branch, Islamic Azad University, Shoushtar, Iran
Hossein Pourhoudhiary ; Khozestan Telecom Corporation, Iran

Puni tekst: engleski, pdf (554 KB) str. 27-33 preuzimanja: 454* citiraj
APA 6th Edition
Hosseini, S.M., Mirsalari, H.R. i Pourhoudhiary, H. (2014). A novel iterative optimization algorithm based on dynamic random population. Tehnički vjesnik, 21 (1), 27-33. Preuzeto s https://hrcak.srce.hr/116571
MLA 8th Edition
Hosseini, Seyyed Meysam, et al. "A novel iterative optimization algorithm based on dynamic random population." Tehnički vjesnik, vol. 21, br. 1, 2014, str. 27-33. https://hrcak.srce.hr/116571. Citirano 03.03.2021.
Chicago 17th Edition
Hosseini, Seyyed Meysam, Hamid Reza Mirsalari i Hossein Pourhoudhiary. "A novel iterative optimization algorithm based on dynamic random population." Tehnički vjesnik 21, br. 1 (2014): 27-33. https://hrcak.srce.hr/116571
Harvard
Hosseini, S.M., Mirsalari, H.R., i Pourhoudhiary, H. (2014). 'A novel iterative optimization algorithm based on dynamic random population', Tehnički vjesnik, 21(1), str. 27-33. Preuzeto s: https://hrcak.srce.hr/116571 (Datum pristupa: 03.03.2021.)
Vancouver
Hosseini SM, Mirsalari HR, Pourhoudhiary H. A novel iterative optimization algorithm based on dynamic random population. Tehnički vjesnik [Internet]. 2014 [pristupljeno 03.03.2021.];21(1):27-33. Dostupno na: https://hrcak.srce.hr/116571
IEEE
S.M. Hosseini, H.R. Mirsalari i H. Pourhoudhiary, "A novel iterative optimization algorithm based on dynamic random population", Tehnički vjesnik, vol.21, br. 1, str. 27-33, 2014. [Online]. Dostupno na: https://hrcak.srce.hr/116571. [Citirano: 03.03.2021.]
Puni tekst: hrvatski, pdf (554 KB) str. 27-33 preuzimanja: 239* citiraj
APA 6th Edition
Hosseini, S.M., Mirsalari, H.R. i Pourhoudhiary, H. (2014). Novi iterativni algoritam optimalizacije zasnovan na dinamičnoj slučajnoj populaciji. Tehnički vjesnik, 21 (1), 27-33. Preuzeto s https://hrcak.srce.hr/116571
MLA 8th Edition
Hosseini, Seyyed Meysam, et al. "Novi iterativni algoritam optimalizacije zasnovan na dinamičnoj slučajnoj populaciji." Tehnički vjesnik, vol. 21, br. 1, 2014, str. 27-33. https://hrcak.srce.hr/116571. Citirano 03.03.2021.
Chicago 17th Edition
Hosseini, Seyyed Meysam, Hamid Reza Mirsalari i Hossein Pourhoudhiary. "Novi iterativni algoritam optimalizacije zasnovan na dinamičnoj slučajnoj populaciji." Tehnički vjesnik 21, br. 1 (2014): 27-33. https://hrcak.srce.hr/116571
Harvard
Hosseini, S.M., Mirsalari, H.R., i Pourhoudhiary, H. (2014). 'Novi iterativni algoritam optimalizacije zasnovan na dinamičnoj slučajnoj populaciji', Tehnički vjesnik, 21(1), str. 27-33. Preuzeto s: https://hrcak.srce.hr/116571 (Datum pristupa: 03.03.2021.)
Vancouver
Hosseini SM, Mirsalari HR, Pourhoudhiary H. Novi iterativni algoritam optimalizacije zasnovan na dinamičnoj slučajnoj populaciji. Tehnički vjesnik [Internet]. 2014 [pristupljeno 03.03.2021.];21(1):27-33. Dostupno na: https://hrcak.srce.hr/116571
IEEE
S.M. Hosseini, H.R. Mirsalari i H. Pourhoudhiary, "Novi iterativni algoritam optimalizacije zasnovan na dinamičnoj slučajnoj populaciji", Tehnički vjesnik, vol.21, br. 1, str. 27-33, 2014. [Online]. Dostupno na: https://hrcak.srce.hr/116571. [Citirano: 03.03.2021.]

Sažetak
Various heuristic optimization methods have been developed in artificial intelligence. These methods are mostly inspired by natural evolution or some applicable innovations, which seek good (near-optimal) solutions at a reasonable computational cost for search problems. A new iterative optimization algorithm is proposed in this paper. The algorithm is based on searching the most valuable part of the solution space, which is normally concentrated about a targeted bias vector (in the form of a dynamic random population). This algorithm greedily searches the solution space for global extremum. The comparison results between the proposed algorithm and some of the well-known heuristic search methods confirm the superiority of our proposed method in solving various non-linear optimization problems from the viewpoint of simplicity and accuracy.

Ključne riječi
dynamic random population; heuristic search algorithm; optimization

Hrčak ID: 116571

URI
https://hrcak.srce.hr/116571

[hrvatski]

Posjeta: 1.060 *