4.7 Article

An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

An investigation of F-Race training strategies for cross domain optimisation with memetic algorithms

Duriye Betul Gumus et al.

Summary: Parameter tuning is crucial for improving metaheuristic performance, but there is a lack of systematic research in this field. This study uses the automated F-Race method for parameter tuning and the results on nine single-objective problem domains show that this method is capable of finding good parameter settings, outperforming many methods from the literature, with different configurations identified as the best depending on the training approach used.

INFORMATION SCIENCES (2023)

Article Computer Science, Information Systems

Evolutionary-state-driven multi-swarm cooperation particle swarm optimization for complex optimization problem

Xu Yang et al.

Summary: To overcome the shortcomings of premature convergence and poor global search ability in PSO, a novel ESD-PSO algorithm is proposed. It introduces an adaptive multi-swarm cooperation mechanism (AMC) to enhance information exchange efficiency among sub-swarms. Additionally, a stagnation compensation strategy (SCS) is triggered to increase the diversity of stagnant sub-swarms, and a competitive disturbance mechanism (CDM) is used to improve solution accuracy. Experimental results demonstrate the superiority of ESD-PSO compared to other PSO variants.

INFORMATION SCIENCES (2023)

Article Computer Science, Information Systems

Efficient mining of top-k high utility itemsets through genetic algorithms

Jose Maria Luna et al.

Summary: Mining high utility itemsets is a burgeoning research field in data mining, aiming to discover itemsets with utility values above a predefined threshold. This paper introduces a novel genetic algorithm, TKHUIM-GA, which guides the search process based on item utility to improve runtime and memory consumption. Unlike existing approaches, TKHUIM-GA is capable of handling positive, negative, integer, and real unit utility values.

INFORMATION SCIENCES (2023)

Article Automation & Control Systems

Binary Aquila Optimizer for 0-1 knapsack problems

Emine Bas

Summary: The optimization process aims to find the best values for system characteristics to minimize the cost of system design. Optimization approaches have been successful in addressing discrete and unconstrained problems in artificial intelligence and machine learning. The Aquila Optimizer (AO) is a heuristic algorithm based on swarm intelligence that mimics the natural behavior of the Aquila. A new algorithm, BAO, is proposed for binary optimization problems and shows promising results compared to other recent heuristic algorithms.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2023)

Article Computer Science, Information Systems

A chaotic differential evolution and symmetric direction sampling for large-scale multiobjective optimization

Qinghua Gu et al.

Summary: This article proposes a Chaotic Differential Evolution and Symmetric Direction Sampling (CDE-SDS) method for large-scale multiobjective optimization. The CDE-SDS method utilizes chaotic differential evolution strategy to accelerate convergence and employs symmetric direction sampling strategy to explore the high-dimensional decision space. Experimental results show that CDE-SDS outperforms seven compared algorithms in terms of diversity and convergence under limited function evaluations.

INFORMATION SCIENCES (2023)

Article Computer Science, Information Systems

Multi-surrogate-assisted stochastic fractal search algorithm for high-dimensional expensive problems *

Xiaodi Cheng et al.

Summary: In this paper, a multi-surrogate-assisted stochastic fractal search algorithm (MSASFS) is proposed to solve high-dimensional expensive problems. The proposed algorithm improves the generalization ability and extends the exploration scope by combining the original coordinate system with the eigencoordinate system. It also employs an expected improvement (EI) pre-screening strategy based on the Gaussian process (GP) model and applies two different surrogate models to enhance robustness.

INFORMATION SCIENCES (2023)

Article Computer Science, Information Systems

New cardiovascular disease prediction approach using support vector machine and quantum-behaved particle swarm optimization

E. I. Elsedimy et al.

Summary: Cardiovascular disease is a leading cause of death globally, and early detection plays a vital role in reducing the risk and improving recovery chances. Existing diagnostic methods for CVD are costly, have adverse side effects, and show low detection rates. This study proposes a novel heart disease detection model, QPSO-SVM, based on the quantum-behaved particle swarm optimization algorithm and support vector machine classification model, which achieves high prediction accuracies and outperforms other state-of-the-art models.

MULTIMEDIA TOOLS AND APPLICATIONS (2023)

Article Computer Science, Information Systems

Modified Artificial Bee Colony Algorithm for Multiple-Choice Multidimensional Knapsack Problem

Arij Mkaouar et al.

Summary: In this study, a Modified Artificial Bee Colony algorithm (MABC) is proposed to solve the multiple-choice multidimensional knapsack problem (MMKP). The MABC algorithm employs surrogate relaxation, Hamming distance, and a tabu list to enhance the local search process and exploit neighborhood information. Experimental results show that the MABC algorithm produces highly competitive solutions in terms of the best solutions found and demonstrates improved CPU efficiency compared to other state-of-the-art algorithms.

IEEE ACCESS (2023)

Article Economics

A combined forecasting and packing model for air cargo loading: Arisk-averse framework

Iordanis Tseremoglou et al.

Summary: This paper presents a decision-support tool for air cargo revenue management departments to assist in the acceptance/rejection process of cargo bookings. The authors propose data-driven algorithms for predicting cargo space and shipment dimensions and solve a packing problem sequentially for each new booking request. Results show that their method outperforms the one used by the partner airline and offers a more robust acceptance strategy in terms of reducing the number of unplanned offloadings.

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2022)

Article Computer Science, Interdisciplinary Applications

Enhanced grasshopper optimization algorithm using elite opposition-based learning for solving real-world engineering problems

Betul Sultan Yildiz et al.

Summary: The paper introduces a new optimization algorithm - elite opposition-based learning grasshopper optimization method (EOBL-GOA), and through validation with multiple engineering design problems, the results indicate that the method is considered one of the best algorithms reported in the literature.

ENGINEERING WITH COMPUTERS (2022)

Article Automation & Control Systems

Solving a novel multi-divisional project portfolio selection and scheduling problem

Kyle Robert Harrison et al.

Summary: This article proposes a novel model for project portfolio selection and scheduling problem (PPSSP) that can handle multiple groups of projects in real-world scenarios. It also presents three hybrid meta-heuristic algorithms to provide high-quality solutions.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2022)

Article Computer Science, Artificial Intelligence

A Cluster-Based Competitive Particle Swarm Optimizer with a Sparse Truncation Operator for Multi-Objective Optimization

Xiangyu Wang et al.

Summary: This paper proposes a novel cluster-based competitive particle swarm optimizer equipped with a sparse truncation operator for solving sparse multi-objective optimization problems. Experimental results show that the proposed algorithm outperforms its peers on sparse test instances and neural network training tasks.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Computer Science, Artificial Intelligence

Novel binary differential evolution algorithm based on Taper-shaped transfer functions for binary optimization problems

Yichao He et al.

Summary: This paper proposes a new class of transfer functions, Taper-shaped transfer functions, for efficiently solving binary optimization problems using differential evolution (DE). Based on these transfer functions, the novel binary differential evolution algorithm, T-NBDE, is proposed. Experimental results show that Taper-shaped transfer functions are competitive and T-NBDE outperforms existing algorithms in solving the knapsack problem with a single continuous variable (KPC) and the uncapacitated facility location problem (UFLP).

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Computer Science, Information Systems

Hybrid particle swarm optimizer with fitness-distance balance and individual self-exploitation strategies for numerical optimization problems

Kaitong Zheng et al.

Summary: This paper proposes a hybrid particle swarm optimizer with fitness-distance balance and individual self-exploitation strategies to overcome the deficiencies of the original PSO. By improving the learning strategy and balancing the weight between exploitation and exploration, the proposed optimizer shows excellent performance in experiments.

INFORMATION SCIENCES (2022)

Article Multidisciplinary Sciences

Fitness-Based Acceleration Coefficients Binary Particle Swarm Optimization (FACBPSO) to Solve the Discounted Knapsack Problem

Adel Sulaiman et al.

Summary: This paper proposes a fitness-based acceleration coefficient binary particle swarm optimization (FACBPSO) algorithm for solving the discounted 0-1 knapsack problem. The algorithm adjusts the values of acceleration coefficients based on the fitness of each particle, leading to improved convergence speed and reduced computing time.

SYMMETRY-BASEL (2022)

Article Computer Science, Information Systems

Many-objective approach based on problem-aware mutation operators for protein encoding

Maria Victoria Diaz-Galian et al.

Summary: A protein encoding algorithm based on a multi-objective approach is proposed in this study, which demonstrates higher efficiency and statistical significance compared to other algorithms. The algorithm optimizes multiple objectives for improving protein expression and introduces novel problem-aware mutation operators.

INFORMATION SCIENCES (2022)

Article Engineering, Electrical & Electronic

State Estimation for Medium- and Low-Voltage Distribution Systems Considering Measurement Characteristics and Grounded Slack Bus

Zhengmei Lu et al.

Summary: This article presents a new set of measurement equations for the mixed three-phase three-wire and three-phase four-wire pattern in distribution systems. It also proposes a three-phase SE model that incorporates constraints and uses the exponentially weighted least squares method. The empirical results demonstrate the accuracy and effectiveness of the proposed formulation.

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT (2022)

Article Engineering, Chemical

Multiobjective optimization of area-to-point heat conduction structure using binary quantum-behaved PSO and Tchebycheff decomposition method

Hongwei Cai et al.

Summary: The study conducted a multiobjective optimization of area-to-point heat conduction using MOMBQPSO/D to minimize both mean temperature and temperature variance. The problem is decomposed into subproblems using Tchebycheff decomposition method and solved simultaneously with the modified binary quantum-behaved PSO. Pareto optimal solutions representing conducting path structures are then selected from the solutions to the subproblems.

CANADIAN JOURNAL OF CHEMICAL ENGINEERING (2021)

Article Computer Science, Artificial Intelligence

A novelx-shaped binary particle swarm optimization

Zahra Beheshti

Summary: A new transfer function called x-shaped BPSO (XBPSO) is proposed in this study to enhance exploration and exploitation of BPSO in the binary search space, as well as to increase solution accuracy and convergence speed. The results show that XBPSO significantly improves BPSO algorithm performance, achieving a minimum error of 8.9% in all benchmark instances and providing superior solutions in 18 out of 23 minimization functions.

SOFT COMPUTING (2021)

Article Computer Science, Information Systems

Novel binary differential evolution algorithm for knapsack problems

Ismail M. Ali et al.

Summary: A novel technique is proposed in this paper to make a simple differential evolution algorithm effective for solving binary-based problems, introducing new components and fitness evaluation approach. Experimental results demonstrate the superiority of this new algorithm in terms of solution quality and computational times compared to other state-of-the-art algorithms.

INFORMATION SCIENCES (2021)

Article Computer Science, Hardware & Architecture

A new quantum particle swarm optimization algorithm for controller placement problem in software-defined networking

Quanyuan Zhang et al.

Summary: Software-defined networking (SDN) algorithms are a new network control and management method that require an efficient controller placement mechanism to meet user requirements and overcome network limitations. By optimizing the traditional QPSO algorithm, the proposed algorithm achieves better performance in multi-controller placement problems.

COMPUTERS & ELECTRICAL ENGINEERING (2021)

Article Automation & Control Systems

A New Binary Particle Swarm Optimization Approach: Momentum and Dynamic Balance Between Exploration and Exploitation

Bach Hoai Nguyen et al.

Summary: The key of applying PSO to binary problems lies in systematically exploring the relationships among velocity, momentum, exploration, and exploitation, helping evolve better solutions.

IEEE TRANSACTIONS ON CYBERNETICS (2021)

Article Computer Science, Artificial Intelligence

A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems

Qinghua Gu et al.

Summary: A new algorithm, RFMOPSO, is proposed in this paper to optimize constrained combinatorial optimization problems by combining multi-objective particle swarm optimization with a random forest model. Adaptive ranking strategy and novel rule are employed to improve search speed and adaptively update particle states for better objective balance and feasible solutions. Experimental results show promising performance on benchmark problems with discrete variables varying from 10 to 100.

KNOWLEDGE-BASED SYSTEMS (2021)

Article Materials Science, Characterization & Testing

Comparision of the political optimization algorithm, the Archimedes optimization algorithm and the Levy flight algorithm for design optimization in industry

Betul Sultan Yildiz et al.

Summary: This article discusses the use of political optimization algorithm (POA), Archimedes' optimization algorithm (AOA), and Levy flight algorithm (LFA) to minimize product costs in product development processes, with a focus on size, shape, and topology optimization methods. The study shows the superiority of POA in optimizing vehicle structures and aims to provide assistance to industrial companies in improving their product design stages.

MATERIALS TESTING (2021)

Article Computer Science, Artificial Intelligence

Evolutionary multi-objective automatic clustering enhanced with quality metrics and ensemble strategy

Shuwei Zhu et al.

KNOWLEDGE-BASED SYSTEMS (2020)

Article Computer Science, Information Systems

A time-varying mirrored S-shaped transfer function for binary particle swarm optimization

Zahra Beheshti

INFORMATION SCIENCES (2020)

Article Computer Science, Artificial Intelligence

A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO

Md Jakirul Islam et al.

APPLIED SOFT COMPUTING (2017)

Article Mathematical & Computational Biology

Cancer Feature Selection and Classification Using a Binary Quantum-Behaved Particle Swarm Optimization and Support Vector Machine

Maolong Xi et al.

COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE (2016)

Article Management

Robust optimization of the 0-1 knapsack problem: Balancing risk and return in assortment optimization

Robert P. Rooderkerk et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

Article Computer Science, Information Systems

A decentralized quantum-inspired particle swarm optimization algorithm with cellular structured population

Wei Fang et al.

INFORMATION SCIENCES (2016)

Article Computer Science, Artificial Intelligence

Binary-coded extremal optimization for the design of PID controllers

Guo-Qiang Zeng et al.

NEUROCOMPUTING (2014)

Article Computer Science, Information Systems

An improved adaptive binary Harmony Search algorithm

Ling Wang et al.

INFORMATION SCIENCES (2013)

Article Computer Science, Artificial Intelligence

S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization

Seyedali Mirjalili et al.

SWARM AND EVOLUTIONARY COMPUTATION (2013)

Article Computer Science, Artificial Intelligence

Quantum-Behaved Particle Swarm Optimization: Analysis of Individual Particle Behavior and Parameter Selection

Jun Sun et al.

EVOLUTIONARY COMPUTATION (2012)

Article Computer Science, Information Systems

Convergence analysis and improvements of quantum-behaved particle swarm optimization

Jun Sun et al.

INFORMATION SCIENCES (2012)

Article Computer Science, Interdisciplinary Applications

Where are the hard knapsack problems?

D Pisinger

COMPUTERS & OPERATIONS RESEARCH (2005)

Article Computer Science, Artificial Intelligence

The particle swarm - Explosion, stability, and convergence in a multidimensional complex space

M Clerc et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2002)