6,510 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. 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
4. 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
5. 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
6. 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
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. 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
9. 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
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. 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
13. OPTIMIZING QUANTUM ALGORITHMS FOR SOLVING THE POISSON EQUATION.
- Author
-
Mukhanbet, Aksultan, Azatbekuly, Nurtugan, and Daribayev, Beimbet
- Subjects
ALGORITHMS ,EIGENVALUES ,QUANTUM computing ,POISSON algebras ,HAMILTON'S equations - Abstract
Contemporary quantum computers open up novel possibilities for tackling intricate problems, encompassing quantum system modeling and solving partial differential equations (PDEs). This paper explores the optimization of quantum algorithms aimed at resolving PDEs, presenting a significant challenge within the realm of computational science. The work delves into the application of the Variational Quantum Eigensolver (VQE) for addressing equations such as Poisson’s equation. It employs a Hamiltonian constructed using a modified Feynman-Kitaev formalism for a VQE, which represents a quantum system and encapsulates information pertaining to the classical system. By optimizing the parameters of the quantum circuit that implements this Hamiltonian, it becomes feasible to achieve minimization, which corresponds to the solution of the original classical system. The modification optimizes quantum circuits by minimizing the cost function associated with the VQE. The efficacy of this approach is demonstrated through the illustrative example of solving the Poisson equation. The prospects for its application to the integration of more generalized PDEs are discussed in detail. This study provides an in-depth analysis of the potential advantages of quantum algorithms in the domain of numerical solutions for the Poisson equation and emphasizes the significance of continued research in this direction. By leveraging quantum computing capabilities, the development of more efficient methodologies for solving these equations is possible, which could significantly transform current computational practices. The findings of this work underscore not only the practical advantages but also the transformative potential of quantum computing in addressing complex PDEs. Moreover, the results obtained highlight the critical need for ongoing research to refine these techniques and extend their applicability to a broader class of PDEs, ultimately paving the way for advancements in various scientific and engineering domains. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
14. 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
15. 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
16. CAD and optimization techniques
- Author
-
Barba, P.Di
- Published
- 2000
- Full Text
- View/download PDF
17. Optimal fiscal policy in times of uncertainty: a stochastic control approach
- Author
-
Neck, Reinhard, Blueschke, Dmitri, and Blueschke-Nikolaeva, Viktoria
- Published
- 2024
- Full Text
- View/download PDF
18. 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
19. 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
20. A modification to particle swarm optimization algorithm
- Author
-
Fan, Huiyuan
- Published
- 2002
- Full Text
- View/download PDF
21. Pareto‐based continuous evolutionary algorithms for multiobjective optimization
- Author
-
Shim, Mun‐Bo, Suh, Myung‐Won, Furukawa, Tomonari, Yagawa, Genki, and Yoshimura, Shinobu
- Published
- 2002
- Full Text
- View/download PDF
22. Enhancing graph drawings through edge bundling using clustering ensembles.
- Author
-
Vieira, Raissa dos Santos, do Nascimento, Hugo Alexandre Dantas, Ferreira, Joelma de Moura, and Foulds, Les
- Subjects
EVOLUTIONARY algorithms ,MACHINE learning ,ALGORITHMS - Abstract
Edge bundling is a technique used to improve the readability of large graph drawings by grouping edges to reduce visual complexity. This paper treats this task as a clustering problem, using compatibility metrics to evaluate solutions in an optimization pipeline combined with a clustering ensemble approach. The aim is to present the Clustering Ensemble-based Edge Bundling (CEBEB) method for solving the General-based Edge Bundling (GBEB) problem and report results for some given graphs. The CEBEB method proved very promising and generated better solutions than an existing evolutionary algorithm. Additionally, the paper introduces a new ensemble algorithm, specific for the GBEB, and reviews some previous results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
23. ADE: advanced differential evolution.
- Author
-
Abbasi, Behzad, Majidnezhad, Vahid, and Mirjalili, Seyedali
- Subjects
- *
CHAOS theory , *ALGORITHMS , *METAHEURISTIC algorithms - Abstract
This paper proposes a metaheuristic algorithm, called advanced differential evolution (ADE), by improving the DE algorithm. The ADE algorithm was developed with the goal of creating an optimization framework that addresses the challenges of exploration and exploitation balance, avoiding local minima, utilizing chaos theory for diverse initialization, and improving solution quality and convergence speed. By incorporating these features, ADE aims to enhance the effectiveness of optimization processes. The proposed algorithm utilizes chaos theory to generate the initial population, which is subsequently divided into two sub-populations with adaptive sizes. The size of each sub-population is determined using a formula based on the number of iterations during the algorithm's execution. The first sub-population has a larger size in the beginning and the second one has a smaller size, but the total size of these two populations is always constant. The main contribution of this paper is the proposal of two novel improved differential evolution algorithms, namely MDE1 and MDE2, which are utilized for exploration within these sub-populations. The proposed ADE is tested on 29 well-known benchmarks and six engineering problems, and the results are compared with seven other algorithms. Various statistical experiments are carried out showing that the proposed algorithm provides significant superiority over other well-known algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. Technical Note—On Hiring Secretaries with Stochastic Departures.
- Author
-
Kesselheim, Thomas, Psomas, Alexandros, and Vardi, Shai
- Subjects
ONLINE algorithms ,RESEARCH awards ,GENERALIZATION ,DECISION making ,ALGORITHMS - Abstract
The paper studies generalization of the secretary problem, where decisions do not have to be made immediately upon applicants' arrivals. After arriving, each applicant stays in the system for some (random) amount of time and then leaves, whereupon the algorithm has to decide irrevocably whether to select this applicant or not. The arrival and waiting times are drawn from known distributions, and the decision maker's goal is to maximize the probability of selecting the best applicant overall. The paper characterizes the optimal policy for this setting, showing that when deciding whether to select an applicant, it suffices to know only the time and the number of applicants that have arrived so far. Furthermore, the policy is monotone nondecreasing in the number of applicants seen so far, and, under certain natural conditions, monotone nonincreasing in time. Furthermore, when the number of applicants is large, a single threshold policy is almost optimal. We study a generalization of the secretary problem, where decisions do not have to be made immediately upon applicants' arrivals. After arriving, each applicant stays in the system for some (random) amount of time and then leaves, whereupon the algorithm has to decide irrevocably whether to select this applicant or not. The arrival and waiting times are drawn from known distributions, and the decision maker's goal is to maximize the probability of selecting the best applicant overall. Our first main result is a characterization of the optimal policy for this setting. We show that when deciding whether to select an applicant, it suffices to know only the time and the number of applicants that have arrived so far. Furthermore, the policy is monotone nondecreasing in the number of applicants seen so far, and, under certain natural conditions, monotone nonincreasing in time. Our second main result is that when the number of applicants is large, a single threshold policy is almost optimal. Funding: A. Psomas is supported in part by the National Science Foundation [Grant CCF-2144208], a Google Research Scholar Award, and by the Algorand Centres of Excellence program managed by Algorand Foundation. Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2023.2476. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
25. A Modified Firefly Algorithm for Solving Optimization Problems.
- Author
-
Chaudhary, Kaylash
- Subjects
PROBLEM solving ,FIREFLIES ,ALGORITHMS ,EQUATIONS ,METAHEURISTIC algorithms - Abstract
This paper presents a modified metaheuristic algorithm named the modified Firefly algorithm. Any metaheuristic algorithm will have exploration and exploitation steps, and the goal of modification is to maintain a balance between them. The improvement relies on movement equations, alterations to the algorithm's structure by introducing a single loop, and a selection of movement equations at random. Two movement equations are included in the improved method and are randomly selected. This guarantees both regionally and globally focused solution-finding. This prevents the algorithm from getting stuck at a local minimum. Comparing the modified version to the original Firefly method, just one for loop is used, reducing the algorithm's complexity. The algorithm's performance is evaluated with 35 traditional benchmark test functions and 10 CEC2019 test functions. According to the findings, the suggested method performed optimally in 24 traditional benchmark test functions and best in the six remaining benchmark test functions. The improved algorithm produced the best outcomes in seven of the 10 CEC2019 test functions. In contrast, the Firefly algorithm produced optimal results in 18 classical benchmark test functions and the best results in 6 CEC2019 test functions. The proposed algorithm is compared with other variants of the Firefly algorithm for common test functions in the literature. The results show that the proposed algorithm outperforms other variants in most test functions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
26. Optimal Reconfiguration of Electrical Distribution Networks Using the Improved Simulated Annealing Algorithm with Hybrid Cooling (ISA-HC).
- Author
-
Simeon Pucuhuayla, Franklin Jesus, Castillo Correa, Carlos, Ñaupari Huatuco, Dionicio Zocimo, and Molina Rodriguez, Yuri Percy
- Subjects
SIMULATED annealing ,TEST systems ,COOLING ,ALGORITHMS - Abstract
This paper presents a new algorithm to solve the optimal reconfiguration problem in distribution networks, using the algorithm called Improved Simulated Annealing combined with Hybrid Cooling (ISA-HC) and Selective Space Search, which leverages the capabilities of the Open Distribution System Simulator (OpenDSS) software and the selective space search concept to enhance performance and reduce the search space. The ISA-HC algorithm determines an adequate starting point for the temperature and initial solution according to the size of the system. For adequate cooling, a three-stage cooling approach was employed to achieve effective cooling, combining two methods widely used in the literature. Overall, the ISA-HC algorithm is a promising method for solving the optimal reconfiguration problem in distribution networks. The algorithm was tested on the systems of 5, 33, 69, and 94 buses and compared to other existing methods in the literature. The results show that the proposed method is more robust and efficient, providing better convergence and reliably achieving good quality global solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. Differential Evolution Algorithm with Three Mutation Operators for Global Optimization.
- Author
-
Wang, Xuming and Yu, Xiaobing
- Subjects
EVOLUTIONARY algorithms ,ARTIFICIAL intelligence ,GLOBAL optimization ,ALGORITHMS ,DIFFERENTIAL evolution ,BENCHES - Abstract
Differential evolution algorithm is a very powerful and recently proposed evolutionary algorithm. Generally, only a mutation operator and predefined parameter values of differential evolution algorithm are utilized to solve various optimization problems, which limits the performance of the algorithm. In this paper, six commonly used mutation operators are divided into three categories according to their own features. A mutation pool is established based on the three categories. A parameter pool with three predefined values is designed. During evolution, three mutation operators are randomly chosen from the three categories, and three parameter values are also randomly selected from the parameter pool. The three groups of mutation operators and parameter values are employed to produce trial vectors. The proposed algorithm makes good use of different mutation operators. Three recently proposed differential evolution variants and three non-differential evolution algorithms are used to make comparisons on the 29 testing functions from CEC. The experimental results have demonstrated that the proposed algorithm is very competitive. The proposed algorithm is utilized to solve three real applications, and the results are superior. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Distribution Network Reconfiguration Optimization Using a New Algorithm Hyperbolic Tangent Particle Swarm Optimization (HT-PSO).
- Author
-
Puma, David W., Molina, Y. P., Atoccsa, Brayan A., Luyo, J. E., and Ñaupari, Zocimo
- Subjects
PARTICLE swarm optimization ,TANGENT function ,HYPERBOLIC functions ,ALGORITHMS - Abstract
This paper introduces an innovative approach to address the distribution network reconfiguration (DNR) challenge, aiming to reduce power loss through an advanced hyperbolic tangent particle swarm optimization (HT-PSO) method. This approach is distinguished by the adoption of a novel hyperbolic tangent function, which effectively limits the rate of change values, offering a significant improvement over traditional sigmoid function-based methods. A key feature of this new approach is the integration of a tunable parameter, δ , into the HT-PSO, enhancing the curve's adaptability. The careful optimization of δ ensures superior control over the rate of change across the entire operational range. This enhanced control mechanism substantially improves the efficiency of the search and convergence processes in DNR. Comparative simulations conducted on 33- and 94-bus systems show an improvement in convergence, demonstrating a more exhaustive exploration of the search space than existing methods documented in the literature based on PSO and variations where functions are proposed for the rate of change of values. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
29. Dataflow-based automatic parallelization of MATLAB/Simulink models for fitting modern multicore architectures.
- Author
-
Gasmi, Kaouther and Hasnaoui, Salam
- Subjects
MODERN architecture ,ARCHITECTURAL design ,TELECOMMUNICATION ,ALGORITHMS ,SEMANTICS - Abstract
In many fields including aerospace, automotive, and telecommunications, MathWorks' MATLAB/Simulink is contemporary standard for model-based design. The strengths of Simulink are rapid design and algorithm exploration. Models created with Simulink are just functional. Therefore, designers cannot effortlessly consider a Simulink model's architecture. As current architectures are optimized to run on multicore processors, software running on these processors needs to be parallelized in order to benefit from their natural performance. For instance, designers need to understand how a Simulink model could be parallelized and how an adequate multicore architecture is selected. This paper focuses on the dataflow-based parallelization of Simulink models and proposes a method based on dataflow to measure the performance of parallelized Simulink models running on multicore architectures. Throughout the parallelization process, the model is converted into a Hierarchical Synchronous DataFlow Graph (HSDFG) keeping its original semantics, and each composite node in the graph is flattened. Then, the graph is mapped and scheduled into a multicore architecture with the ultimate objective that minimizes the end-to-end latency. In the experiment of applying the proposed approach to a real Simulink model, latency of the parallelized model could be reduced successfully on a various multi-core architectures. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Adaptive crossover-based marine predators algorithm for global optimization problems.
- Author
-
Yasear, Shaymah Akram
- Subjects
GLOBAL optimization ,PARTICLE swarm optimization ,SWARM intelligence ,FORAGING behavior ,METAHEURISTIC algorithms ,PROBLEM solving ,ALGORITHMS - Abstract
The Marine Predators Algorithm (MPA) is a swarm intelligence algorithm developed based on the foraging behavior of the ocean's predators. This algorithm has drawbacks including, insufficient population diversity, leading to trapping in local optima and poor convergence. To mitigate these drawbacks, this paper introduces an enhanced MPA based on Adaptive Sampling with Maximin Distance Criterion (AM) and the horizontal and vertical crossover operators – i.e. Adaptive Crossover-based MPA (AC-MPA). The AM approach is used to generate diverse and well-distributed candidate solutions. Whereas the horizontal and vertical crossover operators maintain the population diversity during the search process. The performance of AC-MPA was tested using 51 benchmark functions from CEC2017, CEC2020, and CEC2022, with varying degrees of dimensionality, and the findings are compared with those of its basic version, variants, and numerous well-established metaheuristics. Additionally, 11 engineering optimization problems were utilized to verify the capabilities of the AC-MPA in handling real-world optimization problems. The findings clearly show that AC-MPA performs well in terms of its solution accuracy, convergence, and robustness. Furthermore, the proposed algorithm demonstrates considerable advantages in solving engineering problems, proving its effectiveness and adaptability. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. 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
32. 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
33. 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
34. 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
35. 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
36. 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
37. Developments of an efficient global optimal design technique – a combined approach of MLS and SA algorithm
- Author
-
Ho, S.L., Yang, Shiyou, Ni, Peihong, and Wong, H.C.
- Published
- 2002
- Full Text
- View/download PDF
38. Sequence placement planning for high‐speed PCB assembly machine
- Author
-
Ong, N.‐S. and Tan, W.‐C.
- Published
- 2002
- Full Text
- View/download PDF
39. 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
40. 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
41. An efficient algorithm to estimate optimal preform die shape parameters in forging
- Author
-
Castro, Catarina F., Costa Sousa, Luísa, António, C.A.C., and César de Sá, J.M.A.
- Published
- 2001
- Full Text
- View/download PDF
42. Layerwise adaptive topology optimization of laminate structures
- Author
-
Hansel, W. and Becker, W.
- Published
- 1999
- Full Text
- View/download PDF
43. 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
44. 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
45. Spare optimization models for series and parallel structures
- Author
-
Dinesh Kumar, U. and Knezevic, J.
- Published
- 1997
- Full Text
- View/download PDF
46. Manifold Optimization-Based Data Detection Algorithm for Multiple-Input–Multiple-Output Orthogonal Frequency-Division Multiplexing Systems under Time-Varying Channels.
- Author
-
Li, Yumeng and Hu, Die
- Subjects
TIME-varying systems ,RIEMANNIAN manifolds ,MULTIPLEXING ,COMPUTATIONAL complexity ,BLOCK designs ,ALGORITHMS - Abstract
Recently, multiple-input–multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems have gained significant attention in the field of wireless communications. The utilization of the Riemannian manifold has become prevalent in MIMO-OFDM systems. However, the existing data detection algorithms for MIMO-OFDM systems are mostly designed for block fading channels. Additionally, these algorithms often suffer from high computational complexity. In this paper, we propose a data detection algorithm on the basis of Riemannian manifold optimization for MIMO-OFDM systems under time-varying channels. The core concept of this algorithm is to optimize the transmitted signals by solving the manifold optimization problem in the case of time-varying channels. In order to reduce the computational complexity of the algorithm, we improve the proposed algorithm by dividing the transmitted signals into multiple subframes for solving the optimization problem separately and using the pilots to maintain the performance of the algorithm. In the simulation, the performance of multiple proposed algorithms and the forced-zero detection algorithm under different parameter settings are compared. The simulation results show that the proposed algorithm demonstrates good bit error rate and computational complexity performances. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. 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
48. 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
- Subjects
VIRTUAL machine systems ,COMPUTER performance ,MATHEMATICAL optimization ,SCHEDULING ,CAPABILITIES approach (Social sciences) - Abstract
The multiverse optimizer (MVO) is one of the most trending algorithms used nowadays. The searching space in MVO is restricted by the best solution only, leading to a poor searching domain, therefore, a long searching time. This paper proposes an improved multiobjective multi-verse optimizer (IMOMVO) as a novel population optimization technique to solve task scheduling problems. The IMOMVO is introduced to overcome the drawbacks risen in the original MVO and its latest enhanced version mMVO. The proposed method solves the problem of the average positioning (AP) by dynamically enhancing the equation of updating the AP based on the best and the second-best available solutions. To evaluate The proposed IMOMVO, several datasets scenarios containing various tasks and virtual machines (Vms) were used to test the approach's capability. Standard evaluation metrics are used to validate the results of the proposed method; task execution time, throughput, and the Vms processing power. The proposed method obtained better results according to the evaluation measures than other state-of-the-art methods. The execution time achieves less time when compared to the mMVO as the proposed method achieved 186.33 s for executing 100 tasks and 934.92 for executing 600 tasks. The throughput results also achieved astonishing results as for 100 tasks, the throughput achieved 0.19, and the Vm processing power for the proposed method was 0.25 Kw for executing 100 tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
49. 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
50. 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
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.