A hybrid search algorithm with heuristics for resource allocation problem

Authors:
Zne-Jung Lee;Chou-Yuan Lee
Affiliations:
Department of Information Management, Kang-Ning Junior College of Medical Care and Management, Nei-Hu, Taipei, Taiwan, ROC;Department of Information Management, Lan-Yang Institute of Technology, Tawain, ROC
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2005

Citing 10
Cited 11

Resource allocation problems: algorithmic approaches

Resource allocation problems: algorithmic approaches
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Genetic local search in combinatorial optimization

CO89 Selected papers of the conference on Combinatorial Optimization
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
Evolutionary computation: comments on the history and current state

IEEE Transactions on Evolutionary Computation
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem

IEEE Transactions on Evolutionary Computation
Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

A new adaptive genetic algorithm for fixed channel assignment

Information Sciences: an International Journal
An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers

Information Sciences: an International Journal
Comparing evolutionary hybrid systems for design and optimization of multilayer perceptron structure along training parameters

Information Sciences: an International Journal
A hybrid genetic algorithm and bacterial foraging approach for global optimization

Information Sciences: an International Journal
An heuristic search technique for fixed frequency assignment in non-homogeneous demand systems

Signal Processing
A temperature-aware virtual submesh allocation scheme for noc-based manycore chips

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Applying hybrid meta-heuristics for capacitated vehicle routing problem

Expert Systems with Applications: An International Journal
Improved Clonal Selection Algorithm Combined with Ant Colony Optimization

IEICE - Transactions on Information and Systems
An unorthodox introduction to Memetic Algorithms

ACM SIGEVOlution
A hybrid genetically-bacterial foraging algorithm converged by particle swarm optimisation for global optimisation

International Journal of Bio-Inspired Computation
An ACO-RFD hybrid method to solve NP-complete problems

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

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.