Fehmi Burcin Özsoydan
Orcid: 0000-0002-6368-4425
According to our database1,
Fehmi Burcin Özsoydan
authored at least 25 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Evolution inspired binary flower pollination for the uncapacitated facility location problem.
Neural Comput. Appl., July, 2024
2023
A hybridisation of linear programming and genetic algorithm to solve the capacitated facility location problem.
Int. J. Prod. Res., May, 2023
An improved arithmetic optimization algorithm for training feedforward neural networks under dynamic environments.
Knowl. Based Syst., March, 2023
A reinforcement learning based computational intelligence approach for binary optimization problems: The case of the set-union knapsack problem.
Eng. Appl. Artif. Intell., 2023
2021
A species-based flower pollination algorithm with increased selection pressure in abiotic local pollination and enhanced intensification.
Knowl. Based Syst., 2021
Chaos and intensification enhanced flower pollination algorithm to solve mechanical design and unconstrained function optimization problems.
Expert Syst. Appl., 2021
Quantum particles-enhanced multiple Harris Hawks swarms for dynamic optimization problems.
Expert Syst. Appl., 2021
Q-learning and hyper-heuristic based algorithm recommendation for changing environments.
Eng. Appl. Artif. Intell., 2021
Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant.
Comput. Oper. Res., 2021
2020
Oper. Res., 2020
Evolutionary and adaptive inheritance enhanced Grey Wolf Optimization algorithm for binary domains.
Knowl. Based Syst., 2020
2019
Analysing the effects of various switching probability characteristics in flower pollination algorithm for solving unconstrained function minimization problems.
Neural Comput. Appl., 2019
Future Gener. Comput. Syst., 2019
Expert Syst. Appl., 2019
Artificial search agents with cognitive intelligence for binary optimization problems.
Comput. Ind. Eng., 2019
Appl. Soft Comput., 2019
2018
Minimisation of non-machining times in operating automatic tool changers of machine tools under dynamic operating conditions.
Int. J. Prod. Res., 2018
Dynamic optimization in binary search spaces via weighted superposition attraction algorithm.
Expert Syst. Appl., 2018
2017
Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization.
Inf. Sci., 2017
2016
Erratum to "A GRASP based solution approach to solve cardinality constrained portfolio optimization problems" [Comput. Indus. Eng. 90 (2015) 339-351].
Comput. Ind. Eng., 2016
2015
A GRASP based solution approach to solve cardinality constrained portfolio optimization problems.
Comput. Ind. Eng., 2015
Appl. Soft Comput., 2015
Proceedings of the 2015 IEEE International Conference on Evolving and Adaptive Intelligent Systems, 2015
Proceedings of the 2015 IEEE International Conference on Evolving and Adaptive Intelligent Systems, 2015
2014
An improved firefly algorithm for solving dynamic multidimensional knapsack problems.
Expert Syst. Appl., 2014