IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v201y2025ics0191261525001821.html

The multi-commodity flow problem with outsourcing decisions

Author

Listed:
  • Fernández, Elena
  • Ljubić, Ivana
  • Zerega, Nicolás

Abstract

We introduce a new prize-collecting problem involving the routing of commodities in a network composed of predefined hub and non-hub nodes. In this setting, the service of non-hub nodes is outsourced to third-party carriers. This study is motivated by the growing prevalence of outsourcing practices in real-world transportation systems, where new entrants or local suppliers increasingly take over parts of the transportation chain – enabling higher volumes and broader network coverage. The problem is modeled as a Stackelberg game: a major firm (the leader) chooses a subset of commodities to serve. The leader aims to outsource the first and last legs of the transportation services to smaller carriers (the followers), assigning at most one carrier to each non-hub node. Each carrier seeks to maximize its own profit, which depends on the offers made by the leader. The goal of the leader is to determine the optimal outsourcing fees, along with the allocation of carriers to the non-hub nodes, so that the profit from the routed commodities is maximized. The optimal response of the followers must be taken into account, as the followers may reject assignments that do not align with their profit-maximizing goals. We also consider two alternative settings: one in which outsourcing fees are fixed, and another where carriers accept any offer yielding non-negative profit. We demonstrate that the set of feasible outsourcing fees can be discretized and formulate the problem as single-level mixed-integer (non)linear program. For all problem variants, we prove NP-hardness and conduct a computational study of various single-level MIP reformulations. Our benchmark instances cover various applications in transportation, such as air transportation, postal delivery and freight transportation. We assess the scalability of proposed formulations and analyze the impact of different carrier reservation prices on solution quality. Finally, by comparing the alternative problem settings, we extract valuable managerial insights.

Suggested Citation

  • Fernández, Elena & Ljubić, Ivana & Zerega, Nicolás, 2025. "The multi-commodity flow problem with outsourcing decisions," Transportation Research Part B: Methodological, Elsevier, vol. 201(C).
  • Handle: RePEc:eee:transb:v:201:y:2025:i:c:s0191261525001821
    DOI: 10.1016/j.trb.2025.103333
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261525001821
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2025.103333?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Harold Greenberg, 1969. "A quadratic assignment problem without column constraints," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 16(3), pages 417-421, September.
    2. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2018. "Exact solution of hub network design problems with profits," European Journal of Operational Research, Elsevier, vol. 266(1), pages 57-71.
    3. Nieto-Isaza, Santiago & Fontaine, Pirmin & Minner, Stefan, 2022. "The value of stochastic crowd resources and strategic location of mini-depots for last-mile delivery: A Benders decomposition approach," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 62-79.
    4. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    5. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    6. Martina Cerulli & Claudia Archetti & Elena Fernández & Ivana Ljubić, 2024. "A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery," Transportation Science, INFORMS, vol. 58(5), pages 1076-1100, September.
    7. Ivan Contreras, 2015. "Hub Location Problems," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 311-344, Springer.
    8. Horner, Hannah & Pazour, Jennifer & Mitchell, John E., 2021. "Optimizing driver menus under stochastic selection behavior for ridesharing and crowdsourced delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    9. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    10. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    11. C Archetti & D Feillet & A Hertz & M G Speranza, 2009. "The capacitated team orienteering and profitable tour problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 831-842, June.
    12. Rosemonde Ausseil & Jennifer A. Pazour & Marlin W. Ulmer, 2022. "Supplier Menus for Dynamic Matching in Peer-to-Peer Transportation Platforms," Transportation Science, INFORMS, vol. 56(5), pages 1304-1326, September.
    13. Albareda-Sambola, Maria & Fernández, Elena & Saldanha-da-Gama, Francisco, 2011. "The facility location problem with Bernoulli demands," Omega, Elsevier, vol. 39(3), pages 335-345, June.
    14. Delle Donne, Diego & Alfandari, Laurent & Archetti, Claudia & Ljubić, Ivana, 2023. "Freight-on-Transit for urban last-mile deliveries: A strategic planning approach," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 53-81.
    15. Mofidi, Seyed Shahab & Pazour, Jennifer A., 2019. "When is it beneficial to provide freelance suppliers with choice? A hierarchical approach for peer-to-peer logistics platforms," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 1-23.
    16. Silke J. Forbes & Mara Lederman, 2010. "Does vertical integration affect firm performance? Evidence from the airline industry," RAND Journal of Economics, RAND Corporation, vol. 41(4), pages 765-790, December.
    17. Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
    18. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    19. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2016. "Hub network design problems with profits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 40-59.
    20. Ghilas, Veaceslav & Demir, Emrah & Woensel, Tom Van, 2016. "A scenario-based planning for the pickup and delivery problem with time windows, scheduled lines and stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 34-51.
    21. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    22. Maria Albareda-Sambola & Elena Fernández & Francisco Saldanha-da-Gama, 2017. "Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 737-753, November.
    23. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    24. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    25. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2017. "Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design," Transportation Science, INFORMS, vol. 51(2), pages 650-667, May.
    26. Silke Januszewski Forbes & Mara Lederman, 2009. "Adaptation and Vertical Integration in the Airline Industry," American Economic Review, American Economic Association, vol. 99(5), pages 1831-1849, December.
    27. Stephan Dempe, 2020. "Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography," Springer Optimization and Its Applications, in: Stephan Dempe & Alain Zemkoho (ed.), Bilevel Optimization, chapter 0, pages 581-672, Springer.
    Full references (including those not matched with items on IDEAS)

    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. Fernández, Elena & Sgalambro, Antonino, 2020. "On carriers collaboration in hub location problems," European Journal of Operational Research, Elsevier, vol. 283(2), pages 476-490.
    2. Domínguez-Bravo, Carmen-Ana & Fernández, Elena & Lüer-Villagra, Armin, 2024. "Hub location with congestion and time-sensitive demand," European Journal of Operational Research, Elsevier, vol. 316(3), pages 828-844.
    3. Erdoğan, Güneş & Battarra, Maria & Rodríguez-Chía, Antonio M., 2022. "The hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1035-1047.
    4. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    5. Raca Todosijević & Olivera Stančić & Zorica Stanimirović & Stefan Mišković, 2025. "General variable neighborhood search for the capacitated single allocation hub maximal covering problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(2), pages 262-303, July.
    6. Jalili Marand, Ata & Hoseinpour, Pooya, 2025. "Profit maximization in congested hub location problems: Demand models and service level constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    7. Setiawan, Fran & Bektaş, Tolga & Iris, Çağatay, 2025. "The role of hubs and economies of scale in network expansion," Omega, Elsevier, vol. 131(C).
    8. Tran, Dung & Azizi, Nader & Archibald, Thomas Welsh, 2026. "Stochastic profit maximization and pricing in hub location problems with elastic demand: Mathematical formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 329(2), pages 498-517.
    9. Corberán, Ángel & Landete, Mercedes & Peiró, Juanjo & Saldanha-da-Gama, Francisco, 2019. "Improved polyhedral descriptions and exact procedures for a broad class of uncapacitated p-hub median problems," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 38-63.
    10. Wandelt, Sebastian & Wang, Shuang & Chen, Xinyue & Zheng, Changhong & Chang, Shuming & Sun, Xiaoqian, 2025. "Network structures in air transportation: A comprehensive review of applications and challenges," Journal of Air Transport Management, Elsevier, vol. 126(C).
    11. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2018. "Exact solution of hub network design problems with profits," European Journal of Operational Research, Elsevier, vol. 266(1), pages 57-71.
    12. Ausseil, Rosemonde & Ulmer, Marlin W. & Pazour, Jennifer A., 2024. "Online acceptance probability approximation in peer-to-peer transportation," Omega, Elsevier, vol. 123(C).
    13. Gita Taherkhani & Sibel A. Alumur & Mojtaba Hosseini, 2021. "Robust Stochastic Models for Profit-Maximizing Hub Location Problems," Transportation Science, INFORMS, vol. 55(6), pages 1322-1350, November.
    14. AL Athamneh, Raed & Tanash, Moayad & Bani Hani, Dania & Rawshdeh, Mustafa & Alawin, Abdallah & Albataineh, Zaid, 2023. "Variable Neighborhood Search Algorithm for the Single Assignment Incomplete Hub Location Problem with Modular Capacities and Direct Connections," Operations Research Perspectives, Elsevier, vol. 11(C).
    15. Zetina, Carlos Armando & Contreras, Ivan & Cordeau, Jean-François & Nikbakhsh, Ehsan, 2017. "Robust uncapacitated hub location," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 393-410.
    16. Ramamoorthy, Prasanna & Vidyarthi, Navneet & Verma, Manish, 2024. "Efficient solution approaches for the bi-criteria p-hub median and dispersion problem," European Journal of Operational Research, Elsevier, vol. 314(1), pages 79-93.
    17. Taherkhani, Gita & Hosseini, Mojtaba & Alumur, Sibel A., 2024. "Sustainable hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 187(C).
    18. Ghaffarinasab, Nader & Kara, Bahar Y. & Campbell, James F., 2022. "The stratified p-hub center and p-hub maximal covering problems," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 120-148.
    19. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    20. Ramamoorthy, Prasanna & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2024. "An exact method for trilevel hub location problem with interdiction," European Journal of Operational Research, Elsevier, vol. 319(3), pages 696-710.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:transb:v:201:y:2025:i:c:s0191261525001821. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.