{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:49:13Z","timestamp":1766180953881,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T00:00:00Z","timestamp":1490140800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Prime Minister's Office, Singapore"},{"name":"IDM Futures Funding Initiative"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2017,7,31]]},"abstract":"<jats:p>\n            Although numerous traditional models predict market share and demand along airline routes, the prediction of existing models is not precise enough, and to the best of our knowledge, there is no use of data mining--based forecasting techniques for improving airline profitability. We propose the maximizing airline profits (MAP) architecture designed to help airlines and make two key contributions in airline market share and route demand prediction and prediction-based airline profit optimization. Compared to past methods used to forecast market share and demand along airline routes, we introduce a novel ensemble forecasting (MAP-EF) approach considering two new classes of features: (i) features derived from clusters of similar routes and (ii) features based on equilibrium pricing. We show that MAP-EF achieves much better Pearson correlation coefficients (greater than 0.95 vs. 0.82 for market share, 0.98 vs. 0.77 for demand) and\n            <jats:italic>R<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            -values compared to three state-of-the-art works for forecasting market share and demand while showing much lower variance. Using the results of MAP-EF, we develop MAP--bilevel branch and bound (MAP-BBB) and MAP-greedy (MAP-G) algorithms to optimally allocate flight frequencies over multiple routes to maximize an airline\u2019s profit. We also study two extensions of the profit maximization problem considering frequency constraints and long-term profits. Furthermore, we develop algorithms for computing Nash equilibrium frequencies when there are multiple strategic airlines. Experimental results show that airlines can increase profits by a significant margin. All experiments were conducted with data aggregated from four sources: the U.S. Bureau of Transportation Statistics (BTS), the U.S. Bureau of Economic Analysis (BEA), the National Transportation Safety Board (NTSB), and the U.S. Census Bureau (CB).\n          <\/jats:p>","DOI":"10.1145\/3041217","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T16:19:44Z","timestamp":1490285984000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Data-Driven Frequency-Based Airline Profit Maximization"],"prefix":"10.1145","volume":"8","author":[{"given":"Bo","family":"An","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Nanyang Avenue, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0572-8888","authenticated-orcid":false,"given":"Haipeng","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Nanyang Avenue, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noseong","family":"Park","sequence":"additional","affiliation":[{"name":"University of North Carolina, Charlotte"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"163","article-title":"The role of wealth in the demand for international air travel","volume":"28","author":"Alperovich Gershon","year":"1994","unstructured":"Gershon Alperovich and Yaffa Machnes . 1994 . The role of wealth in the demand for international air travel . Journal of Transport Economics and Policy 28 , 2, 163 -- 173 . Gershon Alperovich and Yaffa Machnes. 1994. The role of wealth in the demand for international air travel. Journal of Transport Economics and Policy 28, 2, 163--173.","journal-title":"Journal of Transport Economics and Policy"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939726"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907)","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii . 2007 . k-means++: The advantages of careful seeding . In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907) . 1027--1035. David Arthur and Sergei Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907). 1027--1035."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jairtraman.2007.11.001"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1177\/1087724X05284016"},{"volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"Bishop Christopher M.","key":"e_1_2_1_6_1","unstructured":"Christopher M. Bishop . 2006. Pattern Recognition and Machine Learning (Information Science and Statistics) . Springer-Verlag , New York, NY . Christopher M. Bishop. 2006. Pattern Recognition and Machine Learning (Information Science and Statistics). Springer-Verlag, New York, NY."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00179-5"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00261-1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD\u201996)","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , and Xiaowei Xu . 1996 . A density-based algorithm for discovering clusters in large spatial databases with noise . In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD\u201996) . 226--231. Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD\u201996). 226--231."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(90)90030-3"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Shizuo Kakutani et al. 1941. A Generalization of Brouwer's Fixed Point Theorem. Duke University Press.  Shizuo Kakutani et al. 1941. A Generalization of Brouwer's Fixed Point Theorem. Duke University Press.","DOI":"10.1215\/S0012-7094-41-00838-4"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"H. Keller U. Pferschy and D. Pisinger. 2004. Knapsack Problems. Springer-Verlag Berlin Germany.  H. Keller U. Pferschy and D. Pisinger. 2004. Knapsack Problems. Springer-Verlag Berlin Germany.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623744"},{"key":"e_1_2_1_16_1","first-page":"295","article-title":"Branch-and-bound algorithms for the solution of the general unidimensional knapsack problem","volume":"13","author":"Martello Silvano","year":"1977","unstructured":"Silvano Martello and Paolo Toth . 1977 . Branch-and-bound algorithms for the solution of the general unidimensional knapsack problem . Advances in Operations Research 13 , 9, 295 -- 301 . Silvano Martello and Paolo Toth. 1977. Branch-and-bound algorithms for the solution of the general unidimensional knapsack problem. Advances in Operations Research 13, 9, 295--301.","journal-title":"Advances in Operations Research"},{"key":"e_1_2_1_17_1","volume-title":"Retrieved","author":"National Transportation Safety Bureau (NTSB).","year":"2016","unstructured":"National Transportation Safety Bureau (NTSB). 2016 . Aviation Accident Database 8 Synopses . Retrieved January 30, 2017, from http:\/\/www.ntsb.gov\/_layouts\/ntsb.aviation\/index.aspx. National Transportation Safety Bureau (NTSB). 2016. Aviation Accident Database 8 Synopses. Retrieved January 30, 2017, from http:\/\/www.ntsb.gov\/_layouts\/ntsb.aviation\/index.aspx."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s006070050042"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.1.75.11898"},{"volume-title":"Gaussian Processes for Machine Learning","author":"Rasmussen C. E.","key":"e_1_2_1_20_1","unstructured":"C. E. Rasmussen and C. K. I. Williams . 2006. Gaussian Processes for Machine Learning . MIT Press , Cambridge, MA . C. E. Rasmussen and C. K. I. Williams. 2006. Gaussian Processes for Machine Learning. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1366-5545(99)00026-5"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289263"},{"key":"e_1_2_1_24_1","volume-title":"Retrieved","author":"U.S. Bureau of Economic Analysis (BEA).","year":"2016","unstructured":"U.S. Bureau of Economic Analysis (BEA). 2016 . Regional Economic Accounts: Download . Retrieved January 30, 2017, from http:\/\/www.bea.gov\/regional\/downloadzip.cfm. U.S. Bureau of Economic Analysis (BEA). 2016. Regional Economic Accounts: Download. Retrieved January 30, 2017, from http:\/\/www.bea.gov\/regional\/downloadzip.cfm."},{"key":"e_1_2_1_25_1","volume-title":"Retrieved","author":"U.S. Bureau of Transportation Statistics (BTS).","year":"2016","unstructured":"U.S. Bureau of Transportation Statistics (BTS). 2016 . Airlines and Airports\u2014Data and Statistical Resources . Retrieved January 30, 2017, from http:\/\/www.rita.dot.gov\/bts\/data_and_statistics\/by_mode\/airline_and_airports\/index.html. U.S. Bureau of Transportation Statistics (BTS). 2016. Airlines and Airports\u2014Data and Statistical Resources. Retrieved January 30, 2017, from http:\/\/www.rita.dot.gov\/bts\/data_and_statistics\/by_mode\/airline_and_airports\/index.html."},{"key":"e_1_2_1_26_1","volume-title":"Retrieved","author":"U.S. Census Bureau (CB).","year":"2016","unstructured":"U.S. Census Bureau (CB). 2016 . Metropolitan and Micropolitan . Retrieved January 30, 2017, from https:\/\/www.census.gov\/population\/metro\/data\/. U.S. Census Bureau (CB). 2016. Metropolitan and Micropolitan. Retrieved January 30, 2017, from https:\/\/www.census.gov\/population\/metro\/data\/."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2004.06.002"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788615"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623633"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783337"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3041217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:52Z","timestamp":1750220632000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,22]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7,31]]}},"alternative-id":["10.1145\/3041217"],"URL":"https:\/\/doi.org\/10.1145\/3041217","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2017,3,22]]},"assertion":[{"value":"2016-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}