IDEAS home Printed from https://ideas.repec.org/a/eee/jotrge/v117y2024ics096669232400084x.html
   My bibliography  Save this article

Determining the number and location of micro-consolidation centres as a solution to growing e-commerce demand

Author

Listed:
  • Kahalimoghadam, Masoud
  • Thompson, Russell G.
  • Rajabifard, Abbas

Abstract

E-commerce's rapid expansion has transformed consumer shopping habits and business operations. While it offers the potential to reduce customer trips, it has also contributed to increased vehicle kilometres travelled (VKT) by delivery vehicles, resulting in elevated greenhouse gas (GHG) emissions, especially in last-mile deliveries. This paper proposes a spatial approach to address the uncapacitated single allocation hub covering problem (USAHCP) to reduce the VKT by optimising the number and location of logistics hub. In this approach, the spatial features and strategic legislation of metropolitan areas are analysed. Integrating existing models, this location-based approach aims to design a collaborative last mile distribution network by locating micro-consolidation centres (MCCs) in metropolitan areas to service parcel lockers where end customers pick up their parcels. The method is applied to Sydney, Australia, using data provided by the largest courier companies in Australia. The results show that incorporating MCCs in the network reduces VKT due to their proximity to final destinations. Sensitivity analyses are conducted by differentiating maximum driving time constraints and specific times of day reflecting traffic patterns. The results provide significant advantages for logistics stakeholders, notably Transport for NSW, by reducing VKT and GHG emissions. Moreover, the developed method can be utilised by carriers and shippers in their strategic and operational decisions to enhance overall delivery speed and reliability.

Suggested Citation

  • Kahalimoghadam, Masoud & Thompson, Russell G. & Rajabifard, Abbas, 2024. "Determining the number and location of micro-consolidation centres as a solution to growing e-commerce demand," Journal of Transport Geography, Elsevier, vol. 117(C).
    • Handle: RePEc:eee:jotrge:v:117:y:2024:i:c:s096669232400084x
    DOI: 10.1016/j.jtrangeo.2024.103875
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S096669232400084X
    Download Restriction: no
    File URL: https://libkey.io/10.1016/j.jtrangeo.2024.103875?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. Heleen Buldeo Rai & Laetitia Dablanc, 2023. "Hunting for treasure: a systematic literature review on urban logistics and e-commerce data," Transport Reviews, Taylor & Francis Journals, vol. 43(2), pages 204-233, March.
    2. Rodrigue, Jean-Paul, 2020. "The distribution network of Amazon and the footprint of freight digitalization," Journal of Transport Geography, Elsevier, vol. 88(C).
    3. Mommens, Koen & Buldeo Rai, Heleen & van Lier, Tom & Macharis, Cathy, 2021. "Delivery to homes or collection points? A sustainability analysis for urban, urbanised and rural areas in Belgium," Journal of Transport Geography, Elsevier, vol. 94(C).
    4. Leung, Abraham & Lachapelle, Ugo & Burke, Matthew, 2023. "Spatio-temporal analysis of Australia Post parcel locker use during the initial system growth phase in Queensland (2013–2017)," Journal of Transport Geography, Elsevier, vol. 110(C).
    5. Borkowski, Przemysław & Jażdżewska-Gutta, Magdalena & Szmelter-Jarosz, Agnieszka, 2021. "Lockdowned: Everyday mobility changes in response to COVID-19," Journal of Transport Geography, Elsevier, vol. 90(C).
    6. 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.
    7. Feng, Xin & Murray, Alan T. & Church, Richard L., 2021. "Drone service response: Spatiotemporal heterogeneity implications," Journal of Transport Geography, Elsevier, vol. 93(C).
    8. Lachapelle, Ugo & Burke, Matthew & Brotherton, Aiden & Leung, Abraham, 2018. "Parcel locker systems in a car dominant city: Location, characterisation and potential impacts on city planning and consumer travel access," Journal of Transport Geography, Elsevier, vol. 71(C), pages 1-14.
    9. Waßmuth, Katrin & Köhler, Charlotte & Agatz, Niels & Fleischmann, Moritz, 2023. "Demand management for attended home delivery—A literature review," European Journal of Operational Research, Elsevier, vol. 311(3), pages 801-815.
    10. Shichang Pan & Lele Zhang & Russell G. Thompson & Hadi Ghaderi, 2021. "A parcel network flow approach for joint delivery networks using parcel lockers," International Journal of Production Research, Taylor & Francis Journals, vol. 59(7), pages 2090-2115, April.
    11. Pani, Agnivesh & Sahu, Prasanta K. & Patil, Gopal R. & Sarkar, Ashoke K., 2018. "Modelling urban freight generation: A case study of seven cities in Kerala, India," Transport Policy, Elsevier, vol. 69(C), pages 49-64.
    12. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    13. Silva, Marcos Roberto & Cunha, Claudio B., 2017. "A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 954-965.
    14. 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.
    15. Aljohani, Khalid & Thompson, Russell G., 2020. "A multi-criteria spatial evaluation framework to optimise the siting of freight consolidation facilities in inner-city areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 138(C), pages 51-69.
    16. Bräysy, Olli & Dullaert, Wout & Nakari, Pentti, 2009. "The potential of optimization in communal routing problems: case studies from Finland," Journal of Transport Geography, Elsevier, vol. 17(6), pages 484-490.
    17. Michael B. Teitz & Polly Bart, 1968. "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph," Operations Research, INFORMS, vol. 16(5), pages 955-961, October.
    18. Huang, Di & Chen, Xinyuan & Liu, Zhiyuan & Lyu, Cheng & Wang, Shuaian & Chen, Xuewu, 2020. "A static bike repositioning model in a hub-and-spoke network framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    19. B Y Kara & B C Tansel, 2003. "The single-assignment hub covering problem: Models and linearizations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 59-64, January.
    20. 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.
    21. Ernst, Andreas T. & Krishnamoorthy, Mohan, 1998. "Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 100-112, January.
    22. J. Lelieveld & J. S. Evans & M. Fnais & D. Giannadaki & A. Pozzer, 2015. "The contribution of outdoor air pollution sources to premature mortality on a global scale," Nature, Nature, vol. 525(7569), pages 367-371, September.
    23. Ashkan Ayough & Behrooz Khorshidvand & Fatemeh Adibrad, 2022. "A genetic algorithm for integrated hub covering-routing problem considering forbidden paths," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 43(2), pages 177-192.
    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. Mahmutogullari, Ali Irfan & Kara, Bahar Y., 2016. "Hub location under competition," European Journal of Operational Research, Elsevier, vol. 250(1), pages 214-225.
    2. Ghaffarinasab, Nader & Motallebzadeh, Alireza, 2018. "Hub interdiction problem variants: Models and metaheuristic solution algorithms," European Journal of Operational Research, Elsevier, vol. 267(2), pages 496-512.
    3. Alumur, Sibel A. & Yaman, Hande & Kara, Bahar Y., 2012. "Hierarchical multimodal hub location problem with time-definite deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1107-1120.
    4. S Alumur & B Y Kara, 2009. "A hub covering network design problem for cargo applications in Turkey," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(10), pages 1349-1359, October.
    5. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    6. 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.
    7. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    8. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    9. 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.
    10. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2009. "The design of single allocation incomplete hub networks," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 936-951, December.
    11. 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.
    12. Lei, Xinyue & Chen, Junlan & Zhu, Zhenjun & Guo, Xiucheng & Liu, Pei & Jiang, Xiaohong, 2022. "How to locate urban–rural transit hubs from the viewpoint of county integration?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    13. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    14. Yu, Bin & Zhu, Hanbing & Cai, Wanjun & Ma, Ning & Kuang, Qiji & Yao, Baozhen, 2013. "Two-phase optimization approach to transit hub location – the case of Dalian," Journal of Transport Geography, Elsevier, vol. 33(C), pages 62-71.
    15. 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.
    16. 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.
    17. 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.
    18. García, Sergio & Landete, Mercedes & Marín, Alfredo, 2012. "New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 48-57.
    19. F. Parvaresh & S. Hashemi Golpayegany & S. Moattar Husseini & B. Karimi, 2013. "Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing," Networks and Spatial Economics, Springer, vol. 13(4), pages 445-470, December.
    20. Yang, Kai & Yang, Lixing & Gao, Ziyou, 2016. "Planning and optimization of intermodal hub-and-spoke network under mixed uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 248-266.

    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:jotrge:v:117:y:2024:i:c:s096669232400084x. 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: https://www.journals.elsevier.com/journal-of-transport-geography .

    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.