Page 134 - IJOCTA-15-2

Parallel late acceptance hill-climbing for binary-encoded optimization problems

31. Aslan M, Pavone M. MBVS: a modified binary 41. Beasley JE. OR-Library: distributing test prob-
vortex search algorithm for solving uncapacitated lems by electronic mail. J Oper Res Soc.
facility location problem. Neural Comput Appl. 1990;41(11):1069-1072.
2024;36(5):2573-2595. https://doi.org/10.1057/jors.1990.166
https://doi.org/10.1007/s00521-023-09190-9 42. Wiegele A. Biq Mac Library-A collection of Max-
32. Gao L, Zeng Y, Dong A. An ant colony algo- Cut and quadratic 0-1 programming instances of
rithm for solving Max-cut problem. Prog Nat Sci. medium size. Preprint. 2007;51:112-127.
2008;18(9):1173-1178.
https://doi.org/10.1016/j.pnsc.2008.04.006
33. Festa P, Pardalos PM, Resende MG, Ribeiro
CC. Randomized heuristics for the MAX-CUT Emrullah Sonu¸c is currently working as an Asso-
problem. Optim Methods Softw. 2002;17(6):1033- ciate Professor at Department of Computer Engineer-
1058. ing, Karabuk University in T¨urkiye. He is also a re-
https://doi.org/10.1080/1055678021000090033 search associate at the Computational Optimization
34. Kim YH, Yoon Y, Geem ZW. A comparison and Learning (COL) Lab in the School of Computer
study of harmony search and genetic algorithm Science at the University of Nottingham, UK. He re-
for the max-cut problem. Swarm Evol Comput. ceived M.Sc. and Ph.D. degrees from the Department
2019;44:130-135. of Computer Engineering, Karabuk University in 2012
https://doi.org/10.1016/j.swevo.2018.01.004 and 2017, respectively. His research interests and ac-
35. Mart´ı, R., Duarte A, Laguna M. Advanced scat- tivities lie at the interface of computer science, artifi-
ter search for the max-cut problem. INFORMS cial intelligence, and operations research, focusing on
J Comput. 2009;21(1):26-38. metaheuristics, parallel evolutionary algorithms and
https://doi.org/10.1287/ijoc.1080.0275 ensemble learning models.
36. Wu Q, Wang Y, L¨u, Z.. A tabu search based hy- https://orcid.org/0000-0001-7425-6963
brid evolutionary algorithm for the max-cut prob-
¨
lem. Appl Soft Comput. 2015;34:827-837. Ender Ozcan is a Professor of Computer Science
https://doi.org/10.1016/j.asoc.2015.04.033 and Operational Research with the Computational Op-
37. Kochenberger GA, Hao JK, L¨u, Z., Wang H, timization and Learning (COL) Lab in the School of
Glover F. Solving large scale max cut problems Computer Science at the University of Nottingham,
via tabu search. J Heuristics. 2013;19:565-571. UK. He received his PhD from the Department of Com-
https://doi.org/10.1007/s10732-011-9189-8 puter and Information Science at Syracuse Univer-
38. Akan T, Agahian S, Dehkharghani R. Binbro: Bi- sity, NY, USA in 1998. He worked as a lecturer in
nary battle royale optimizer algorithm. Expert the Department of Computer Engineering at Yeditepe
Syst Appl. 2022;195:116599. University, Istanbul, Turkey from 1998-2007. He es-
https://doi.org/10.1016/j.eswa.2022.116599 tablished and led the ARTIficial Intelligence research
39. Zhu F, Shuai Z, Lu Y et al. oBABC: A one- group from 2002. He served as the Deputy Head of
¨
dimensional binary artificial bee colony algorithm the Department from 2004-2007. Prof Ozcan was ap-
for binary optimization. Swarm Evol Comput. pointed as a senior research fellow in 2008 to the
2024;87:101567. EPSRC funded LANCS initiative, which was one of
https://doi.org/10.1016/j.swevo.2024.101567 the largest Science and Innovation Rewards given by
ˇ
40. Sevi´c, I., Jovanovic R, Uroˇsevi´c, D., Davidovi´c, EPSRC (Engineering and Physical Sciences Research
T. Fixed Set Search Applied to the Max-Cut Council, UK). He has been an academic at the Univer-
Problem. In: 2024 IEEE 8th Energy Conference sity of Nottingham since then. He is currently Director
(ENERGYCON). 2024; 1-6. IEEE. of the Faculty of Science Doctoral Training Centre in
https://doi.org/10.1109/ENERGYCON58629.2024. Artificial Intelligence.
10488777 https://orcid.org/0000-0003-0276-1391

An International Journal of Optimization and Control: Theories & Applications
(https://accscience.com/journal/ijocta)

This work is licensed under a Creative Commons Attribution 4.0 International License. The authors retain ownership of
the copyright for their article, but they allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles
in IJOCTA, so long as the original authors and source are credited. To see the complete license contents, please visit
http://creativecommons.org/licenses/by/4.0/.

329