default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFehmi Burcin Özsoydan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Fehmi Burcin Ozsoydan
, Ali Erel Kasirga:
Evolution inspired binary flower pollination for the uncapacitated facility location problem. Neural Comput. Appl. 36(20): 12117-12130 (2024)- 2023
- [j22]Fehmi Burcin Ozsoydan, Ilker Gölcük:
A reinforcement learning based computational intelligence approach for binary optimization problems: The case of the set-union knapsack problem. Eng. Appl. Artif. Intell. 118: 105688 (2023) - [j21]Fehmi Burcin Ozsoydan, Ilker Gölcük:
A hybridisation of linear programming and genetic algorithm to solve the capacitated facility location problem. Int. J. Prod. Res. 61(10): 3331-3349 (2023) - [j20]Ilker Gölcük, Fehmi Burcin Ozsoydan, Esra Duygu Durmaz:
An improved arithmetic optimization algorithm for training feedforward neural networks under dynamic environments. Knowl. Based Syst. 263: 110274 (2023) - 2021
- [j19]Fehmi Burcin Ozsoydan, Müjgan Sagir:
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. 125: 105044 (2021) - [j18]Ilker Gölcük, Fehmi Burcin Ozsoydan:
Q-learning and hyper-heuristic based algorithm recommendation for changing environments. Eng. Appl. Artif. Intell. 102: 104284 (2021) - [j17]Ilker Gölcük, Fehmi Burcin Ozsoydan:
Quantum particles-enhanced multiple Harris Hawks swarms for dynamic optimization problems. Expert Syst. Appl. 167: 114202 (2021) - [j16]Fehmi Burcin Ozsoydan, Adil Baykasoglu:
Chaos and intensification enhanced flower pollination algorithm to solve mechanical design and unconstrained function optimization problems. Expert Syst. Appl. 184: 115496 (2021) - [j15]Fehmi Burcin Ozsoydan, Adil Baykasoglu:
A species-based flower pollination algorithm with increased selection pressure in abiotic local pollination and enhanced intensification. Knowl. Based Syst. 225: 107125 (2021) - 2020
- [j14]Ilker Gölcük, Fehmi Burcin Özsoydan:
Evolutionary and adaptive inheritance enhanced Grey Wolf Optimization algorithm for binary domains. Knowl. Based Syst. 194: 105586 (2020) - [j13]Adil Baykasoglu, Fehmi Burcin Özsoydan, Mümin Emre Senol:
Weighted superposition attraction algorithm for binary optimization problems. Oper. Res. 20(4): 2555-2581 (2020)
2010 – 2019
- 2019
- [j12]Fehmi Burcin Özsoydan:
Effects of dominant wolves in grey wolf optimization algorithm. Appl. Soft Comput. 83 (2019) - [j11]Fehmi Burcin Özsoydan:
Artificial search agents with cognitive intelligence for binary optimization problems. Comput. Ind. Eng. 136: 18-30 (2019) - [j10]Fehmi Burcin Özsoydan, Adil Baykasoglu:
Quantum firefly swarms for multimodal dynamic optimization problems. Expert Syst. Appl. 115: 189-199 (2019) - [j9]Fehmi Burcin Özsoydan, Adil Baykasoglu:
A swarm intelligence-based algorithm for the set-union knapsack problem. Future Gener. Comput. Syst. 93: 560-569 (2019) - [j8]Fehmi Burcin Özsoydan, Adil Baykasoglu:
Analysing the effects of various switching probability characteristics in flower pollination algorithm for solving unconstrained function minimization problems. Neural Comput. Appl. 31(11): 7805-7819 (2019) - 2018
- [j7]Adil Baykasoglu, Fehmi Burcin Özsoydan:
Dynamic optimization in binary search spaces via weighted superposition attraction algorithm. Expert Syst. Appl. 96: 157-174 (2018) - [j6]Adil Baykasoglu, Fehmi Burcin Ozsoydan:
Minimisation of non-machining times in operating automatic tool changers of machine tools under dynamic operating conditions. Int. J. Prod. Res. 56(4): 1548-1564 (2018) - 2017
- [j5]Adil Baykasoglu, Fehmi Burcin Özsoydan:
Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization. Inf. Sci. 420: 159-183 (2017) - 2016
- [j4]Adil Baykasoglu, Mualla Gonca Avci, Fehmi Burcin Özsoydan:
Erratum to "A GRASP based solution approach to solve cardinality constrained portfolio optimization problems" [Comput. Indus. Eng. 90 (2015) 339-351]. Comput. Ind. Eng. 96: 249-250 (2016) - 2015
- [j3]Adil Baykasoglu, Fehmi Burcin Özsoydan:
Adaptive firefly algorithm with chaos for mechanical design optimization problems. Appl. Soft Comput. 36: 152-164 (2015) - [j2]Adil Baykasoglu, Mualla Gonca Yunusoglu, Fehmi Burcin Özsoydan:
A GRASP based solution approach to solve cardinality constrained portfolio optimization problems. Comput. Ind. Eng. 90: 339-351 (2015) - [c2]Adil Baykasoglu, Fehmi Burcin Özsoydan:
A constructive search algorithm for combinatorial dynamic optimization problems. EAIS 2015: 1-7 - [c1]Fehmi Burcin Özsoydan, Adil Baykasoglu:
A multi-population firefly algorithm for dynamic optimization problems. EAIS 2015: 1-7 - 2014
- [j1]Adil Baykasoglu, Fehmi Burcin Özsoydan:
An improved firefly algorithm for solving dynamic multidimensional knapsack problems. Expert Syst. Appl. 41(8): 3712-3725 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
