An evolutionary algorithm for adaptive online services in dynamic environment

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An evolutionary adaptive algorithm for solving a class of online service provider problems in a dynamical web environment is introduced. In the online service provider scenario, a system continuously generates digital products and service instances by assembling components (e.g. headlines of online newspapers, search engine query results, advertising lists) to fulfill the requirements of a market of anonymous customers. The evaluation of a service instance can only be known by the feedback obtained after delivering it to the customer over the internet or through telephone networks. In dynamic domains available components and customer/agents preferences are changing over the time. The proposed algorithm employs typical genetic operators in order to optimize the service delivered and to adapt it to the environment feedback and evolution. Differently from classical genetic algorithms the goal of such systems is to maximize the average fitness instead of determining the single best optimal service/product. Experimental results for different classes of services, online newspapers and search engines, confirm the adaptive behavior of the proposed technique. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Milani, A., Leung, C. H. C., Baioletti, M., & Suriani, S. (2008). An evolutionary algorithm for adaptive online services in dynamic environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4974 LNCS, pp. 626–632). https://doi.org/10.1007/978-3-540-78761-7_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free