A Memetic Immunological Algorithm for Resource Allocation Problem

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.

[1]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[2]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[3]  Vincenzo Cutello,et al.  Exploring the Capability of Immune Algorithms: A Characterization of Hypermutation Operators , 2004, ICARIS.

[4]  Bala Shetty,et al.  The Nonlinear Resource Allocation Problem , 1995, Oper. Res..

[5]  Vincenzo Cutello,et al.  An immune algorithm with hyper-macromutations for the Dill's 2D hydrophobic-hydrophilic model , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[6]  Vincenzo Cutello,et al.  An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem , 2007, J. Comb. Optim..

[7]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[8]  Vincenzo Cutello,et al.  A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem , 2003, GECCO.

[9]  Vincenzo Cutello,et al.  An Immune Algorithm for Protein Structure Prediction on Lattice Models , 2007, IEEE Transactions on Evolutionary Computation.

[10]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..

[11]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[12]  Günther R. Raidl,et al.  Genetic Algorithms for the Multiple Container Packing Problem , 1998, PPSN.

[13]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[14]  Max D. Morris,et al.  Factorial sampling plans for preliminary computational experiments , 1991 .

[15]  Vincenzo Cutello,et al.  Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator , 2006, SAC.

[16]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[17]  Richard E. Korf,et al.  Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems , 2011, J. Artif. Intell. Res..

[18]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[19]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.

[20]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.