scholarly journals A Novel Monarch Butterfly Optimization with Global Position Updating Operator for Large-Scale 0-1 Knapsack Problems

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1056 ◽  
Author(s):  
Feng ◽  
Yu ◽  
Wang
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Orthogonal Design ◽  
Continuous Optimization ◽  
Monarch Butterfly ◽  
Migration Behavior ◽  
Monarch Butterflies ◽  
Monarch Butterfly Optimization ◽  
Low Dimensional ◽  
Continuous Optimization Problems

As a significant subset of the family of discrete optimization problems, the 0-1 knapsack problem (0-1 KP) has received considerable attention among the relevant researchers. The monarch butterfly optimization (MBO) is a recent metaheuristic algorithm inspired by the migration behavior of monarch butterflies. The original MBO is proposed to solve continuous optimization problems. This paper presents a novel monarch butterfly optimization with a global position updating operator (GMBO), which can address 0-1 KP known as an NP-complete problem. The global position updating operator is incorporated to help all the monarch butterflies rapidly move towards the global best position. Moreover, a dichotomy encoding scheme is adopted to represent monarch butterflies for solving 0-1 KP. In addition, a specific two-stage repair operator is used to repair the infeasible solutions and further optimize the feasible solutions. Finally, Orthogonal Design (OD) is employed in order to find the most suitable parameters. Two sets of low-dimensional 0-1 KP instances and three kinds of 15 high-dimensional 0-1 KP instances are used to verify the ability of the proposed GMBO. An extensive comparative study of GMBO with five classical and two state-of-the-art algorithms is carried out. The experimental results clearly indicate that GMBO can achieve better solutions on almost all the 0-1 KP instances and significantly outperforms the rest.

scholarly journals Tree-Seed Algorithm for Large-Scale Binary Optimization

2018 ◽  
Vol 3 (1) ◽  
pp. 48 ◽  
Author(s):  
Ahmet Cevahir Cinar ◽  
Hazim Iscan ◽  
Mustafa Servet Kiran
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Logic Gate ◽  
Continuous Optimization ◽  
Population Based ◽  
Benchmark Problems ◽  
Binary Optimization ◽  
Continuous Optimization Problems ◽  
Computation Algorithms ◽  
Tree Seed

Population-based swarm or evolutionary computation algorithms in optimization are attracted the interest of the researchers due their simple structure, optimization performance, easy-adaptation. Binary optimization problems can be also solved by using these algorithms. This paper focuses on solving large scale binary optimization problems by using Tree-Seed Algorithm (TSA) proposed for solving continuous optimization problems by imitating relationship between the trees and their seeds in nature. The basic TSA is modified by using xor logic gate for solving binary optimization problems in this study. In order to investigate the performance of the proposed algorithm, the numeric benchmark problems with the different dimensions are considered and obtained results show that the proposed algorithm produces effective and comparable solutions in terms of solution quality.Keywords: binary optimization, tree-seed algorithm, xor-gate, large-scale optimization

scholarly journals A survey on evolutionary computation for complex continuous optimization

2021 ◽  
Author(s):  
Zhi-Hui Zhan ◽  
Lin Shi ◽  
Kay Chen Tan ◽  
Jun Zhang
Keyword(s):  
Evolutionary Computation ◽  
Large Scale ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Future Research ◽  
Practical Applications ◽  
Fast Development ◽  
Comprehensive Survey ◽  
Continuous Optimization Problems ◽  
Expensive Optimization

AbstractComplex continuous optimization problems widely exist nowadays due to the fast development of the economy and society. Moreover, the technologies like Internet of things, cloud computing, and big data also make optimization problems with more challenges including Many-dimensions, Many-changes, Many-optima, Many-constraints, and Many-costs. We term these as 5-M challenges that exist in large-scale optimization problems, dynamic optimization problems, multi-modal optimization problems, multi-objective optimization problems, many-objective optimization problems, constrained optimization problems, and expensive optimization problems in practical applications. The evolutionary computation (EC) algorithms are a kind of promising global optimization tools that have not only been widely applied for solving traditional optimization problems, but also have emerged booming research for solving the above-mentioned complex continuous optimization problems in recent years. In order to show how EC algorithms are promising and efficient in dealing with the 5-M complex challenges, this paper presents a comprehensive survey by proposing a novel taxonomy according to the function of the approaches, including reducing problem difficulty, increasing algorithm diversity, accelerating convergence speed, reducing running time, and extending application field. Moreover, some future research directions on using EC algorithms to solve complex continuous optimization problems are proposed and discussed. We believe that such a survey can draw attention, raise discussions, and inspire new ideas of EC research into complex continuous optimization problems and real-world applications.

scholarly journals Binary social group optimization algorithm for solving 0-1 knapsack problem

2022 ◽  
Vol 11 (1) ◽  
pp. 55-72 ◽  
Author(s):  
Anima Naik ◽  
Pradeep Kumar Chokkalingam
Keyword(s):  
Knapsack Problem ◽  
Social Group ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
High Dimensional ◽  
The Social ◽  
Social Group Optimization ◽  
Low Dimensional ◽  
Continuous Optimization Problems

In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems. So a transformation function is used to convert the continuous values generated from SGO into binary ones. The experiments are carried out using both low-dimensional and high-dimensional knapsack problems. The results obtained by the BSGO algorithm are compared with other binary optimization algorithms. Experimental results reveal the superiority of the BSGO algorithm in achieving a high quality of solutions over different algorithms and prove that it is one of the best finding algorithms especially in high-dimensional cases.

Multi-Objective Reliability-Based Optimization with Stochastic Metamodels

2011 ◽  
Vol 19 (4) ◽  
pp. 525-560 ◽  
Author(s):  
Rajan Filomeno Coelho ◽  
Philippe Bouillard
Keyword(s):  
Structural Engineering ◽  
Large Scale ◽  
Optimization Problems ◽  
Probability Distributions ◽  
Computational Cost ◽  
Continuous Optimization ◽  
Computational Effort ◽  
Kriging Interpolation ◽  
Simulation Code ◽  
Continuous Optimization Problems

This paper addresses continuous optimization problems with multiple objectives and parameter uncertainty defined by probability distributions. First, a reliability-based formulation is proposed, defining the nondeterministic Pareto set as the minimal solutions such that user-defined probabilities of nondominance and constraint satisfaction are guaranteed. The formulation can be incorporated with minor modifications in a multiobjective evolutionary algorithm (here: the nondominated sorting genetic algorithm-II). Then, in the perspective of applying the method to large-scale structural engineering problems—for which the computational effort devoted to the optimization algorithm itself is negligible in comparison with the simulation—the second part of the study is concerned with the need to reduce the number of function evaluations while avoiding modification of the simulation code. Therefore, nonintrusive stochastic metamodels are developed in two steps. First, for a given sampling of the deterministic variables, a preliminary decomposition of the random responses (objectives and constraints) is performed through polynomial chaos expansion (PCE), allowing a representation of the responses by a limited set of coefficients. Then, a metamodel is carried out by kriging interpolation of the PCE coefficients with respect to the deterministic variables. The method has been tested successfully on seven analytical test cases and on the 10-bar truss benchmark, demonstrating the potential of the proposed approach to provide reliability-based Pareto solutions at a reasonable computational cost.

Sign in / Sign up

Export Citation Format

Share Document