Article Per Year (5 Year)
p-Index From 2021 - 2026
0.817
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics
Turan, Cemil
Unknown Affiliation
Electrical & Electronics Engineering

Published : 4 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 4 Documents
Search

 1 
Comparative analysis of machine learning approaches in Kazakh banknote classification Sadyk, Ualikhan; Yerzhan, Makhambet; Baimukashev, Rashid; Turan, Cemil
Bulletin of Electrical Engineering and Informatics Vol 13, No 5: October 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v13i5.8004

Abstract

Nowadays, smartphones seamlessly blend into every aspect of our lives, including as handheld assistants for individuals with disabilities. Therefore, this research addresses the need for a robust system that can classify Kazakh banknotes. By capitalizing on the availability of smartphones and the ability to integrate detectors with classifiers this study introduces classifiers of Kazakh banknote images specifically designed for banknotes ranging from 500 KZT to 20,000 KZT. It compares traditional and hybrid machine learning (ML) approaches, utilizing a dataset of diverse banknote images, aiming for both lightweight and high accuracy. Competitive performance is demonstrated by the traditional approach, enhanced by thoughtful feature engineering. The hybrid approach, utilizing features from a pre-trained ResNet-18 model, showcases remarkable accuracy and robustness. Evaluation metrics reveal significant achievements, with the traditional approach attaining 94.00% accuracy and the hybrid approach excelling at 99.11%. Model stacking, combining classifiers from both approaches, outperforms individual classifiers, achieving 95.00% and 99.55% accuracy for the traditional and hybrid ML approaches, respectively. Our methodology’s comparable outcome in classifying Thai banknotes and coffee beans roasting levels demonstrates their versatility in image classification tasks that rely on color differentiation, showcasing the potential beyond banknote recognition.
2D face recognition using PCA and triplet similarity embedding Bazatbekov, Bek; Turan, Cemil; Kadyrov, Shirali; Aitimov, Askhat
Bulletin of Electrical Engineering and Informatics Vol 12, No 1: February 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v12i1.4162

Abstract

The aim of this study is to propose a new robust face recognition algorithm by combining principal component analysis (PCA), Triplet Similarity Embedding based technique and Projection as a similarity metric at the different stages of the recognition processes. The main idea is to use PCA for feature extraction and dimensionality reduction, then train the triplet similarity embedding to accommodate changes in the facial poses, and finally use orthogonal projection as a similarity metric for classification. We use the open source ORL dataset to conduct the experiments to find the recognition rates of the proposed algorithm and compare them to the performance of one of the very well-known machine learning algorithms k-Nearest Neighbor classifier. Our experimental results show that the proposed model outperforms the kNN. Moreover, when the training set is smaller than the test set, the performance contribution of triplet similarity embedding during the learning phase becomes more visible compared to without it
Recent developments in vehicle routing problem under time uncertainty: a comprehensive review Yernar, Akhmetbek; Turan, Cemil
Bulletin of Electrical Engineering and Informatics Vol 14, No 2: April 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i2.8636

Abstract

This review paper examines recent advancements in vehicle routing optimization under time uncertainty, focusing on the vehicle routing problem (VRP). It sys-tematically analyzes research papers to identify strategies for optimizing routes despite temporal uncertainties, covering key areas such as optimization algo-rithms, uncertainty modeling techniques, and simulation methods. The study investigates dynamic dispatching models, reliability considerations, and multi-objective optimization approaches. By synthesizing existing literature, this pa-per presents the current state of research in vehicle routing under time uncer-tainty and suggests potential future research directions. Our findings indicate that integrating robust optimization techniques with advanced simulation meth-ods could significantly enhance decision-making processes in uncertain envi-ronments. Additionally, the paper highlights the role of machine learning and artificial intelligence in developing adaptive algorithms that respond to dynamic changes in real-time. As the need for efficient logistics solutions grows, this comprehensive review underscores the importance of addressing uncertainties in vehicle routing to improve operational efficiency, reduce costs, and enhance customer satisfaction.
Route splitting and adaptive mutation in genetic algorithms for the capacitated vehicle routing problem Kadyrov, Shirali; Turan, Cemil
Bulletin of Electrical Engineering and Informatics Vol 14, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v14i6.9204

Abstract

The capacitated vehicle routing problem (CVRP), where vehicle capacity constraints limit the load carried per route for multiple vehicles, is addressed using an optimized genetic algorithm (GA) framework. This work focuses on finding the best configuration of GA by systematically evaluating 12 distinct GA variants, differing in adaptive mutation rates and route-splitting strategies. The framework integrates adaptive mutation rates and novel route-splitting approaches—greedy, dynamic programming (DP), and heuristic—to enhance computational efficiency and solution quality. Experiments on six CVRP instances of varying complexity, encompassing differences in problem size, vehicle capacity, and geographical distribution, demonstrate the heuristic approach’s effectiveness. It achieves solutions within 2%–5% of the optimal cost of DP while being 3–4 times faster. Adaptive techniques reduce costs by up to 20% compared to standard GAs and heuristics. The framework’s scalability is evident in large-scale instances such as the 200-customer case, where the heuristic method balances cost (414.17) and computation time (0.003 seconds). The developed software is openly available at GitHub, providing a robust tool for addressing practical logistics challenges.
Co-Authors Aitimov, Askhat Baimukashev, Rashid Bazatbekov, Bek Kadyrov, Shirali Sadyk, Ualikhan Yernar, Akhmetbek Yerzhan, Makhambet