A new approach for the solution of multiple objective optimization problems based on reinforcement learning

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

Abstract

Many problems can be characterized by several competing objectives. Multiple objective optimization problems have recently received considerable attention specially by the evolutionary algorithms community. Their proposals, however, require an adequate codification of the problem into strings, which is not always easy to do. This paper introduces a new algorithm, called MDQL, for multiple objective optimization problems which does not suffer from previous limitations. MDQL is based on a new distributed Q-learning algorithm, called DQL, which is also introduced in this paper. Furthermore, an extension for applying reinforcement learning to continuos functions is also given. Successful results of MDQL on a continuos non restricted problem whose Pareto front is convex and on a continuos non-convex problem with restrictions are described. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Mariano, C., & Morales, E. (2000). A new approach for the solution of multiple objective optimization problems based on reinforcement learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1793 LNAI, pp. 212–223). https://doi.org/10.1007/10720076_20

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