A Novel Hybrid Algorithm for Big Resource Allocation Problems

The complexity of resource allocation problems is usually NP-complete, which makes exact method inadequate to handle Resource allocation problems, and encourages heuristic techniques to this class of problems for obtaining approximate solutions in polynomial time. Different heuristic techniques have already been investigated for handling various Resource allocation problems. In this paper, we propose a novel hybrid search algorithm that combines the merit of genetic algorithm and tabu search optimization. In our implementation, both iteration number fixed algorithm and running time fixed algorithm are well designed for the resource allocation problem. Furthermore, Simulation results are reported and it shows that proposed algorithm indeed have admirable performance for tested problems.