Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Optimizing Deployment- Scheme System Using the Concept of Bin Packing Algorithm


Affiliations
1 Academy of Mathematics and System Sciences, Graduate University of Chinese Academy of Sciences, Beijing, China
2 Department of Computer Technology, Yaba College of Technology, Yaba-Lagos, Nigeria
3 Department of Computer Science, College of Natural Sciences, University of Agriculture, Abeokuta, Ogun State, India
4 Department of Computer Science, College of Natural Sciences, University of Agriculture, Abeokuta, Ogun State, Nigeria
     

   Subscribe/Renew Journal


Deployment scheme is a variant of bin packing problem which is known to be an NP-complete problem. The deployment scheme problem asks for the minimum number k of identical bins (states) of capacity C needed to store a finite collection of weights (corps members) w1, w2, w3, ... , wn so that no bin has weights stored in it whose sum exceeds the bin's capacity. Traditionally, the capacity C is chosen to be 1 and the weights are real numbers which lie between 0 and 1, but here, for convenience of exposition, the consideration will be a situation where C is a positive integer and the weights are positive integers which are less than the capacity. The bin packing concepts was modified by adding some other soft and hard constraints. The algorithm was tested with real life data of graduate from Nigerian tertiary institutions who are to be deployed for the National Youth Service Corps (NYSC) Scheme and interesting results were obtained.

Keywords

Bin Packing Algorithm, Hard and Soft Constraints, NP Problem, Optimization.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 207

PDF Views: 3




  • Optimizing Deployment- Scheme System Using the Concept of Bin Packing Algorithm

Abstract Views: 207  |  PDF Views: 3

Authors

Arogundade O. Tale
Academy of Mathematics and System Sciences, Graduate University of Chinese Academy of Sciences, Beijing, China
Ikotun A. Motunrayo
Department of Computer Technology, Yaba College of Technology, Yaba-Lagos, Nigeria
Akinwale A. Taofik
Department of Computer Science, College of Natural Sciences, University of Agriculture, Abeokuta, Ogun State, India
Ogunnowo Olubunmi
Department of Computer Science, College of Natural Sciences, University of Agriculture, Abeokuta, Ogun State, Nigeria

Abstract


Deployment scheme is a variant of bin packing problem which is known to be an NP-complete problem. The deployment scheme problem asks for the minimum number k of identical bins (states) of capacity C needed to store a finite collection of weights (corps members) w1, w2, w3, ... , wn so that no bin has weights stored in it whose sum exceeds the bin's capacity. Traditionally, the capacity C is chosen to be 1 and the weights are real numbers which lie between 0 and 1, but here, for convenience of exposition, the consideration will be a situation where C is a positive integer and the weights are positive integers which are less than the capacity. The bin packing concepts was modified by adding some other soft and hard constraints. The algorithm was tested with real life data of graduate from Nigerian tertiary institutions who are to be deployed for the National Youth Service Corps (NYSC) Scheme and interesting results were obtained.

Keywords


Bin Packing Algorithm, Hard and Soft Constraints, NP Problem, Optimization.