IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0279131.html

Solving an airport ground service task assignment problem with an exact algorithm

Author

Listed:
  • Qiannan Tian
  • Jie Li
  • Guoxuan Huang
  • Wei Yuan

Abstract

In this paper, an airport ground service task assignment problem is studied. A task represents a service, which must be performed by one or multiple ground crew of a shift with required qualification/proficiency within a prescribed time period. For every assigned task, define “task priority” times “task duration” as the “benefit” generated. The objective is to maximize the summation of “benefit” for all the assigned tasks. The problem is modeled as an integer linear programming problem with mathematical formulation. A branch-and-price algorithm is proposed for solving the problem instances to optimality. To expedite the column generation process, an acceleration strategy is proposed. The computational results show that our proposed branch-and-price algorithm is capable of solving large-sized instances and the acceleration strategy is quite effective in reducing the computational time. Moreover, the impact of changing various characteristics of tasks and shifts on the performance of the algorithm is studied in detail with supporting computational experiments. In particular, the impact of reducing the qualifications is significant with 20.82% improvement in the objective value.

Suggested Citation

  • Qiannan Tian & Jie Li & Guoxuan Huang & Wei Yuan, 2022. "Solving an airport ground service task assignment problem with an exact algorithm," PLOS ONE, Public Library of Science, vol. 17(12), pages 1-23, December.
    • Handle: RePEc:plo:pone00:0279131
    DOI: 10.1371/journal.pone.0279131
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0279131
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0279131&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0279131?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    2. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    3. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    4. Ilaria Vacca & Matteo Salani & Michel Bierlaire, 2013. "An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment," Transportation Science, INFORMS, vol. 47(2), pages 148-161, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhou, Peng & Shen, Yu & Zheng, Yujing & Zheng, Yuefeng & Guo, Binfeng & Du, Yuchuan, 2025. "A comprehensive review of ground support equipment scheduling for aircraft ground handling services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 203(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
    2. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    3. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
    4. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    5. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    6. Hoogendoorn, Y.N. & Dalmeijer, K., 2021. "Resource-robust valid inequalities for set covering and set partitioning models," Econometric Institute Research Papers EI 2020-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    8. George Kozanidis & Odysseas Moschopoulos, 2025. "Set-cover master problem formulations for maximum flight coverage in branch & price solution algorithms for optimal aircrew rostering," Operational Research, Springer, vol. 25(3), pages 1-34, September.
    9. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    11. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    12. Sarac, Abdulkadir & Batta, Rajan & Rump, Christopher M., 2006. "A branch-and-price approach for operational aircraft maintenance routing," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1850-1869, December.
    13. Shyam S. G. Perumal & Jesper Larsen & Richard M. Lusby & Morten Riis & Tue R. L. Christensen, 2022. "A column generation approach for the driver scheduling problem with staff cars," Public Transport, Springer, vol. 14(3), pages 705-738, October.
    14. Jee Eun Kang & Will Recker, 2015. "Strategic Hydrogen Refueling Station Locations with Scheduling and Routing Considerations of Individual Vehicles," Transportation Science, INFORMS, vol. 49(4), pages 767-783, November.
    15. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    16. Ng, T.S. & Lee, L.H. & Chew, E.P., 2006. "Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1117-1140, December.
    17. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    18. Pereira Lopes, Manuel J. & de Carvalho, J.M. Valerio, 2007. "A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1508-1527, February.
    19. Pedro Munari & Martin Savelsbergh, 2020. "A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows," SN Operations Research Forum, Springer, vol. 1(4), pages 1-24, December.
    20. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0279131. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.