Title
A hybrid search algorithm with heuristics for resource allocation problem
Abstract
The resource allocation problelm 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 implelmentation, both GA and ACO are well designed for the resource allocation problelm. Fur thermore, 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.
Year
DOI
Venue
2005
10.1016/j.ins.2004.07.010
Inf. Sci.
Keywords
Field
DocType
hybrid search algorithm,ant colony optimization,resource allocation problem,best solution,genetic algorithm,resource allocation problelm,search space,search performance,simulation result,proposed algorithm,admirable performance,search algorithm,resource allocation,hybrid system
Ant colony optimization algorithms,Mathematical optimization,Search algorithm,Computer science,Exploit,Resource allocation,Heuristics,Artificial intelligence,Hybrid system,Best-first search,Genetic algorithm,Machine learning
Journal
Volume
Issue
ISSN
173
1-3
0020-0255
Citations 
PageRank 
References 
36
2.06
9
Authors
2
Name
Order
Citations
PageRank
Zne-Jung Lee194043.45
Chou-Yuan Lee229517.36