Displacement problem and dynamically scheduling aircraft landings
In this paper we define a generic decision problem - the displacement problem. The displacement problem arises when we have to make a sequence of decisions and each new decision that must be made has an explicit link back to the previous decision that was made. This link is quantified by means of th...
Gespeichert in:
| Veröffentlicht in: | The Journal of the Operational Research Society 2004-01, Vol.55 (1), p.54-64 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 64 |
|---|---|
| container_issue | 1 |
| container_start_page | 54 |
| container_title | The Journal of the Operational Research Society |
| container_volume | 55 |
| creator | Beasley, J E Krishnamoorthy, M Sharaiha, Y M Abramson, D |
| description | In this paper we define a generic decision problem - the displacement problem. The displacement problem arises when we have to make a sequence of decisions and each new decision that must be made has an explicit link back to the previous decision that was made. This link is quantified by means of the displacement function. One situation where the displacement problem arises is that of dynamically scheduling aircraft landings at an airport. Here decisions about the landing times for aircraft (and the runways they land on) must be taken in a dynamic fashion as time passes and the operational environment changes. We illustrate the application of the displacement problem to the dynamic aircraft landing problem. Computational results are presented for a number of publicly available test problems involving up to 500 aircraft and five runways. |
| doi_str_mv | 10.1057/palgrave.jors.2601650 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_231333678</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>4101827</jstor_id><sourcerecordid>4101827</sourcerecordid><originalsourceid>FETCH-LOGICAL-c433t-f13127e1f29369a765a4e2451a70e7515935d0c49fe603e6ae2cd9197f48a6e93</originalsourceid><addsrcrecordid>eNqFUE1LwzAYDqLgnP4DhSJ47Eyar-Xm8BsGXvQcXtNkdqTtTDql_96Mbu6mp8D7fOZB6ILgCcFcXq_ALwJ82cmyDXFSCEwExwdoRJgUuaICH6JRuuGci2lxjE5iXGKMFSZqhGZ3VVx5MLa2TZetQvvubZ1BU2Zl30BdGfC-z6L5sOXaV80igyqYAK7LfCKlQzxFRw58tGfbd4zeHu5fb5_y-cvj8-1snhtGaZc7QkkhLXFFaqRACg7MFowTkNhKTriivMSGKWcFplaALUypiJKOTUFYRcfocvBNJT_XNnZ62a5DkyJ1QQmlVMhpIvGBZEIbY7BOr0JVQ-g1wXozlt6NpTdj6e1YSXe1NYeYvuwCNKaKezGXmDPGE08MvJigZmHDvsR_AeeDcBm7NvwaM4LJtJAJvhngqnFtqOG7Db7UHfS-Dbsy9O-EHyF5oJY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>231333678</pqid></control><display><type>article</type><title>Displacement problem and dynamically scheduling aircraft landings</title><source>Jstor Complete Legacy</source><creator>Beasley, J E ; Krishnamoorthy, M ; Sharaiha, Y M ; Abramson, D</creator><creatorcontrib>Beasley, J E ; Krishnamoorthy, M ; Sharaiha, Y M ; Abramson, D</creatorcontrib><description>In this paper we define a generic decision problem - the displacement problem. The displacement problem arises when we have to make a sequence of decisions and each new decision that must be made has an explicit link back to the previous decision that was made. This link is quantified by means of the displacement function. One situation where the displacement problem arises is that of dynamically scheduling aircraft landings at an airport. Here decisions about the landing times for aircraft (and the runways they land on) must be taken in a dynamic fashion as time passes and the operational environment changes. We illustrate the application of the displacement problem to the dynamic aircraft landing problem. Computational results are presented for a number of publicly available test problems involving up to 500 aircraft and five runways.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/palgrave.jors.2601650</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor & Francis</publisher><subject>Air traffic control ; Aircraft ; Aircraft landing ; Airline scheduling ; Airport runways ; Algorithms ; Applied sciences ; Business and Management ; Cost functions ; displacement problem ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Heuristic ; Heuristics ; Management ; Mathematical functions ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; runway operations ; Runways ; Scheduling ; Sequencing ; Studies ; Theoretical Paper ; Theoretical Papers ; Variables</subject><ispartof>The Journal of the Operational Research Society, 2004-01, Vol.55 (1), p.54-64</ispartof><rights>Copyright © 2004, Palgrave Macmillan Ltd 2004</rights><rights>Copyright 2004 Operational Research Society Ltd</rights><rights>Palgrave Macmillan Ltd 2004</rights><rights>2004 INIST-CNRS</rights><rights>Copyright (c) 2004 Palgrave Macmillan Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c433t-f13127e1f29369a765a4e2451a70e7515935d0c49fe603e6ae2cd9197f48a6e93</citedby><cites>FETCH-LOGICAL-c433t-f13127e1f29369a765a4e2451a70e7515935d0c49fe603e6ae2cd9197f48a6e93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/4101827$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/4101827$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,776,780,799,4010,27900,27901,27902,57992,58225</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15705445$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Beasley, J E</creatorcontrib><creatorcontrib>Krishnamoorthy, M</creatorcontrib><creatorcontrib>Sharaiha, Y M</creatorcontrib><creatorcontrib>Abramson, D</creatorcontrib><title>Displacement problem and dynamically scheduling aircraft landings</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>In this paper we define a generic decision problem - the displacement problem. The displacement problem arises when we have to make a sequence of decisions and each new decision that must be made has an explicit link back to the previous decision that was made. This link is quantified by means of the displacement function. One situation where the displacement problem arises is that of dynamically scheduling aircraft landings at an airport. Here decisions about the landing times for aircraft (and the runways they land on) must be taken in a dynamic fashion as time passes and the operational environment changes. We illustrate the application of the displacement problem to the dynamic aircraft landing problem. Computational results are presented for a number of publicly available test problems involving up to 500 aircraft and five runways.</description><subject>Air traffic control</subject><subject>Aircraft</subject><subject>Aircraft landing</subject><subject>Airline scheduling</subject><subject>Airport runways</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Business and Management</subject><subject>Cost functions</subject><subject>displacement problem</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Management</subject><subject>Mathematical functions</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>runway operations</subject><subject>Runways</subject><subject>Scheduling</subject><subject>Sequencing</subject><subject>Studies</subject><subject>Theoretical Paper</subject><subject>Theoretical Papers</subject><subject>Variables</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqFUE1LwzAYDqLgnP4DhSJ47Eyar-Xm8BsGXvQcXtNkdqTtTDql_96Mbu6mp8D7fOZB6ILgCcFcXq_ALwJ82cmyDXFSCEwExwdoRJgUuaICH6JRuuGci2lxjE5iXGKMFSZqhGZ3VVx5MLa2TZetQvvubZ1BU2Zl30BdGfC-z6L5sOXaV80igyqYAK7LfCKlQzxFRw58tGfbd4zeHu5fb5_y-cvj8-1snhtGaZc7QkkhLXFFaqRACg7MFowTkNhKTriivMSGKWcFplaALUypiJKOTUFYRcfocvBNJT_XNnZ62a5DkyJ1QQmlVMhpIvGBZEIbY7BOr0JVQ-g1wXozlt6NpTdj6e1YSXe1NYeYvuwCNKaKezGXmDPGE08MvJigZmHDvsR_AeeDcBm7NvwaM4LJtJAJvhngqnFtqOG7Db7UHfS-Dbsy9O-EHyF5oJY</recordid><startdate>20040101</startdate><enddate>20040101</enddate><creator>Beasley, J E</creator><creator>Krishnamoorthy, M</creator><creator>Sharaiha, Y M</creator><creator>Abramson, D</creator><general>Taylor & Francis</general><general>Palgrave Macmillan Press</general><general>Palgrave Macmillan UK</general><general>Palgrave</general><general>Taylor & Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope></search><sort><creationdate>20040101</creationdate><title>Displacement problem and dynamically scheduling aircraft landings</title><author>Beasley, J E ; Krishnamoorthy, M ; Sharaiha, Y M ; Abramson, D</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c433t-f13127e1f29369a765a4e2451a70e7515935d0c49fe603e6ae2cd9197f48a6e93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Air traffic control</topic><topic>Aircraft</topic><topic>Aircraft landing</topic><topic>Airline scheduling</topic><topic>Airport runways</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Business and Management</topic><topic>Cost functions</topic><topic>displacement problem</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Management</topic><topic>Mathematical functions</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>runway operations</topic><topic>Runways</topic><topic>Scheduling</topic><topic>Sequencing</topic><topic>Studies</topic><topic>Theoretical Paper</topic><topic>Theoretical Papers</topic><topic>Variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Beasley, J E</creatorcontrib><creatorcontrib>Krishnamoorthy, M</creatorcontrib><creatorcontrib>Sharaiha, Y M</creatorcontrib><creatorcontrib>Abramson, D</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Career & Technical Education Database</collection><collection>ABI/INFORM Complete</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Health and Medical</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>ProQuest Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Beasley, J E</au><au>Krishnamoorthy, M</au><au>Sharaiha, Y M</au><au>Abramson, D</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Displacement problem and dynamically scheduling aircraft landings</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>2004-01-01</date><risdate>2004</risdate><volume>55</volume><issue>1</issue><spage>54</spage><epage>64</epage><pages>54-64</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>JORSDZ</coden><abstract>In this paper we define a generic decision problem - the displacement problem. The displacement problem arises when we have to make a sequence of decisions and each new decision that must be made has an explicit link back to the previous decision that was made. This link is quantified by means of the displacement function. One situation where the displacement problem arises is that of dynamically scheduling aircraft landings at an airport. Here decisions about the landing times for aircraft (and the runways they land on) must be taken in a dynamic fashion as time passes and the operational environment changes. We illustrate the application of the displacement problem to the dynamic aircraft landing problem. Computational results are presented for a number of publicly available test problems involving up to 500 aircraft and five runways.</abstract><cop>London</cop><pub>Taylor & Francis</pub><doi>10.1057/palgrave.jors.2601650</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0160-5682 |
| ispartof | The Journal of the Operational Research Society, 2004-01, Vol.55 (1), p.54-64 |
| issn | 0160-5682 1476-9360 |
| language | eng |
| recordid | cdi_proquest_journals_231333678 |
| source | Jstor Complete Legacy |
| subjects | Air traffic control Aircraft Aircraft landing Airline scheduling Airport runways Algorithms Applied sciences Business and Management Cost functions displacement problem Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Heuristics Management Mathematical functions Operational research and scientific management Operational research. Management science Operations research Operations Research/Decision Theory runway operations Runways Scheduling Sequencing Studies Theoretical Paper Theoretical Papers Variables |
| title | Displacement problem and dynamically scheduling aircraft landings |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T14%3A16%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Displacement%20problem%20and%20dynamically%20scheduling%20aircraft%20landings&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Beasley,%20J%20E&rft.date=2004-01-01&rft.volume=55&rft.issue=1&rft.spage=54&rft.epage=64&rft.pages=54-64&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/palgrave.jors.2601650&rft_dat=%3Cjstor_proqu%3E4101827%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=231333678&rft_id=info:pmid/&rft_jstor_id=4101827&rfr_iscdi=true |