Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/118918
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Aeronautical and Aviation Engineering-
dc.creatorZhu, L-
dc.creatorBelieres, S-
dc.creatorHewitt, M-
dc.creatorWu, L-
dc.date.accessioned2026-05-21T07:58:08Z-
dc.date.available2026-05-21T07:58:08Z-
dc.identifier.issn0191-2615-
dc.identifier.urihttp://hdl.handle.net/10397/118918-
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.rights© 2026 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ ).en_US
dc.rightsThe following publicaton Zhu, L., Belieres, S., Hewitt, M., & Wu, L. (2026). Joint fleet scheduling and cargo flow allocation for air cargo services. Transportation Research Part B: Methodological, 209, 103469 is available at https://doi.org/10.1016/j.trb.2026.103469.en_US
dc.subjectAir cargo routingen_US
dc.subjectColumn generationen_US
dc.subjectFleet schedulingen_US
dc.subjectInteger programmingen_US
dc.subjectThrough cargo connectionen_US
dc.titleJoint fleet scheduling and cargo flow allocation for air cargo servicesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume209-
dc.identifier.doi10.1016/j.trb.2026.103469-
dcterms.abstractWe propose an integrated optimization model designed for the air cargo service network scheduling problem, focusing on next-day delivery. Our model effectively combines dedicated cargo aircraft with belly capacity from passenger airlines to jointly determine optimal cargo flight schedules, cargo fleet routes, and cargo routes. To enhance the efficiency of the air cargo service network, we incorporate through cargo connections into the cargo routing problem. These connections occur when the same aircraft operates consecutive flights within a cargo route. A tailored column-generation-based heuristic is developed to solve the problem. We conduct an extensive set of experiments to validate the performance of our proposed model and algorithm based on the data from our industry partner company. The computational results demonstrate that for small-scale instances, our algorithm rapidly identifies near-optimal solutions. Meanwhile, for medium- and large-scale instances, it consistently delivers superior solution quality compared to the commercial solver. Ultimately, our study highlights that the inclusion of through cargo connections not only enhances the overall service level of the network but also leads to increases in flight load factors and reductions in operational costs.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransportation research. Part B, Methodological, July 2026, v. 209, 103469-
dcterms.isPartOfTransportation research. Part B, Methodological-
dcterms.issued2026-07-
dc.identifier.scopus2-s2.0-105034946500-
dc.identifier.eissn1879-2367-
dc.identifier.artn103469-
dc.description.validate202605 bcch-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_TAen_US
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextWe are grateful to the editor and two anonymous reviewers for their valuable comments, which helped improve the quality of the paper. This work was supported by the National Natural Science Foundation of China under Grant 72301230, the Research Grants Council of the Hong Kong Special Administrative Region, China, under Grant 25223223, and by the Shenzhen Science and Technology Program, China, under Grant JCYJ20240813162012016.en_US
dc.description.pubStatusPublisheden_US
dc.description.TAElsevier (2026)en_US
dc.description.oaCategoryTAen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
1-s2.0-S0191261526000810-main.pdf7.84 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.