A hybrid search algorithm with heuristics for resource allocation problem

The resource allocation problem is to allocate resources to activities so that the cost becomes as optimal as possible. In this paper, a hybrid search algorithm with heuristics for resource allocation problem encountered in practice is proposed. The proposed algorithm has both the advantages of genetic algorithm (GA) and ant colony optimization (ACO) that can explore the search space and exploit the best solution. In our implementation, both GA and ACO are well designed for the resource allocation problem. Furthermore, heuristics are used to ameliorate the search performance for resource allocation problem. Simulation results were reported and the proposed algorithm indeed have admirable performance for tested problems.