A two-stage decision dependent stochastic approach for airline flight network expansion

buir.contributor.authorÇavuş, Özlem
buir.contributor.authorAktürk, M. Selim
buir.contributor.orcidAktürk, M. Selim|0000-0003-0515-1644
dc.citation.epage101en_US
dc.citation.spage78en_US
dc.citation.volumeNumber158en_US
dc.contributor.authorŞafak, Ö.
dc.contributor.authorÇavuş, Özlem
dc.contributor.authorAktürk, M. Selim
dc.date.accessioned2023-02-16T11:11:42Z
dc.date.available2023-02-16T11:11:42Z
dc.date.issued2022-02-28
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractAirlines need to expand their flight networks with developing new routes and introducing more flights to increase their market share. In this work, we propose a two-stage stochastic mixed integer nonlinear program (MINLP), which expands an existing flight schedule by operating new flights either with existing fleet resources or a leased aircraft while considering the impact of departure time decisions on the probability distribution of random demand. Moreover, our study helps an airline to link a strategic decision of leasing an aircraft to the tactical aircraft assignment decisions by considering fuel efficiency and seat capacity of the aircraft alternatives in response to new passenger demand. However, the large number of scenarios, nonlinear fuel burn function and nonlinearities due to the decision dependent probabilities become main challenges of solving the problem. In order to deal with the computational requirements of a two-stage stochastic MINLP with decision dependent probabilities, we propose strong conic quadratic and McCormick inequalities, and an exact scenario group wise decomposition algorithm along with a new bounding method. In our computational results, we clearly demonstrate the effectiveness of proposed decomposition algorithm and the strength of the reformulations.en_US
dc.description.provenanceSubmitted by Ezgi Uğurlu (ezgi.ugurlu@bilkent.edu.tr) on 2023-02-16T11:11:42Z No. of bitstreams: 1 The_stratified__p-hub_center_and_p-hub_maximal_covering_problems.pdf: 1944989 bytes, checksum: 5c07ac7f5739177453d832c3f0f7587a (MD5)en
dc.description.provenanceMade available in DSpace on 2023-02-16T11:11:42Z (GMT). No. of bitstreams: 1 The_stratified__p-hub_center_and_p-hub_maximal_covering_problems.pdf: 1944989 bytes, checksum: 5c07ac7f5739177453d832c3f0f7587a (MD5) Previous issue date: 2022-02-28en
dc.embargo.release2024-02-28
dc.identifier.doi10.1016/j.trb.2022.02.003en_US
dc.identifier.eissn1879-2367
dc.identifier.issn0191-2615
dc.identifier.urihttp://hdl.handle.net/11693/111440
dc.language.isoEnglishen_US
dc.publisherElsevier Ltden_US
dc.relation.isversionofhttps://doi.org/10.1016/j.trb.2022.02.003en_US
dc.source.titleTransportation Research Part B: Methodologicalen_US
dc.subjectAirline flight network expansionen_US
dc.subjectStochastic programmingen_US
dc.subjectDecision dependent probabilitiesen_US
dc.subjectNonlinear mixed-integer programmingen_US
dc.titleA two-stage decision dependent stochastic approach for airline flight network expansionen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
The_stratified__p-hub_center_and_p-hub_maximal_covering_problems.pdf
Size:
1.85 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: