A memetic immunological algorithm for resource allocation problem

Authors:
Jole Costanza;Vincenzo Cutello;Mario Pavone
Affiliations:
Department of Mathematics and Computer Science, University of Catania, Catania, Italy;Department of Mathematics and Computer Science, University of Catania, Catania, Italy;Department of Mathematics and Computer Science, University of Catania, Catania, Italy
Venue:
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Year:
2011

Citing 10
Cited 0

Resource allocation problems: algorithmic approaches

Resource allocation problems: algorithmic approaches
Factorial sampling plans for preliminary computational experiments

Technometrics
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
The vehicle routing problem

The vehicle routing problem
Introduction to Algorithms

Introduction to Algorithms
Genetic Algorithms for the Multiple Container Packing Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator

Proceedings of the 2006 ACM symposium on Applied computing
Bin completion algorithms for multicontainer packing, knapsack, and covering problems

Journal of Artificial Intelligence Research
A hybrid immune algorithm with information gain for the graph coloring problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
An Immune Algorithm for Protein Structure Prediction on Lattice Models

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this research work, we present a combination of a memetic algorithm and an immunological algorithm that we call Memetic Immunological Algorithm - MIA. This algorithm has been designed to tackle the resource allocation problem on a communication network. The aim of the problem is to supply all resource requested on a communication network with minimal costs and using a fixed number of providers, everyone with a limited resource quantity to be supplied. The scheduling of several resource allocations is a classical combinatorial problem that finds many applications in real-world problems. MIA incorporates two deterministic approaches: (1) a local search operator, which is based on the exploration of the neighbourhood; and (2) a deterministic approach for the assignment scheme based on the Depth First Search (DFS) algorithm. The results show that the usage of a local search procedure and mainly the DFS algorithm is an effective and efficient approach to better exploring the complex search space of the problem. To evaluate the performances of MIA we have used 28 different instances. The obtained results suggest that MIA is an effective optimization algorithm in terms of the quality of the solution produced and of the computational effort.