A novel algorithm for optimizing the Pareto set in dynamic problem spaces.

Ima Okon Essiet Yanxia Sun Zenghui Wang

Published in: ICTAS (2018)

Keyphrases

cost function
learning algorithm
objective function
computational complexity
dynamic programming
computationally efficient
worst case
optimal solution
simulated annealing
optimization algorithm
shortest path problem
genetic algorithm
multi agent systems
linear programming
convex hull