Int. J. Appl. Metaheuristic Comput.最新文献

筛选
英文 中文
Extreme Min - Cut Max - Flow Algorithm 极端最小切割最大流量算法
Int. J. Appl. Metaheuristic Comput. Pub Date : 2023-05-05 DOI: 10.4018/ijamc.322436
Trust Tawanda, Philimon Nyamugure, E. Munapo, Santosh Kumar
{"title":"Extreme Min - Cut Max - Flow Algorithm","authors":"Trust Tawanda, Philimon Nyamugure, E. Munapo, Santosh Kumar","doi":"10.4018/ijamc.322436","DOIUrl":"https://doi.org/10.4018/ijamc.322436","url":null,"abstract":"In this article, the authors propose a maximum flow algorithm based on flow matrix. The algorithm only requires the effort to reduce the capacity of the underutilized arcs to that of the respective flow. The optimality of the algorithm is proved by the max-flow min-cut theorem. The algorithm is table-based, thus avoiding augmenting path and residual network concepts. The authors used numerical examples and computational comparisons to demonstrate the efficiency of the algorithm. These examples and comparisons revealed that the proposed algorithm is capable of computing exact solutions while using few iterations as compared to some existing algorithms.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133754121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Spark-Based Parallel Implementation of Arithmetic Optimization Algorithm 一种基于spark的并行算法优化实现
Int. J. Appl. Metaheuristic Comput. Pub Date : 2023-02-24 DOI: 10.4018/ijamc.318642
Maryam Aljame, Aisha Alnoori, Mohammad AlFailakawi, Imtiaz Ahmad
{"title":"A Spark-Based Parallel Implementation of Arithmetic Optimization Algorithm","authors":"Maryam Aljame, Aisha Alnoori, Mohammad AlFailakawi, Imtiaz Ahmad","doi":"10.4018/ijamc.318642","DOIUrl":"https://doi.org/10.4018/ijamc.318642","url":null,"abstract":"Arithmetic optimization algorithm (AOA) is a recent population-based metaheuristic widely used for solving optimization problems. However, the emerging large-scale optimization problems pose a great challenge for AOA due to its prohibitive computational cost to traverse the huge solution space effectively. This article proposes a parallel Spark-AOA using Scala on Apache Spark computing platform. Spark-AOA leverages the intrinsic parallel nature of the population-based AOA and the native iterative in-memory computation support of Spark through resilient distributed datasets (RDD) to accelerate the optimization process. Spark-AOA divides the solutions population into several subpopulations that are distributed into multiple RDD partitions and manipulated concurrently. Simulation experiments on different benchmark functions with up to 1,000-dimension and three engineering design problems demonstrate that Spark-AOA outperforms considerably standard AOA and Spark-based implementations of two recent metaheuristics both in terms of run-time and solution quality.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128375365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem 团查找器:最大团问题的自适应模拟退火算法
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-04-01 DOI: 10.4018/IJAMC.20220401.OA1
Sarab Almuhaideb, Najwa Altwaijry, S. Al-Mansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran
{"title":"Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem","authors":"Sarab Almuhaideb, Najwa Altwaijry, S. Al-Mansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran","doi":"10.4018/IJAMC.20220401.OA1","DOIUrl":"https://doi.org/10.4018/IJAMC.20220401.OA1","url":null,"abstract":"The maximum clique problem (MCP) is a classical NP-hard problem that has gained considerable attention due to its numerous real-world applications and theoretical complexity. It is inherently computationally complex, and so exact methods may require prohibitive computing time. Natureinspired meta-heuristics have proven their utility in solving many NP-hard problems. In this research, the authors propose a simulated annealing-based algorithm that they call clique finder algorithm to solve the MCP. The algorithm uses a logarithmic cooling schedule and two moves that are selected in an adaptive manner. The objective (error) function is the total number of missing links in the clique, which is to be minimized. The proposed algorithm was evaluated using benchmark graphs from the open-source library DIMACS, and results show that the proposed algorithm had a high success rate. KeywoRdS Cooling Schedule, DIMACS, Maximum Clique Problem, Metaheuristics, Nature-Inspired Methods, NP-Hard Problem, Self-Adaptive, Simulated Annealing International Journal of Applied Metaheuristic Computing Volume 13 • Issue 2 • April-June 2022","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128511481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Backtracking Search Algorithm With Single and Multi-Objective Function for the Solution of Optimal Power Flow Problem 求解最优潮流问题的单目标和多目标回溯搜索算法
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-01-01 DOI: 10.4018/ijamc.2022010110
Sriparna Banerjee, D. Banerjee, P. Roy
{"title":"Backtracking Search Algorithm With Single and Multi-Objective Function for the Solution of Optimal Power Flow Problem","authors":"Sriparna Banerjee, D. Banerjee, P. Roy","doi":"10.4018/ijamc.2022010110","DOIUrl":"https://doi.org/10.4018/ijamc.2022010110","url":null,"abstract":"This manuscript investigates the performance of the backtracking search algorithm (BSA) to minimize various objectives for an economical and secure power system. A variety of single and multi - objectives are delineated and solved. This manuscript also includes the valve-point loading effect alongside the objectives considered. The simulation has been computed in the IEEE 30-bus, IEEE 57-bus and IEEE 118-bus test network. The simulation outcomes as obtained by the proposed BSA and various algorithms are compared. Convergence curves are plotted to testify the characteristics of the proposed BSA for proceeding towards the global minima.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123130754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Metaheuristic Optimization Algorithm for Solving Higher-Order Boundary Value Problems 求解高阶边值问题的元启发式优化算法
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-01-01 DOI: 10.4018/ijamc.292515
Shaza Alturky, G. A. Toma
{"title":"A Metaheuristic Optimization Algorithm for Solving Higher-Order Boundary Value Problems","authors":"Shaza Alturky, G. A. Toma","doi":"10.4018/ijamc.292515","DOIUrl":"https://doi.org/10.4018/ijamc.292515","url":null,"abstract":"An effective metaheuristic algorithm to solve the higher-order boundary value problems, called a genetic programming technique is presented. In this paper, a genetic programming algorithm, which depends on the syntax tree representation, is employed to obtain the analytical solutions of higher- order differential equations with the boundary conditions. The proposed algorithm can be produce an exact or approximate solution when the classical methods lead to unsatisfactory results. To illustrate the efficiency and accuracy of the designed algorithm, several examples are tested. Finally, the obtained results are compared with the existing methods such as the homotopy analysis method, the B-Spline collocation method and the differential transform method.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"12 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123573805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Hybrid Genetic Algorithm and Sperm Swarm Optimization (HGASSO) for Multimodal Functions 多模态函数的混合遗传算法与精群优化
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-01-01 DOI: 10.4018/ijamc.292507
Hisham A. Shehadeh, Hossam M. J. Mustafa, Mohammad Tubishat
{"title":"A Hybrid Genetic Algorithm and Sperm Swarm Optimization (HGASSO) for Multimodal Functions","authors":"Hisham A. Shehadeh, Hossam M. J. Mustafa, Mohammad Tubishat","doi":"10.4018/ijamc.292507","DOIUrl":"https://doi.org/10.4018/ijamc.292507","url":null,"abstract":"In this paper, we propose a hybrid algorithm combining two different metaheuristic methods, “Genetic Algorithms (GA)” and “Sperm Swarm Optimization (SSO)”, for the global optimization of multimodal benchmarks functions. The proposed Hybrid Genetic Algorithm and Sperm Swarm Optimization (HGASSO) operates based on incorporates concepts from GA and SSO in which generates individuals in a new iteration not only by crossover and mutation operations as proposed in GA, but also by techniques of local search of SSO. The main idea behind this hybridization is to reduce the probability of trapping in local optimum of multi modal problem. Our algorithm is compared against GA, and SSO metaheuristic optimization algorithms. The experimental results using a suite of multimodal benchmarks functions taken from the literature have evinced the superiority of the proposed HGASSO approach over the other approaches in terms of quality of results and convergence rates in which obtained good results in solving the multimodal benchmarks functions that include cosine, sine, and exponent in their formulation.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125330076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Techniques for Selecting the Optimal Parameters of One-Class Support Vector Machine Classifier for Reduced Samples 简化样本单类支持向量机分类器最优参数选择技术
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-01-01 DOI: 10.4018/ijamc.290533
Y. Guerbai, Y. Chibani, Yassine Meraihi
{"title":"Techniques for Selecting the Optimal Parameters of One-Class Support Vector Machine Classifier for Reduced Samples","authors":"Y. Guerbai, Y. Chibani, Yassine Meraihi","doi":"10.4018/ijamc.290533","DOIUrl":"https://doi.org/10.4018/ijamc.290533","url":null,"abstract":"Usually, the One-Class Support Vector Machine (OC-SVM) requires a large dataset for modeling effectively the target class independently to other classes. For finding the OC-SVM model, the available dataset is subdivided into two subsets namely training and validation, which are used for training and validating the optimal parameters. This approach is effective when a large dataset is available. However, when training samples are reduced, parameters of the OC-SVM are difficult to find in absence of the validation subset. Hence, this paper proposes various techniques for selecting the optimal parameters using only a training subset. The experimental evaluation conducted on several real-world benchmarks proves the effective use of the new selection parameter techniques for validating the model of OC-SVM classifiers versus the standard validation techniques","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122867994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Comparative Study of Meta-Heuristic and Conventional Search in Optimization of Multi-Dimensional Feature Selection 多维特征选择优化中的元启发式与常规搜索的比较研究
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-01-01 DOI: 10.4018/ijamc.292517
Khin Sandar Kyaw, S. Limsiroratana, T. Sattayaraksa
{"title":"A Comparative Study of Meta-Heuristic and Conventional Search in Optimization of Multi-Dimensional Feature Selection","authors":"Khin Sandar Kyaw, S. Limsiroratana, T. Sattayaraksa","doi":"10.4018/ijamc.292517","DOIUrl":"https://doi.org/10.4018/ijamc.292517","url":null,"abstract":"Algorithmic – based search approach is ineffective at addressing the problem of multi-dimensional feature selection for document categorization. This study proposes the use of meta heuristic based search approach for optimal feature selection. Elephant optimization (EO) and Ant Colony optimization (ACO) algorithms coupled with Naïve Bayes (NB), Support Vector Machin (SVM), and J48 classifiers were used to highlight the optimization capability of meta-heuristic search for multi-dimensional feature selection problem in document categorization. In addition, the performance results for feature selection using the two meta-heuristic based approaches (EO and ACO) were compared with conventional Best First Search (BFS) and Greedy Stepwise (GS) algorithms on news document categorization. The comparative results showed that global optimal feature subsets were attained using adaptive parameters tuning in meta-heuristic based feature selection optimization scheme. In addition, the selected number of feature subsets were minimized dramatically for document classification.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124773548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Product Review-Based Customer Sentiment Analysis Using an Ensemble of mRMR and Forest Optimization Algorithm (FOA) 基于mRMR和森林优化算法(FOA)的产品评论顾客情感分析
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-01-01 DOI: 10.4018/ijamc.2022010107
Parag Verma, A. Dumka, Anuj Bhardwaj, Alaknanda Ashok
{"title":"Product Review-Based Customer Sentiment Analysis Using an Ensemble of mRMR and Forest Optimization Algorithm (FOA)","authors":"Parag Verma, A. Dumka, Anuj Bhardwaj, Alaknanda Ashok","doi":"10.4018/ijamc.2022010107","DOIUrl":"https://doi.org/10.4018/ijamc.2022010107","url":null,"abstract":"This research presents a way of feature selection problem for classification of sentiments that use ensemble-based classifier. This includes a hybrid approach of minimum redundancy and maximum relevance (mRMR) technique and Forest Optimization Algorithm (FOA) (i.e. mRMR-FOA) based feature selection. Before applying the FOA on sentiment analysis, it has been used as feature selection technique applied on 10 different classification datasets publically available on UCI machine learning repository. The classifiers for example k-Nearest Neighbor (k-NN), Support Vector Machine (SVM) and Naïve Bayes used the ensemble based algorithm for available datasets. The mRMR-FOA uses the Blitzer’s dataset (customer reviews on electronic products survey) to select the significant features. The classification of sentiments has noticed to improve by 12 to 18%. The evaluated results are further enhanced by the ensemble of k-NN, NB and SVM with an accuracy of 88.47% for the classification of sentiment analysis task.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123492746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Sensitivity Analysis of GFRP Composite Drilling Parameters and Genetic Algorithm-Based Optimisation GFRP复合材料钻孔参数敏感性分析及遗传算法优化
Int. J. Appl. Metaheuristic Comput. Pub Date : 2022-01-01 DOI: 10.4018/ijamc.290539
K. Kalita, R. Ghadai, Ankur V. Bansod
{"title":"Sensitivity Analysis of GFRP Composite Drilling Parameters and Genetic Algorithm-Based Optimisation","authors":"K. Kalita, R. Ghadai, Ankur V. Bansod","doi":"10.4018/ijamc.290539","DOIUrl":"https://doi.org/10.4018/ijamc.290539","url":null,"abstract":"In this article, a genetic algorithm (GA) is used for optimizing a metamodel of surface roughness (R_a ) in drilling glass-fibre reinforced plastic (GFRP) composites. A response surface methodology (RSM) based three levels (-1, 0, 1) design of experiments is used for developing the metamodel. Analysis of variance (ANOVA) is undertaken to determine the importance of each process parameter in the developed metamodel. Subsequently, after detailed metamodel adequacy checks, the insignificant terms are dropped to make the established metamodel more rigorous and make accurate predictions. A sensitivity analysis of the independent variables on the output response helps in determining the most influential parameters. It is observed that f is the most crucial parameter, followed by the t and D. The optimization results depict that the R_a increases as the f increases and a minor value of drill diameter is the most appropriate to attain minimum surface roughness. Finally, a robustness test of the predicted GA solution is carried out.","PeriodicalId":300623,"journal":{"name":"Int. J. Appl. Metaheuristic Comput.","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128002837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书