Back to results

Massachusetts Institute of Technology

A multi-objective, decomposition-based algorithm design methodology and its application to runaway operations planning

Abstract

dc:description.abstract

(cont.) to the design of a heuristic decomposed algorithm for solving the ROP problem. This decomposition methodology offers an original paradigm potentially applicable to the design of solution algorithms for a class of problems with functions and parameters that, similar to those of the ROP problem, can be parsed in subsets. The potential merit in decomposing the ROP problem in two stages and the resulting utility of the two-stage solution algorithm are evaluated by performing benefits analysis across specific dimensions related to airport efficiency, as well as stability and robustness analysis of the algorithm output.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2004

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Anagnostakis, Ioannis
Advisor dc:contributor.advisor
  • John-Paul Clarke.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1721.1/28913
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/28913

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Anagnostakis, Ioannis. A multi-objective, decomposition-based algorithm design methodology and its application to runaway operations planning. Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28913