Karakaya, Kasım Murat

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14411/8124
Name Variants
Karakaya, Murat
Karakaya, Kasım Murat
K., Kasim Murat
K.,Kasım Murat
Karakaya,K.M.
Kasim Murat, Karakaya
K., Karakaya
K.,Kasim Murat
Karakaya, Kasim Murat
Kasım Murat, Karakaya
K.M.Karakaya
K.,Karakaya
Karakaya,M.
Karakaya,M.
Job Title
Profesör Doktor
Email Address
murat.karakaya@atilim.edu.tr
Main Affiliation
Computer Engineering
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
1
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
0
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
1
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
0
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
4
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
0
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
0
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
0
Research Products
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

44

Articles

20

Views / Downloads

148/417

Supervised MSc Theses

4

Supervised PhD Theses

0

WoS Citation Count

138

Scopus Citation Count

200

Patents

0

Projects

0

WoS Citations per Publication

3.14

Scopus Citations per Publication

4.55

Open Access Source

4

Supervised Theses

4

JournalCount
UBMK 2018 - 3rd International Conference on Computer Science and Engineering -- 3rd International Conference on Computer Science and Engineering, UBMK 2018 -- 20 September 2018 through 23 September 2018 -- Sarajevo -- 1435604
2017 IEEE 1st Ukraine Conference on Electrical and Computer Engineering, UKRCON 2017 - Proceedings -- 1st IEEE Ukraine Conference on Electrical and Computer Engineering, UKRCON 2017 -- 29 May 2017 through 2 June 2017 -- Kyiv -- 1317632
Proceedings - 6th International Conference on Computer Science and Engineering, UBMK 2021 -- 6th International Conference on Computer Science and Engineering, UBMK 2021 -- 15 September 2021 through 17 September 2021 -- Ankara -- 1768262
3rd International Conference on Computer Science and Engineering (UBMK) -- SEP 20-23, 2018 -- Sarajevo, BOSNIA & HERCEG2
1st International Informatics and Software Engineering Conference: Innovative Technologies for Digital Transformation, IISEC 2019 - Proceedings -- 1st International Informatics and Software Engineering Conference, IISEC 2019 -- 6 November 2019 through 7 November 2019 -- Ankara -- 1571112
Current Page: 1 / 5

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2015 - 20162
Reset filters

Settings

Author: Savuran, Halil

Scholarly Output Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Master Thesis
    Havada Kalış Süresi Kısıtlı Seyir Halindeki Gemiye Konuşlu İnsansız Hava Aracının Hedef En Çoklaması
    (2015) Savuran, Halil; Karakaya, Kasım Murat
    Bu tez seyir halindeki bir gemi üzerine konuşlu, menzil kısıtlı bir insansız hava aracının (İHA) hedef en çoklaması problemi için bir çözüm yaklaşımı önermektedir. Bu problem, Araç Rotalama Probleminin (ARP) menzil kapasitesi ve depo mobilitesi kısıtlarıyla genişletilmesiyle modellenmekte ve bu özgün genişletme çalışma boyunca Kapasite kısıtlı Mobil Depo ARP (K-MoDARP) olarak tanımlanmaktadır. Bu problemin doğasının dikte ettiği özgün çözüm gereksinimi probleme özel kısıtlar için uyarlanmış bir genetik algoritma (GA-KMoD) ile karşılanmaktadır. Tezde, çalışmanın amacı, problem tanımı ve önerilen çözümün geliştirme ve uygulaması anlatılmıştır. Ayrıca, önerilen GA-KMoD'un performansı farklı problem kıstasları için yoğun benzetim testleri vasıtasıyla değerlendirilmiştir. GA-KMoD'un ürettiği rotaların kalitesi alternatif yöntemlerle üretilen sonuçlarla karşılaştırılmıştır. Deneysel sonuçlar, önerilen çözüm yönteminin alternatif yöntemlere göre olan üstünlüğünü net bir şekilde ortaya koymaktadır.
  • Thumbnail Image
    Article
    Citation - WoS: 76
    Citation - Scopus: 91
    Efficient Route Planning for an Unmanned Air Vehicle Deployed on a Moving Carrier
    (Springer, 2016) Savuran, Halil; Karakaya, Murat
    Vehicle routing problem (VRP) is a constrained extension of the well-known traveling salesman problem (TSP). Emerging from the current conceptual trends in operations field, a new constraint to be included to the existing VRP parameters is the depot mobility. A practical example of such a problem is planning a route for an Unmanned air vehicle (UAV) deployed on a mobile platform to visit fixed targets. Furthermore, the range constraint of the UAV becomes another constraint within this sample case as well. In this paper, we define new VRP variants by introducing depot mobility (Mobile Depot VRP: MoDVRP) and extending it with capacity constraint (Capacitated MoDVRP: C-MoDVRP). As a sample use case, we study route planning for a UAV deployed on a moving carrier. To deal with the C-MoDVRP, we propose a Genetic Algorithm that is adapted to satisfy the constraints of depot mobility and range, while maximizing the number of targets visited by the UAV. To examine the success of our approach, we compare the individual performances of our proposed genetic operators with conventional ones and the performance of our overall solution with the Nearest Neighbor and Hill Climbing heuristics, on some well-known TSP benchmark problems, and receive successful results.