Kazım Erdoğdu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kazım Erdoğdu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Korhan Günel
Department of Mathematics, Aydın Adnan Menderes University, Efeler, Turkey
2 shared publications - Korhan Karabulut
Yaşar Üniversitesi
2 shared publications Refet Polat
Department of Mathematics Yasar University Izmir Turkey
2 shared publications- Yasin Özarslan
Yasar University
2 shared publications Cihanser Çalışkan
Graduate School, Yaar University,Department of Computer Engineering,zmir,Turkey
1 shared publicationKorhan Karabulut
Yasar University,Department of Software Engineering,Izmir,Turkey
1 shared publication
Latest Publications
- Open Access
- 27 September 2024
- Published by Deu Muhendislik Fakultesi Fen ve Muhendislik in Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi
- Vol. 26 (78) , 519-527
Ant Colony Optimization and Beam-Ant Colony Optimization on Traveling Salesman Problem with Traffic Congestion
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.
- 27 September 2024
- Published by Deu Muhendislik Fakultesi Fen ve Muhendislik in Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi
- Vol. 26 (78) , 519-527
Open AccessAnt Colony Optimization and Beam-Ant Colony Optimization on Traveling Salesman Problem with Traffic Congestion
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.
- Open Access
- 16 May 2023
- Published by IEOM Society International
- Vol. 12 (1)
Comparing ALNS and NSGA-II on Bi-Objective Travelling Thief Problem
Real-life optimization problems consist of various conflicting optimization problems. Due to the interdependency of these sub-optimization problems, their solution is more difficult than single optimization problems. For this reason, most of the real-life optimization problems are considered multi-objective optimization problems by nature, and different methods and approaches are applied. In this paper, a recent multi-objective optimization problem, the biobjective travelling thief problem (BiTTP) was studied. Two state-of-the-art algorithms, ALNS and NSGA-II, were hybridized with certain local search methods and applied on six problem instances of Polyakovskiy's problem benchmark set. As a result, the performances of these two algorithms were evaluated and a new set of Pareto front sets were generated for the related benchmark instances.
- 16 May 2023
- Published by IEOM Society International
- Vol. 12 (1)
Open AccessComparing ALNS and NSGA-II on Bi-Objective Travelling Thief Problem
Real-life optimization problems consist of various conflicting optimization problems. Due to the interdependency of these sub-optimization problems, their solution is more difficult than single optimization problems. For this reason, most of the real-life optimization problems are considered multi-objective optimization problems by nature, and different methods and approaches are applied. In this paper, a recent multi-objective optimization problem, the biobjective travelling thief problem (BiTTP) was studied. Two state-of-the-art algorithms, ALNS and NSGA-II, were hybridized with certain local search methods and applied on six problem instances of Polyakovskiy's problem benchmark set. As a result, the performances of these two algorithms were evaluated and a new set of Pareto front sets were generated for the related benchmark instances.
- 8 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 207-213
Self-Adaptive Genetic Algorithm For Permutation Flow Shop Scheduling Problems
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%.
- 8 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 207-213
Self-Adaptive Genetic Algorithm For Permutation Flow Shop Scheduling Problems
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
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 29 (5) , 2545-2560
A new model for minimizing the electric vehicle battery capacity in electric travelling salesman problem with time windows
- 23 September 2021
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 29 (5) , 2545-2560
A new model for minimizing the electric vehicle battery capacity in electric travelling salesman problem with time windows
- 15 August 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (3) , 1602-1626
Bi‐objective green vehicle routing problem
The green vehicle routing problem (GVRP) is a variant of the vehicle routing problem (VRP), which increasingly attracts many researchers in recent years due to the growing global environmental issues. As the transportation of the products grows, the number of vehicles in fleets and the pollutants caused by these vehicles also grow, which in turn negatively affects human health. In this paper, a biobjective GVRP was studied. The two objectives are minimizing the total distance and minimizing the total fuel consumption of all vehicle routes. As a solution method, an adaptive large neighborhood search was hybridized with two new local search heuristics. The proposed method was applied to two well‐known benchmark problem sets for VRPs and new approximate Pareto fronts were obtained for these benchmark sets.
- 15 August 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (3) , 1602-1626
Bi‐objective green vehicle routing problem
The green vehicle routing problem (GVRP) is a variant of the vehicle routing problem (VRP), which increasingly attracts many researchers in recent years due to the growing global environmental issues. As the transportation of the products grows, the number of vehicles in fleets and the pollutants caused by these vehicles also grow, which in turn negatively affects human health. In this paper, a biobjective GVRP was studied. The two objectives are minimizing the total distance and minimizing the total fuel consumption of all vehicle routes. As a solution method, an adaptive large neighborhood search was hybridized with two new local search heuristics. The proposed method was applied to two well‐known benchmark problem sets for VRPs and new approximate Pareto fronts were obtained for these benchmark sets.
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-164
Distance and Energy Consumption Minimization in Electric Traveling Salesman Problem with Time Windows
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.
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-164
Distance and Energy Consumption Minimization in Electric Traveling Salesman Problem with Time Windows
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.
- 16 April 2018
- Published by Wiley in Expert Systems
- Vol. 36 (3)
An empirical study on evolutionary feature selection in intelligent tutors for learning concept detection
Concept map mining (CMM) has emerged as a new research area with recent developments in computational intelligence in educational technology. CMM includes the following steps: extracting the learning concepts from educational content, specifying relations among them, and generating a concept map as a result. The purpose of this study was to develop a mechanism using data mining technique to determine the features that characterize a learning concept extracted automatically from a single educational text. The 3 major features that distinguish the real learning concepts from other sequences of strings are detected by using a hybrid system of a feed‐forward neural network and some evolutionary algorithms. Ant colony optimization and genetic algorithm and particle swarm optimization are used as a binary feature selection method. In addition, the aforementioned methods are hybridized to get better accuracy and precision. The performance comparisons with two different state‐of‐the‐art algorithms have been made from the viewpoint of a typical classification problem.
- 16 April 2018
- Published by Wiley in Expert Systems
- Vol. 36 (3)
An empirical study on evolutionary feature selection in intelligent tutors for learning concept detection
Concept map mining (CMM) has emerged as a new research area with recent developments in computational intelligence in educational technology. CMM includes the following steps: extracting the learning concepts from educational content, specifying relations among them, and generating a concept map as a result. The purpose of this study was to develop a mechanism using data mining technique to determine the features that characterize a learning concept extracted automatically from a single educational text. The 3 major features that distinguish the real learning concepts from other sequences of strings are detected by using a hybrid system of a feed‐forward neural network and some evolutionary algorithms. Ant colony optimization and genetic algorithm and particle swarm optimization are used as a binary feature selection method. In addition, the aforementioned methods are hybridized to get better accuracy and precision. The performance comparisons with two different state‐of‐the‐art algorithms have been made from the viewpoint of a typical classification problem.
- 29 March 2017
- Published by Springer Nature
- p. 952-962
A Feature Selection Application Using Particle Swarm Optimization for Learning Concept Detection
- 29 March 2017
- Published by Springer Nature
- p. 952-962
A Feature Selection Application Using Particle Swarm Optimization for Learning Concept Detection