scispace - formally typeset
Journal ArticleDOI

Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem

TLDR
The results demonstrate that the proposed IWD‐MKP algorithm is trustable and promising in finding the optimal or near‐optimal solutions and it is proved that the IWD algorithm has the property of the convergence in value.
Abstract
Purpose – The purpose of this paper is to test the capability of a new population‐based optimization algorithm for solving an NP‐hard problem, called “Multiple Knapsack Problem”, or MKP.Design/methodology/approach – Here, the intelligent water drops (IWD) algorithm, which is a population‐based optimization algorithm, is modified to include a suitable local heuristic for the MKP. Then, the proposed algorithm is used to solve the MKP.Findings – The proposed IWD algorithm for the MKP is tested by standard problems and the results demonstrate that the proposed IWD‐MKP algorithm is trustable and promising in finding the optimal or near‐optimal solutions. It is proved that the IWD algorithm has the property of the convergence in value.Originality/value – This paper introduces the new optimization algorithm, IWD, to be used for the first time for the MKP and shows that the IWD is applicable for this NP‐hard problem. This research paves the way to modify the IWD for other optimization problems. Moreover, it opens...

read more

Citations
More filters
Journal ArticleDOI

Metaheuristic research: a comprehensive survey

TL;DR: A survey of metaheuristic research in literature consisting of 1222 publications from year 1983 to 2016 is performed to highlight potential open questions and critical issues raised in literature and provides guidance for future research to be conducted more meaningfully.
Journal ArticleDOI

The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm

TL;DR: The intelligent water drops (IWD) algorithm is tested to find solutions of the n-queen puzzle with a simple local heuristic and the travelling salesman problem (TSP) is also solved with a modified IWD algorithm.
Journal ArticleDOI

Review: Multi-objective optimization methods and application in energy saving

TL;DR: In order to get the final optimal solution in the real-world multi-objective optimization problems, trade-off methods including a priori methods, interactive methods, Pareto-dominated methods and new dominance methods are utilized.
Journal ArticleDOI

Political Optimizer: A novel socio-inspired meta-heuristic for global optimization

TL;DR: The results show that PO outperforms all other algorithms, and consistency in performance on such a comprehensive suite of benchmark functions proves the versatility of the algorithm.
Journal ArticleDOI

Nature Inspired Computing: An Overview and Some Future Directions

TL;DR: An overview of significant advances made in the emerging field of nature-inspired computing with a focus on the physics- and biology-based approaches and algorithms is presented.
References
More filters
Journal ArticleDOI

Optimization by Simulated Annealing

TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book

Adaptation in natural and artificial systems

TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Book

Ant Colony Optimization

TL;DR: Ant colony optimization (ACO) is a relatively new approach to problem solving that takes inspiration from the social behaviors of insects and of other animals as discussed by the authors In particular, ants have inspired a number of methods and techniques among which the most studied and the most successful is the general purpose optimization technique known as ant colony optimization.
Journal ArticleDOI

Tabu Search—Part II

TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Book

Knapsack Problems: Algorithms and Computer Implementations

TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.