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.

### A Memetic Immunological Algorithm for Resource Allocation Problem

#### 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.
##### Scheda breve Scheda completa Scheda completa (DC)
2011
memetic immunological algorithm; combinatorial optimization; clonal selection algorithms
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/20.500.11769/93143`
• ND
• 3
• ND