Alkın Yurtkuran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alkın Yurtkuran has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Erdal Emel
Department of Industrial Engineering, Uludag University, Görükle Campus, 16059 Bursa, Turkey
8 shared publications Erdal Emel
2 shared publicationsB. Bicer
Robert Bosch AS BTSO Organized Ind Zone, Eflatun Cad 9, Bursa, Turkey
1 shared publication- Betul Yagmahan
Department of Industrial Engineering, Faculty of Engineering and Architecture, Uludag University, Gorukle Campus, Bursa 16059, Turkey
1 shared publication - Deniz Merih Yurtkuran
Department of Physical Therapy and Rehabilitation, Medical Faculty of Uludag University, Bursa, Turkey
1 shared publication - Duygu Özdemir
Bursa Uludag Universitesi
1 shared publication
Latest Publications
- 1 January 2020
- Published by Academic World Research in Journal of Applied Fluid Mechanics
- Vol. 13 (1) , 119-132
Parameter and Design Analysis for Gasoline Direct Injection Injector using CFD and Design of Experiments
- 1 January 2020
- Published by Academic World Research in Journal of Applied Fluid Mechanics
- Vol. 13 (1) , 119-132
Parameter and Design Analysis for Gasoline Direct Injection Injector using CFD and Design of Experiments
- Open Access
- 23 May 2019
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2019, 1-20
An Improved Electromagnetic Field Optimization for the Global Optimization Problems
Electromagnetic field optimization (EFO) is a relatively new physics-inspired population-based metaheuristic algorithm, which simulates the behavior of electromagnets with different polarities and takes advantage of a nature-inspired ratio, known as the golden ratio. In EFO, the population consists of electromagnetic particles made of electromagnets corresponding to variables of an optimization problem and is divided into three fields: positive, negative, and neutral. In each iteration, a new electromagnetic particle is generated based on the attraction-repulsion forces among these electromagnetic fields, where the repulsion force helps particle to avoid the local optimal point, and the attraction force leads to find global optimal. This paper introduces an improved version of the EFO called improved electromagnetic field optimization (iEFO). Distinct from the EFO, the iEFO has two novel modifications: new solution generation function for the electromagnets and adaptive control of algorithmic parameters. In addition to these major improvements, the boundary control and randomization procedures for the newly generated electromagnets are modified. In the computational studies, the performance of the proposed iEFO is tested against original EFO, existing physics-inspired algorithms, and state-of-the-art meta-heuristic algorithms as artificial bee colony algorithm, particle swarm optimization, and differential evolution. Obtained results are verified with statistical testing, and results reveal that proposed iEFO outperforms the EFO and other considered competitor algorithms by providing better results.
- 23 May 2019
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2019, 1-20
Open AccessAn Improved Electromagnetic Field Optimization for the Global Optimization Problems
Electromagnetic field optimization (EFO) is a relatively new physics-inspired population-based metaheuristic algorithm, which simulates the behavior of electromagnets with different polarities and takes advantage of a nature-inspired ratio, known as the golden ratio. In EFO, the population consists of electromagnetic particles made of electromagnets corresponding to variables of an optimization problem and is divided into three fields: positive, negative, and neutral. In each iteration, a new electromagnetic particle is generated based on the attraction-repulsion forces among these electromagnetic fields, where the repulsion force helps particle to avoid the local optimal point, and the attraction force leads to find global optimal. This paper introduces an improved version of the EFO called improved electromagnetic field optimization (iEFO). Distinct from the EFO, the iEFO has two novel modifications: new solution generation function for the electromagnets and adaptive control of algorithmic parameters. In addition to these major improvements, the boundary control and randomization procedures for the newly generated electromagnets are modified. In the computational studies, the performance of the proposed iEFO is tested against original EFO, existing physics-inspired algorithms, and state-of-the-art meta-heuristic algorithms as artificial bee colony algorithm, particle swarm optimization, and differential evolution. Obtained results are verified with statistical testing, and results reveal that proposed iEFO outperforms the EFO and other considered competitor algorithms by providing better results.
- 1 December 2018
- Published by Elsevier in Applied Soft Computing
- Vol. 73, 767-782
A novel artificial bee colony algorithm for the workforce scheduling and balancing problem in sub-assembly lines with limited buffers
- 1 December 2018
- Published by Elsevier in Applied Soft Computing
- Vol. 73, 767-782
A novel artificial bee colony algorithm for the workforce scheduling and balancing problem in sub-assembly lines with limited buffers
- Open Access
- 1 June 2017
- Published by Association for Health Sciences and Education in Journal of Hospital Administration
- Vol. 6 (4) , 10
Lean transformation to reduce costs in healthcare: A public hospital case in Turkey
Until recently, hospitals have adapted a series of quality standards to improve the quality of their services. However, these standards do not provide any cost reduction that is worth mentioning within which qualified personnel, material and indirect costs are already very high. To overcome this problem, lean production techniques have been integrated to the healthcare processes in the last few years. This study aimed to reduce costs by both improving and shortening the time of Social Security Instituition (SSI) based invoicing processes of a public hospital in Bursa, Turkey during the period of 2013-2014. To accomplish this goal various lean tools such as value stream mapping, poka-yoke, kaizen and standardization were presented and implemented. For validation purposes, montly SSI cuts, total income and process times before and after the lean transformation were analysed and compared. Furthermore, patient satisfaction surveys were carried out in order to investigate the negative effects of cost oriented lean studies. Results reveal that a clear improvement in total income is achievable, while maintaining the patient satisfaction levels. In this case, an eight percent improvement in SSI cuts resulting in a clear improvement on total income values has been obtained. Findings indicate that implementing lean tools on hospital processes is an effective way to reduce the healthcare costs while maintaining the patient satisfaction levels. The results of this study will stimulate the research in adopting lean techniques not only for patient satisfaction, but also for cost reduction purposes in hospitals.
- 1 June 2017
- Published by Association for Health Sciences and Education in Journal of Hospital Administration
- Vol. 6 (4) , 10
Open AccessLean transformation to reduce costs in healthcare: A public hospital case in Turkey
Until recently, hospitals have adapted a series of quality standards to improve the quality of their services. However, these standards do not provide any cost reduction that is worth mentioning within which qualified personnel, material and indirect costs are already very high. To overcome this problem, lean production techniques have been integrated to the healthcare processes in the last few years. This study aimed to reduce costs by both improving and shortening the time of Social Security Instituition (SSI) based invoicing processes of a public hospital in Bursa, Turkey during the period of 2013-2014. To accomplish this goal various lean tools such as value stream mapping, poka-yoke, kaizen and standardization were presented and implemented. For validation purposes, montly SSI cuts, total income and process times before and after the lean transformation were analysed and compared. Furthermore, patient satisfaction surveys were carried out in order to investigate the negative effects of cost oriented lean studies. Results reveal that a clear improvement in total income is achievable, while maintaining the patient satisfaction levels. In this case, an eight percent improvement in SSI cuts resulting in a clear improvement on total income values has been obtained. Findings indicate that implementing lean tools on hospital processes is an effective way to reduce the healthcare costs while maintaining the patient satisfaction levels. The results of this study will stimulate the research in adopting lean techniques not only for patient satisfaction, but also for cost reduction purposes in hospitals.
- 24 March 2016
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (22) , 6860-6878
A discrete artificial bee colony algorithm for single machine scheduling problems
This paper presents a discrete artificial bee colony algorithm for a single machine earliness–tardiness scheduling problem. The objective of single machine earliness–tardiness scheduling problems is to find a job sequence that minimises the total sum of earliness–tardiness penalties. Artificial bee colony (ABC) algorithm is a swarm-based meta-heuristic, which mimics the foraging behaviour of honey bee swarms. In this study, several modifications to the original ABC algorithm are proposed for adapting the algorithm to efficiently solve combinatorial optimisation problems like single machine scheduling. In proposed study, instead of using a single search operator to generate neighbour solutions, random selection from an operator pool is employed. Moreover, novel crossover operators are presented and employed with several parent sets with different characteristics to enhance both exploration and exploitation behaviour of the proposed algorithm. The performance of the presented meta-heuristic is evaluated on several benchmark problems in detail and compared with the state-of-the-art algorithms. Computational results indicate that the algorithm can produce better solutions in terms of solution quality, robustness and computational time when compared to other algorithms.
- 24 March 2016
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (22) , 6860-6878
A discrete artificial bee colony algorithm for single machine scheduling problems
This paper presents a discrete artificial bee colony algorithm for a single machine earliness–tardiness scheduling problem. The objective of single machine earliness–tardiness scheduling problems is to find a job sequence that minimises the total sum of earliness–tardiness penalties. Artificial bee colony (ABC) algorithm is a swarm-based meta-heuristic, which mimics the foraging behaviour of honey bee swarms. In this study, several modifications to the original ABC algorithm are proposed for adapting the algorithm to efficiently solve combinatorial optimisation problems like single machine scheduling. In proposed study, instead of using a single search operator to generate neighbour solutions, random selection from an operator pool is employed. Moreover, novel crossover operators are presented and employed with several parent sets with different characteristics to enhance both exploration and exploitation behaviour of the proposed algorithm. The performance of the presented meta-heuristic is evaluated on several benchmark problems in detail and compared with the state-of-the-art algorithms. Computational results indicate that the algorithm can produce better solutions in terms of solution quality, robustness and computational time when compared to other algorithms.
- Open Access
- 24 December 2015
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2016, 1-13
An Enhanced Artificial Bee Colony Algorithm with Solution Acceptance Rule and Probabilistic Multisearch
The artificial bee colony (ABC) algorithm is a popular swarm based technique, which is inspired from the intelligent foraging behavior of honeybee swarms. This paper proposes a new variant of ABC algorithm, namely, enhanced ABC with solution acceptance rule and probabilistic multisearch (ABC-SA) to address global optimization problems. A new solution acceptance rule is proposed where, instead of greedy selection between old solution and new candidate solution, worse candidate solutions have a probability to be accepted. Additionally, the acceptance probability of worse candidates is nonlinearly decreased throughout the search process adaptively. Moreover, in order to improve the performance of the ABC and balance the intensification and diversification, a probabilistic multisearch strategy is presented. Three different search equations with distinctive characters are employed using predetermined search probabilities. By implementing a new solution acceptance rule and a probabilistic multisearch approach, the intensification and diversification performance of the ABC algorithm is improved. The proposed algorithm has been tested on well-known benchmark functions of varying dimensions by comparing against novel ABC variants, as well as several recent state-of-the-art algorithms. Computational results show that the proposed ABC-SA outperforms other ABC variants and is superior to state-of-the-art algorithms proposed in the literature.
- 24 December 2015
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2016, 1-13
Open AccessAn Enhanced Artificial Bee Colony Algorithm with Solution Acceptance Rule and Probabilistic Multisearch
The artificial bee colony (ABC) algorithm is a popular swarm based technique, which is inspired from the intelligent foraging behavior of honeybee swarms. This paper proposes a new variant of ABC algorithm, namely, enhanced ABC with solution acceptance rule and probabilistic multisearch (ABC-SA) to address global optimization problems. A new solution acceptance rule is proposed where, instead of greedy selection between old solution and new candidate solution, worse candidate solutions have a probability to be accepted. Additionally, the acceptance probability of worse candidates is nonlinearly decreased throughout the search process adaptively. Moreover, in order to improve the performance of the ABC and balance the intensification and diversification, a probabilistic multisearch strategy is presented. Three different search equations with distinctive characters are employed using predetermined search probabilities. By implementing a new solution acceptance rule and a probabilistic multisearch approach, the intensification and diversification performance of the ABC algorithm is improved. The proposed algorithm has been tested on well-known benchmark functions of varying dimensions by comparing against novel ABC variants, as well as several recent state-of-the-art algorithms. Computational results show that the proposed ABC-SA outperforms other ABC variants and is superior to state-of-the-art algorithms proposed in the literature.
- 1 November 2015
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 271, 1004-1023
An adaptive artificial bee colony algorithm for global optimization
- 1 November 2015
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 271, 1004-1023
An adaptive artificial bee colony algorithm for global optimization
- Open Access
- 29 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
A Modified Artificial Bee Colony Algorithm for-Center ProblemsThe objective of the-center problem is to locate-centers on a network such that the maximum of the distances from each node to its nearest center is minimized. The artificial bee colony algorithm is a swarm-based meta-heuristic algorithm that mimics the foraging behavior of honey bee colonies. This study proposes a modified ABC algorithm that benefits from a variety of search strategies to balance exploration and exploitation. Moreover, random key-based coding schemes are used to solve the-center problem effectively. The proposed algorithm is compared to state-of-the-art techniques using different benchmark problems, and computational results reveal that the proposed approach is very efficient.- 29 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
Open AccessA Modified Artificial Bee Colony Algorithm for-Center ProblemsThe objective of the-center problem is to locate-centers on a network such that the maximum of the distances from each node to its nearest center is minimized. The artificial bee colony algorithm is a swarm-based meta-heuristic algorithm that mimics the foraging behavior of honey bee colonies. This study proposes a modified ABC algorithm that benefits from a variety of search strategies to balance exploration and exploitation. Moreover, random key-based coding schemes are used to solve the-center problem effectively. The proposed algorithm is compared to state-of-the-art techniques using different benchmark problems, and computational results reveal that the proposed approach is very efficient. - Open Access
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-12
Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle’s boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-12
Open AccessEfficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle’s boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.
- Open Access
- 8 December 2013
- Published by Wiley in Computational and Mathematical Methods in Medicine
- Vol. 2013, 1-9
A Clinical Decision Support System for Femoral Peripheral Arterial Disease Treatment
One of the major challenges of providing reliable healthcare services is to diagnose and treat diseases in an accurate and timely manner. Recently, many researchers have successfully used artificial neural networks as a diagnostic assessment tool. In this study, the validation of such an assessment tool has been developed for treatment of the femoral peripheral arterial disease using a radial basis function neural network (RBFNN). A data set for training the RBFNN has been prepared by analyzing records of patients who had been treated by the thoracic and cardiovascular surgery clinic of a university hospital. The data set includes 186 patient records having 16 characteristic features associated with a binary treatment decision, namely, being a medical or a surgical one. K-means clustering algorithm has been used to determine the parameters of radial basis functions and the number of hidden nodes of the RBFNN is determined experimentally. For performance evaluation, the proposed RBFNN was compared to three different multilayer perceptron models having Pareto optimal hidden layer combinations using various performance indicators. Results of comparison indicate that the RBFNN can be used as an effective assessment tool for femoral peripheral arterial disease treatment.
- 8 December 2013
- Published by Wiley in Computational and Mathematical Methods in Medicine
- Vol. 2013, 1-9
Open AccessA Clinical Decision Support System for Femoral Peripheral Arterial Disease Treatment
One of the major challenges of providing reliable healthcare services is to diagnose and treat diseases in an accurate and timely manner. Recently, many researchers have successfully used artificial neural networks as a diagnostic assessment tool. In this study, the validation of such an assessment tool has been developed for treatment of the femoral peripheral arterial disease using a radial basis function neural network (RBFNN). A data set for training the RBFNN has been prepared by analyzing records of patients who had been treated by the thoracic and cardiovascular surgery clinic of a university hospital. The data set includes 186 patient records having 16 characteristic features associated with a binary treatment decision, namely, being a medical or a surgical one. K-means clustering algorithm has been used to determine the parameters of radial basis functions and the number of hidden nodes of the RBFNN is determined experimentally. For performance evaluation, the proposed RBFNN was compared to three different multilayer perceptron models having Pareto optimal hidden layer combinations using various performance indicators. Results of comparison indicate that the RBFNN can be used as an effective assessment tool for femoral peripheral arterial disease treatment.