3,832 results
Search Results
2. Social and content aware One-Class recommendation of papers in scientific social networks.
- Author
-
Wang, Gang, He, XiRan, and Ishuga, Carolyne Isigi
- Subjects
INFORMATION technology ,SOCIAL networks ,SPARSE graphs ,HYBRID computers (Computer architecture) ,HYBRID power systems - Abstract
With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
3. Social and content aware One-Class recommendation of papers in scientific social networks
- Author
-
Carolyne Isigi Ishuga, XiRan He, and Gang Wang
- Subjects
Optimization ,Computer and Information Sciences ,Computer science ,Science ,Emotions ,lcsh:Medicine ,Social Sciences ,02 engineering and technology ,Research and Analysis Methods ,Social Networking ,Mathematical and Statistical Techniques ,Sociology ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,Collaborative filtering ,Profiling (information science) ,Humans ,Statistical Methods ,Computer Networks ,Cooperative Behavior ,lcsh:Science ,Internet ,Multidisciplinary ,Social Research ,Social network ,business.industry ,Applied Mathematics ,Simulation and Modeling ,lcsh:R ,Publications ,Information technology ,Social Communication ,Data science ,Communications ,Social research ,Social Networks ,Social system ,Physical Sciences ,lcsh:Q ,020201 artificial intelligence & image processing ,The Internet ,business ,Information Technology ,Network Analysis ,Mathematics ,Statistics (Mathematics) ,Algorithms ,Research Article ,Forecasting - Abstract
With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs.
- Published
- 2017
4. A multi-objective optimization model for sustainable supply chain network with using genetic algorithm
- Author
-
Ehtesham Rasi, Reza and Sohanian, Mehdi
- Published
- 2021
- Full Text
- View/download PDF
5. Performance Optimization of the Paper Mill using Opposition based Shuffled frog-leaping algorithm.
- Author
-
Sharma, Tarun K.
- Subjects
PAPER mills ,PARTICLE swarm optimization ,ALGORITHMS ,FORAGING behavior ,INFORMATION sharing - Abstract
Shuffled frog-leaping algorithm (SFLA) is recently introduced memetic algorithm inspired by foraging behavior of frogs. SFLA partially follows particle swarm optimization in local search process and shuffled complex evolution algorithm in performing global search. The key concept about such algorithms is to gain an edge over traditional or deterministic mathematical techniques to achieve comparatively better solutions to the multimodal or multifaceted optimization problems. SFLA embeds the features of both particle swarm optimization (PSO) and shuffled complex evolution (SCE) algorithm. In this study SFLA named as O-SFLA is proposed. In general structure of SFLA, the frogs are divided into memeplexes based on their fitness values where they forage for food. In this study the opposition based learning concept is embedded into the memeplexes before the frog initiates foraging. The proposal is validated on performance optimization of the Paper Mill. [ABSTRACT FROM AUTHOR]
- Published
- 2017
6. An effective teaching-learning-based optimization algorithm for the multi-skill resource-constrained project scheduling problem
- Author
-
Joshi, Dheeraj, Mittal, M.L., Sharma, Milind Kumar, and Kumar, Manish
- Published
- 2019
- Full Text
- View/download PDF
7. RoomTetris: an optimal procedure for committing rooms to reservations in hotels
- Author
-
Battiti, Roberto, Brunato, Mauro, and Battiti, Filippo
- Published
- 2020
- Full Text
- View/download PDF
8. Theoretical analysis and comparative study of top 10 optimization algorithms with DMS algorithm.
- Author
-
Srivani, B., Sandhya, N., and Padmaja Rani, B.
- Subjects
OPTIMIZATION algorithms ,ALGORITHMS ,BIG data ,COMPARATIVE studies - Abstract
The significance of big data are prone to complication in solving optimization issues. In several scenarios, one requires adapting several contradictory goals and satisfies various criterions. This made the research on multi-objective optimization more vital and has become main topic. This paper presents theoretical analysis and comparative study of top ten optimization algorithms with respect to DMS. The performance analysis and study of optimization algorithms in big data streaming are explicated. Here, the top ten algorithms of optimization based on recency and popularity are considered. In addition, the performance analysis based on Efficiency, Reliability, Quality of solution, and superiority of DMS algorithm over other top 10 algorithms are examined. From analysis, the DMS provides better efficiency as it endeavours less computational effort to generate better solution, due to acquisition of both DA and MS algorithm's benefits and DMS takes less time to process a task. Moreover, the DMS needs less number of iterations in the process of optimization and helps to stop optimization process in local optimum. In addition, the DMS has better reliability as it poses the potential to handle specific level of performance. In addition, the DMS utilizes heuristic information for attaining high reliability. Moreover, the DMS produced high computation accuracy, which reveals its solution quality. From the analysis, it is noted that DMS attained improved outcomes in terms of efficiency, reliability and solution quality in contrast to other top 10 optimization algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. Robust optimization model for sustainable supply chain for production and distribution of polyethylene pipe
- Author
-
Valizadeh, Jaber, Sadeh, Ehsan, Amini Sabegh, Zainolabedin, and Hafezalkotob, Ashkan
- Published
- 2020
- Full Text
- View/download PDF
10. AN EFFICIENT ALGORITHM FOR INTEGER LATTICE REDUCTION.
- Author
-
CHARTON, FRANC COIS, LAUTER, KRISTIN, CATHY LI, and TYGERT, MARK
- Subjects
RIESZ spaces ,ALGORITHMS ,NUMBER theory - Abstract
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the problem of finding a set of vectors in a given lattice such that the collection of all integer linear combinations of this subset is still the entire original lattice and so that the Euclidean norms of the subset are reduced. The present paper proposes simple, efficient iterations for lattice reduction which are guaranteed to reduce the Euclidean norms of the basis vectors (the vectors in the subset) monotonically during every iteration. Each iteration selects the basis vector for which projecting off (with integer coefficients) the components of the other basis vectors along the selected vector minimizes the Euclidean norms of the reduced basis vectors. Each iteration projects off the components along the selected basis vector and efficiently updates all information required for the next iteration to select its best basis vector and perform the associated projections. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
11. A Novel IDS with a Dynamic Access Control Algorithm to Detect and Defend Intrusion at IoT Nodes.
- Author
-
Alazab, Moutaz, Awajan, Albara, Alazzam, Hadeel, Wedyan, Mohammad, Alshawi, Bandar, and Alturki, Ryan
- Subjects
INTRUSION detection systems (Computer security) ,ACCESS control ,INTERNET of things ,ALGORITHMS ,FALSE alarms ,MATHEMATICAL analysis - Abstract
The Internet of Things (IoT) is the underlying technology that has enabled connecting daily apparatus to the Internet and enjoying the facilities of smart services. IoT marketing is experiencing an impressive 16.7% growth rate and is a nearly USD 300.3 billion market. These eye-catching figures have made it an attractive playground for cybercriminals. IoT devices are built using resource-constrained architecture to offer compact sizes and competitive prices. As a result, integrating sophisticated cybersecurity features is beyond the scope of the computational capabilities of IoT. All of these have contributed to a surge in IoT intrusion. This paper presents an LSTM-based Intrusion Detection System (IDS) with a Dynamic Access Control (DAC) algorithm that not only detects but also defends against intrusion. This novel approach has achieved an impressive 97.16% validation accuracy. Unlike most of the IDSs, the model of the proposed IDS has been selected and optimized through mathematical analysis. Additionally, it boasts the ability to identify a wider range of threats (14 to be exact) compared to other IDS solutions, translating to enhanced security. Furthermore, it has been fine-tuned to strike a balance between accurately flagging threats and minimizing false alarms. Its impressive performance metrics (precision, recall, and F1 score all hovering around 97%) showcase the potential of this innovative IDS to elevate IoT security. The proposed IDS boasts an impressive detection rate, exceeding 98%. This high accuracy instills confidence in its reliability. Furthermore, its lightning-fast response time, averaging under 1.2 s, positions it among the fastest intrusion detection systems available. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
12. Luigi Moretti’s Formalised Methods and his Use of Mathematics in the Design Process of Architettura Parametrica’s Swimming Stadiums
- Author
-
Canestrino, Giuseppe
- Published
- 2024
- Full Text
- View/download PDF
13. Energy-Efficiency Optimization in IoT Networks: Algorithms, Techniques, and Case Studies.
- Author
-
Nagavelli, Umarani, Dey, Niladri Sekhar, and Kumar Reddy, S. Pavan
- Subjects
SYSTEM downtime ,INTERNET of things ,ALGORITHMS ,ENERGY conservation ,CARBON emissions ,OPERATING costs - Abstract
The exponential growth of Internet of Things (IoT) devices has resulted in an unparalleled surge in the need for energy-efficient strategies to guarantee the sustainability and durability of IoT networks. This study article provides a thorough examination of energyefficiency optimization in Internet of Things (IoT) networks, with a specific emphasis on the creation of algorithms, methodologies, and empirical investigations. The article commences by providing an overview of the significant significance of energy efficiency in Internet of Things (IoT) networks and its direct influence on the lifetime of devices, scalability of networks, and environmental sustainability. This emphasizes the urgent need for inventive approaches to tackle the difficulties presented by resource-limited Internet of Things (IoT) devices. Subsequently, the present study undertakes an in-depth examination of existing methodologies and algorithms for optimizing energy efficiency in Internet of Things (IoT) networks. This paper presents a comprehensive examination of each category, including insights into their respective strengths, limits, and suitability for various Internet of Things (IoT) applications. This study presents innovative algorithms and strategies that are especially developed to improve energy efficiency in Internet of Things (IoT) networks. These advancements use cutting-edge technology such as machine learning, edge computing, and low-power device design. The paper provides comprehensive explanations of these methodologies, accompanied by simulations and performance assessments, to showcase their efficacy in attaining energy conservation while maintaining network dependability and service excellence. The case studies presented provide valuable perspectives on the practical use of energy-efficient technologies, demonstrating their effectiveness in reducing operating expenses, carbon emissions, and system downtime. Moreover, this study aims to discuss the many problems and unresolved research inquiries pertaining to energy-efficient Internet of Things (IoT) networks. The aforementioned points underscore the need for further investigation in several aspects, including scalability challenges, security implications, and standardization efforts. These areas of focus are crucial in order to foster the ongoing expansion and long-term viability of Internet of Things (IoT) ecosystems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
14. Grey wolf optimization based parameter selection for support vector machines
- Author
-
Eswaramoorthy, Sathish, Sivakumaran, N., and Sekaran, Sankaranarayanan
- Published
- 2016
- Full Text
- View/download PDF
15. An Efficient Optimization Approach for Designing Machine Models Based on Combined Algorithm.
- Author
-
Larijani, Ata and Dehghani, Farbod
- Subjects
INTRUSION detection systems (Computer security) ,SUPERVISED learning ,MACHINE design ,SUPPORT vector machines ,ALGORITHMS ,SUBSET selection - Abstract
Many intrusion detection algorithms that use optimization have been developed and are commonly used to detect intrusions. The process of selecting features and the parameters of the classifier are essential parts of how well an intrusion detection system works. This paper provides a detailed explanation and discussion of an improved intrusion detection method for multiclass classification. The proposed solution uses a combination of the modified teaching–learning-based optimization (MTLBO) algorithm, the modified JAYA (MJAYA) algorithm, and a support vector machine (SVM). MTLBO is used with supervised machine learning (ML) to select subsets of features. Selection of the fewest features possible without impairing the accuracy of the results in feature subset selection (FSS) is a multiobjective optimization issue. This paper presents MTLBO as a mechanism and investigates its algorithm-specific, parameter-free idea. This study used the modified JAYA (MJAYA) algorithm to optimize the C and gamma parameters of the support vector machine (SVM) classifier. When the proposed MTLBO-MJAYA-SVM algorithm was compared with the original TLBO and JAYA algorithms on a well-known intrusion detection dataset, it was found to outperform them significantly. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. An improved artificial bee colony algorithm based on whale optimization algorithm for data clustering.
- Author
-
Rahnema, Nouria and Gharehchopogh, Farhad Soleimanian
- Subjects
BEES algorithm ,MATHEMATICAL optimization ,ALGORITHMS ,K-means clustering ,WHALES ,STATISTICS - Abstract
Data clustering is one of the branches of unsupervised learning and it is a process whereby the samples are divided into categories whose members are similar to each other. The K-means algorithm is a simple and fast clustering technique, but it has many initial problems, for example, it depends heavily on the initial value for better clustering. Moreover, it is susceptible to outliers and unbalanced clusters. The artificial bee colony (ABC) algorithm is one of the meta-heuristic algorithms that is used nowadays to solve many optimization problems including clustering and the fundamental problem of this algorithm is exploration and late convergence. In this paper, to solve the problem of exploration and late convergence in ABC are used Random Memory (RM) and Elite Memory (EM) called ABCWOA algorithm. RM in the ABCWOA algorithm has used the search stage for the bait in the whale optimization algorithm (WOA) and EM is also used to increase convergence. In addition, we control the use of EM dynamically. Finally, the proposed method was implemented on ten standard datasets from the UCI Machine Learning Database for evaluation. Moreover, it was compared in terms of statistical criteria and analysis of variance (ANOVA) test with basic ABC and WOA, vortex search (VS) algorithm, butterfly optimization algorithm (BOA), crow search (CS) algorithm, and cuckoo search algorithm (CSA). The simulation results showed that the degree of convergence maintained its performance by increasing the number of repetitions of the proposed method, but the ABC algorithm has shown poor performance by increasing the repetition of performance. ANOVA results also confirmed that the ABCWOA algorithm has a positive effect on the population and it contains less noise than other comparative algorithms. The ABCWOA algorithm show that the ABCWOA algorithm performs better than other meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
17. Pharmacological, Non-Pharmacological Policies and Mutation: An Artificial Intelligence Based Multi-Dimensional Policy Making Algorithm for Controlling the Casualties of the Pandemic Diseases.
- Author
-
Tutsoy, Onder
- Subjects
ARTIFICIAL intelligence ,PANDEMICS ,PARAMETRIC modeling ,ALGORITHMS ,VACCINATION policies ,MULTIDIMENSIONAL databases - Abstract
Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. Sequential Time-Optimal Path-Tracking Algorithm for Robots.
- Author
-
Nagy, Akos and Vajk, Istvan
- Subjects
LINEAR programming ,ROBOTS ,ALGORITHMS ,ROBOT kinematics ,HEURISTIC algorithms ,REINFORCEMENT learning - Abstract
This paper focuses on minimum-time path tracking, a subproblem in motion planning of robotic systems. We generate a time-optimal velocity profile for robotic manipulators taking into account kinematic and dynamic constraints. Based on the special structure of the constraints (called peaked constraints), profile generation is formulated as a linear programming (LP) problem. The LP-based control problem is solved by a sequential optimization method. The presented algorithm has reduced computational time compared to a general LP solver. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
19. Metaheuristic-Based Algorithms for Optimizing Fractional-Order Controllers—A Recent, Systematic, and Comprehensive Review.
- Author
-
Nassef, Ahmed M., Abdelkareem, Mohammad Ali, Maghrabie, Hussein M., and Baroutaji, Ahmad
- Subjects
COST functions ,LITERATURE reviews ,PARTICLE swarm optimization ,ALGORITHMS ,PARAMETER identification ,FRACTIONAL programming ,METAHEURISTIC algorithms - Abstract
Metaheuristic optimization algorithms (MHA) play a significant role in obtaining the best (optimal) values of the system's parameters to improve its performance. This role is significantly apparent when dealing with systems where the classical analytical methods fail. Fractional-order (FO) systems have not yet shown an easy procedure to deal with the determination of their optimal parameters through traditional methods. In this paper, a recent, systematic. And comprehensive review is presented to highlight the role of MHA in obtaining the best set of gains and orders for FO controllers. The systematic review starts by exploring the most relevant publications related to the MHA and the FO controllers. The study is focused on the most popular controllers such as the FO-PI, FO-PID, FO Type-1 fuzzy-PID, and FO Type-2 fuzzy-PID. The time domain is restricted in the articles published through the last decade (2014:2023) in the most reputed databases such as Scopus, Web of Science, Science Direct, and Google Scholar. The identified number of papers, from the entire databases, has reached 850 articles. A Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology was applied to the initial set of articles to be screened and filtered to end up with a final list that contains 82 articles. Then, a thorough and comprehensive study was applied to the final list. The results showed that Particle Swarm Optimization (PSO) is the most attractive optimizer to the researchers to be used in the optimal parameters identification of the FO controllers as it attains about 25% of the published papers. In addition, the papers that used PSO as an optimizer have gained a high citation number despite the fact that the Chaotic Atom Search Optimization (ChASO) is the highest one, but it is used only once. Furthermore, the Integral of the Time-Weighted Absolute Error (ITAE) is the best nominated cost function. Based on our comprehensive literature review, this appears to be the first review paper that systematically and comprehensively addresses the optimization of the parameters of the fractional-order PI, PID, Type-1, and Type-2 fuzzy controllers with the use of MHAs. Therefore, the work in this paper can be used as a guide for researchers who are interested in working in this field. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
20. Logistics Pure Electric Vehicle Routing Based on GA-PSO Algorithm.
- Author
-
Mengqin WANG and Qiyue XIE
- Subjects
ALGORITHMS ,WAREHOUSES ,ELECTRIC vehicles - Abstract
In this paper, with the current practical application in logistics industry as the background, from electric vehicle charging scheduling and path planning, a hybrid algorithm combining genetic-particle swarm algorithm is proposed to plan the best driving route for a group of electric logistics vehicles with vehicle load, vehicle battery life, charging facility location and customer time window as constraints and the total cost as the objective function. Based on the single distribution center, a more complex multi-distribution center electric vehicle path planning problem is considered. In this paper, multiple sets of Solomon VRPTW data sets are selected to test the prepared algorithm, and the results show that the algorithm can effectively plan the best distribution scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
21. Photovoltaic (PV) Parameter Extraction using a Hybrid Algorithm based on Spotted Hyena-Ant Lion Optimization.
- Author
-
Kumar, Parveen, Kumar, Manish, and Bansal, Ajay Kumar
- Subjects
OPTIMIZATION algorithms ,SOLAR cells ,PHOTOVOLTAIC power systems ,ALGORITHMS ,METAHEURISTIC algorithms ,NONLINEAR equations - Abstract
The parameter extraction of Photovoltaic (PV) cell and module is a necessary to simulate and evaluate the performance of the PV system. The parameter extraction is a complex and challenging task due to its non-linear nature. Researchers are used several metaheuristic algorithms to solve the non-linear problem of parameter extraction. However, the demand for most accurate and reliable methods is increasing to get precise estimation of parameters. In this paper, a novel hybrid optimization algorithm is proposed based on the Spotted-Hyena optimization (SHO) and Ant Lion Optimization (ALO). The hybrid method is called as Spotted Hyena - Ant Lion (SH-AL) optimization. The optimization algorithm is applied in two stages. In stage 1, essential parameters are identified and extracted using SHO and passed to stage 2. In stage 2, identified parameters are optimized using ALO for accurate model of PV cell. Different type of PV cells such as thin film, mono and multi crystalline are examined under various irradiance conditions to extract the parameters. The proposed algorithm is validated by comparing the results with other algorithms and proposed algorithm is proved its superiority. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
22. A Modified Tunicate Swarm Algorithm for Engineering Optimization Problems.
- Author
-
Akdağ, Ozan
- Subjects
ENGINEERING design ,BENCHMARK problems (Computer science) ,MATHEMATICAL optimization ,SYSTEMS engineering ,ALGORITHMS - Abstract
Tunicate Swarm Algorithm (TSA) is a new bio-based optimization technique that has proven not only to be able to compete with other methods but has also shown successful performance in classic design engineering problems/benchmark test problems. However, like some population-based methods, TSA tends to be trapped in local optima, converging to global optima in a long time, unbalanced exploitation/exploration, and the inability to effectively solve high-capacity engineering problems. In this paper, the M-TSA, which is a Modified version of the TSA, is proposed to overcome such problems. M-TSA was developed in three steps. The first is the new movement strategy that improves the movement of tunicates with a spiral movement, the second is the new herd strategy that improves the herd movement of tunics with the Levy movement, and the third is the consideration of the FAD effect. In this study, the efficiency and robustness of the M-TSA algorithm is tested on the CEC'17 test suite, six real-life design engineering problems, and two complex power system engineering problems. The test results were compared with other techniques reported in the literature and with the original TSA. Comparing the results from the M-TSA technique with other techniques proves the effectiveness of M-TSA with better exploration/exploitation balance and optimal solution finding. In this paper, MATLAB 2020b software is used for optimization problems simulation. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
23. Applying "Two Heads Are Better Than One" Human Intelligence to Develop Self-Adaptive Algorithms for Ridesharing Recommendation Systems.
- Author
-
Hsieh, Fu-Shiung
- Subjects
RECOMMENDER systems ,EVOLUTIONARY algorithms ,RIDESHARING ,ARTIFICIAL intelligence ,EVOLUTIONARY computation ,SELF-adaptive software ,ALGORITHMS - Abstract
Human beings have created numerous laws, sayings and proverbs that still influence behaviors and decision-making processes of people. Some of the laws, sayings or proverbs are used by people to understand the phenomena that may take place in daily life. For example, Murphy's law states that "Anything that can go wrong will go wrong." Murphy's law is helpful for project planning with analysis and the consideration of risk. Similar to Murphy's law, the old saying "Two heads are better than one" also influences the determination of the ways for people to get jobs done effectively. Although the old saying "Two heads are better than one" has been extensively discussed in different contexts, there is a lack of studies about whether this saying is valid and can be applied in evolutionary computation. Evolutionary computation is an important optimization approach in artificial intelligence. In this paper, we attempt to study the validity of this saying in the context of evolutionary computation approach to the decision making of ridesharing systems with trust constraints. We study the validity of the saying "Two heads are better than one" by developing a series of self-adaptive evolutionary algorithms for solving the optimization problem of ridesharing systems with trust constraints based on the saying, conducting several series of experiments and comparing the effectiveness of these self-adaptive evolutionary algorithms. The new finding is that the old saying "Two heads are better than one" is valid in most cases and hence can be applied to facilitate the development of effective self-adaptive evolutionary algorithms. Our new finding paves the way for developing a better evolutionary computation approach for ridesharing recommendation systems based on sayings created by human beings or human intelligence. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. Optimized task scheduling in cloud computing using improved multi-verse optimizer
- Author
-
Otair, Mohammed, Alhmoud, Areej, Jia, Heming, Altalhi, Maryam, Hussein, Ahmad MohdAziz, and Abualigah, Laith
- Published
- 2022
- Full Text
- View/download PDF
25. Lumbar spinal ligament characteristics extracted from stepwise reduction experiments allow for preciser modeling than literature data
- Author
-
Robert Rockenfeller, Nicolas Damm, and Karin Gruber
- Subjects
Optimization ,Facet joint ,Computer science ,medicine.medical_treatment ,Finite Element Analysis ,0206 medical engineering ,02 engineering and technology ,Models, Biological ,03 medical and health sciences ,Lumbar ,Individual lumbar spine model ,Intervertebral disk ,Pressure ,medicine ,Humans ,Computer Simulation ,Biomechanics ,Range of Motion, Articular ,Intervertebral Disc ,Reduction (orthopedic surgery) ,030304 developmental biology ,Original Paper ,0303 health sciences ,Ligaments ,Lumbar Vertebrae ,Mechanical Engineering ,Models, Theoretical ,musculoskeletal system ,020601 biomedical engineering ,Spine ,Biomechanical Phenomena ,medicine.anatomical_structure ,Modeling and Simulation ,Calibration ,Ligament ,Regression Analysis ,Muscle ,Lumbar spine ,Tomography, X-Ray Computed ,Range of motion ,Algorithms ,Biotechnology ,Biomedical engineering - Abstract
Lumbar ligaments play a key role in stabilizing the spine, particularly assisting muscles at wide-range movements. Hence, valid ligament force–strain data are required to generate physiological model predictions. These data have been obtained by experiments on single ligaments or functional units throughout the literature. However, contrary to detailed spine geometries, gained, for instance, from CT data, ligament characteristics are often inattentively transferred to multi-body system (MBS) or finite element models. In this paper, we use an elaborated MBS model of the lumbar spine to demonstrate how individualized ligament characteristics can be obtained by reversely reenacting stepwise reduction experiments, where the range of motion (ROM) was measured. We additionally validated the extracted characteristics with physiological experiments on intradiscal pressure (IDP). Our results on a total of in each case 160 ROM and 49 IDP simulations indicated superiority of our procedure (seven and eight outliers) toward the incorporation of classical literature data (on average 71 and 31 outliers).
- Published
- 2019
26. A Linear Programming Method for Finding a Minimal Set of Axial Lines Representing an Entire Geometry of Building and Urban Layout.
- Author
-
Jung, Sung Kwon and Kim, Youngchul
- Subjects
BUILDING layout ,GEOMETRY ,ALGORITHMS ,LINEAR programming - Abstract
This paper devises an algorithm for finding the minimal set of axial lines that can represent a geometry of building and urban layout in two dimensions. Although axial lines are useful to analyze spatial configuration in the Space Syntax, existing methods for selecting axial lines seldom address the optimality of their solutions. The proposed algorithm uses linear programming to obtain a minimal set of axial lines. To minimize the number of axial lines that represent the entire geometry of building and urban layout, a linear programming problem is established in which a set of axial lines represents the entire geometry. The axial lines must have at least one intersection with every extension line of the wall edges to the sides of the reflex angles. If a solution to this linear programming problem exists, it will be guaranteed to be an optimum. However, some solutions of this general linear programming problem may include isolated lines, which are undesirable for an axial line analysis. To avoid isolated axial lines, this paper states a new formulation by adding a group of constraints to the original formulation. By examining the modified linear programming problem in various two-dimensional building maps and spatial layouts, this paper demonstrates that the proposed algorithm can guarantee a minimum set of axial lines to represent a two-dimensional geometry. This modified linear programming problem prevents isolated axial lines in the process of axial line reduction. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
27. Algorithms for Constructing Minimal Generating Set of Solutions for Systems of Linear Equations
- Author
-
Kryvyi, S. and Chugaenko, O.
- Published
- 2024
- Full Text
- View/download PDF
28. The aperiodic facility layout problem with time-varying demands and an optimal master-slave solution approach.
- Author
-
Xiao, Yiyong, Zhang, Yue, Kulturel-Konak, Sadan, Konak, Abdullah, Xu, Yuchun, and Zhou, Shenghan
- Subjects
PLANT layout ,ALGORITHMS ,DYNAMIC programming ,BENCHMARK problems (Computer science) ,MATERIALS handling ,PRODUCTION planning - Abstract
In many seasonal industries, customer demands are constantly changing over time, and accordingly the facility layout should be re-optimized in a timely manner to adapt to changing material handling patterns among manufacturing departments. This paper investigates the aperiodic facility layout problem (AFLP) that involves arranging facilities layout and re-layout aperiodically in a dynamic manufacturing environment during a given planning horizon. The AFLP is decomposed into a master problem and a combination set of static facility layout problems (FLPs, the slave problems) without loss of optimality, and all problems are formulated as mixed-integer linear programming (MILP) models that can be solved by MIP solvers for small-sized problems. An exact backward dynamic programming (BDP) algorithm with a computational complexity of O(n
2 ) is developed for the master problem, and an improved linear programming based problem evolution algorithm (PEA-LP) is developed for the traditional static FLP. Computational experiments are conducted on two new problems and twelve well-known benchmark problems from the literature, and the experimental results show that the proposed solution approach is promising for solving the AFLP with practical sizes of problem instances. In addition, the improved PEA-LP found new best solutions for five benchmark problems. [ABSTRACT FROM AUTHOR]- Published
- 2021
- Full Text
- View/download PDF
29. A Discrete Prey–Predator Algorithm for Cloud Task Scheduling.
- Author
-
Abdulgader, Doaa Abdulmoniem, Yousif, Adil, and Ali, Awad
- Subjects
ALGORITHMS ,CLOUD computing ,SCHEDULING ,PRODUCTION scheduling - Abstract
Cloud computing is considered a key Internet technology. Cloud providers offer services through the Internet, such as infrastructure, platforms, and software. The scheduling process of cloud providers' tasks concerns allocating clients' tasks to providers' resources. Several mechanisms have been developed for task scheduling in cloud computing. Still, these mechanisms need to be optimized for execution time and makespan. This paper presents a new task-scheduling mechanism based on Discrete Prey–Predator to optimize the task-scheduling process in the cloud environment. The proposed Discrete Prey–Predator mechanism assigns each scheduling solution survival values. The proposed mechanism denotes the prey's maximum surviving value and the predator's minimum surviving value. The proposed Discrete Prey–Predator mechanism aims to minimize the execution time of tasks in cloud computing. This paper makes a significant contribution to the field of cloud task scheduling by introducing a new mechanism based on the Discrete Prey–Predator algorithm. The Discrete Prey–Predator mechanism presents distinct advantages, including optimized task execution, as the mechanism is purpose-built to optimize task execution times in cloud computing, improving overall system efficiency and resource utilization. Moreover, the proposed mechanism introduces a survival-value-based approach, as the mechanism introduces a unique approach for assigning survival values to scheduling solutions, differentiating between the prey's maximum surviving value and the predator's minimum surviving value. This improvement enhances decision-making precision in task allocation. To evaluate the proposed mechanism, simulations using the CloudSim simulator were conducted. The experiment phase considered different scenarios for testing the proposed mechanism in different states. The simulation results revealed that the proposed Discrete Prey–Predator mechanism has shorter execution times than the firefly algorithm. The average of the five execution times of the Discrete Prey–Predator mechanism was 270.97 s, while the average of the five execution times of the firefly algorithm was 315.10 s. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
30. An Improved Dandelion Optimizer Algorithm for Spam Detection: Next-Generation Email Filtering System.
- Author
-
Tubishat, Mohammad, Al-Obeidat, Feras, Sadiq, Ali Safaa, and Mirjalili, Seyedali
- Subjects
SPAM email ,EMAIL systems ,OPTIMIZATION algorithms ,PARTICLE swarm optimization ,ALGORITHMS ,FEATURE selection - Abstract
Spam emails have become a pervasive issue in recent years, as internet users receive increasing amounts of unwanted or fake emails. To combat this issue, automatic spam detection methods have been proposed, which aim to classify emails into spam and non-spam categories. Machine learning techniques have been utilized for this task with considerable success. In this paper, we introduce a novel approach to spam email detection by presenting significant advancements to the Dandelion Optimizer (DO) algorithm. The DO is a relatively new nature-inspired optimization algorithm inspired by the flight of dandelion seeds. While the DO shows promise, it faces challenges, especially in high-dimensional problems such as feature selection for spam detection. Our primary contributions focus on enhancing the DO algorithm. Firstly, we introduce a new local search algorithm based on flipping (LSAF), designed to improve the DO's ability to find the best solutions. Secondly, we propose a reduction equation that streamlines the population size during algorithm execution, reducing computational complexity. To showcase the effectiveness of our modified DO algorithm, which we refer to as the Improved DO (IDO), we conduct a comprehensive evaluation using the Spam base dataset from the UCI repository. However, we emphasize that our primary objective is to advance the DO algorithm, with spam email detection serving as a case study application. Comparative analysis against several popular algorithms, including Particle Swarm Optimization (PSO), the Genetic Algorithm (GA), Generalized Normal Distribution Optimization (GNDO), the Chimp Optimization Algorithm (ChOA), the Grasshopper Optimization Algorithm (GOA), Ant Lion Optimizer (ALO), and the Dragonfly Algorithm (DA), demonstrates the superior performance of our proposed IDO algorithm. It excels in accuracy, fitness, and the number of selected features, among other metrics. Our results clearly indicate that the IDO overcomes the local optima problem commonly associated with the standard DO algorithm, owing to the incorporation of LSAF and the reduction in equation methods. In summary, our paper underscores the significant advancement made in the form of the IDO algorithm, which represents a promising approach for solving high-dimensional optimization problems, with a keen focus on practical applications in real-world systems. While we employ spam email detection as a case study, our primary contribution lies in the improved DO algorithm, which is efficient, accurate, and outperforms several state-of-the-art algorithms in various metrics. This work opens avenues for enhancing optimization techniques and their applications in machine learning. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
31. A New Migration and Reproduction Intelligence Algorithm: Case Study in Cloud-Based Microgrid.
- Author
-
Yan, Renwu, Liu, Yunzhang, and Yu, Ning
- Subjects
PARTICLE swarm optimization ,SWARM intelligence ,MICROGRIDS ,ALGORITHMS ,REPRODUCTION ,BIOGEOGRAPHY - Abstract
Inspired by the migration and reproduction of species in nature to explore suitable habitats, this paper proposed a new swarm intelligence algorithm called the Migration and Reproduction Algorithm (MARA). This new algorithm discusses how to transform the behavior of an organism looking for a suitable habitat into a mathematical model, which can solve optimization problems. MARA has some common features with other optimization methods such as particle swarm optimization (PSO) and the fireworks algorithm (FWA), which means MARA can also solve the optimization problems that PSO and FWA are used to, namely, high-dimensional optimization problems. MARA also has some unique features among biology-based optimization methods. In this paper, we articulated the structure of MARA by correlating it with natural biogeography; then, we demonstrated the performance of MARA on sets of 12 benchmark functions. In the end, we applied it to optimize a practical problem of power dispatching in a multi-microgrid system that proved it has certain value in practical applications. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
32. A Review of Implementing Ant System Algorithms on Scheduling Problems.
- Author
-
Kashef, Samar and Elshaer, Raafat
- Subjects
ALGORITHMS ,COMBINATORIAL optimization ,METAHEURISTIC algorithms ,COMPUTING platforms ,QUANTITATIVE research - Abstract
The ant system (AS) and scheduling problem are well-known concepts in literature. Ant algorithms have been known to be an effective tool for solving combinatorial optimization problems. Elitist AS (EAS), rank-based AS (RAS), ant colony system (ACS), and max-min AS (MMAS) are the variants of the AS algorithm; they are triggered by the different ways of updating the pheromone trail τ, computing the visibility η, and/or other parameters in the basic AS model. The main contribution of this article is twofold. First, the basic AS and its controlled parameters are presented, the key variants of the ant algorithms are explained, and major changes of each variant from the basic model are tracked. Second, sixty papers are collected between 2015 and 2020 based on a search strategy for tracking the implementation of different AS variants in solving scheduling problems. Numerous findings based on a statistical analysis of the collected papers are reported and discussed. This study will allow the researcher to understand the essence of the ant algorithm, recognize the fundamental differences in its five systems, and determine how each of them can be implemented. Tracking a sample of articles that apply an ant algorithm for a specific case study gives researchers new ideas on how to adjust the original model to fit their problem. [ABSTRACT FROM AUTHOR]
- Published
- 2021
33. Detection of Deepfake Media Using a Hybrid CNN–RNN Model and Particle Swarm Optimization (PSO) Algorithm.
- Author
-
Al-Adwan, Aryaf, Alazzam, Hadeel, Al-Anbaki, Noor, and Alduweib, Eman
- Subjects
PARTICLE swarm optimization ,CONVOLUTIONAL neural networks ,MACHINE learning ,DEEP learning ,DEEPFAKES ,ALGORITHMS ,VIDEOS - Abstract
Deepfakes are digital audio, video, or images manipulated using machine learning algorithms. These manipulated media files can convincingly depict individuals doing or saying things they never actually did. Deepfakes pose significant risks to our lives, including national security, financial markets, and personal privacy. The ability to create convincing deep fakes can also harm individuals' reputations and can be used to spread disinformation and fake news. As such, there is a growing need for reliable and accurate methods to detect deep fakes and prevent their harmful effects. In this paper, a hybrid convolutional neural network (CNN) and recurrent neural network (RNN) with a particle swarm optimization (PSO) algorithm is utilized to demonstrate a deep learning strategy for detecting deepfake videos. High accuracy, sensitivity, specificity, and F1 score were attained by the proposed approach when tested on two publicly available datasets: Celeb-DF and the Deepfake Detection Challenge Dataset (DFDC). Specifically, the proposed method achieved an average accuracy of 97.26% on Celeb-DF and an average accuracy of 94.2% on DFDC. The results were compared to other state-of-the-art methods and showed that the proposed method outperformed many. The proposed method can effectively detect deepfake videos, which is essential for identifying and preventing the spread of manipulated content online. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. Path Algorithms for Contact Sequence Temporal Graphs †.
- Author
-
Gheibi, Sanaz, Banerjee, Tania, Ranka, Sanjay, and Sahni, Sartaj
- Subjects
ALGORITHMS ,NEIGHBORHOODS ,DATA structures - Abstract
This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges (OSE) representation, which is faster than other known representations. While our proposed representation clearly outperforms the OSE representation for shallow neighborhood search problems, it is not evident that it does so for different problems. We demonstrate the competitiveness of our TRG representation for the single-source all-destinations fastest, min-hop, shortest, and foremost paths problems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
35. Data transmission path planning method for wireless sensor network in grounding grid area based on MM‐DPS hybrid algorithm.
- Author
-
Xiao, Xianghui, Huang, Longsheng, Zhang, Zhenshan, Huang, Mingxian, Guan, Luchang, and Song, Yunhao
- Subjects
WIRELESS sensor networks ,DATA transmission systems ,SEARCH algorithms ,MULTICASTING (Computer networks) ,NONDESTRUCTIVE testing ,ALGORITHMS ,ENERGY consumption - Abstract
At present, in order to conduct non‐destructive testing on the grounding grid of substations under the condition of continuous power supply and no excavation, researchers have applied wireless technology based on electrochemical methods to remotely monitor the corrosion state of grounding conductors online. Nevertheless, wireless signals are affected by the environment when they are transmitted underground. In the field of grounding gird wireless monitoring, how to plan the information transmission path of wireless sensor network (WSN) with high accuracy of data transfer and low energy consumption earns growing research attention. To address the problem of WSN path planning in grounding grid area, a path planning method for WSN based on the hybrid algorithm of map‐matching algorithm and double‐pole search algorithm (MM‐DPS) is proposed in this paper. The map‐matching algorithm is employed to calculate the optimal sampling node number of the data transmission path. On the basis of the optimal sampling node number, the double‐pole search algorithm is employed in seeking out each sensor node of the path, and two groups of path plans are obtained. In the simulation experiment, compared with the A‐star algorithm, the MM‐DPS algorithm shortens the data transmission path length by about 39% and reduces the energy consumption by about 57%. The research work brings a method to alleviate the problem of data transmission underground of WSN in grounding grid area. The method not only ensures the accuracy of data transmission, but also shorts the transmission distance and reduces energy consumption. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. Optimal selection of benchmarking datasets for unbiased machine learning algorithm evaluation.
- Author
-
Pereira, João Luiz Junho, Smith-Miles, Kate, Muñoz, Mario Andrés, and Lorena, Ana Carolina
- Subjects
MACHINE learning ,SUPERVISED learning ,METAHEURISTIC algorithms ,CLASSIFICATION algorithms ,ALGORITHMS - Abstract
Whenever a new supervised machine learning (ML) algorithm or solution is developed, it is imperative to evaluate the predictive performance it attains for diverse datasets. This is done in order to stress test the strengths and weaknesses of the novel algorithms and provide evidence for situations in which they are most useful. A common practice is to gather some datasets from public benchmark repositories for such an evaluation. But little or no specific criteria are used in the selection of these datasets, which is often ad-hoc. In this paper, the importance of gathering a diverse benchmark of datasets in order to properly evaluate ML models and really understand their capabilities is investigated. Leveraging from meta-learning studies evaluating the diversity of public repositories of datasets, this paper introduces an optimization method to choose varied classification and regression datasets from a pool of candidate datasets. The method is based on maximum coverage, circular packing, and the meta-heuristic Lichtenberg Algorithm for ensuring that diverse datasets able to challenge the ML algorithms more broadly are chosen. The selections were compared experimentally with a random selection of datasets and with clustering by k-medoids and proved to be more effective regarding the diversity of the chosen benchmarks and the ability to challenge the ML algorithms at different levels. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. Dynamic bipolar fuzzy aggregation operators: A novel approach for emerging technology selection in enterprise integration.
- Author
-
Alghazzawi, Dilshad, Abbas, Sajida, Alolaiyan, Hanan, Khalifa, Hamiden Abd El-Wahed, Alburaikan, Alhanouf, Xin, Qin, and Razaq, Abdul
- Subjects
EXPERT systems ,INNOVATION adoption ,PROBLEM solving ,FUZZY sets - Abstract
Emerging technology selection is crucial for enterprise integration, driving innovation, competitiveness, and streamlining operations across diverse sectors like finance and healthcare. However, the decision-making process for technology adoption is often complex and fraught with uncertainties. Bipolar fuzzy sets offer a nuanced representation of uncertainty, allowing for simultaneous positive and negative membership degrees, making them valuable in decision-making and expert systems. In this paper, we introduce dynamic averaging and dynamic geometric operators under bipolar fuzzy environment. We also establish some of the fundamental crucial features of these operators. Moreover, we present a step by step mechanism to solve MADM problem under bipolar fuzzy dynamic aggregation operators. In addition, these new techniques are successfully applied for the selection of the most promising emerging technology for enterprise integration. Finally, a comparative study is conducted to show the validity and practicability of the proposed techniques in comparison to existing methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. VARIATIONAL DATA ASSIMILATION AND ITS DECOUPLED ITERATIVE NUMERICAL ALGORITHMS FOR STOKES–DARCY MODEL.
- Author
-
XUEJIAN LI, WEI GONG, XIAOMING HE, and TAO LIN
- Subjects
LAGRANGE multiplier ,EULER-Lagrange equations ,TIKHONOV regularization ,BILINEAR forms ,ALGORITHMS ,DISCRETE systems - Abstract
In this paper we develop and analyze a variational data assimilation method with efficient decoupled iterative numerical algorithms for the Stokes–Darcy equations with the Beavers–Joseph interface condition. By using Tikhonov regularization and formulating the variational data assimilation into an optimization problem, we establish the existence, uniqueness, and stability of the optimal solution. Based on the weak formulation of the Stokes–Darcy equations, the Lagrange multiplier rule is utilized to derive the first order optimality system for both the continuous and discrete variational data assimilation problems, where the discrete data assimilation is based on a finite element discretization in space and the backward Euler scheme in time. By rescaling the optimality system and then analyzing its corresponding bilinear forms, we prove the optimal finite element convergence rate with special attention paid to recovering uncertainties missed in the optimality system. To solve the discrete optimality system efficiently, three decoupled iterative algorithms are proposed to address the computational cost for both well-conditioned and ill-conditioned variational data assimilation problems, respectively. Finally, numerical results are provided to validate the proposed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. Dendritic Growth Optimization: A Novel Nature-Inspired Algorithm for Real-World Optimization Problems.
- Author
-
Priyadarshini, Ishaani
- Subjects
OPTIMIZATION algorithms ,BIOLOGICALLY inspired computing ,DEEP learning ,MACHINE learning ,METAHEURISTIC algorithms ,PROBLEM solving ,ALGORITHMS - Abstract
In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. A Reduced Switch Count Multilevel Inverter for PV Standalone System using Modified JAYA Algorithm.
- Author
-
Mohanty, Rupali, Chatterjee, Debasish, Suman, Swati, and Anand, Mukul
- Subjects
PARTICLE swarm optimization ,ELECTRIC inverters ,PHOTOVOLTAIC power systems ,ALGORITHMS - Abstract
This paper introduces a hybrid multilevel inverter (MLI) with reduced switch count, which can generate higher output voltage level with minimum number of DC input sources. The operation of this proposed MLI is carried out with unequal DC sources to achieve the desired output voltage level. The reduced MLI output voltage is set to minimal total harmonic distortion (THD) with the help of modified JAYA (MJAYA) algorithm. A JAYA algorithm with improved steps by adopting an accelerating parameter has been proposed in this research work to obtain a faster convergence of the objective function. The MJAYA algorithm has provided the suitable switching angles for the proposed three-phase 15-level MLI and reduced the output voltage THD to 2.23%, which satisfies the standard set by IEEE-519. To prove the efficiency of this proposed modified algorithm, the comparative analysis is carried out through MATLAB program and Simulink tool using common JAYA and modified particle swarm optimisation algorithms. The performance and productivity of the proposed MLI have been investigated through simulation and experimental setups. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Autonomous Parameter Balance in Population-Based Approaches: A Self-Adaptive Learning-Based Strategy.
- Author
-
Vega, Emanuel, Lemus-Romani, José, Soto, Ricardo, Crawford, Broderick, Löffler, Christoffer, Peña, Javier, and Talbi, El-Gazhali
- Subjects
SELF-adaptive software ,METAHEURISTIC algorithms ,MANUFACTURING cells ,KNAPSACK problems ,ALGORITHMS - Abstract
Population-based metaheuristics can be seen as a set of agents that smartly explore the space of solutions of a given optimization problem. These agents are commonly governed by movement operators that decide how the exploration is driven. Although metaheuristics have successfully been used for more than 20 years, performing rapid and high-quality parameter control is still a main concern. For instance, deciding the proper population size yielding a good balance between quality of results and computing time is constantly a hard task, even more so in the presence of an unexplored optimization problem. In this paper, we propose a self-adaptive strategy based on the on-line population balance, which aims for improvements in the performance and search process on population-based algorithms. The design behind the proposed approach relies on three different components. Firstly, an optimization-based component which defines all metaheuristic tasks related to carry out the resolution of the optimization problems. Secondly, a learning-based component focused on transforming dynamic data into knowledge in order to influence the search in the solution space. Thirdly, a probabilistic-based selector component is designed to dynamically adjust the population. We illustrate an extensive experimental process on large instance sets from three well-known discrete optimization problems: Manufacturing Cell Design Problem, Set covering Problem, and Multidimensional Knapsack Problem. The proposed approach is able to compete against classic, autonomous, as well as IRace-tuned metaheuristics, yielding interesting results and potential future work regarding dynamically adjusting the number of solutions interacting on different times within the search process. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. Approximate Cost-Optimal Energy Management of Hydrogen Electric Multiple Unit Trains Using Double Q-Learning Algorithm.
- Author
-
Li, Qi, Meng, Xiang, Gao, Fei, Zhang, Guorui, and Chen, Weirong
- Subjects
ENERGY management ,ELECTRIC multiple units ,HYDROGEN as fuel ,TOTAL cost of ownership ,ENERGY consumption ,ALGORITHMS - Abstract
Energy management strategy (EMS) is the key to the performance of fuel cell / battery hybrid system. At present, reinforcement learning (RL) has been introduced into this field and has gradually become the focus of research. However, traditional EMSs only take the energy consumption into consideration when optimizing the operation economy, and ignore the cost caused by power source degradations. It would cause the problem of poor operation economy regarding Total Cost of Ownership (TCO). On the other hand, most studied RL algorithms have the disadvantages of overestimation and improper way of restricting battery SOC, which would lead to relatively poor control performance as well. To solve these problems, this paper establishes a TCO model including energy consumption, equivalent energy consumption and degradation of power sources at first, then adopt the Double Q-learning RL algorithm with state constraint and variable action space to determine the optimal EMS. Finally, using hardware-in-the-loop platform, the feasibility, superiority and generalization of proposed EMS is proved by comparing with the optimal dynamic programming and traditional RL EMS and equivalent consumption minimum strategy (ECMS) under both training and unknown operating conditions. Results prove that the proposed strategy has high global optimality and excellent SOC control ability regardless of training or unknown conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
43. Infrastructure-Assisted on-Driving Experience Sharing for Millimeter-Wave Connected Vehicles.
- Author
-
Jung, Soyi, Kim, Joongheon, Levorato, Marco, Cordeiro, Carlos, and Kim, Jae-Hyun
- Subjects
RESOURCE allocation ,CAPITAL investments ,ALGORITHMS ,VENDING stands ,COST analysis - Abstract
This paper proposes on-driving experience sharing algorithms at junctions in infrastructure-assisted vehicles-to-everything networks. For the purpose, a millimeter-wave (mmWave) technology is used because it provides multi-Gbps data rates which is helpful for handling users’ short stay times at junctions and spatial reuse due to high beam directionality which is helpful for interference-avoidance among densely deployed vehicles at junctions. To realize on-driving experience sharing, the proposed algorithms focus on joint resource allocation and scheduling for 3GPP-compliant multiple unicast vehicle-to-vehicle (V2V) communications where the vehicles are group leaders (GLs) in 3GPP Mode 4(d). The resource allocation stands for the roadside unit (RSU) allocation to scheduled V2V GL links where RSU is essentially required for overcoming blockage by establishing two-hop relaying. Because vehicles stay for short times at junctions, this paper designs two algorithms without or with delay considerations. Without delay considerations, the joint optimization of RSU allocation and scheduling was originally formulated as mixed 0-1 non-convex optimization. However our proposed algorithm reformulates the problem into mixed 0-1 convex optimization, which is computationally easier to solve. With delay considerations, our proposed algorithm dynamically controls video contents frame rates for time-average on-driving video sharing quality maximization subject to delay constraints, inspired by Lyapunov optimization. Extensive simulation results demonstrate that our algorithms can significantly outperform in a variety of scenarios. Furthermore, we conduct the cost analysis for the proposed algorithms in terms of capital expenditure (CAPEX) and operating expenditure (OPEX). [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
44. Optimized Resource Allocation in IoT Using Fuzzy Logic and Bio-Inspired Algorithms.
- Author
-
Sharma, Deepak Kumar, Mishra, Jahanavi, Singh, Aeshit, Govil, Raghav, Singh, Krishna Kant, and Singh, Akansha
- Subjects
FUZZY logic ,INTERNET of things ,RESOURCE allocation ,ALGORITHMS ,DYNAMIC loads ,SMART devices - Abstract
IoT smart devices are a confluence of microprocessors, sensors, power source and transceiver modules to effectively sense, communicate and transfer data. Energy efficiency is a key governing value of the network performance of smart devices in distributed IoT networks. Low and discrete power and limited amount of memory and finite number of resources form some major bottlenecks in the workflow. Dynamic load balancing, reliability and flexibility are heavily relied upon by cloud computing for its accessibility. Resources are dynamically provided to the end client in an as-come on-demand fashion with the global network that is the Internet. Proportionally the need for services is increasing at a rate that is astonishing compared to any other forms of development. Load balancing seems a major challenge faced due to the architecture and the modular nature of our cloud environment. Loads need to be distributed dynamically to all the nodes. In this paper, we have introduced a technique that combines fuzzy logic with various nature inspired algorithms—grey wolf algorithm and firefly algorithm to effectively balance the load in a network of IoT devices. The performances of various nature inspired algorithms are compared with a brute force approach based on energy efficiency, network lifetime maximization, node failure rate and packet delivery ratio. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
45. Machine Learning Applications in Renewable Energy (MLARE) Research: A Publication Trend and Bibliometric Analysis Study (2012–2021).
- Author
-
Ajibade, Samuel-Soma M., Bekun, Festus Victor, Adedoyin, Festus Fatai, Gyamfi, Bright Akwasi, and Adediran, Anthonia Oluwatosin
- Subjects
BIBLIOMETRICS ,RENEWABLE energy sources ,MACHINE learning ,TREND analysis ,RECREATIONAL mathematics ,OPEN access publishing ,MATHEMATICS conferences - Abstract
This study examines the research climate on machine learning applications in renewable energy (MLARE). Therefore, the publication trends (PT) and bibliometric analysis (BA) on MLARE research published and indexed in the Elsevier Scopus database between 2012 and 2021 were examined. The PT was adopted to deduce the major stakeholders, top-cited publications, and funding organizations on MLARE, whereas BA elucidated critical insights into the research landscape, scientific developments, and technological growth. The PT revealed 1218 published documents comprising 46.9% articles, 39.7% conference papers, and 6.0% reviews on the topic. Subject area analysis revealed MLARE research spans the areas of science, technology, engineering, and mathematics among others, which indicates it is a broad, multidisciplinary, and impactful research topic. The most prolific researcher, affiliations, country, and funder are Ravinesh C. Deo, National Renewable Energy Laboratory, United States, and the National Natural Science Foundation of China, respectively. The most prominent journals on the top are Applied Energy and Energies, which indicates that journal reputation and open access are critical considerations for the author's choice of publication outlet. The high productivity of the major stakeholders in MLARE is due to collaborations and research funding support. The keyword co-occurrence analysis identified four (4) clusters or thematic areas on MLARE, which broadly describe the systems, technologies, tools/technologies, and socio-technical dynamics of MLARE research. Overall, the study showed that ML is critical to the prediction, operation, and optimization of renewable energy technologies (RET) along with the design and development of RE-related materials. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
46. Dynamic Leader Multi-Verse Optimizer (DLMVO): A New Algorithm for Parameter Identification of Solar PV Models.
- Author
-
Li, Jiangfeng, Dang, Jian, Xia, Chaohao, Jia, Rong, Wang, Gaoming, Li, Peihang, and Zhang, Yunxiang
- Subjects
PARAMETER identification ,ALGORITHMS ,STANDARD deviations ,PARAMETERS (Statistics) - Abstract
To efficiently extract the model parameters of photovoltaic (PV) modules, this paper proposed an identification method based on the Dynamic Elite-Leader Multi-Verse Optimizer (DLMVO) algorithm. An adaptive strategy was used to control parameters based on population evolution rate and aggregation rate to balance the exploitation and exploration to avoid the search falling into local optimization. In addition, this paper proposed a dynamic elite-leader-based variation strategy to enhance the probability of variation success and improve merit search speed. This proposed algorithm was applied to the parameter identification of two different PV modules and validated using six existing methods in the literature for comparison. The experimental results show that the DLMVO algorithm significantly reduced the standard deviation of the three models compared with the standard deviation of the MVO algorithm, the single diode decreased by nearly 40%, the single-component model decreased by about 28%, and the double diode exhibited the best effect, which decreased by 83%. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
47. Enhancing Decomposition-Based Algorithms by Estimation of Distribution for Constrained Optimal Software Product Selection.
- Author
-
Xiang, Yi, Yang, Xiaowei, Zhou, Yuren, and Huang, Han
- Subjects
EVOLUTIONARY algorithms ,ALGORITHMS ,INTERDISCIPLINARY approach to knowledge ,BENCHMARK problems (Computer science) ,COMPUTER software ,SOFTWARE engineering ,DEFINITIONS - Abstract
This paper integrates an estimation of distribution (EoD)-based update operator into decomposition-based multiobjective evolutionary algorithms for binary optimization. The probabilistic model in the update operator is a probability vector, which is adaptively learned from historical information of each subproblem. We show that this update operator can significantly enhance decomposition-based algorithms on a number of benchmark problems. Moreover, we apply the enhanced algorithms to the constrained optimal software product selection (OSPS) problem in the field of search-based software engineering. For this real-world problem, we give its formal definition and then develop a new repair operator based on satisfiability solvers. It is demonstrated by the experimental results that the algorithms equipped with the EoD operator are effective in dealing with this practical problem, particularly for large-scale instances. The interdisciplinary studies in this paper provide a new real-world application scenario for constrained multiobjective binary optimizers and also offer valuable techniques for software engineers in handling the OSPS problem. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
48. Formulation and Comparison of Two Real-Time Predictive Gear Shift Algorithms for Connected/Automated Heavy-Duty Vehicles.
- Author
-
Xu, Chu, Geyer, Stephen, and Fathy, Hosam K.
- Subjects
SHIFT systems ,RECURRENT neural networks ,ENERGY consumption ,TRUCK fuel consumption ,ALGORITHMS ,DYNAMIC programming - Abstract
This paper examines the problem of predictive gear scheduling for fuel consumption minimization in connected/automated heavy trucks. The literature highlights the fuel economy benefits of such predictive scheduling, but there is a need to optimize such scheduling online, in real time. To address this need, we begin by using dynamic programming (DP) to schedule gear shifting offline, in a manner that achieves a globally optimal Pareto tradeoff between the conflicting objectives of minimizing fuel consumption and shift frequency. The computational cost of DP is unfavorable for online implementation, but we present two algorithms addressing this challenge. Both algorithms rely on the fact that in the Pareto limit where fuel consumption minimization is the sole objective, DP furnishes a simple static shift map. Our first algorithm trains a recurrent neural network to prune the shift schedule generated by this map. The second algorithm performs this pruning in a direct manner tailored to reduce the schedule's rain flow count. We simulate these algorithms for different drive cycles. Both algorithms achieve a reasonable tradeoff between fuel consumption and gear shift frequency. However, the rain flow count algorithm is both more effective in approaching the DP-based Pareto front and more computationally efficient. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
49. Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.
- Author
-
Dai, Guowei, Guo, Longkun, Gutin, Gregory, Zhang, Xiaoyan, and Zhang, Zan-Bo
- Subjects
TANNER graphs ,CODING theory ,ALGORITHMS ,DIRECTED graphs ,ARTIFICIAL intelligence ,GRAPH algorithms ,NP-hard problems ,WEIGHTED graphs - Abstract
As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
50. IMATSA – an improved and adaptive intelligent optimization algorithm based on tunicate swarm algorithm.
- Author
-
Chen, Yan, Dong, Weizhen, and Hu, Xiaochun
- Subjects
- *
OPTIMIZATION algorithms , *PARTICLE swarm optimization , *ALGORITHMS , *SWARM intelligence , *IMAGE segmentation , *SUPPORT vector machines - Abstract
Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarm algorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.