Approximating multi-objective time-dependent optimization problems

S. Dabia, El-Ghazali Talbi, T. Woensel, van, A.G. Kok, de

Research output: Book/ReportReportAcademic

41 Downloads (Pure)


In many practical situations, decisions are multi-objective in nature. Furthermore, costs and profits are time-dependent, i.e. depending upon the time a decision is taken, different costs and profits are incurred. In this paper, we propose a generic approach to deal with multi-objective time-dependent optimization problems (MOTDP). The aim is to determine the set of Pareto solutions that capture the interactions between the different objectives. Due, to the complexity of MOTDP, an efficient approximation based on dynamic programming is developed. The approximation has a provable worst case performance guarantee. Even though the approximate Pareto set consists of less solutions, it represents a good coverage of the true set of Pareto solutions. Numerical results are presented showing the value of the approximation.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages22
Publication statusPublished - 2011

Publication series

NameBETA publicatie : working papers
ISSN (Print)1386-9213


Dive into the research topics of 'Approximating multi-objective time-dependent optimization problems'. Together they form a unique fingerprint.

Cite this