Kazım Erdoğdu

Kazım Erdoğdu

Auto-generated profile, based on publicly available information

Kazım Erdoğdu

Yasar University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 August 2021 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
KEKazım Erdoğdu
Kazım Erdoğdu
KKKorhan Karabulut
Korhan Karabulut

16 April 2018 in Expert Systems
Verified
Journal Article
Closed access
PDF file
KGKorhan Gunel
Korhan Gunel
KEKazim Erdogdu
Kazim Erdogdu
RPRefet Polat
Refet Polat
YASİN ÖZARSLANYASİN ÖZARSLAN
YASİN ÖZARSLAN

1 April 2020
Verified
Conference Paper
Closed access
KEKazim Erdogdu
Kazim Erdogdu
KKKorhan Karabulut
Korhan Karabulut
As global pollution caused by transportation increases, the need for cleaner energy becomes more significant each day. For this reason, one of the recent global technological and scientific tendencies is to develop and include electric vehicles in transportation. In this paper, an Electric Traveling Salesman Problem with Time Windows was studied by considering two objectives: minimizing the total distance and minimizing the total energy consumption. As a solution method, the well-known Simulated Annealing algorithm was hybridized with a constructive heuristic and a local search heuristic. This algorithm was executed on a set of well-known benchmark instances from the literature separately for the two objectives and the results were presented.

27 September 2024 in Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi
Verified
Journal Article
Open access
PDF file
MUMustafa Orçun Uslu
Mustafa Orçun Uslu
KEKazım Erdoğdu
Kazım Erdoğdu
The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem that has various implications in a variety of industries. Even the purest formulation of TSP has applications on from logistics routes to microchip manufacturing, unexpectedly, it can be used on DNA sequencing with slight modification as a sub-problem. In this paper, two versions of TSP were studied, a classical TSP and the TSP containing traffic congestion data. Two state-of-the-art solution methods were used, Ant Colony Optimization (ACO) and Beam-ACO. These algorithms were hybridized with 2-Opt local search and their performances compared on the same benchmark instances. The experimental results show the efficiency of Beam-ACO compared to ACO.

8 May 2023
Verified
Conference Paper
Closed access
CÇCihanser Çalışkan
Cihanser Çalışkan
KEKazım Erdoğdu
Kazım Erdoğdu
The permutation flow shop scheduling problem (PFSSP) is a well-known, extensively researched, and heavily applied non-polynomial (NP)-Hard combinatorial optimization problem. It is encountered in various real-life manufacturing problems such as automotive manufacturing, integrated circuit fabrication, and agricultural food industries. It continues to gain popularity in operational research areas as new manufacturing areas are developed. Therefore, finding a solution to these NP-Hard problems attract the attention of scientists. In this paper, we studied a PFSSP and proposed a new heuristic for its solution: The Self-Adaptive Genetic Algorithm (GA). This proposed algorithm uses a conventional GA with cycle crossover and random swap mutation. Its novelty, on the other hand, lies in incorporating an adaptive mechanism in the GA. The proposed algorithm uses three different local searches (i.e. 2-Opt, Greedy Insert, and Greedy Swap local searches) based on their successes. In other words, the proposed algorithm evaluates the performance of each local search at each generational iteration and makes a decision on which one to use based on their previous performances. The more successful local searches increase their probability of selection and vice versa. This way, Self-Adaptive GA, hence the name, adapts and directs its exploitation by the information it obtains in its previous generations. The proposed algorithm was applied to a subset of well-known Taillard problem instances. The experimental studies show its successful performance. Self-Adaptive GA obtained the optimum results for 7 out of 18 benchmark instances. In the rest of the 11 instances, the differences between the results of the proposed method and the optimum values are less than 2%.

23 September 2021 in Turkish Journal of Electrical Engineering and Computer Sciences
Verified
Journal Article
Closed access
KEKazım ERDOĞDU
Kazım ERDOĞDU
KKKorhan Karabulut
Korhan Karabulut