IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i3p1291-d731977.html
   My bibliography  Save this article

An Investigation of Multimodal Transport for Last Mile Delivery in Rural Areas

Author

Listed:
  • Xiaofei Kou

    (School of Management Engineering, Zhengzhou University of Aeronautics, Zhengzhou 450046, China)

  • Yanqi Zhang

    (School of Management Engineering, Zhengzhou University of Aeronautics, Zhengzhou 450046, China)

  • Die Long

    (Office of Industrial Administration, Zhengzhou University of Aeronautics, Zhengzhou 450046, China)

  • Xuanyu Liu

    (School of Management Engineering, Zhengzhou University of Aeronautics, Zhengzhou 450046, China)

  • Liangliang Qie

    (School of Chemistry and Material Science, Hubei Engineering University, Xiaogan 432000, China)

Abstract

High distribution costs constitute one of the major obstacles to the sustainable development of rural logistics. In order to effectively reduce the distribution costs of last mile delivery in rural areas, based on three typical transport modes (local logistics providers, public transport, and crowdsourcing logistics), this study first proposes a multimodal transport design for last mile delivery in rural areas. Then, a cost–benefit model for multimodal transport is proposed which uses genetic algorithms (GA) to solve the logistical problems faced. Finally, Shapley value is used to fairly allocate profits and represent the marginal contribution of each mode in multimodal transport. The numerical results show that multimodal transport can effectively reduce the distribution costs of last mile delivery in rural areas. When the order demand of each node tends to be stable, the marginal contribution of crowdsourcing logistics is often greater than that of the other two distribution modes. The marginal contribution of public transport is highest only when the number of orders per node is very small.

Suggested Citation

  • Xiaofei Kou & Yanqi Zhang & Die Long & Xuanyu Liu & Liangliang Qie, 2022. "An Investigation of Multimodal Transport for Last Mile Delivery in Rural Areas," Sustainability, MDPI, vol. 14(3), pages 1-15, January.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:3:p:1291-:d:731977
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/3/1291/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/3/1291/
    Download Restriction: no
    ---><---

    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. A. W. J. Kolen & A. H. G. Rinnooy Kan & H. W. J. M. Trienekens, 1987. "Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 35(2), pages 266-273, April.
    3. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    4. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    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. Chang-Gyun Roh & Jiyoon Kim, 2022. "What Are More Efficient Transportation Services in a Rural Area? A Case Study in Yangsan City, South Korea," IJERPH, MDPI, vol. 19(18), pages 1-24, September.
    2. Małgorzata Markowska & Jakub Marcinkowski, 2022. "Rural E-Customers’ Preferences for Last Mile Delivery: Evidence from Poland," Energies, MDPI, vol. 15(22), pages 1-15, November.
    3. Cavallaro, Federico & Nocera, Silvio, 2023. "Flexible-route integrated passenger–freight transport in rural areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 169(C).
    4. Ziyu Chen & Jili Kong, 2023. "Research on Shared Logistics Decision Based on Evolutionary Game and Income Distribution," Sustainability, MDPI, vol. 15(11), pages 1-24, May.

    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. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    2. Line Blander Reinhardt & Mads Kehlet Jepsen & David Pisinger, 2016. "The Edge Set Cost of the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 50(2), pages 694-707, May.
    3. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    4. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
    5. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.
    6. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    7. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    8. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    9. Baozhen Yao & Qianqian Yan & Mengjie Zhang & Yunong Yang, 2017. "Improved artificial bee colony algorithm for vehicle routing problem with time windows," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-18, September.
    10. Matsatsinis, Nikolaos F., 2004. "Towards a decision support system for the ready concrete distribution system: A case of a Greek company," European Journal of Operational Research, Elsevier, vol. 152(2), pages 487-499, January.
    11. Stefan Irnich & Daniel Villeneuve, 2006. "The Shortest-Path Problem with Resource Constraints and k -Cycle Elimination for k (ge) 3," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 391-406, August.
    12. Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
    13. Li, Haibing & Lim, Andrew, 2003. "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, Elsevier, vol. 150(1), pages 115-127, October.
    14. Michel Gendreau & Alain Hertz & Gilbert Laporte & Mihnea Stan, 1998. "A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows," Operations Research, INFORMS, vol. 46(3), pages 330-335, June.
    15. Chang, Tsung-Sheng & Wan, Yat-wah & OOI, Wei Tsang, 2009. "A stochastic dynamic traveling salesman problem with hard time windows," European Journal of Operational Research, Elsevier, vol. 198(3), pages 748-759, November.
    16. Leung, Stephen C.H. & Zhang, Zhenzhen & Zhang, Defu & Hua, Xian & Lim, Ming K., 2013. "A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 225(2), pages 199-210.
    17. Dondo, Rodolfo & Cerda, Jaime, 2007. "A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1478-1507, February.
    18. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    19. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    20. Loske, Dominic & Klumpp, Matthias, 2021. "Human-AI collaboration in route planning: An empirical efficiency-based analysis in retail logistics," International Journal of Production Economics, Elsevier, vol. 241(C).

    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:jsusta:v:14:y:2022:i:3:p:1291-:d:731977. 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.