A CLONAL SELECTION ALGORITHM TO INVESTIGATE DIVERSE SOLUTIONS FOR THE RELIABLE SERVER ASSIGNMENT PROBLEM

Abdullah Konak, Sadan Kulturel-Konak

2011

Abstract

A reliable server assignment (RSA) problem in networks is defined as determining a deployment of identical servers on a network to maximize a measure of service availability. In this paper, a simulation optimization approach is introduced based on a Monte Carlo simulation and embedded into a Clonal Selection Algorithm (CSA) to find diverse solutions for the RSA problem, which is important in simulation optimization. The experimental results show that the simulation embedded-CSA is an effective heuristic method to discover diverse solutions to the problem.

Paper Citation

in Harvard Style

Konak A. and Kulturel-Konak S. (2011). A CLONAL SELECTION ALGORITHM TO INVESTIGATE DIVERSE SOLUTIONS FOR THE RELIABLE SERVER ASSIGNMENT PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 156-161. DOI: 10.5220/0003644101560161

in Bibtex Style

@conference{ecta11,
author={Abdullah Konak and Sadan Kulturel-Konak},
title={A CLONAL SELECTION ALGORITHM TO INVESTIGATE DIVERSE SOLUTIONS FOR THE RELIABLE SERVER ASSIGNMENT PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},
year={2011},
pages={156-161},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003644101560161},
isbn={978-989-8425-83-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)
TI - A CLONAL SELECTION ALGORITHM TO INVESTIGATE DIVERSE SOLUTIONS FOR THE RELIABLE SERVER ASSIGNMENT PROBLEM
SN - 978-989-8425-83-6
AU - Konak A.
AU - Kulturel-Konak S.
PY - 2011
SP - 156
EP - 161
DO - 10.5220/0003644101560161