Integrating Pareto Optimization into Dynamic Programming
Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when sc...
Main Authors: | Thomas Gatter, Robert Giegerich, Cédric Saule |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2016-01-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/9/1/12 |
Similar Items
-
Performance Comparison of Non-Dominated Sorting Genetic Algorithm with strength Pareto evolutionary algorithm in Selecting Optimal Portfolios in Tehran Stock Exchange
by: Gholamhossein Golarzi, et al.
Published: (2022-09-01) -
Pareto-Based Bi-Objective Optimization Method of Sensor Placement in Structural Health Monitoring
by: Shao-Xiao Nong, et al.
Published: (2021-11-01) -
MODIFICATION OF FIREWORKS METHOD FOR MULTIOBJECTIVE OPTIMIZATION BASED ON NON-DOMINATED SORTING
by: A. V. Panteleev, et al.
Published: (2019-06-01) -
Pareto Optimality of Centralized Procurement Based on Genetic Algorithm
by: Fengxia Ding, et al.
Published: (2022-01-01) -
<i>k</i>-Pareto Optimality-Based Sorting with Maximization of Choice and Its Application to Genetic Optimization
by: Jean Ruppert, et al.
Published: (2022-11-01)