Solving Multi-Objective Resource Allocation Problem Using Multi-Objective Binary Artificial Bee Colony Algorithm
Abstract
Resource allocation is the optimal distribution in a limited number of resources available for certain activities. The large activities requires exponentially multiplying computation cost. Therefore, resource problem known as NP-Hard literature. In this study, multi-objective binary artificial bee colony algorithm has been proposed solving problems. benefited from robust structure and easy implementation properties algorithm. contribution to introduce version with advanced local search format using transfer functions. improved two versions sigmoid hyperbolic tangent functions be able space. With algorithms, problems literature are solved, algorithms compared other that develop same results obtained show give effective on problem. Especially, large-scale problems, higher accuracy values reached smaller evaluations.