WSEAS Transactions on Computers
Print ISSN: 1109-2750, E-ISSN: 2224-2872
Volume 17, 2018
A Parallel Approach of Best Fit Decreasing Algorithm
Authors: ,
Abstract: In this work we introduce a parallel approach of Best Fit Decreasing algorithm. The Best Fit Decreasing algorithm is heuristic and is used for optimal assignment problems, for example cutting stock problem, bin packing problem etc. The above problems for optimal assignment have very large computational complexity. For this reason have developed heuristic algorithms which aim at the reduction of computational time with disadvantage on solution. The Best Fit Decreasing compute, in most times, a approach of optimal solution. The purpose of the study is twofold: (a) to split the dataset of problem with representative manner so that at every sub-problem to Best Fit Decreasing algorithm is applied and the cost to the results to be the smallest and (b) to be implemented program in Matlab that will running every sub-problem with parallel techniques with the aim of reducing computational time.
Search Articles
Pages: 79-85
WSEAS Transactions on Computers, ISSN / E-ISSN: 1109-2750 / 2224-2872, Volume 17, 2018, Art. #9