NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Developer Tools for Evaluating Multi-Objective AlgorithmsMulti-objective algorithms for scheduling offer many advantages over the more conventional single objective approach. By keeping user objectives separate instead of combined, more information is available to the end user to make trade-offs between competing objectives. Unlike single objective algorithms, which produce a single solution, multi-objective algorithms produce a set of solutions, called a Pareto surface, where no solution is strictly dominated by another solution for all objectives. From the end-user perspective a Pareto-surface provides a tool for reasoning about trade-offs between competing objectives. From the perspective of a software developer multi-objective algorithms provide an additional challenge. How can you tell if one multi-objective algorithm is better than another? This paper presents formal and visual tools for evaluating multi-objective algorithms and shows how the developer process of selecting an algorithm parallels the end-user process of selecting a solution for execution out of the Pareto-Surface.

Document ID
20150007174
Acquisition Source
Jet Propulsion Laboratory
Document Type
Conference Paper
External Source(s)
Authors
Giuliano, Mark E.
(Space Science Inst. Baltimore, MD, United States)
Johnston, Mark D.
(Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Date Acquired
May 1, 2015
Publication Date
June 8, 2011
Subject Category
Computer Programming And Software
Meeting Information
Meeting: International Workshop on Planning and Scheduling for Space (IWPSS-11)
Location: Darmstadt
Country: Germany
Start Date: June 8, 2011
End Date: June 10, 2011
Sponsors: European Space Agency. European Space Operations Center
Funding Number(s)
CONTRACT_GRANT: NNX07AV67G
Distribution Limits
Public
Copyright
Other
Keywords
multi-objective optimization
scheduling

Available Downloads

There are no available downloads for this record.
No Preview Available