☆ 4.7 Article

Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem

MATHEMATICS (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Mathematics

Hybrid Swarm Intelligence Optimization Methods for Low-Embodied Energy Steel-Concrete Composite Bridges

David Martinez-Munoz et al.

Summary: Bridge optimization is a complex problem with abundant configurations. This research focused on a steel-concrete box-girder optimization problem, using embodied energy and cost as objective functions. The study employed TAMO, CS, and SCA algorithms, and found that SCA achieved comparable results with TAMO in terms of energy function values, while reducing computation time by 25.79%. The analysis revealed that using metaheuristic methodologies to save cost could also reduce energy consumption by 0.584 kW center dot h.

MATHEMATICS (2023)

添加到收藏夹

Review Computer Science, Interdisciplinary Applications

Efficient Initialization Methods for Population-Based Metaheuristic Algorithms: A Comparative Study

Jeffrey O. O. Agushaka et al.

Summary: In this paper, a comprehensive comparison was conducted to evaluate the impact of population size, number of iterations, and different initialization methods on the performance of population-based metaheuristic optimizers. The results indicated that population size and number of iterations affect the algorithm performance, and certain algorithms are sensitive to the initialization schemes. Good population diversity and a suitable number of iterations are likely to lead to optimal solutions.

ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING (2023)

添加到收藏夹

Article Automation & Control Systems

A reinforcement learning based computational intelligence approach for binary optimization problems: The case of the set-union knapsack problem

Fehmi Burcin Ozsoydan et al.

Summary: Machine learning and computational intelligence show efficiency in solving optimization problems, but studies combining these approaches are lacking. This paper introduces a Q-learning reinforcement learning strategy for binary optimization problems and utilizes a variety of optimization algorithms to avoid local optima. The experimental results demonstrate the effectiveness of this approach in solving the set-union knapsack problem.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2023)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Modelling uncertainty in sustainable-green integrated reverse logistics network using metaheuristics optimization

Hadi Gholizadeh et al.

Summary: This paper presents a sustainable reverse logistics process model for polystyrene disposable appliances as an MINLP. Three heuristics, namely, cross-entropy, genetic algorithm, and simulated annealing, are employed to generate initial solutions for the MINLP model. Robust optimization is then utilized to solve the resulting problem. The response surface method and the Taguchi method are applied to optimize parameter values and improve algorithm performance. The heuristics are evaluated against the robust optimization method using the best-worst technique, and the model is validated through a real case study.

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

添加到收藏夹

Article Computer Science, Cybernetics

Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem

Isma Dahmani et al.

Summary: This article explores the impact of incorporating backtracking strategy into population-based solutions, specifically in addressing the set-union knapsack problem. The proposed method utilizes swarm optimization, iterative search operator, and path-relinking strategy to generate high-quality solutions. Experimental results show promising performance compared to existing methods in the literature.

CYBERNETICS AND SYSTEMS (2022)

添加到收藏夹

Article Chemistry, Multidisciplinary

Initialisation Approaches for Population-Based Metaheuristic Algorithms: A Comprehensive Review

Jeffrey O. Agushaka et al.

Summary: The initialisation control parameters play a significant role in improving the performance of population-based metaheuristic algorithms, yet there have been few studies in this area. This paper presents a comprehensive survey of different initialisation schemes, discusses their success levels and limitations, and provides useful insights for future research directions.

APPLIED SCIENCES-BASEL (2022)

添加到收藏夹

Review Computer Science, Artificial Intelligence

Heuristics and metaheuristics for biological network alignment: A review

Lijia Ma et al.

Summary: In this paper, a comprehensive review of heuristic and metaheuristic biological network alignment methods is presented. Comparative analyses of alignment models, datasets, evaluation metrics, and experimental results are provided, along with conclusions and possible future directions for BNAs.

NEUROCOMPUTING (2022)

添加到收藏夹

Article Computer Science, Artificial Intelligence

A comprehensive survey on recent metaheuristics for feature selection

Tansel Dokeroglu et al.

Summary: This survey examines the most outstanding recent metaheuristic feature selection algorithms of the last two decades in terms of their performance in exploration/exploitation operators, selection methods, transfer functions, fitness value evaluations, and parameter setting techniques. Current challenges and possible future research topics are also discussed.

NEUROCOMPUTING (2022)

添加到收藏夹

Article Engineering, Civil

Discrete swarm intelligence optimization algorithms applied to steel-concrete composite bridges

D. Martinez-Munoz et al.

Summary: This study proposes a hybrid algorithm that integrates the unsupervised learning technique of k-means with continuous swarm intelligence metaheuristics to optimize composite bridges. The results show that the hybrid proposal outperforms different algorithms designed.

ENGINEERING STRUCTURES (2022)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Optimal design of steel-concrete composite bridge based on a transfer function discrete swarm intelligence algorithm

David Martinez-Munoz et al.

Summary: This paper presents two single objective optimizations of box-girder steel-concrete composite bridges considering cost and CO2 emissions. SAMO2, SCA, and Jaya metaheuristics were applied, and it was observed that SCA showed similar cost values to SAMO2 but with an 18% improvement in computational time and lower objective function result deviation. Adding cells to bridge cross-sections improved section behavior and optimization results.

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION (2022)

添加到收藏夹

Article Engineering, Civil

Discrete swarm intelligence optimization algorithms applied to steel-concrete composite bridges

D. Martinez-Munoz et al.

Summary: This study proposed a hybrid algorithm integrating k-means with swarm intelligence metaheuristics to optimize a box-girder steel-concrete composite bridge, achieving better results compared to other algorithms.

ENGINEERING STRUCTURES (2022)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Group theory-based optimization algorithm for solving knapsack problems

Yichao He et al.

Summary: The paper proposes a group theory-based optimization algorithm (GTOA) for knapsack problems, which uses group operations in the evolution process and is validated as an efficient algorithm. Comparative results show that GTOA outperforms other evolutionary algorithms, and it is also the first paradigm to apply group theory directly to design an evolutionary algorithm.

KNOWLEDGE-BASED SYSTEMS (2021)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Multistart solution-based tabu search for the Set-Union Knapsack Problem

Zequn Wei et al.

Summary: A multistart solution-based tabu search algorithm was investigated for the NP-hard Set-Union Knapsack Problem, achieving good computational results and shedding light on the key composing ingredients of the algorithm.

APPLIED SOFT COMPUTING (2021)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Kernel based tabu search for the Set-union Knapsack Problem

Zequn Wei et al.

Summary: The algorithm introduced in this study aims to solve the Set-union Knapsack Problem efficiently through its original kernel-based search components and an effective local search procedure. Extensive computational assessments demonstrate its high performance on benchmark instances. Providing access to the algorithm's code aims to facilitate its practical use.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

添加到收藏夹

Article Mathematics

A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

Jose Garcia et al.

Summary: This article proposes a hybrid algorithm that integrates the k-means algorithm into a binary version of cuckoo search to solve the NP-hard Set-Union Knapsack Problem. Numerical experiments show that the hybrid algorithm consistently produces superior results in most medium instances, but its performance degrades in large instances.

MATHEMATICS (2021)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Solving the set-union knapsack problem by a novel hybrid Jaya algorithm

Congcong Wu et al.

SOFT COMPUTING (2020)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Evolutionary and adaptive inheritance enhanced Grey Wolf Optimization algorithm for binary domains

Ilker Golcuk et al.

KNOWLEDGE-BASED SYSTEMS (2020)

添加到收藏夹

Article Mathematics

A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem

Jose Garcia et al.

MATHEMATICS (2020)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Influence of initialization on the performance of metaheuristic optimizers

Qian Li et al.

APPLIED SOFT COMPUTING (2020)

添加到收藏夹

Article Computer Science, Theory & Methods

A swarm intelligence-based algorithm for the set-union knapsack problem

Fehmi Burcin Ozsoydan et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Artificial search agents with cognitive intelligence for binary optimization problems

Fehmi Burcin Ozsoydan

COMPUTERS & INDUSTRIAL ENGINEERING (2019)

添加到收藏夹

Article Computer Science, Theory & Methods

Iterated two-phase local search for the Set-Union Knapsack Problem

Zequn Wei et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)

添加到收藏夹

Article Mathematics

The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm

Yanhong Feng et al.

MATHEMATICS (2019)

添加到收藏夹

Article Computer Science, Information Systems

Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems

Yanhong Feng et al.

IEEE ACCESS (2019)

添加到收藏夹

Article Computer Science, Information Systems

Estimation of Distribution Algorithm Based on Levy Flight for Solving the Set-Union Knapsack Problem

Xue-Jing Liu et al.

IEEE ACCESS (2019)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Predicting protein-protein interaction sites using modified support vector machine

Hong Guo et al.

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS (2018)

添加到收藏夹

Article Computer Science, Theory & Methods

A novel binary artificial bee colony algorithm for the set-union knapsack problem

Yichao He et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2018)

添加到收藏夹

Article Computer Science, Artificial Intelligence

A k-means binarization framework applied to multidimensional knapsack problem

Jos Garcia et al.

APPLIED INTELLIGENCE (2018)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Probabilistic shape design optimization of structural components under fatigue

Manolis Georgioudakis et al.

COMPUTERS & STRUCTURES (2017)

添加到收藏夹

Article Management

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Xinan Yang et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

添加到收藏夹

Article Mathematics, Applied

A note on the set union knapsack problem

Ashwin Arulselvan

DISCRETE APPLIED MATHEMATICS (2014)

添加到收藏夹

Article Computer Science, Software Engineering

A Key-Pose Caching System for Rendering an Animated Crowd in Real-Time

W. Lister et al.

COMPUTER GRAPHICS FORUM (2010)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.