A clonal selection algorithm to investigate diverse solutions for the reliable server assignment problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationECTA 2011 FCTA 2011 - Proceedings of the International Conference on Evolutionary Computation Theory and Applications and International Conference on Fuzzy Computation Theory and Applications
Pages156-161
Number of pages6
StatePublished - Dec 1 2011
EventInternational Conference on Evolutionary Computation Theory and Applications, ECTA 2011 and International Conference on Fuzzy Computation Theory and Applications, FCTA 2011 - Paris, France
Duration: Oct 24 2011Oct 26 2011

Publication series

NameECTA 2011 FCTA 2011 - Proceedings of the International Conference on Evolutionary Computation Theory and Applications and International Conference on Fuzzy Computation Theory and Applications

Other

OtherInternational Conference on Evolutionary Computation Theory and Applications, ECTA 2011 and International Conference on Fuzzy Computation Theory and Applications, FCTA 2011
CountryFrance
CityParis
Period10/24/1110/26/11

All Science Journal Classification (ASJC) codes

  • Applied Mathematics

Fingerprint Dive into the research topics of 'A clonal selection algorithm to investigate diverse solutions for the reliable server assignment problem'. Together they form a unique fingerprint.

Cite this