Search
  Advanced Search
 
Journal search
Journal cover: International Journal of Intelligent Computing and Cybernetics

International Journal of Intelligent Computing and Cybernetics

ISSN: 1756-378X

Online from: 2008

Subject Area: Electrical & Electronic Engineering

Content: Latest Issue | icon: RSS Latest Issue RSS | Previous Issues

 

Previous article.Icon: Print.Table of Contents.Next article.Icon: .

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


Document Information:
Title:Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem
Author(s):Hamed Shah-Hosseini, (Electrical and Computer Engineering Department, Shahid Beheshti University, Tehran, Iran)
Citation:Hamed Shah-Hosseini, (2008) "Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem", International Journal of Intelligent Computing and Cybernetics, Vol. 1 Iss: 2, pp.193 - 212
Keywords:Optimization techniques, Programming and algorithm theory, Systems and control theory
Article type:Research paper
DOI:10.1108/17563780810874717 (Permanent URL)
Publisher:Emerald Group Publishing Limited
Acknowledgements:The author would like to express his gratitude to grateful to the anonymous referees for their valuable comments and suggestions, which led to the better presentation of this paper in IJICC.
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 the way to get possibly better results by modifying the proposed IWD-MKP algorithm.



Fulltext Options:

Login

Login

Existing customers: login
to access this document

Login


- Forgot password?
- Athens/Institutional login

Purchase

Purchase

Downloadable; Printable; Owned
HTML, PDF (339kb)

Due to our platform migration, pay-per-view is temporarily unavailable.

To purchase this item please login or register.

Login


- Forgot password?

Recommend to your librarian

Complete and print this form to request this document from your librarian


Marked list


Bookmark & share

Reprints & permissions