5,691 research outputs found
Weighted Multi-Skill Resource Constrained Project Scheduling: A Greedy and Parallel Scheduling Approach
This study addresses the Weighted Multi-Skill Resource Constrained Project Scheduling Problem (W-MSRCSPSP) with the aim of minimizing software project makespan. Unlike previous works, our investigation regards heterogeneous resources characterized by varying skill proficiency levels. Another major problem with existing methodologies is the potential underutilization of human resources due to varying task durations. This work introduces an innovative scheduling approach known as the Greedy and Parallel Scheduling (GPS) algorithm to handle the said issues. GPS focuses on assigning the most suitable resources available to project activities at each scheduling point. The fundamental goal of our proposed approach is to reduce resource wastage while efficiently allocating surplus resources, if any, to project tasks, ultimately leading to a decrease in the makespan. To empirically evaluate the efficacy of the GPS algorithm, we conduct a comparative analysis against the Parallel Scheduling Scheme (PSS). The advantage of our proposed approach lies in its ability to optimize the utilization of available resources, resulting in accelerated project completion. Results from extensive simulations substantiate this claim, demonstrating that the GPS scheme outperforms the PSS approach in minimizing project duration
Robust multi-machine power system stabilizer design using bio-inspired optimization techniques and their comparison
DATA AVAILABILITY : Data will be made available on request.This paper reports a comparative study among four bio-inspired meta-heuristic techniques i.e. Sooty-Tern Optimization (STO), Grey Wolf Optimization (GWO), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO) to tune the robust Power System Stabilizer (PSS) parameters of the multi-machine power system. These approaches are successfully tested on two bench-mark systems: sixteen-machine, sixty-eight-bus New England Extended Power Grid (NEEPG) and three-machine, nine-bus Western System Coordinating Council (WSCC). The efficacy of planned PSS via STO and GWO is validated by extensive non-linear simulations, eigenvalue analysis, and performance indices for numerous operating conditions under decisive perturbations, and outcomes are matched with those of GA and PSO techniques. In addition, the robustness is also tested for these algorithms. The results indicate that the PSS design using STO and GWO improves the small-signal stability and damping performance for mitigating inter-area and local area modes of low-frequency oscillations compared to GA and PSO.https://www.elsevier.com/locate/ijepeshj2024Electrical, Electronic and Computer EngineeringSDG-07:Affordable and clean energ
A dynamic hierarchical partition method for optimal power balance of urban power system with high renewables
With the development of new urban power systems, the centralized-distributed hierarchical partition management architecture has gradually become a consensus. Existing hierarchical partition methods are mostly static. And if the partition results are determined, it will remain unchanged for a relatively long time. However, the new type power system experiences more frequent and larger fluctuations in power generation and load, requiring dynamic responses to the system’s real-time operation. In this case, traditional partition methods are no longer applicable, and new hierarchical partition methods for system operation need to be adopted. Therefore, this paper proposes a power balance mechanism of urban power system based on dynamic hierarchical partition method, including dynamic hierarchical partition method and corresponding decoupling power balance models. The former can continuously change the results of hierarchical partition according to the real-time state of the power system, so as to reduce the inter-regional liaison cost and improve the economy. The latter improves the independence of the region and the security of the power system through decoupling power balance. Eventually, the proposed method is validated with an modified Hawaii 37-node system
Optimal Design of Steel Structures Using Innovative Black Widow Algorithm Hybridized with Greedy Sensitivity-Based Particle Swarm Optimization Technique
This paper presents a Greedy Sensitivity-based analysis implemented on the Particle Swarm Optimization search engine (GSPSO). The effectiveness of the method focuses mainly on providing an intelligent population to enter meta-heuristic algorithms. As a meta-heuristic method in the second stage, the recently introduced Black Widow Optimization (BWO) algorithm was selected and improved by the authors. It is based on three operators: cannibalism, crossover, and mutation, whose main stage is Cannibalism. The advantage of this stage is that those designs that do not match the solutions close to the global optimal are eliminated, and the more effective solutions remain. To examine the proposed approach, five optimization examples, including three two-dimensional benchmark frames and two three-dimensional structures, have been used. The results show that the greedy sensitivity-based PSO technique can improve computational efficiency in solving discrete variable structural optimization problems. The hybridized BWO (BGP) with this technique was able to obtain very good results in terms of convergence speed and performance accuracy. Overall, compared to the performance of BWO, between 50 and 75% improvement in the total number of analyzes was achieved. In addition, a slight improvement in the weight of the evaluated structures was also reported. Compared to other hybrid algorithms, very competitive and promising results were obtained
Optimization of Nursing Scheduling in Emergency by Using Genetic Algorithm
Scheduling nurse duty is one of the problems in health organizations that is quite complicated to solve. Starting from the uncertain number of patients, serious patient illnesses, characteristics of organizational groups, requests for nurses to take time off, and the qualifications and specialization of the nurses themselves are why scheduling in the ER is difficult to optimize. The same thing is being experienced by one of the health institutions, RSUD Dr. Pirngadi. Preparing schedules or determining the number of nurses on duty is still done manually, resulting in a lack of optimization in scheduling and the number of nurses who must be on duty, especially in the emergency department. In solving this problem, an appropriate method is needed so that the process of scheduling and optimizing the number of nurses can be formed properly. This research applies the Genetic Algorithm in optimal emergency department (IGD) nurse duty scheduling. Genetic algorithms, also called search algorithms, are based on the mechanisms of natural selection and genetics. Genetic algorithms are one of the appropriate methods for solving complex optimization problems. This method is good enough to optimize shift scheduling for the Emergency Room Nursing Service in a Hospital. This Genetic Algorithm can be a solution to multi-criteria and multi-objective problems modeled using biological and evolutionary processes. So, the concept of this method can be applied in optimizing the Nursing Service schedule. The results of calculations using the Genetic Algorithm show quite significant comparisons, including several nurses losing their positions and being eliminated by mutation because they could not compete with several other strong individuals
Construction cost prediction system based on Random Forest optimized by the Bird Swarm Algorithm
Predicting construction costs often involves disadvantages, such as low prediction accuracy, poor promotion value and unfavorable efficiency, owing to the complex composition of construction projects, a large number of personnel, long working periods and high levels of uncertainty. To address these concerns, a prediction index system and a prediction model were developed. First, the factors influencing construction cost were first identified, a prediction index system including 14 secondary indexes was constructed and the methods of obtaining data were presented elaborately. A prediction model based on the Random Forest (RF) algorithm was then constructed. Bird Swarm Algorithm (BSA) was used to optimize RF parameters and thereby avoid the effect of the random selection of RF parameters on prediction accuracy. Finally, the engineering data of a construction company in Xinyu, China were selected as a case study. The case study showed that the maximum relative error of the proposed model was only 1.24%, which met the requirements of engineering practice. For the selected cases, the minimum prediction index system that met the requirement of prediction accuracy included 11 secondary indexes. Compared with classical metaheuristic optimization algorithms (Particle Swarm Optimization, Genetic Algorithms, Tabu Search, Simulated Annealing, Ant Colony Optimization, Differential Evolution and Artificial Fish School), BSA could more quickly determine the optimal combination of calculation parameters, on average. Compared with the classical and latest forecasting methods (Back Propagation Neural Network, Support Vector Machines, Stacked Auto-Encoders and Extreme Learning Machine), the proposed model exhibited higher forecasting accuracy and efficiency. The prediction model proposed in this study could better support the prediction of construction cost, and the prediction results provided a basis for optimizing the cost management of construction projects
A bi-objective hybrid vibration damping optimization model for synchronous flow shop scheduling problems
Flow shop scheduling deals with the determination of the optimal sequence of jobs processing on machines in a fixed order with the main objective consisting of minimizing the completion time of all jobs (makespan). This type of scheduling problem appears in many industrial and production planning applications. This study proposes a new bi-objective mixed-integer programming model for solving the synchronous flow shop scheduling problems with completion time. The objective functions are the total makespan and the sum of tardiness and earliness cost of blocks. At the same time, jobs are moved among machines through a synchronous transportation system with synchronized processing cycles. In each cycle, the existing jobs begin simultaneously, each on one of the machines, and after completion, wait until the last job is completed. Subsequently, all the jobs are moved concurrently to the next machine. Four algorithms, including non-dominated sorting genetic algorithm (NSGA II), multi-objective simulated annealing (MOSA), multi-objective particle swarm optimization (MOPSO), and multi-objective hybrid vibration-damping optimization (MOHVDO), are used to find a near-optimal solution for this NP-hard problem. In particular, the proposed hybrid VDO algorithm is based on the imperialist competitive algorithm (ICA) and the integration of a neighborhood creation technique. MOHVDO and MOSA show the best performance among the other algorithms regarding objective functions and CPU Time, respectively. Thus, the results from running small-scale and medium-scale problems in MOHVDO and MOSA are compared with the solutions obtained from the epsilon-constraint method. In particular, the error percentage of MOHVDO’s objective functions is less than 2% compared to the epsilon-constraint method for all solved problems. Besides the specific results obtained in terms of performance and, hence, practical applicability, the proposed approach fills a considerable gap in the literature. Indeed, even though variants of the aforementioned meta-heuristic algorithms have been largely introduced in multi-objective environments, a simultaneous implementation of these algorithms as well as a compared study of their performance when solving flow shop scheduling problems has been so far overlooked
Unveiling the frontiers of deep learning: innovations shaping diverse domains
Deep learning (DL) enables the development of computer models that are
capable of learning, visualizing, optimizing, refining, and predicting data. In
recent years, DL has been applied in a range of fields, including audio-visual
data processing, agriculture, transportation prediction, natural language,
biomedicine, disaster management, bioinformatics, drug design, genomics, face
recognition, and ecology. To explore the current state of deep learning, it is
necessary to investigate the latest developments and applications of deep
learning in these disciplines. However, the literature is lacking in exploring
the applications of deep learning in all potential sectors. This paper thus
extensively investigates the potential applications of deep learning across all
major fields of study as well as the associated benefits and challenges. As
evidenced in the literature, DL exhibits accuracy in prediction and analysis,
makes it a powerful computational tool, and has the ability to articulate
itself and optimize, making it effective in processing data with no prior
training. Given its independence from training data, deep learning necessitates
massive amounts of data for effective analysis and processing, much like data
volume. To handle the challenge of compiling huge amounts of medical,
scientific, healthcare, and environmental data for use in deep learning, gated
architectures like LSTMs and GRUs can be utilized. For multimodal learning,
shared neurons in the neural network for all activities and specialized neurons
for particular tasks are necessary.Comment: 64 pages, 3 figures, 3 table
Concepts and applications of data mining and analysis of social networks
Social media has become an important reference for information during the last few decades. They have been able to be effective in various fields such as business, entertainment, science, crisis management, politics, etc. For this reason, a social media analysis has become very important for researchers and large companies. The widespread use of social media leads to a complex problem called "accumulation of data". Many data science specialists seek to analyze this data in order to identify the behavioral characteristics of users, analyze interests and needs, and improve marketing processes. Different social media platforms have the ability to use all kinds of media, including text data, video, video, audio, and location information, etc. Therefore, data analysis in social networks is very important. In this research, the concepts and applications of data analysis in social networks will be investigated
- …