{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:39:52Z","timestamp":1743064792948,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_11","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"123-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Branch-and-Price Algorithm for\u00a0Daily Aircraft Routing and\u00a0Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Yu","family":"Si","sequence":"first","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"11_CR1","unstructured":"Belobaba, P., Odoni, A., Barnhart, C.: The Global Airline Industry. John Wiley & Sons, Hoboken (2015)"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/trsc.5.3.232","volume":"5","author":"A Levin","year":"1971","unstructured":"Levin, A.: Scheduling and fleet routing models for transportation systems. Transp. Sci. 5(3), 232\u2013255 (1971)","journal-title":"Transp. Sci."},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/inte.19.4.20","volume":"19","author":"J Abara","year":"1989","unstructured":"Abara, J.: Applying integer linear programming to the fleet assignment problem. Interfaces 19(4), 20\u201328 (1989)","journal-title":"Interfaces"},{"issue":"1\u20133","key":"11_CR4","first-page":"211","volume":"70","author":"CA Hane","year":"1995","unstructured":"Hane, C.A., Barnhart, C., Johnson, E.L., et al.: The fleet assignment problem: solving a large-scale integer program. Math. Program. 70(1\u20133), 211\u2013232 (1995)","journal-title":"Math. Program."},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/mnsc.43.6.841","volume":"43","author":"G Desaulniers","year":"1997","unstructured":"Desaulniers, G., Desrosiers, J., Dumas, Y., et al.: Daily aircraft routing and scheduling. Manag. Sci. 43(6), 841\u2013855 (1997)","journal-title":"Manag. Sci."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.trc.2017.06.003","volume":"81","author":"L Cadarso","year":"2017","unstructured":"Cadarso, L., de Celis, R.: Integrated airline planning: robust update of scheduling and fleet balancing under demand uncertainty. Transp. Res. Part C Emerg. Technol. 81, 227\u2013245 (2017)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.cor.2017.08.014","volume":"100","author":"N Kenan","year":"2018","unstructured":"Kenan, N., Jebali, A., Diabat, A.: An integrated flight scheduling and fleet assignment problem under uncertainty. Comput. Oper. Res. 100, 333\u2013342 (2018)","journal-title":"Comput. Oper. Res."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cui, R., Dong, X., Lin, Y.: Models for aircraft maintenance routing problem with consideration of remaining time and robustness. Comput. Ind. Eng. 137, 106045 (2019)","DOI":"10.1016\/j.cie.2019.106045"},{"issue":"9","key":"11_CR9","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.1080\/00207543.2019.1629663","volume":"58","author":"S Zheng","year":"2020","unstructured":"Zheng, S., Yang, Z., He, Z., et al.: Hybrid simulated annealing and reduced variable neighbourhood search for an aircraft scheduling and parking problem. Int. J. Prod. Res. 58(9), 2626\u20132646 (2020)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/trsc.2018.0878","volume":"53","author":"L Costa","year":"2019","unstructured":"Costa, L., Contardo, C., Desaulniers, G.: Exact branch-price-and-cut algorithms for vehicle routing. Transp. Sci. 53(4), 946\u2013985 (2019)","journal-title":"Transp. Sci."},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318\u2013326 (2000)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:44:59Z","timestamp":1641015899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}