IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v8y2024i4p130-d1540778.html
   My bibliography  Save this article

A Pareto-Based Clustering Approach for Solving a Bi-Objective Mobile Hub Location Problem with Congestion

Author

Listed:
  • Maryam Dehghan Chenary

    (Department of Business Decisions and Analytics, University of Vienna, 1090 Wien, Austria)

  • Arman Ferdowsi

    (ECS Group, TU Wien, 1040 Wien, Austria)

  • Richard F. Hartl

    (Department of Business Decisions and Analytics, University of Vienna, 1090 Wien, Austria)

Abstract

Background : This paper introduces an enhanced multi-period p -mobile hub location model that accounts for critical factors such as service time, flow processing delays, and congestion impacts at capacity-constrained hubs. As (urban) transportation networks evolve, mobile hubs play an increasingly vital role in promoting sustainable logistics solutions and addressing complex operational challenges. By enabling the repositioning of hubs across periods, this model seeks to minimize overall costs, particularly in response to dynamic demand fluctuations. Method : To solve this problem, we propose a bi-objective optimization model and introduce a hybrid meta-heuristic algorithm tailored to this application. The algorithm involves a clustering-based technique for evaluating solutions and a refined genetic approach for producing new sets of solutions. Results : Various experiments have been conducted on the Australian Post dataset to evaluate the proposed method. The results have been compared with Multiple-Objecti-ve Particle Swarm Optimization (MOPSO) and Non-Domi-nated Sorting Genetic Algorithm (NSGA-II) using several performance evaluation metrics. Conclusions : The results indicate that the proposed algorithm can provide remarkably better Pareto sets than the other competitive algorithms.

Suggested Citation

  • Maryam Dehghan Chenary & Arman Ferdowsi & Richard F. Hartl, 2024. "A Pareto-Based Clustering Approach for Solving a Bi-Objective Mobile Hub Location Problem with Congestion," Logistics, MDPI, vol. 8(4), pages 1-30, December.
  • Handle: RePEc:gam:jlogis:v:8:y:2024:i:4:p:130-:d:1540778
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/8/4/130/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2305-6290/8/4/130/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Rodríguez, V. & Alvarez, M.J. & Barcos, L., 2007. "Hub location under capacity constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(5), pages 495-505, September.
    2. 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.
    3. Campbell, James F., 1994. "Integer programming formulations of discrete hub location problems," European Journal of Operational Research, Elsevier, vol. 72(2), pages 387-405, January.
    4. Lipowski, Adam & Lipowska, Dorota, 2012. "Roulette-wheel selection via stochastic acceptance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(6), pages 2193-2196.
    5. 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.
    6. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2010. "Single-assignment hub location problems with multiple capacity levels," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1047-1066, September.
    7. 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.
    8. Derya Celik Turkoglu & Mujde Erol Genevois, 2020. "A comparative survey of service facility location problems," Annals of Operations Research, Springer, vol. 292(1), pages 399-468, September.
    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. 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.
    2. Dhyani, Sneha & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2019. "Alternate Second Order Conic Programming Reformulations for Hub Location with Capacity Selection under Demand," IIMA Working Papers WP 2018-12-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Hu, Lu & Zhu, Juan Xiu & Wang, Yuan & Lee, Loo Hay, 2018. "Joint design of fleet size, hub locations, and hub capacities for third-party logistics networks with road congestion constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 568-588.
    4. 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.
    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. Basallo-Triana, Mario José & Bravo-Bastidas, Juan José & Contreras, Ivan & Cordeau, Jean-François & Vidal-Holguín, Carlos Julio, 2023. "Intermodal hub network design with generalized capacity constraints and non-synchronized train–truck operations," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    7. Esmizadeh, Yalda & Bashiri, Mahdi & Jahani, Hamed & Almada-Lobo, Bernardo, 2021. "Cold chain management in hierarchical operational hub networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    8. 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.
    9. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    10. 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.
    11. Ghaffarinasab, Nader & Kara, Bahar Y., 2022. "A conditional β-mean approach to risk-averse stochastic multiple allocation hub location problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    12. Jayaswal, Sachin & Vidyarthi, Navneet, 2023. "Multiple allocation hub location with service level constraints for two shipment classes," European Journal of Operational Research, Elsevier, vol. 309(2), pages 634-655.
    13. Yıldız, Barış & Karaşan, Oya Ekin, 2015. "Regenerator Location Problem and survivable extensions: A hub covering location perspective," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 32-55.
    14. 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.
    15. Hüseyin Güden, 2021. "New complexity results for the p-hub median problem," Annals of Operations Research, Springer, vol. 298(1), pages 229-247, March.
    16. Sneha Dhyani Bhatt & Sachin Jayaswal & Ankur Sinha & Navneet Vidyarthi, 2021. "Alternate second order conic program reformulations for hub location under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 304(1), pages 481-527, September.
    17. Landete, Mercedes & Peiró, Juanjo, 2024. "Some new clique inequalities in four-index hub location models," European Journal of Operational Research, Elsevier, vol. 318(3), pages 768-777.
    18. Zühal Kartal & Mohan Krishnamoorthy & Andreas T. Ernst, 2019. "Heuristic algorithms for the single allocation p-hub center problem with routing considerations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 99-145, March.
    19. Peker, Meltem & Kara, Bahar Y., 2015. "The P-Hub maximal covering problem and extensions for gradual decay functions," Omega, Elsevier, vol. 54(C), pages 158-172.
    20. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.

    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:gam:jlogis:v:8:y:2024:i:4:p:130-:d:1540778. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.