Seguir
Korhan Karabulut
Korhan Karabulut
Dirección de correo verificada de yasar.edu.tr - Página principal
Título
Citado por
Citado por
Año
A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method
K Karabulut, MM İnceoğlu
International Conference on Advances in Information Systems, 441-450, 2004
1142004
A variable iterated greedy algorithm for the traveling salesman problem with time windows
K Karabulut, MF Tasgetiren
Information Sciences 279, 383-395, 2014
712014
Long term energy consumption forecasting using genetic programming
K Karabulut, A Alkan, A Yilmaz
Mathematical and Computational Applications 13 (2), 2008
712008
A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops
K Karabulut
Computers & Industrial Engineering 98, 300-307, 2016
662016
Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach
K Karabulut, H Öztop, L Kandiller, MF Tasgetiren
Computers & Operations Research 129, 105192, 2021
352021
An evolution strategy approach to the team orienteering problem with time windows
K Karabulut, MF Tasgetiren
Computers & Industrial Engineering 139, 106109, 2020
282020
An evolution strategy approach for the distributed blocking flowshop scheduling problem
K Karabulut, D Kizilay, MF Tasgetiren, L Gao, L Kandiller
Computers & Industrial Engineering 163, 107832, 2022
272022
A discrete artificial bee colony algorithm for the traveling salesman problem with time windows
K Karabulut, MF Tasgetiren
2012 IEEE Congress on Evolutionary Computation, 1-7, 2012
272012
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
K Karabulut, H Öztop, D Kizilay, MF Tasgetiren, L Kandiller
Computers & Operations Research 142, 105733, 2022
262022
Bi‐objective green vehicle routing problem
K Erdoğdu, K Karabulut
International Transactions in Operational Research 29 (3), 1602-1626, 2022
182022
A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times
Y Ince, K Karabulut, MF Tasgetiren, Q Pan
2016 IEEE congress on Evolutionary computation (CEC), 3401-3408, 2016
162016
Feature selection for malware detection on the android platform based on differences of IDF values
G Peynirci, M Eminağaoğlu, K Karabulut
Journal of Computer Science and Technology 35, 946-962, 2020
112020
A discrete artificial bee colony algorithm for the team orienteering problem with time windows
K Karabulut, MF Tasgetiren
2013 IEEE Symposium on Computational Intelligence in Production and …, 2013
112013
Distance and energy consumption minimization in electric traveling salesman problem with time windows
K Erdoğdu, K Karabulut
2020 7th International Conference on Electrical and Electronics Engineering …, 2020
72020
A populated iterated greedy algorithm with inver-over operator for traveling salesman problem
MF Tasgetiren, O Buyukdagli, D Kızılay, K Karabulut
Swarm, Evolutionary, and Memetic Computing: 4th International Conference …, 2013
62013
MOGRAPH: Mobile graph algorithms library for engineering students
MM Inceoglu, B Ciloglugil, K Karabulut
International Journal of Engineering Education 23 (3), 499, 2007
52007
Effects of parameters of an island model parallel genetic algorithm for the quadratic assignment problem
A Kizil, K Karabulut
2019 8th International Congress on Advanced Applied Informatics (IIAI-AAI …, 2019
42019
Null control in linear antenna arrays with ensemble differential evolution
M Secmen, MF Tasgetiren, K Karabulut
2013 IEEE Symposium on Differential Evolution (SDE), 92-98, 2013
32013
MuKEA-TCP: A mutant kill-based local search augmented evolutionary algorithm approach for test case prioritization
E Ufuktepe, DK Ufuktepe, K Karabulut
2021 IEEE 45th Annual Computers, Software, and Applications Conference …, 2021
22021
Asimetrik Gezgin Satıcı Problemi İçin Bir Evrimsel Strateji Algoritması
K Karabulut
Celal Bayar Üniversitesi Fen Bilimleri Dergisi 12 (3), 561-568, 2016
22016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20