IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v296y2021i1d10.1007_s10479-019-03421-w.html
   My bibliography  Save this article

Bi-objective load balancing multiple allocation hub location: a compromise programming approach

Author

Listed:
  • Rahimeh Neamatian Monemi

    (Laboratoire de Conception, Optimisation et Modélisation des Systèmes, LCOMS EA 7306
    Université de Lorraine, IUT de Metz
    University of Southampton)

  • Shahin Gelareh

    (Laboratoire de Conception, Optimisation et Modélisation des Systèmes, LCOMS EA 7306
    Université d’Artois)

  • Anass Nagih

    (Laboratoire de Conception, Optimisation et Modélisation des Systèmes, LCOMS EA 7306
    Université de Lorraine)

  • Dylan Jones

    (University of Portsmouth)

Abstract

In this paper we address unbalanced spatial distribution of hub-level flows in an optimal hub-and-spoke network structure of median-type models. Our study is based on a rather general variant of the multiple allocation hub location problems with fixed setup costs for hub nodes and hub edges in both capacitated and uncapacitated variants wherein the number of hub nodes traversed along origin-destination pairs is not constrained to one or two as in the classical models.. From the perspective of an infrastructure owner, we want to make sure that there exists a choice of design for the hub-level sub-network (hubs and hub edges) that considers both objectives of minimizing cost of transportation and balancing spatial distribution of flow across the hub-level network. We propose a bi-objective (transportation cost and hub-level flow variance) mixed integer non-linear programming formulation and handle the bi-objective model via a compromise programming framework. We exploit the structure of the problem and propose a second-order conic reformulation of the model along with a very efficient matheuristics algorithm for larger size instances.

Suggested Citation

  • Rahimeh Neamatian Monemi & Shahin Gelareh & Anass Nagih & Dylan Jones, 2021. "Bi-objective load balancing multiple allocation hub location: a compromise programming approach," Annals of Operations Research, Springer, vol. 296(1), pages 363-406, January.
    • Handle: RePEc:spr:annopr:v:296:y:2021:i:1:d:10.1007_s10479-019-03421-w
    DOI: 10.1007/s10479-019-03421-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03421-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-019-03421-w?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Campbell, James F., 1990. "Locating transportation terminals to serve an expanding demand," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 173-192, June.
    2. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.
    3. O'Kelly, M. E. & Bryan, D. L., 1998. "Hub location with flow economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 605-616, November.
    4. Dylan Jones & Mehrdad Tamiz, 2010. "Practical Goal Programming," International Series in Operations Research and Management Science, Springer, edition 1, number 978-1-4419-5771-9, April.
    5. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    6. Gelareh, Shahin & Nickel, Stefan, 2011. "Hub location problems in transportation networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1092-1111.
    7. Ilic, Aleksandar & Urosevic, Dragan & Brimberg, Jack & Mladenovic, Nenad, 2010. "A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 206(2), pages 289-300, October.
    8. Samir Elhedhli & Huyu Wu, 2010. "A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 282-296, May.
    9. Kanellopoulos, A. & Gerdessen, J.C. & Claassen, G.D.H., 2015. "Compromise programming: Non-interactive calibration of utility-based metrics," European Journal of Operational Research, Elsevier, vol. 244(2), pages 519-524.
    10. Ivan Contreras & Jean-François Cordeau & Gilbert Laporte, 2011. "The Dynamic Uncapacitated Hub Location Problem," Transportation Science, INFORMS, vol. 45(1), pages 18-32, February.
    11. Parviz Fattahi & Saeed Fayyaz, 2010. "A Compromise Programming Model to Integrated Urban Water Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 24(6), pages 1211-1227, April.
    12. Isabel Correia & Stefan Nickel & Francisco Saldanha-da-Gama, 2014. "Multi-product Capacitated Single-Allocation Hub Location Problems: Formulations and Inequalities," Networks and Spatial Economics, Springer, vol. 14(1), pages 1-25, March.
    13. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    14. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    15. J. Benders, 2005. "Partitioning procedures for solving mixed-variables programming problems," Computational Management Science, Springer, vol. 2(1), pages 3-19, January.
    16. F J André & M A Cardenete & C Romero, 2008. "Using compromise programming for macroeconomic policy making in a general equilibrium framework: theory and application to the Spanish economy," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 875-883, July.
    17. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    18. A. J. Goldman, 1969. "Optimal Locations for Centers in a Network," Transportation Science, INFORMS, vol. 3(4), pages 352-360, November.
    19. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    20. Ballestero, Enrique, 2007. "Compromise programming: A utility-based linear-quadratic composite metric from the trade-off between achievement and balanced (non-corner) solutions," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1369-1382, November.
    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. 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.

    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. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    2. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.
    3. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    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. Masaeli, Mobina & Alumur, Sibel A. & Bookbinder, James H., 2018. "Shipment scheduling in hub location problems," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 126-142.
    6. Lüer-Villagra, Armin & Marianov, Vladimir, 2013. "A competitive hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 231(3), pages 734-744.
    7. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2018. "A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities," Omega, Elsevier, vol. 74(C), pages 122-134.
    8. Mehmet R. Taner & Bahar Y. Kara, 2016. "Endogenous Effects of Hubbing on Flow Intensities," Networks and Spatial Economics, Springer, vol. 16(4), pages 1151-1181, December.
    9. Ghaffarinasab, Nader & Çavuş, Özlem & Kara, Bahar Y., 2023. "A mean-CVaR approach to the risk-averse single allocation hub location problem with flow-dependent economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 32-53.
    10. Zheng, Jianfeng & Qi, Jingwen & Sun, Zhuo & Li, Feng, 2018. "Community structure based global hub location problem in liner shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 1-19.
    11. Sibel A. Alumur & Stefan Nickel & Francisco Saldanha-da-Gama & Yusuf Seçerdin, 2016. "Multi-period hub network design problems with modular capacities," Annals of Operations Research, Springer, vol. 246(1), pages 289-312, November.
    12. 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.
    13. An, Yu & Zhang, Yu & Zeng, Bo, 2015. "The reliable hub-and-spoke design problem: Models and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 103-122.
    14. Nader Azizi & Navneet Vidyarthi & Satyaveer S. Chauhan, 2018. "Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 264(1), pages 1-40, May.
    15. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    16. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    17. Bernardes Real, Luiza & O'Kelly, Morton & de Miranda, Gilberto & Saraiva de Camargo, Ricardo, 2018. "The gateway hub location problem," Journal of Air Transport Management, Elsevier, vol. 73(C), pages 95-112.
    18. J. Fabian Meier & Uwe Clausen, 2018. "Solving Single Allocation Hub Location Problems on Euclidean Data," Transportation Science, INFORMS, vol. 52(5), pages 1141-1155, October.
    19. 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.
    20. Milad Keshvari Fard & Laurent Alfandari, 2018. "Trade-offs between the Stepwise Cost Function and its Linear Approximation for the Modular Hub Location Problem," Working Papers hal-01821280, HAL.

    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:spr:annopr:v:296:y:2021:i:1:d:10.1007_s10479-019-03421-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.