Multidimensional 0–1 Knapsack using directed Bee Colony algorithm

Bole, Amol V.; Kumar, Rajesh

doi:10.1109/itcosp.2017.8303080

2017 IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing (INCOS) 2017

DOI: 10.1109/itcosp.2017.8303080

View full text | Cite

Multidimensional 0–1 Knapsack using directed Bee Colony algorithm

Amol V. Bole

Rajesh Kumar

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results obtained by this one produced better solutions in shorter time than the ABC algorithm without the communication mechanism. In the same way,[123] proposed a hybrid algorithm for solving MKP that integrates two models: A new ABC algorithm and a GA tournament selection. The first model consists of an ABC in which honey bees are directed with a multi-agent system.The agents collect solutions of individual bees before than a coordinator agent selects the best solution from all collected solutions.…”

mentioning

confidence: 99%

The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches

Laabadi¹,

Naimi²,

Amri³

et al. 2018

AJOR

View full text Add to dashboard Cite

The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, telecommunications and other fields. In the 0/1 MKP, a set of items is given, each with a size and value, which has to be placed into a knapsack that has a certain number of dimensions having each a limited capacity. The goal is to find a subset of items leading to the maximum total profit while respecting the capacity constraints. Even though the 0/1 MKP is well studied in the literature, we can just find a little number of recent review papers on this problem. Furthermore, the existing reviews focus particularly on some specific issues. This paper aims to give a general and comprehensive survey of the considered problem so that it can be useful for both researchers and practitioners. Indeed, we first describe the 0/1 MKP and its relevant variants. Then, we present the detailed models of some important real-world applications of this problem. Moreover, an important collection of recently published heuristics and metaheuristics is categorized and briefly reviewed. These approaches are then quantitatively compared through some indicative statistics. Finally, some synthetic remarks and research directions are highlighted in the conclusion.

show abstract

mentioning

confidence: 99%

The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches

Laabadi¹,

Naimi²,

Amri³

et al. 2018

AJOR

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based startup that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

334 Leonard St

Brooklyn, NY 11211

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Multidimensional 0–1 Knapsack using directed Bee Colony algorithm

Cited by 1 publication

References 30 publications

The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches

The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches

Contact Info

Product

Resources

About