Welcome to the InfoSci Platform
Reference Hub1
A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

Sara Sabba, Salim Chikhi
Copyright: © 2015 |Volume: 6 |Issue: 2 |Pages: 20
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781466678002|DOI: 10.4018/ijoris.2015040101
Cite Article Cite Article

MLA

Sabba, Sara, and Salim Chikhi. "A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem." IJORIS vol.6, no.2 2015: pp.1-20. http://doi.org/10.4018/ijoris.2015040101

APA

Sabba, S. & Chikhi, S. (2015). A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem. International Journal of Operations Research and Information Systems (IJORIS), 6(2), 1-20. http://doi.org/10.4018/ijoris.2015040101

Chicago

Sabba, Sara, and Salim Chikhi. "A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem," International Journal of Operations Research and Information Systems (IJORIS) 6, no.2: 1-20. http://doi.org/10.4018/ijoris.2015040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Binary optimization problems are in the most case the NP-hard problems that call to satisfy an objective function with or without constraints. Various optimization problems can be formulated in binary expression whither they can be resolved in easier way. Optimization literature supplies a large number of approaches to find solutions to binary hard problems. However, most population-based algorithms have a great tendency to be trapped in local optima particularly when solving complex optimization problems. In this paper, the authors introduce a new efficient population-based technique for binary optimization problems (that we called EABOP). The proposed algorithm can provide an effective search through a new proposed binary mutation operator. The performance of our approach was tested on hard instances of the multidimensional knapsack problem. The obtained results show that the new algorithm is able of quickly obtaining high-quality solutions for most hard instances of the problem.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.