Determining the Robust Counterpart of Flight Retiming Model

Autor:	Khusnul Novianingsih
Rok vydání:	2019
Předmět:	Mathematical optimization Integer programming model Conic section Computer science Robustness (computer science) Robust optimization ComputerApplications_COMPUTERSINOTHERSYSTEMS Quadratic programming Retiming Ellipsoid
Zdroj:	2019 International Conference on Information and Communications Technology (ICOIACT).
DOI:	10.1109/icoiact46704.2019.8938442
Popis:	A flight retiming problem is a problem to retime departure times of flight schedules so that the robustness of the schedules can be improved. By minimizing total propagated delay along aircraft routings, the problem can be formulated as a linear integer programming model. in this paper, we discuss about how to model the uncertain flight retiming problem using robust optimization. We derive the robust counterpart of the problem by choosing uncertainty box and ellipsoidal uncertainty sets. The modeling results show that we obtain a linear integer programming model for box uncertainty set and a conic quadratic programming model for ellipsoidal uncertainty set which are classified as computationally tractable problems.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::bdadec142607d3c111b040cd31cdb5e1 https://doi.org/10.1109/icoiact46704.2019.8938442 Zobrazit plný text záznamu