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.

Original languageEnglish (US)
Title of host publicationIn Proceedings of the International Conference on Evolutionary Computation Theory and Applications, ECTA 2011
EditorsAgostinho Rosa
PublisherScience and Technology Publications, Lda
Pages156-161
Number of pages6
ISBN (Print)9789898425836
DOIs
StatePublished - 2011
EventInternational Conference on Evolutionary Computation Theory and Applications, ECTA 2011 - Paris, France
Duration: Oct 24 2011Oct 26 2011

Publication series

NameInternational Joint Conference on Computational Intelligence
Volume1
ISSN (Electronic)2184-3236

Conference

ConferenceInternational Conference on Evolutionary Computation Theory and Applications, ECTA 2011
Country/TerritoryFrance
CityParis
Period10/24/1110/26/11

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computational Theory and 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