Flow shop scheduling problem is one of the most classical NP-hard optimization problem. Which aims to find the best planning that minimizes the makespan (total completion time) of a set of tasks in a set of machines with certain constraints. In this paper, we propose a new nature inspired metaheuristic to solve the flow shop scheduling problem (FSSP), called penguins search optimization algorithm (PeSOA) based on collaborative hunting strategy of penguins.The operators and parameter values of PeSOA redefined to solve this problem. The performance of the penguins search optimization algorithm is tested on a set of benchmarks instances of FSSP from OR-Library, The results of the tests show that PeSOA is superior to some other metaheuristics algorithms, in terms of the quality of the solutions found and the execution time.
A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduli...Xin-She Yang
The document describes a discrete firefly algorithm proposed to solve hybrid flowshop scheduling problems with two objectives: minimizing makespan and mean flow time. Hybrid flowshop scheduling problems involve scheduling jobs through multiple stages with parallel machines in some stages, and are known to be NP-hard. The proposed discrete firefly algorithm adapts the continuous firefly algorithm to the discrete problem by using a smallest position value rule to map continuous firefly positions to discrete job permutations. Computational experiments show the proposed algorithm outperforms other metaheuristics for hybrid flowshop scheduling problems.
Non-convex constrained economic power dispatch with prohibited operating zone...IJECEIAES
This paper is focused on the solution of the non-convex economic power dispatch problem with piecewise quadratic cost functions and practical operation constraints of generation units. The constraints of the economic dispatch problem are power balance constraint, generation limits constraint, prohibited operating zones and transmission power losses. To solve this problem, a meta-heuristic optimization algorithm named crow search algorithm is proposed. A constraint handling technique is also implemented to satisfy the constraints effectively. For the verification of the effectiveness and the superiority of the proposed algorithm, it is tested on 6-unit, 10-unit and 15-unit test systems. The simulation results and statistical analysis show the efficiency of the proposed algorithm. Also, the results confirm the superiority and the high-quality solutions of the proposed algorithm when compared to the other reported algorithms.
An energy-efficient flow shop scheduling using hybrid Harris hawks optimizationjournalBEEI
The energy crisis has become an environmental problem, and this has received much attention from researchers. The manufacturing sector is the most significant contributor to energy consumption in the world. One of the significant efforts made in the manufacturing industry to reduce energy consumption is through proper scheduling. Energy-efficient scheduling (EES) is a problem in scheduling to reduce energy consumption. One of the EES problems is in a flow shop scheduling problem (FSSP). This article intends to develop a new approach to solving an EES in the FSSP problem. Hybrid Harris hawks optimization (hybrid HHO) algorithm is offered to resolve the EES issue on FSSP by considering the sequence-dependent setup. Swap and flip procedures are suggested to improve HHO performance. Furthermore, several procedures were used as a comparison to assess hybrid HHO performance. Ten tests were exercised to exhibit the hybrid HHO accomplishment. Based on numerical experimental results, hybrid HHO can solve EES problems. Furthermore, HHO was proven more competitive than other algorithms.
Solving practical economic load dispatch problem using crow search algorithm IJECEIAES
The document presents a crow search algorithm to solve the practical economic load dispatch problem considering valve-point loading effects and multiple fuel options. This problem is non-convex, non-smooth, and non-linear. The crow search algorithm is inspired by the intelligent social behavior of crows. It models the crows following each other to find food storage locations. The algorithm updates crow positions based on whether another crow detects it or not. Simulation results show the crow search algorithm finds high-quality solutions and performs effectively compared to other algorithms for solving the non-convex economic load dispatch problem.
Financial assessment considered weighting factor scenarios for the optimal co...INFOGAIN PUBLICATION
This paper presents an application of the novel evolutionary algorithm for assessing financially an economic power system operation throughout a combined economic and emission dispatch problem required by various technical limitations. In detail, this problem considers two dispatches for fuel and environmental aspects as a constrained objective function associated with weighting factor scenarios. Running out simulations show that minimum costs are depended on weighting factors, which implemented on the combination of the problem. Reducing the total fuel cost focused on the dispatching priority and the pollutant target based on the emission production have difference implications as its contribution to the economic operation, the increasing load demand leads to generated powers, costs and emission discharges associated with its parameters and power schedules.
The document proposes a hybrid algorithm combining genetic algorithm and cuckoo search optimization to solve job shop scheduling problems. It aims to minimize makespan (completion time of all jobs) by scheduling jobs on machines. The genetic algorithm is used to explore the search space but can get trapped in local optima. Cuckoo search optimization performs local search faster than genetic algorithm and helps avoid local optima. Experimental results on benchmark problems show the hybrid algorithm yields better solutions in terms of makespan and runtime compared to genetic algorithm and ant colony optimization algorithms.
Economic Load Dispatch Using Grey Wolf OptimizationIJERA Editor
This document presents an analysis of using Grey Wolf Optimization (GWO) to solve the economic load dispatch (ELD) problem in power systems. GWO is a metaheuristic optimization algorithm inspired by grey wolf hunting behavior. The ELD problem aims to minimize total generation cost while satisfying constraints like power balance and generator limits. GWO is applied to two test power systems with 3 and 6 generators. Results show GWO finds solutions comparable to other algorithms like cuckoo search and lambda iteration for different load demands, demonstrating GWO's effectiveness in solving the ELD problem.
This document summarizes the application of computational intelligence techniques like genetic algorithms and particle swarm optimization for solving economic load dispatch problems. It first applies a real-coded genetic algorithm to minimize generation costs for a 6-generator test system with continuous fuel cost equations, showing superiority over quadratic programming. It then uses particle swarm optimization to minimize costs for a 10-generator system with each generator having discontinuous fuel options, showing better results than other published methods. The document provides background on economic load dispatch problems and optimization techniques like quadratic programming, genetic algorithms, and particle swarm optimization.
A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduli...Xin-She Yang
The document describes a discrete firefly algorithm proposed to solve hybrid flowshop scheduling problems with two objectives: minimizing makespan and mean flow time. Hybrid flowshop scheduling problems involve scheduling jobs through multiple stages with parallel machines in some stages, and are known to be NP-hard. The proposed discrete firefly algorithm adapts the continuous firefly algorithm to the discrete problem by using a smallest position value rule to map continuous firefly positions to discrete job permutations. Computational experiments show the proposed algorithm outperforms other metaheuristics for hybrid flowshop scheduling problems.
Non-convex constrained economic power dispatch with prohibited operating zone...IJECEIAES
This paper is focused on the solution of the non-convex economic power dispatch problem with piecewise quadratic cost functions and practical operation constraints of generation units. The constraints of the economic dispatch problem are power balance constraint, generation limits constraint, prohibited operating zones and transmission power losses. To solve this problem, a meta-heuristic optimization algorithm named crow search algorithm is proposed. A constraint handling technique is also implemented to satisfy the constraints effectively. For the verification of the effectiveness and the superiority of the proposed algorithm, it is tested on 6-unit, 10-unit and 15-unit test systems. The simulation results and statistical analysis show the efficiency of the proposed algorithm. Also, the results confirm the superiority and the high-quality solutions of the proposed algorithm when compared to the other reported algorithms.
An energy-efficient flow shop scheduling using hybrid Harris hawks optimizationjournalBEEI
The energy crisis has become an environmental problem, and this has received much attention from researchers. The manufacturing sector is the most significant contributor to energy consumption in the world. One of the significant efforts made in the manufacturing industry to reduce energy consumption is through proper scheduling. Energy-efficient scheduling (EES) is a problem in scheduling to reduce energy consumption. One of the EES problems is in a flow shop scheduling problem (FSSP). This article intends to develop a new approach to solving an EES in the FSSP problem. Hybrid Harris hawks optimization (hybrid HHO) algorithm is offered to resolve the EES issue on FSSP by considering the sequence-dependent setup. Swap and flip procedures are suggested to improve HHO performance. Furthermore, several procedures were used as a comparison to assess hybrid HHO performance. Ten tests were exercised to exhibit the hybrid HHO accomplishment. Based on numerical experimental results, hybrid HHO can solve EES problems. Furthermore, HHO was proven more competitive than other algorithms.
Solving practical economic load dispatch problem using crow search algorithm IJECEIAES
The document presents a crow search algorithm to solve the practical economic load dispatch problem considering valve-point loading effects and multiple fuel options. This problem is non-convex, non-smooth, and non-linear. The crow search algorithm is inspired by the intelligent social behavior of crows. It models the crows following each other to find food storage locations. The algorithm updates crow positions based on whether another crow detects it or not. Simulation results show the crow search algorithm finds high-quality solutions and performs effectively compared to other algorithms for solving the non-convex economic load dispatch problem.
Financial assessment considered weighting factor scenarios for the optimal co...INFOGAIN PUBLICATION
This paper presents an application of the novel evolutionary algorithm for assessing financially an economic power system operation throughout a combined economic and emission dispatch problem required by various technical limitations. In detail, this problem considers two dispatches for fuel and environmental aspects as a constrained objective function associated with weighting factor scenarios. Running out simulations show that minimum costs are depended on weighting factors, which implemented on the combination of the problem. Reducing the total fuel cost focused on the dispatching priority and the pollutant target based on the emission production have difference implications as its contribution to the economic operation, the increasing load demand leads to generated powers, costs and emission discharges associated with its parameters and power schedules.
The document proposes a hybrid algorithm combining genetic algorithm and cuckoo search optimization to solve job shop scheduling problems. It aims to minimize makespan (completion time of all jobs) by scheduling jobs on machines. The genetic algorithm is used to explore the search space but can get trapped in local optima. Cuckoo search optimization performs local search faster than genetic algorithm and helps avoid local optima. Experimental results on benchmark problems show the hybrid algorithm yields better solutions in terms of makespan and runtime compared to genetic algorithm and ant colony optimization algorithms.
Economic Load Dispatch Using Grey Wolf OptimizationIJERA Editor
This document presents an analysis of using Grey Wolf Optimization (GWO) to solve the economic load dispatch (ELD) problem in power systems. GWO is a metaheuristic optimization algorithm inspired by grey wolf hunting behavior. The ELD problem aims to minimize total generation cost while satisfying constraints like power balance and generator limits. GWO is applied to two test power systems with 3 and 6 generators. Results show GWO finds solutions comparable to other algorithms like cuckoo search and lambda iteration for different load demands, demonstrating GWO's effectiveness in solving the ELD problem.
This document summarizes the application of computational intelligence techniques like genetic algorithms and particle swarm optimization for solving economic load dispatch problems. It first applies a real-coded genetic algorithm to minimize generation costs for a 6-generator test system with continuous fuel cost equations, showing superiority over quadratic programming. It then uses particle swarm optimization to minimize costs for a 10-generator system with each generator having discontinuous fuel options, showing better results than other published methods. The document provides background on economic load dispatch problems and optimization techniques like quadratic programming, genetic algorithms, and particle swarm optimization.
Memetic chicken swarm algorithm for job shop scheduling problemIJECEIAES
This paper presents a Memetic Chicken swarm optimization (MeCSO) to solve job shop scheduling problem (JSSP). The aim is to find a better solution which minimizes the maximum of the completion time also called Makespan. In this paper, we adapt the chicken swarm algorithm which take into consideration the hierarchical order of chicken swarm while seeking for food. Moreover, we integrate 2-opt method to improve the movement of the rooster. The new algorithm is applied on some instances of ORLibrary. The empirical results show the forcefulness of MeCSO comparing to other metaheuristics from literature in term of run time and quality of solution.
This document presents a particle swarm optimization (PSO) algorithm to solve economic load dispatch (ELD) problems more efficiently than genetic algorithms. The PSO technique requires less computational time per iteration and finds solutions faster. Simulation results show that using PSO, the computational time and generation costs are lower than when using genetic algorithms. PSO is effective at finding the minimum cost solution to the economic load dispatch problem with fewer iterations and less computation time compared to other optimization methods.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
This document presents a particle swarm optimization (PSO) algorithm to solve economic load dispatch (ELD) problems more efficiently than genetic algorithms. The PSO technique requires less computational time per iteration and finds solutions faster. Simulation results show that using PSO, the computational time and generation costs are lower than when using genetic algorithms. PSO is effective at finding the minimum cost generation dispatch that meets load demand while satisfying constraints such as generator limits.
1) The document presents a particle swarm optimization (PSO) technique to solve economic load dispatch problems in a more computationally efficient manner than genetic algorithms.
2) PSO is a population-based optimization technique that is faster and requires less computation time per iteration than genetic algorithms. It is well-suited for solving complex non-linear optimization problems.
3) The study applies PSO to minimize generation costs for an economic load dispatch problem subject to constraints. Simulation results demonstrate that PSO solves the problem with less computational time and iterations compared to genetic algorithms.
This paper considers a flow shop scheduling problem. The flow shop scheduling is
characterized “n” jobs and “m” machines in series with unidirectional flow of work with
variety of jobs being processed sequentially in a single pass manner. Most real world
problems are NP-hard in nature. The essential complexity of the problem necessitates the
use of meta-heuristics for solving flow shop scheduling problem. The paper addresses the
flow shop scheduling problem to minimize the makespan time with specific batch size
using Particle Swarm Optimization (PSO) and comparing the results with an real time
company production sequence.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
This document discusses using the Cuckoo Optimization Algorithm (COA) to solve a production planning problem. It provides background on COA and how it was applied to optimize a mathematical model of production planning with the goal of minimizing costs. The COA approach found better solutions than Genetic Algorithm and Lingo software in less time. The authors conclude COA is an effective method for solving this type of constrained nonlinear optimization problem.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
This document discusses using the Cuckoo Optimization Algorithm (COA) to solve a production planning problem. It provides background on COA and how it works, modeling the production planning problem with objectives and constraints. The COA is implemented on a 3-product, 5-period example problem. Results show COA finds better solutions faster than Genetic Algorithm and provides answers close to commercial solver Lingo. COA is thus shown to be an effective method for solving this type of constrained nonlinear production planning problem.
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization TechniquejournalBEEI
This document presents a study that uses Particle Swarm Optimization (PSO) technique to solve the Dynamic Economic Dispatch (DED) problem for a 9-bus power system with 3 generators over a 24-hour period. The objective is to determine the optimal generator outputs at each hour to minimize total generation costs while satisfying system constraints. PSO is applied to find the optimal solution by updating generator output positions based on personal and global best cost values. Results found the minimum cost schedule for each generator over the 24 hours while ensuring system limits were not violated.
An Enhanced Bio-Stimulated Methodology to Resolve Shop Scheduling Problemsijasa
This document summarizes research on using a customized bacterial foraging optimization (CBFO) algorithm to solve job shop, flow shop, and open shop scheduling problems. CBFO combines bacterial foraging optimization (BFO) with ant colony optimization (ACO). The researchers tested CBFO on benchmark problem instances and randomly generated instances, finding it performed better than standard BFO. CBFO can effectively solve various shop scheduling problems and has potential for solving real-world scheduling issues.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problemsijpla
Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is
categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization
was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging
Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by
proposed Hybrid Bacterial Foraging Optimization algorithms are much better when compared with the
solutions obtained by Bacterial Foraging Optimization algorithm for well-known test problems of different
sizes. From the implementation of this research work, it could be observed that the proposed Hybrid
Bacterial Foraging Optimization was effective than Bacterial Foraging Optimization algorithm in solving
Job Shop Scheduling Problems. Hybrid Bacterial Foraging Optimization is used to implement real world
Job Shop Scheduling Problems
Rice Data Simulator, Neural Network, Multiple linear regression, Prediction o...ijcseit
This paper is the continuation of the paper published by the authors Arun Balaji and Baskaran [2].
Multiple linear regression (MLR) equations were developed between the years of rice cultivation and Feed
Forward Back Propagation Neural Network (FFBPNN) method of predicted area of rice cultivation / rice
production for different districts pertaining to Kuruvai, Samba and Kodai seasons in Tamilnadu. The
average r
2
value in area of cultivation is 0.40 in Kuruvai season, 0.42 in Samba season and 0.46 in Kodai
season, where as the r2
value in rice production is 0.31 in Kuruvai season, 0.23 in Samba season and
0.42 in Kodai season. The Rice Data Simulator (RDS) predicted the area of rice cultivation and rice
production using the MLR equations developed in this research. The range of average predicted area for
Kuruvai, Samba and Kodai seasons varies from 12052.52 ha to 13595.32 ha, 48998.96 ha to 53324.54 ha
and 4241.23 ha to 6449.88 ha respectively whereas the range of average predicted rice production varies
from 45132.88 tonnes to 46074.48 tonnes in Kuruvai, 128619 tonnes to 139693.29 tonnes in Samba and
15446.07 to 20573.50 tonnes in Kodai seasons. The mean absolute relative error (ARE) between the
FFBPNN and multiple regression methods of prediction of area of rice cultivation was found to be 15.58%,
8.04% and 26.34% for the Kuruvai, Samba and the Kodai seasons respectively. The ARE for the rice
production was found to be 17%, 11.80% and 24.60% for the Kuruvai, Samba and the Kodai seasons
respectively. The paired t test between the FFBPNN and MLR methods of predicted area of cultivation in
Kuruvai shows that there is no significant difference between the two types of prediction for certain
districts.
Presenting a new Ant Colony Optimization Algorithm (ACO) for Efficient Job Sc...Editor IJCATR
Grid computing utilizes the distributed heterogeneous resources in order to support complicated computing problems. Job
scheduling in computing grid is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign
jobs to resources in grids.
In the natural environment, the ants have a tremendous ability to team up to find an optimal path to food resources. An ant algorithm
simulates the behavior of ants. In this paper, a new Ant Colony Optimization (ACO) algorithm is proposed for job scheduling in the
Grid environment. The main contribution of this paper is to minimize the makespan of a given set of jobs. Compared with the other job
scheduling algorithms, the proposed algorithm can outperform them according to the experimental results.
Design and Implementation of a Multi-Agent System for the Job Shop Scheduling...CSCJournals
This document proposes an agent-based parallel genetic algorithm for solving the job shop scheduling problem. The approach divides the genetic algorithm population into multiple subpopulations that are evolved independently in parallel on different hosts. Agents are used to create the initial populations in parallel and execute the genetic algorithm operations. The genetic algorithm runs in execution phases where subpopulations evolve independently, and migration phases where the subpopulations exchange solutions. Experimental results showed this parallel approach improves the performance over a non-parallel genetic algorithm.
In industries, the completion time of job problems in the manufacturing unit has risen significantly. In several types of current study, the job's completion time, or makespan, is reduced by taking straight paths, which is time-consuming. In this paper, we used an Improved Ant Colony Optimization and Tabu Search (ACOTS) algorithm to solve this problem by precisely defining the fault occurrence location in order to rollback. We have used a short-term memory-based rollback recovery strategy to minimise the job's completion time by rolling back to its own short-term memory. The recent movements in Tabu quest are visited using short term memory. As compared to the ACO algorithm, our proposed ACOTS-Cmax solution is more efficient and takes less time to complete.
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...IJECEIAES
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
More Related Content
Similar to Discrete penguins search optimization algorithm to solve flow shop scheduling problem
Memetic chicken swarm algorithm for job shop scheduling problemIJECEIAES
This paper presents a Memetic Chicken swarm optimization (MeCSO) to solve job shop scheduling problem (JSSP). The aim is to find a better solution which minimizes the maximum of the completion time also called Makespan. In this paper, we adapt the chicken swarm algorithm which take into consideration the hierarchical order of chicken swarm while seeking for food. Moreover, we integrate 2-opt method to improve the movement of the rooster. The new algorithm is applied on some instances of ORLibrary. The empirical results show the forcefulness of MeCSO comparing to other metaheuristics from literature in term of run time and quality of solution.
This document presents a particle swarm optimization (PSO) algorithm to solve economic load dispatch (ELD) problems more efficiently than genetic algorithms. The PSO technique requires less computational time per iteration and finds solutions faster. Simulation results show that using PSO, the computational time and generation costs are lower than when using genetic algorithms. PSO is effective at finding the minimum cost solution to the economic load dispatch problem with fewer iterations and less computation time compared to other optimization methods.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
This document presents a particle swarm optimization (PSO) algorithm to solve economic load dispatch (ELD) problems more efficiently than genetic algorithms. The PSO technique requires less computational time per iteration and finds solutions faster. Simulation results show that using PSO, the computational time and generation costs are lower than when using genetic algorithms. PSO is effective at finding the minimum cost generation dispatch that meets load demand while satisfying constraints such as generator limits.
1) The document presents a particle swarm optimization (PSO) technique to solve economic load dispatch problems in a more computationally efficient manner than genetic algorithms.
2) PSO is a population-based optimization technique that is faster and requires less computation time per iteration than genetic algorithms. It is well-suited for solving complex non-linear optimization problems.
3) The study applies PSO to minimize generation costs for an economic load dispatch problem subject to constraints. Simulation results demonstrate that PSO solves the problem with less computational time and iterations compared to genetic algorithms.
This paper considers a flow shop scheduling problem. The flow shop scheduling is
characterized “n” jobs and “m” machines in series with unidirectional flow of work with
variety of jobs being processed sequentially in a single pass manner. Most real world
problems are NP-hard in nature. The essential complexity of the problem necessitates the
use of meta-heuristics for solving flow shop scheduling problem. The paper addresses the
flow shop scheduling problem to minimize the makespan time with specific batch size
using Particle Swarm Optimization (PSO) and comparing the results with an real time
company production sequence.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
This document discusses using the Cuckoo Optimization Algorithm (COA) to solve a production planning problem. It provides background on COA and how it was applied to optimize a mathematical model of production planning with the goal of minimizing costs. The COA approach found better solutions than Genetic Algorithm and Lingo software in less time. The authors conclude COA is an effective method for solving this type of constrained nonlinear optimization problem.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
Constrained Nonlinear programming problems are hard problems, and one of the most widely used and
common problems for production planning problem to optimize. In this study, one of the mathematical
models of production planning is survey and the problem solved by cuckoo algorithm. Cuckoo Algorithm is
efficient method to solve continues non linear problem. Moreover, mentioned models of production
planning solved with Genetic algorithm and Lingo software and the results will compared. The Cuckoo
Algorithm is suitable choice for optimization in convergence of solution.
THE STUDY OF CUCKOO OPTIMIZATION ALGORITHM FOR PRODUCTION PLANNING PROBLEMijcax
This document discusses using the Cuckoo Optimization Algorithm (COA) to solve a production planning problem. It provides background on COA and how it works, modeling the production planning problem with objectives and constraints. The COA is implemented on a 3-product, 5-period example problem. Results show COA finds better solutions faster than Genetic Algorithm and provides answers close to commercial solver Lingo. COA is thus shown to be an effective method for solving this type of constrained nonlinear production planning problem.
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization TechniquejournalBEEI
This document presents a study that uses Particle Swarm Optimization (PSO) technique to solve the Dynamic Economic Dispatch (DED) problem for a 9-bus power system with 3 generators over a 24-hour period. The objective is to determine the optimal generator outputs at each hour to minimize total generation costs while satisfying system constraints. PSO is applied to find the optimal solution by updating generator output positions based on personal and global best cost values. Results found the minimum cost schedule for each generator over the 24 hours while ensuring system limits were not violated.
An Enhanced Bio-Stimulated Methodology to Resolve Shop Scheduling Problemsijasa
This document summarizes research on using a customized bacterial foraging optimization (CBFO) algorithm to solve job shop, flow shop, and open shop scheduling problems. CBFO combines bacterial foraging optimization (BFO) with ant colony optimization (ACO). The researchers tested CBFO on benchmark problem instances and randomly generated instances, finding it performed better than standard BFO. CBFO can effectively solve various shop scheduling problems and has potential for solving real-world scheduling issues.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problemsijpla
Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is
categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization
was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging
Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by
proposed Hybrid Bacterial Foraging Optimization algorithms are much better when compared with the
solutions obtained by Bacterial Foraging Optimization algorithm for well-known test problems of different
sizes. From the implementation of this research work, it could be observed that the proposed Hybrid
Bacterial Foraging Optimization was effective than Bacterial Foraging Optimization algorithm in solving
Job Shop Scheduling Problems. Hybrid Bacterial Foraging Optimization is used to implement real world
Job Shop Scheduling Problems
Rice Data Simulator, Neural Network, Multiple linear regression, Prediction o...ijcseit
This paper is the continuation of the paper published by the authors Arun Balaji and Baskaran [2].
Multiple linear regression (MLR) equations were developed between the years of rice cultivation and Feed
Forward Back Propagation Neural Network (FFBPNN) method of predicted area of rice cultivation / rice
production for different districts pertaining to Kuruvai, Samba and Kodai seasons in Tamilnadu. The
average r
2
value in area of cultivation is 0.40 in Kuruvai season, 0.42 in Samba season and 0.46 in Kodai
season, where as the r2
value in rice production is 0.31 in Kuruvai season, 0.23 in Samba season and
0.42 in Kodai season. The Rice Data Simulator (RDS) predicted the area of rice cultivation and rice
production using the MLR equations developed in this research. The range of average predicted area for
Kuruvai, Samba and Kodai seasons varies from 12052.52 ha to 13595.32 ha, 48998.96 ha to 53324.54 ha
and 4241.23 ha to 6449.88 ha respectively whereas the range of average predicted rice production varies
from 45132.88 tonnes to 46074.48 tonnes in Kuruvai, 128619 tonnes to 139693.29 tonnes in Samba and
15446.07 to 20573.50 tonnes in Kodai seasons. The mean absolute relative error (ARE) between the
FFBPNN and multiple regression methods of prediction of area of rice cultivation was found to be 15.58%,
8.04% and 26.34% for the Kuruvai, Samba and the Kodai seasons respectively. The ARE for the rice
production was found to be 17%, 11.80% and 24.60% for the Kuruvai, Samba and the Kodai seasons
respectively. The paired t test between the FFBPNN and MLR methods of predicted area of cultivation in
Kuruvai shows that there is no significant difference between the two types of prediction for certain
districts.
Presenting a new Ant Colony Optimization Algorithm (ACO) for Efficient Job Sc...Editor IJCATR
Grid computing utilizes the distributed heterogeneous resources in order to support complicated computing problems. Job
scheduling in computing grid is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign
jobs to resources in grids.
In the natural environment, the ants have a tremendous ability to team up to find an optimal path to food resources. An ant algorithm
simulates the behavior of ants. In this paper, a new Ant Colony Optimization (ACO) algorithm is proposed for job scheduling in the
Grid environment. The main contribution of this paper is to minimize the makespan of a given set of jobs. Compared with the other job
scheduling algorithms, the proposed algorithm can outperform them according to the experimental results.
Design and Implementation of a Multi-Agent System for the Job Shop Scheduling...CSCJournals
This document proposes an agent-based parallel genetic algorithm for solving the job shop scheduling problem. The approach divides the genetic algorithm population into multiple subpopulations that are evolved independently in parallel on different hosts. Agents are used to create the initial populations in parallel and execute the genetic algorithm operations. The genetic algorithm runs in execution phases where subpopulations evolve independently, and migration phases where the subpopulations exchange solutions. Experimental results showed this parallel approach improves the performance over a non-parallel genetic algorithm.
In industries, the completion time of job problems in the manufacturing unit has risen significantly. In several types of current study, the job's completion time, or makespan, is reduced by taking straight paths, which is time-consuming. In this paper, we used an Improved Ant Colony Optimization and Tabu Search (ACOTS) algorithm to solve this problem by precisely defining the fault occurrence location in order to rollback. We have used a short-term memory-based rollback recovery strategy to minimise the job's completion time by rolling back to its own short-term memory. The recent movements in Tabu quest are visited using short term memory. As compared to the ACO algorithm, our proposed ACOTS-Cmax solution is more efficient and takes less time to complete.
Similar to Discrete penguins search optimization algorithm to solve flow shop scheduling problem (20)
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...IJECEIAES
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Neural network optimizer of proportional-integral-differential controller par...IJECEIAES
Wide application of proportional-integral-differential (PID)-regulator in industry requires constant improvement of methods of its parameters adjustment. The paper deals with the issues of optimization of PID-regulator parameters with the use of neural network technology methods. A methodology for choosing the architecture (structure) of neural network optimizer is proposed, which consists in determining the number of layers, the number of neurons in each layer, as well as the form and type of activation function. Algorithms of neural network training based on the application of the method of minimizing the mismatch between the regulated value and the target value are developed. The method of back propagation of gradients is proposed to select the optimal training rate of neurons of the neural network. The neural network optimizer, which is a superstructure of the linear PID controller, allows increasing the regulation accuracy from 0.23 to 0.09, thus reducing the power consumption from 65% to 53%. The results of the conducted experiments allow us to conclude that the created neural superstructure may well become a prototype of an automatic voltage regulator (AVR)-type industrial controller for tuning the parameters of the PID controller.
An improved modulation technique suitable for a three level flying capacitor ...IJECEIAES
This research paper introduces an innovative modulation technique for controlling a 3-level flying capacitor multilevel inverter (FCMLI), aiming to streamline the modulation process in contrast to conventional methods. The proposed
simplified modulation technique paves the way for more straightforward and
efficient control of multilevel inverters, enabling their widespread adoption and
integration into modern power electronic systems. Through the amalgamation of
sinusoidal pulse width modulation (SPWM) with a high-frequency square wave
pulse, this controlling technique attains energy equilibrium across the coupling
capacitor. The modulation scheme incorporates a simplified switching pattern
and a decreased count of voltage references, thereby simplifying the control
algorithm.
A review on features and methods of potential fishing zoneIJECEIAES
This review focuses on the importance of identifying potential fishing zones in seawater for sustainable fishing practices. It explores features like sea surface temperature (SST) and sea surface height (SSH), along with classification methods such as classifiers. The features like SST, SSH, and different classifiers used to classify the data, have been figured out in this review study. This study underscores the importance of examining potential fishing zones using advanced analytical techniques. It thoroughly explores the methodologies employed by researchers, covering both past and current approaches. The examination centers on data characteristics and the application of classification algorithms for classification of potential fishing zones. Furthermore, the prediction of potential fishing zones relies significantly on the effectiveness of classification algorithms. Previous research has assessed the performance of models like support vector machines, naïve Bayes, and artificial neural networks (ANN). In the previous result, the results of support vector machine (SVM) were 97.6% more accurate than naive Bayes's 94.2% to classify test data for fisheries classification. By considering the recent works in this area, several recommendations for future works are presented to further improve the performance of the potential fishing zone models, which is important to the fisheries community.
Electrical signal interference minimization using appropriate core material f...IJECEIAES
As demand for smaller, quicker, and more powerful devices rises, Moore's law is strictly followed. The industry has worked hard to make little devices that boost productivity. The goal is to optimize device density. Scientists are reducing connection delays to improve circuit performance. This helped them understand three-dimensional integrated circuit (3D IC) concepts, which stack active devices and create vertical connections to diminish latency and lower interconnects. Electrical involvement is a big worry with 3D integrates circuits. Researchers have developed and tested through silicon via (TSV) and substrates to decrease electrical wave involvement. This study illustrates a novel noise coupling reduction method using several electrical involvement models. A 22% drop in electrical involvement from wave-carrying to victim TSVs introduces this new paradigm and improves system performance even at higher THz frequencies.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Bibliometric analysis highlighting the role of women in addressing climate ch...IJECEIAES
Fossil fuel consumption increased quickly, contributing to climate change
that is evident in unusual flooding and draughts, and global warming. Over
the past ten years, women's involvement in society has grown dramatically,
and they succeeded in playing a noticeable role in reducing climate change.
A bibliometric analysis of data from the last ten years has been carried out to
examine the role of women in addressing the climate change. The analysis's
findings discussed the relevant to the sustainable development goals (SDGs),
particularly SDG 7 and SDG 13. The results considered contributions made
by women in the various sectors while taking geographic dispersion into
account. The bibliometric analysis delves into topics including women's
leadership in environmental groups, their involvement in policymaking, their
contributions to sustainable development projects, and the influence of
gender diversity on attempts to mitigate climate change. This study's results
highlight how women have influenced policies and actions related to climate
change, point out areas of research deficiency and recommendations on how
to increase role of the women in addressing the climate change and
achieving sustainability. To achieve more successful results, this initiative
aims to highlight the significance of gender equality and encourage
inclusivity in climate change decision-making processes.
Voltage and frequency control of microgrid in presence of micro-turbine inter...IJECEIAES
The active and reactive load changes have a significant impact on voltage
and frequency. In this paper, in order to stabilize the microgrid (MG) against
load variations in islanding mode, the active and reactive power of all
distributed generators (DGs), including energy storage (battery), diesel
generator, and micro-turbine, are controlled. The micro-turbine generator is
connected to MG through a three-phase to three-phase matrix converter, and
the droop control method is applied for controlling the voltage and
frequency of MG. In addition, a method is introduced for voltage and
frequency control of micro-turbines in the transition state from gridconnected mode to islanding mode. A novel switching strategy of the matrix
converter is used for converting the high-frequency output voltage of the
micro-turbine to the grid-side frequency of the utility system. Moreover,
using the switching strategy, the low-order harmonics in the output current
and voltage are not produced, and consequently, the size of the output filter
would be reduced. In fact, the suggested control strategy is load-independent
and has no frequency conversion restrictions. The proposed approach for
voltage and frequency regulation demonstrates exceptional performance and
favorable response across various load alteration scenarios. The suggested
strategy is examined in several scenarios in the MG test systems, and the
simulation results are addressed.
Enhancing battery system identification: nonlinear autoregressive modeling fo...IJECEIAES
Precisely characterizing Li-ion batteries is essential for optimizing their
performance, enhancing safety, and prolonging their lifespan across various
applications, such as electric vehicles and renewable energy systems. This
article introduces an innovative nonlinear methodology for system
identification of a Li-ion battery, employing a nonlinear autoregressive with
exogenous inputs (NARX) model. The proposed approach integrates the
benefits of nonlinear modeling with the adaptability of the NARX structure,
facilitating a more comprehensive representation of the intricate
electrochemical processes within the battery. Experimental data collected
from a Li-ion battery operating under diverse scenarios are employed to
validate the effectiveness of the proposed methodology. The identified
NARX model exhibits superior accuracy in predicting the battery's behavior
compared to traditional linear models. This study underscores the
importance of accounting for nonlinearities in battery modeling, providing
insights into the intricate relationships between state-of-charge, voltage, and
current under dynamic conditions.
Smart grid deployment: from a bibliometric analysis to a surveyIJECEIAES
Smart grids are one of the last decades' innovations in electrical energy.
They bring relevant advantages compared to the traditional grid and
significant interest from the research community. Assessing the field's
evolution is essential to propose guidelines for facing new and future smart
grid challenges. In addition, knowing the main technologies involved in the
deployment of smart grids (SGs) is important to highlight possible
shortcomings that can be mitigated by developing new tools. This paper
contributes to the research trends mentioned above by focusing on two
objectives. First, a bibliometric analysis is presented to give an overview of
the current research level about smart grid deployment. Second, a survey of
the main technological approaches used for smart grid implementation and
their contributions are highlighted. To that effect, we searched the Web of
Science (WoS), and the Scopus databases. We obtained 5,663 documents
from WoS and 7,215 from Scopus on smart grid implementation or
deployment. With the extraction limitation in the Scopus database, 5,872 of
the 7,215 documents were extracted using a multi-step process. These two
datasets have been analyzed using a bibliometric tool called bibliometrix.
The main outputs are presented with some recommendations for future
research.
Use of analytical hierarchy process for selecting and prioritizing islanding ...IJECEIAES
One of the problems that are associated to power systems is islanding
condition, which must be rapidly and properly detected to prevent any
negative consequences on the system's protection, stability, and security.
This paper offers a thorough overview of several islanding detection
strategies, which are divided into two categories: classic approaches,
including local and remote approaches, and modern techniques, including
techniques based on signal processing and computational intelligence.
Additionally, each approach is compared and assessed based on several
factors, including implementation costs, non-detected zones, declining
power quality, and response times using the analytical hierarchy process
(AHP). The multi-criteria decision-making analysis shows that the overall
weight of passive methods (24.7%), active methods (7.8%), hybrid methods
(5.6%), remote methods (14.5%), signal processing-based methods (26.6%),
and computational intelligent-based methods (20.8%) based on the
comparison of all criteria together. Thus, it can be seen from the total weight
that hybrid approaches are the least suitable to be chosen, while signal
processing-based methods are the most appropriate islanding detection
method to be selected and implemented in power system with respect to the
aforementioned factors. Using Expert Choice software, the proposed
hierarchy model is studied and examined.
Enhancing of single-stage grid-connected photovoltaic system using fuzzy logi...IJECEIAES
The power generated by photovoltaic (PV) systems is influenced by
environmental factors. This variability hampers the control and utilization of
solar cells' peak output. In this study, a single-stage grid-connected PV
system is designed to enhance power quality. Our approach employs fuzzy
logic in the direct power control (DPC) of a three-phase voltage source
inverter (VSI), enabling seamless integration of the PV connected to the
grid. Additionally, a fuzzy logic-based maximum power point tracking
(MPPT) controller is adopted, which outperforms traditional methods like
incremental conductance (INC) in enhancing solar cell efficiency and
minimizing the response time. Moreover, the inverter's real-time active and
reactive power is directly managed to achieve a unity power factor (UPF).
The system's performance is assessed through MATLAB/Simulink
implementation, showing marked improvement over conventional methods,
particularly in steady-state and varying weather conditions. For solar
irradiances of 500 and 1,000 W/m2
, the results show that the proposed
method reduces the total harmonic distortion (THD) of the injected current
to the grid by approximately 46% and 38% compared to conventional
methods, respectively. Furthermore, we compare the simulation results with
IEEE standards to evaluate the system's grid compatibility.
Enhancing photovoltaic system maximum power point tracking with fuzzy logic-b...IJECEIAES
Photovoltaic systems have emerged as a promising energy resource that
caters to the future needs of society, owing to their renewable, inexhaustible,
and cost-free nature. The power output of these systems relies on solar cell
radiation and temperature. In order to mitigate the dependence on
atmospheric conditions and enhance power tracking, a conventional
approach has been improved by integrating various methods. To optimize
the generation of electricity from solar systems, the maximum power point
tracking (MPPT) technique is employed. To overcome limitations such as
steady-state voltage oscillations and improve transient response, two
traditional MPPT methods, namely fuzzy logic controller (FLC) and perturb
and observe (P&O), have been modified. This research paper aims to
simulate and validate the step size of the proposed modified P&O and FLC
techniques within the MPPT algorithm using MATLAB/Simulink for
efficient power tracking in photovoltaic systems.
Adaptive synchronous sliding control for a robot manipulator based on neural ...IJECEIAES
Robot manipulators have become important equipment in production lines, medical fields, and transportation. Improving the quality of trajectory tracking for
robot hands is always an attractive topic in the research community. This is a
challenging problem because robot manipulators are complex nonlinear systems
and are often subject to fluctuations in loads and external disturbances. This
article proposes an adaptive synchronous sliding control scheme to improve trajectory tracking performance for a robot manipulator. The proposed controller
ensures that the positions of the joints track the desired trajectory, synchronize
the errors, and significantly reduces chattering. First, the synchronous tracking
errors and synchronous sliding surfaces are presented. Second, the synchronous
tracking error dynamics are determined. Third, a robust adaptive control law is
designed,the unknown components of the model are estimated online by the neural network, and the parameters of the switching elements are selected by fuzzy
logic. The built algorithm ensures that the tracking and approximation errors
are ultimately uniformly bounded (UUB). Finally, the effectiveness of the constructed algorithm is demonstrated through simulation and experimental results.
Simulation and experimental results show that the proposed controller is effective with small synchronous tracking errors, and the chattering phenomenon is
significantly reduced.
Remote field-programmable gate array laboratory for signal acquisition and de...IJECEIAES
A remote laboratory utilizing field-programmable gate array (FPGA) technologies enhances students’ learning experience anywhere and anytime in embedded system design. Existing remote laboratories prioritize hardware access and visual feedback for observing board behavior after programming, neglecting comprehensive debugging tools to resolve errors that require internal signal acquisition. This paper proposes a novel remote embeddedsystem design approach targeting FPGA technologies that are fully interactive via a web-based platform. Our solution provides FPGA board access and debugging capabilities beyond the visual feedback provided by existing remote laboratories. We implemented a lab module that allows users to seamlessly incorporate into their FPGA design. The module minimizes hardware resource utilization while enabling the acquisition of a large number of data samples from the signal during the experiments by adaptively compressing the signal prior to data transmission. The results demonstrate an average compression ratio of 2.90 across three benchmark signals, indicating efficient signal acquisition and effective debugging and analysis. This method allows users to acquire more data samples than conventional methods. The proposed lab allows students to remotely test and debug their designs, bridging the gap between theory and practice in embedded system design.
Detecting and resolving feature envy through automated machine learning and m...IJECEIAES
Efficiently identifying and resolving code smells enhances software project quality. This paper presents a novel solution, utilizing automated machine learning (AutoML) techniques, to detect code smells and apply move method refactoring. By evaluating code metrics before and after refactoring, we assessed its impact on coupling, complexity, and cohesion. Key contributions of this research include a unique dataset for code smell classification and the development of models using AutoGluon for optimal performance. Furthermore, the study identifies the top 20 influential features in classifying feature envy, a well-known code smell, stemming from excessive reliance on external classes. We also explored how move method refactoring addresses feature envy, revealing reduced coupling and complexity, and improved cohesion, ultimately enhancing code quality. In summary, this research offers an empirical, data-driven approach, integrating AutoML and move method refactoring to optimize software project quality. Insights gained shed light on the benefits of refactoring on code quality and the significance of specific features in detecting feature envy. Future research can expand to explore additional refactoring techniques and a broader range of code metrics, advancing software engineering practices and standards.
Smart monitoring technique for solar cell systems using internet of things ba...IJECEIAES
Rapidly and remotely monitoring and receiving the solar cell systems status parameters, solar irradiance, temperature, and humidity, are critical issues in enhancement their efficiency. Hence, in the present article an improved smart prototype of internet of things (IoT) technique based on embedded system through NodeMCU ESP8266 (ESP-12E) was carried out experimentally. Three different regions at Egypt; Luxor, Cairo, and El-Beheira cities were chosen to study their solar irradiance profile, temperature, and humidity by the proposed IoT system. The monitoring data of solar irradiance, temperature, and humidity were live visualized directly by Ubidots through hypertext transfer protocol (HTTP) protocol. The measured solar power radiation in Luxor, Cairo, and El-Beheira ranged between 216-1000, 245-958, and 187-692 W/m 2 respectively during the solar day. The accuracy and rapidity of obtaining monitoring results using the proposed IoT system made it a strong candidate for application in monitoring solar cell systems. On the other hand, the obtained solar power radiation results of the three considered regions strongly candidate Luxor and Cairo as suitable places to build up a solar cells system station rather than El-Beheira.
An efficient security framework for intrusion detection and prevention in int...IJECEIAES
Over the past few years, the internet of things (IoT) has advanced to connect billions of smart devices to improve quality of life. However, anomalies or malicious intrusions pose several security loopholes, leading to performance degradation and threat to data security in IoT operations. Thereby, IoT security systems must keep an eye on and restrict unwanted events from occurring in the IoT network. Recently, various technical solutions based on machine learning (ML) models have been derived towards identifying and restricting unwanted events in IoT. However, most ML-based approaches are prone to miss-classification due to inappropriate feature selection. Additionally, most ML approaches applied to intrusion detection and prevention consider supervised learning, which requires a large amount of labeled data to be trained. Consequently, such complex datasets are impossible to source in a large network like IoT. To address this problem, this proposed study introduces an efficient learning mechanism to strengthen the IoT security aspects. The proposed algorithm incorporates supervised and unsupervised approaches to improve the learning models for intrusion detection and mitigation. Compared with the related works, the experimental outcome shows that the model performs well in a benchmark dataset. It accomplishes an improved detection accuracy of approximately 99.21%.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
Rainfall intensity duration frequency curve statistical analysis and modeling...bijceesjournal
Using data from 41 years in Patna’ India’ the study’s goal is to analyze the trends of how often it rains on a weekly, seasonal, and annual basis (1981−2020). First, utilizing the intensity-duration-frequency (IDF) curve and the relationship by statistically analyzing rainfall’ the historical rainfall data set for Patna’ India’ during a 41 year period (1981−2020), was evaluated for its quality. Changes in the hydrologic cycle as a result of increased greenhouse gas emissions are expected to induce variations in the intensity, length, and frequency of precipitation events. One strategy to lessen vulnerability is to quantify probable changes and adapt to them. Techniques such as log-normal, normal, and Gumbel are used (EV-I). Distributions were created with durations of 1, 2, 3, 6, and 24 h and return times of 2, 5, 10, 25, and 100 years. There were also mathematical correlations discovered between rainfall and recurrence interval.
Findings: Based on findings, the Gumbel approach produced the highest intensity values, whereas the other approaches produced values that were close to each other. The data indicates that 461.9 mm of rain fell during the monsoon season’s 301st week. However, it was found that the 29th week had the greatest average rainfall, 92.6 mm. With 952.6 mm on average, the monsoon season saw the highest rainfall. Calculations revealed that the yearly rainfall averaged 1171.1 mm. Using Weibull’s method, the study was subsequently expanded to examine rainfall distribution at different recurrence intervals of 2, 5, 10, and 25 years. Rainfall and recurrence interval mathematical correlations were also developed. Further regression analysis revealed that short wave irrigation, wind direction, wind speed, pressure, relative humidity, and temperature all had a substantial influence on rainfall.
Originality and value: The results of the rainfall IDF curves can provide useful information to policymakers in making appropriate decisions in managing and minimizing floods in the study area.
Design and optimization of ion propulsion dronebjmsejournal
Electric propulsion technology is widely used in many kinds of vehicles in recent years, and aircrafts are no exception. Technically, UAVs are electrically propelled but tend to produce a significant amount of noise and vibrations. Ion propulsion technology for drones is a potential solution to this problem. Ion propulsion technology is proven to be feasible in the earth’s atmosphere. The study presented in this article shows the design of EHD thrusters and power supply for ion propulsion drones along with performance optimization of high-voltage power supply for endurance in earth’s atmosphere.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
2. Int J Elec & Comp Eng ISSN: 2088-8708
Discrete penguins search optimization algorithm to solve flow shop scheduling problem (Ilyass Mzili)
4427
case. Recently, this algorithm has been used to solve discrete problems [18-20] because of the satisfied
results in the continuous case.
In this paper, we propose an adaptation of PeSOA algorithm to solve FSSP. In this one, we adapt
the parameters values and operators PeSOA to find good-quality solutions. The performance of PeSOA
algorithm evaluated by a test on a set of benchmarks of FSSP from the OR-Library of various sizes and
a comparison with other métaheuristics. The organizational structure of this paper as follows: The second
section is contains a short description of flow shop scheduling problem.In the third section PeSOA algorithm
are presented.In the fourth section,adaptation of PeSOA to solve the FSSP. The experimental results and
discussion in the fifth section. Finally, a conclusion and perspectives.
2. FLOW SHOP SCHEDULING PROBLEM SEARCH
2.1. Presentation
The FSSP is an important issue in production scheduling. This problem was first proposed in 1954
by Johnson [21] and classified as a NP-hard problem. The FSSP is described by a set n jobs J = {1,..., n} not
related, must be treated in m machines in M = {1,..., m}. Each job j contains a sequence of operations
O = {Oji, j ∈ {1,..., n} and i ∈ {1,..., m}} which have been executed in a given order. Following this order,
each operation Oij must be performed on a specified machine k for a specified time Pijk. Each machine can
only process one job at a time, and each job has to go through each machine once and only once. The FSSP
consists in finding a schedule to perform operations on the machines that minimizes the Cmax (makespan),
ie the time required to perform all jobs.
2.2. Formulation
FSSP are often designated by the 𝑚, n, π and 𝐶max symbols where 𝑛 represents the number of jobs;
𝑚 is the number of machines, π = (𝑗1, 𝑗2... 𝑗 𝑛) is a planning permutation of all jobs and 𝐶max is the makespan.
Let t (𝑖, 𝑗) (1 ≤ 𝑖 ≤ 𝑛, 1 ≤ 𝑗 ≤ m) the processing times of job 𝑖 on the machine 𝑗, assuming that the preparation
time for each job is zero or included in the working time treatment, ; π = (𝑗1, 𝑗2, ..., 𝑗n) is a planning
permutation of all jobs. Π is the overall planning of permutation. 𝐶 (𝑗𝑖, 𝑘) is the completion time of the job 𝑗𝑖
on the machine 𝑘.The completion time of the flow shop problem planning π = (𝑗1, 𝑗2, ..., 𝑗 𝑛) is illustrated
as follows :
𝐶(𝑗1, 1) = 𝑡(𝑗1, 1), (1)
𝐶(𝑗𝑖, 1) = 𝐶(𝑗𝑖−1, 1) + 𝑡(𝑗𝑖, 1), 𝑖 = 2, 3,…, 𝑛, (2)
𝐶(𝑗1, 𝑘) = 𝐶(𝑗1, 𝑘 − 1) + 𝑡(𝑗1, 𝑘), 𝑘 = 2, 3, …, 𝑚, (3)
𝐶(𝑗𝑖, 𝑘) = max{𝐶(𝑗𝑖−1, 𝑘), 𝐶(𝑗𝑖, 𝑘 − 1)} + 𝑡(𝑗1, 𝑘), 𝑖 = 2, 3, 𝑛, 𝑘 = 2, 3, . . . , 𝑚, (4)
𝜋∗ = arg {𝐶max (𝜋) = 𝐶 (𝑗𝑛, 𝑚)} → min, ∀𝜋 ∈ Π, (5)
where π * is the most appropriate arrangement which is the purpose of the permutation of flow shop problem
to find 𝐶max (π *) as the minimal component.
We consider the flow shop scheduling problem: in a car paint factory. We calculated the duration of
painting of two cars (jobs), knowing that car painting is a sequence of two operations, degreasing and
painting (machines). The Figure 1 presents the time required to degrease and paint the two cars 1 and 2.
The problem data is two jobs, two machine and the completion time of each job on each machine.
The optimal problem solution is car2 - car1, the completion time (Cmax) is 12. The Figure 2 shows the use of
a gantt chart to calculate the completion time and the planning the implementation of the solution.
Degreasing Painting
Car1 5 3
Car2 4 4
Figure 1. The processing time of the cars paint
3. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 10, No. 4, August 2020 : 4426 - 4435
4428
TASK NAME TIME
1 2 3 4 5 6 7 8 9 10 11 12
Degreasing Car2 Car1
Painting Car2 Car1
Figure 2. Gantt chart
3. PeSOA ALGORITHM
The PeSOA algorithm is a new metaheuristic [22] nature-inspired based on the collaborative
hunting behavior of penguins. The hunting strategy of penguins base on collaborate their efforts and
synchronize their dives to optimize the global energy in the process of collective hunting and nutrition.
Penguins divide into groups to start hunting. As penguins eat fish, they are diving to harvest food until
oxygen reserves are depleted.
The hunting strategy of penguins; each group of penguins starts searching in a specific position and
random levels, the penguin of each group looks for foods in random way and individually in its group,
and after an approximate number of dives, the penguins get back on the ice to share with its affiliates.
If the amount of food in a position is not enough for the group, part of the group migrates to another position.
The group that ate the most fish gives us the location of the rich food represented by the hole and the level.
The PeSOA algorithm is performed through a set of penguin population (random initial solutions).
In the next step, the amount of fish consumed is the objective function related to each member of
the population. The optimal value of the objective function presented the location where there is a large
amount of food, which was granted by the groups. To find a location of enough food (best solutions),
penguins move to a new location identified. This movement expressed this formula follows ;
𝑋 𝑛𝑒𝑤 = 𝑋𝑖𝑑 + 𝑟𝑎𝑛𝑑 × |𝑋 𝑏𝑒𝑠𝑡𝑙𝑜𝑐𝑎𝑙 − 𝑋𝑖𝑑| (6)
where rand is a random number for distribution; and we have three solution, Xbestlocal the best local solution,
Xid the last solution and the Xnew is a new solution.The pseudo code of the PeSOA algorithm:
Algorithm 1 : Pseudo-code of PeSOA
1. Generate random population P of the initial solutions
(penguins);
2. Initialize the probability of existence of fish in the
holes-levels;
3. While (the stop condition is not satisfied) do
4. For each i individual of P do
5. While (RO2> 0) do
6. - Take a random step
7. - Improve the penguin position using Eq (6);
8. - Update quantities of fish eaten for this penguin.
9. End while
10. End for
11. Update quantities of eaten fish in the holes-levels.
12. Update the best group.
13. Recalculate the probability of existence of fish in the
holes-levels
14. Update best- solution
15. End while
16. Return best solution.
4. APPLY PeSOA TO FLOW SHOP SCHEDULING PROBLEM
We applied PeSOA on FSSP to improve the results and to show its performance against other
metaheuristics. The PeSOA as all metaheuristics introduced initially for continuous optimization, PeSOA
standard continuous coding scheme cannot be used directly to solve discrete problems like flow shop
problem, we adapt the algorithm parameters and the FSSP solution form in the space and the transition from
the current solution to another one.
4.1. FSSP solution
The position of penguin presents a solution. Therefore, PeSOA considered a penguin in a population
as a solution in the search space. Considering an instance of FSSP, for example Table 1 that contains 4 jobs
and 3 machines, and each job operation is associated with its machine and processing time.
4. Int J Elec & Comp Eng ISSN: 2088-8708
Discrete penguins search optimization algorithm to solve flow shop scheduling problem (Ilyass Mzili)
4429
Table 1. FSSP instance (4×3)
M1 M2 M3
J1 6 1 4
J2 3 6 2
J3 1 2 1
A solution of FSSP instance is a permutation of jobs that can be presented by a series of n integers
(Jobs) S = {1, 2, 3... n}, each integer i in the series is designated the index of job and the order of i in S is
the order of processing of these jobs in each machine. In our example, consider an initial solution of instance
(4.3) 2-1-4-3 which represents the order of processing of the 4 jobs on each machine. For example,
the machines starts processing jobs 2 and ends with jobs 3. Considering Table 1 and the initial solution, we
can design the Gantt chart as shown in Figure 3 of the initial solution (2-1-4-3) to calculate the objective
function (Cmax) of proposed solution. The makespan of the instance solution is 21.
Machines
Time
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
M1 2 1 4 3
M2 2 1 4 3
M3 2 1 4 3
Figure 3. Gantt chart of initial solution 2-1-4-3 (S= (2-1-4-3))
4.2. Position updating of PeSOA
The transition from one solution to another in the search space is an operation based on the notion of
length and topology. The length is designated as the cost of solution, the topology of passage is a technique
performed by the operators of (7)
𝑆 𝑛𝑒𝑤 = 𝑆𝑖𝑑 ⊕ 𝑟𝑎𝑛𝑑 ⊗ (𝑆 𝑏𝑒𝑠𝑡 − 𝑆𝑖𝑑) (7)
where rand is a random number for distribution; and we have three solution, the best local solution (Sbest),
the current solution (Sid) and the new solution (Snew).
The operations in (7) defined as follows:
a) Substruction operation −
An operation between two solutions(scheduling) S1 and S2, which gives a displacement vector Q. in
this way, extracts the permutations applied to the two solutions S2 to obtain S1, for example:
Whether S1 = {j1, j2, j3, j4… jn-1, jn} and S2= {j2, j3, j1, j4… jn, jn-1}
Q= S1 - S2 then Q = {(j1, j2), (j2, j3), …, (jn, jn-1)}
In other words S1 - S2=Q S1⊕Q=S2
b) Addition operation ⊕
An operation between two different variables, a solution S2 and a vector Q, give a solution Snew.
Is an application of the permutations of the vector Q to the solution S2 for obtain a new solution Snew,
for example:
Whether S2 = {j1, j2, j3, j4, j5…, jn} and Q = {(j3,j1),( j4,j3),( j2,j5)}
Snew=S2⊕Q then Snew ={j4, j5, j1, j3, j2,…, jn}
c) Multiplication operation ⊗
An operation between a real number r (r𝜖[0,1]) and displacement vector Q. The main role of this
operation is to reduce the number of permutations of the vector Q according to the value of r. We consider
a displacement vector Q of n couple of permutation
Q= {(c1, c2), (c3, c4), (c5, c6)…, (c2n-1,x2n)} and real number 0≤ r ≤1.
Q’=r×Q Then m=r × n ≤n, Q’ = {(c1, c2), (c3, c4)…, (c2m-1, c2m)}
5. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 10, No. 4, August 2020 : 4426 - 4435
4430
The Figure 4 illustrates the use of the operators of (7) to move it from the current solution SId to
a new solution Snew.
Figure 4. Illustration of PeSOA operators function.
4.3. The PeSOA_ FSSP Algorithm
As any algorithm, the first step in the PeSOA algorithm is to initialize some necessary parameters
for good and efficient operation of the algorithm. In the proposed algorithm, a few parameters are to be set.
Steps of the proposed algorithm (PeSOA) are presented below.
Step 1: Initialization
- Initialize a population size p
- Generate random population P of the initial solutions S (schedules).
- Initialize Ro2 and the global solution Sgbest
Step 2: Calculate completion time (Cmax) for all solutions in P
Step 3: Calculate Sbest the best schedule in p
Step 4: For each solution (schedules), calculate her new version using (7).
Step 5: Improving of population solutions using descent method.
Step 6: Update Sbest and Sgbest as follows:
If (Cmax(Sid) < Cmax (Sbest)) Then
Sbest=Jid.
If (Cmax (Sbest) < Cmax (Sgbest)) Then
Sgbest = Sbest;
Step 7: Stop iterations if stop condition is satisfed.
Return to Step 4, otherwise.
The solution of the problem is the last Sgbest. Figure 5 shows the flowchart of the proposed algorithm.
6. Int J Elec & Comp Eng ISSN: 2088-8708
Discrete penguins search optimization algorithm to solve flow shop scheduling problem (Ilyass Mzili)
4431
Figure 5. Flowchart of the proposed algorithm (PeSOA_FSSP)
5. EXPERIMENTAL RESULTS AND DISCUSSION
In this section, we evaluated the PeSOA by 31 benchmarks instances from the OR-Library [23],
using c langage. The results of this experiment are extracted from a computer with Intel (R) Core (TM) 2
processor Dual CPU 2.00GHz M370@2.40GHZ 2.40 GHz and 4.00 GB of RAM. Each instances is tested 10
times with the program. Experimental results and analysis are divided into three parts. First, in section 1,
we evaluate the effect of important parameters on the proposed algorithm. In section 2, we present
the computational results of the PeSOA algorithm when applied to some instances of the OR-library and final
section; we compare our results with other metaheuristics to study the performance and the efficiency
of PeSOA.
5.1. Parameters of PeSOA_FSSP
The algorithm performance appear in the good setting of the parameters. So, at first we make
a regulation of the values of the key parameters for the obtaining an effective adaptation. The Figure 6 shows
the results of use Hel1 (100 x 10) instance of OR-library to test the effect of parameters PeSOA.
This instance contains 100 jobs for 10-machine.We increase the population size of the algorithm ranging
from 10 to 60, and marked the quality of the solution found. The optimal solution appeared in point 40.
Therefore, we set the population size at 40 for this experiment.
In Figures 7 and 8 we used two instance Hel1(100 x 10) and ReC7 (20 x 10), to find the good value
of parameter RO2. We vary the values of RO2 from 0 to 30 and marks the deviation of the length of
the solution found over the length of the best solution, and time executions.At point 10, we found good
solutions quality in reasonable time. So, the value of Ro2 must be fixed it 10 for this experience.
Cost = length of the solution found − length of the optimal solution (8)
The values of the parameters used in this experiment are shown in Table 2.
7. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 10, No. 4, August 2020 : 4426 - 4435
4432
Figure 6. The impact of increasing the PeSOA population size (M)
Table 2. The Parameters of PeSOA
Parameters Meaning Value
Gene Maximum number of iterations 1000
M Population size 40
RO2 oxygen reserve 10
5.2. Computational results
The numerical results of this adaptation are presented in Table 3. The first column contains
the name of the instance ‘Instance’, the column ‘n×m’ represents n job for m machine. The column ‘BKS’
show the best result proposed by the other algorithms. The column ‘Best’ and ‘Worst’ presents the best
results and the worst results obtained by the application of the PeSOA method for the selected instance.
The columns ‘Average’ contain information on average, the column ‘PDav(%)’ denotes the percentage
deviation of the average of length of solutions found over the length of the optimal solution in 10 runs and
the last column ‘Time’ shows the average execution time in seconds for the 10 runs .
PDav(%) =
BKS−Average
BKS
× 100% (9)
Table 3 presents the computational results of PeSOA algorithm on 31 instances of OR-library.
The column ‘PDav(%)’ which takes the value 0.00 ndicated in bold when all the solutions found in 10 tests
are equal with the length of the best known solution, and the value less than 0.00 in bold-blue, if the average
of solutions found on all the tests is less than the length of the best known solution, in this case the solutions
found are better than the best known solution. the rest; 26% of the values, are less than 0.5%, which means
that the best solution found, on the 10 tests, approximates less than 0.5% of the best-known solution .the 16%
of the values, are more 0.5% , which means that the PeSOA does not reach the best-known solution or near
solution to this solution in the 10 test. The numerical values in Table 3 show that PeSOA is of great ability to
provide high quality solutions in reasonable time.
Figure 7. The impact of changing the value
of RO2 for solutions Hel1 instance
Figure 8. The impact of changing the value
of RO2 for solutions ReC7 instance
8. Int J Elec & Comp Eng ISSN: 2088-8708
Discrete penguins search optimization algorithm to solve flow shop scheduling problem (Ilyass Mzili)
4433
Table 3. Numericals results obtain
Instance m x n BKS Best Worst Average PDav(%) Time(S)
Car1 11 x 5 7038 7038 7038 7038 0.00 0.11
Car2 13 x4 7166 7166 7166 7166 0.00 0.07
Car3 12 x 5 7312 7312 7312 7312 0.00 0.08
Car4 14 x 4 8003 8003 8003 8003 0.00 0.08
Car5 10 x 6 7720 7720 7720 7720 0.00 0.07
Car6 8 x 9 8505 8505 8505 8505 0.00 0.07
Car7 7 x 7 6590 6590 6590 6590 0.00 0.04
Car8 8 x 8 8366 8366 8366 8366 0.00 0.06
Hel1 100 x 10 516 515 516 515,5 -0.09 40.58
Hel2 20 x 10 136 135 136 135,5 -0.36 7.21
ReC1 20 x 5 1247 1247 1247 1247 0.00 0.64
ReC3 20 x 5 1109 1109 1109 1109 0.00 1.17
ReC5 20 x 5 1242 1245 1245 1245 0.24 0.14
ReC7 20 x 10 1566 1566 1566 1566 0.00 2.26
ReC9 20 x 10 1537 1537 1537 1537 0.00 2.19
ReC11 20 x 10 1431 1431 1431 1431 0.00 1.97
ReC13 20 x 15 1930 1930 1936 1933 0.15 9.45
ReC15 20 x 15 1950 1950 1950 1950 0.00 71.58
ReC17 30 x 15 1902 1902 1902 1902 0.00 5.17
ReC19 30 x 10 2093 2099 2099 2099 0.29 17.89
ReC21 30 x 10 2017 2046 2046 2046 1.44 15.45
ReC23 30 x 10 2011 2020 2020 2020 0.45 88.46
ReC25 30 x 15 2513 2525 2530 2527,5 0.57 325.23
ReC27 30 x 15 2373 2379 2384 2381,5 0.36 80.30
ReC29 30 x 15 2287 2298 2298 2298 0.48 439.38
ReC31 50 x 10 3045 3053 3061 3057 0.39 86.88
ReC33 50 x 10 3114 3118 3118 3118 0.13 140.56
ReC35 50 x 10 3277 3277 3277 3277 0.00 04.58
ReC37 75 x 20 4951 5062 5080 5071 2.42 468.70
ReC39 75 x 20 5087 5180 5184 5182 1.86 159.33
ReC41 75 x 20 4960 5079 5118 5098.5 2.79 236.54
5.3. Comparison with other metaheuristic
To further present the performance of the proposed PeSOA, a comparison was made between
the proposed algorithm with results of EM, and GA listed in the work of Yuan, Henequin, Wang, and
Gao (2006) [24] and PSO-EDA in the work of Hongcheng Liu et al. (2011) [25] and GBA in the work
F. Sayoti, M.E.Riffi ) (2016) [26], using different instances of OR-library. The results are listed in Table 4.
Table 4. Comparison of PeSOA with different algorithms: GA, EM, GBA and PSO-EDA
Problem PDav (%)
Instance n × m BKS PeSOA EM GA PSO-EDA GBA
Car1 11 x 5 7038 0 0 0 0 0
Car2 13 x4 7166 0 0 0 0 0
Car3 12 x 5 7312 0 0 1.19 0 0
Car4 14 x 4 8003 0 0 0 0 0
Car5 10 x 6 7720 0 0 0 0 0
Car6 8 x 9 8505 0 0 0 0 0
Car7 7 x 7 6590 0 0 0 0 0
Car8 8 x 8 8366 0 0 0 0 0
Hel1 100 x 10 516 -0.09 - - - 2.9263
Hel2 20 x 10 136 -0.36 - - - 1.7647
Rec1 20 x 5 1247 0 4.41 6.96 0.096 0.1764
Rec3 20 x 5 1109 0 1.98 4.45 0.036 0.252
Rec5 20 x 5 1242 0.24 2.01 3.82 0.242 0.3059
Rec7 20x10 1566 0 3.70 5.31 0 0.8812
Rec9 20x10 1537 0 3.97 4.73 0.202 2.0104
Rec11 20x10 1431 0 4.05 7.39 0.126 2.0614
Rec13 20 x15 1930 0.15 4.87 5.97 0.223 2.0362
Rec15 20 x 15 1950 0 3.79 4.29 0.303 2.3128
Rec17 30 x 15 1902 0 5.57 6.08 0.289 2.3554
Rec19 30 x 10 2093 0.29 5.97 6.07 0.612 2.8858
Rec21 30 x 10 2017 1.44 3.22 6.07 1.408 2.6425
Rec23 30 x 10 2011 0.45 5.97 7.46 0.597 3.0283
9. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 10, No. 4, August 2020 : 4426 - 4435
4434
This comparison is based on the percentage deviation, i.e. the quality of solution found compared
to best-known solution according in OR-library. Which is confirmed by Figure 9 indicating the lower curve
associated with PeSOA. Hence, PeSOA is more appropriate to be adapted to solve FSSP and it can give
good results.
In Table 4, the experimental results of PeSOA algorithm are compared with the results of the EM,
GA, PSO-EDA and GBA methods. these results clearly show that PeSOA outperforms the other EM, GA,
PSO-EDA and GBA algorithms in resolution of all twenty-two tested instances .The proposed PeSOA
algorithm gets
17
22
Best solutions while EM / GA / PSO-EDA / GBA only gets
8
20
/
7
20
/
9
20
/
8
22
of the best solutions
among 22 or 20 instances. Furthermore, we find that the average of PDav (%) for the EM / GA / PSO-EDA /
GBA algorithms is equal to 2,475 / 3,489 /0,206 / 1,165, while our algorithm PeSOA is equal to 0,096.
Figure 9 shows the study of the PDav (%) variation between the PeSOA algorithm and the EM, GA,
PSO-EDA and GBA algorithms for the twelve instances of different sizes. In Figure 9, the lower curve
associated with the PeSOA algorithm is better, in terms of the quality of the solution. This can explained
the performance and efficiency of FSSJ resolution PeSOA algorithm in terms of the quality of
the solutions found.
Figure 9. The percentage deviation for the PeSOA and other metaheuristics
6. CONCLUSION
In this paper, we proposed a swarm-intelligence algorithm, so-called PeSOA to solve flow shop
scheduling problem. This adaptation consists of adding a set of changes to the standard version of PeSOA
regarding position representation and its update equation, as well as the operators of this equation. Besides,
a local search mechanism was used to improve research strategy. The PeSOA algorithm was applied on a set
of benchmark instances of FSSP from the OR-Library. It has been shown that the effectiveness as well as
performance of PeSOA, has reached that of the other techniques such as GA, EM, GBA and PSO-EDA in
terms of the quality of solutions and the computing time. Future work is to extend the PeSOA application for
other combinatorial optimization problems such as other scheduling models, logistic network models, vehicle
routing models, etc. We will also try to improve the PeSOA algorithm in order to obtain even better results
by hybridization with other methods or by modifications of the parameters or the algorithm operators.
REFERENCES
[1] N. Gupta, et al., "Flowshop scheduling research after five decades," European Journal of Operational Research,
vol. 169, no. 3, pp. 699-711, 2006.
[2] M. R. Garey, et al., "The complexity of flowshop and jobshop scheduling," Mathematics of operations research,
vol. 1, no. 2, pp. 117-129, 1976.
[3] Y. Saji, et al., "Discrete bat-inspired algorithm for travelling salesman problem," In Second World Conference on
Complex Systems, 2014. WCCS 2014, IEEE, pp. 28-31, 2014.
10. Int J Elec & Comp Eng ISSN: 2088-8708
Discrete penguins search optimization algorithm to solve flow shop scheduling problem (Ilyass Mzili)
4435
[4] M.E. Riffi, et al., "Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in
a discrete bat algorithm to solve the quadratic assignment problem," Egyptian Informatics Journal, vol. 18,
pp. 221–232, 2017.
[5] X. H. Shi, et al., "Particle swarm optimization-based algorithms for TSP and generalized TSP," Information
processing letters, vol. 103, no. 5, pp. 169-176, 2007.
[6] D. Karaboga and B. Gorkemli, " A combinatorial artificial bee colony algorithm for traveling salesman problem,"
In International Symposium on Innovations in Intelligent Systems and Applications, 2011. IEEE, pp. 50-53, 2011.
[7] A. Bouzidi, and M. E. Riffi, "Improved CSO to Solve the TSP," In International Conference on Advanced
Intelligent Systems for Sustainable Development, 2018. Springer, Cham, pp. 252-260, 2018.
[8] A. Bouzidi, et al., "Cat swarm optimization for solving the open shop scheduling problem," Journal of Industrial
Engineering International, vol. 15, no. 2, pp. 367-378, 2019.
[9] A. Agharghor, et al., "Improved hunting search algorithm for the quadratic assignment problem," Indonesian
Journal of Electrical Engineering and Computer Science (IJEECS), vol. 14, no. 1, pp. 143-154, 2019.
[10] A. Hossam, et al., "Elephants herding optimization for solving the travelling salesman problem," In International
Conference on Advanced Intelligent Systems for Sustainable Development, Springer, Cham, pp. 122-130, 2018.
[11] S. Bouzidi, and M. E. Riffi, "Discrete swallow swarm optimization algorithm for travelling salesman problem,"
In Proceedings of the 2017 International Conference on Smart Digital Environment, ACM, pp. 80-84, 2017.
[12] F. Sayoti, et al., "Optimization of makespan in job shop scheduling problem by golden ball algorithm," Indonesian
Journal of Electrical Engineering and Computer Science (IJEECS), vol. 4, no. 3, pp. 542-547, 2016.
[13] K. Ruttanateerawichien, et al., "An improved golden ball algorithm for the capacitated vehicle routing problem,"
In Bio-Inspired Computing-Theories and Applications. Springer, Berlin, Heidelberg, pp. 341-356, 2014.
[14] A. Ouaarab, et al., "Discrete cuckoo search algorithm for the travelling salesman Problem," Neural Computing and
Applications, vol. 24, no. 7-8, pp. 1659-1669, 2014.
[15] S.C.B. Semlali, et al., "Parallel hybrid chicken swarm optimization for solving the quadratic assignment problem,"
International Journal of Electrical and Computer Engineering (IJECE), vol. 9, no. 3, pp. 2064-2074, 2019.
[16] H. Ye, et al., "An Improved Chicken Swarm Optimization for TSP," in International Conference on Applications
and Techniques in Cyber Security and Intelligence. Springer, Cham, pp. 211-220, 2019.
[17] D. P. Samdean, et al., "Flower Pollination Algorithm (FPA) to Solve Quadratic Assignment Problem (QAP)
," Contemporary Mathematics and Applications, vol. 1, no. 2, pp. 58-67, 2019.
[18] I. Mzili and M.E. Riffi, "Discrete penguins search optimization algorithm to solve the traveling salesman problem,"
Journal of Theoretical & Applied Information Technology, vol. 72, no. 3, 2015.
[19] I. Mzili, et al., "Hybrid Penguins Search Optimization Algorithm and Genetic Algorithm Solving Traveling
Salesman Problem," In International Conference on Advanced Information Technology, Services and Systems,
Springer, Cham, pp. 461-473, 2017.
[20] I. Mzili, et al., "Penguins search optimization algorithm to solve quadratic assignment problem," In Proceedings of
the 2nd international Conference on Big Data, Cloud and Applications, 2017, BDCA'17. ACM, pp. 1-6, 2017.
[21] S. M. Johnson, "Optimal two‐and three‐stage production schedules with setup times included," Naval research
logistics quarterly, vol. 1, pp. 61-68, 1954.
[22] Y. Gheraibia, and A. Moussaoui, "Penguins search optimization algorithm (PeSOA)," In International Conference
on Industrial, Engineering and Other Applications of Applied Intelligent Systems, 2013, Berlin 2013, Springer
Heidelberg, pp. 222-231, 2013.
[23] J.E. Beasley, "OR-Library: distributing test problems by electronic mail," Journal of the operational research
society, vol. 41, pp. 1069-1072, 1990.
[24] K.Yuan, et al., "A new heuristic-EM for permutation flowshop scheduling," IFAC Proceedings Volumes, vol. 39,
pp. 33-38, 2006.
[25] H. Liu, et al., "A hybrid particle swarm optimization with estimation of distribution algorithm for solving
permutation flowshop scheduling problem," Expert Systems with Applications, vol. 38, pp. 4348-4360, 2011.
[26] F. Sayoti, and M.E. Riffi, "Golden ball algorithm for solving flow shop scheduling problem," The International
Journal of Interactive Multimedia and Artificial Intelligence, vol. 4, no. 1, pp. 15-18, 2016.