IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v99y2017icp62-82.html
   My bibliography  Save this article

Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery

Author

Listed:
  • Kafle, Nabin
  • Zou, Bo
  • Lin, Jane

Abstract

This paper proposes a crowdsource-enabled system for urban parcel relay and delivery. We consider cyclists and pedestrians as crowdsources who are close to customers and interested in relaying parcels with a truck carrier and undertaking jobs for the last-leg parcel delivery and the first-leg parcel pickup. The crowdsources express their interests in doing so by submitting bids to the truck carrier. The truck carrier then selects bids and coordinates crowdsources’ last-leg delivery (first-leg pickup) with its truck operations. The truck carrier's problem is formulated as a mixed integer non-linear program which simultaneously i) selects crowdsources to complete the last-leg delivery (first-leg pickup) between customers and selected points for crowdsource-truck relay; and ii) determines the relay points and truck routes and schedule. To solve the truck carrier problem, we first decompose the problem into a winner determination problem and a simultaneous pickup and delivery problem with soft time windows, and propose a Tabu Search based algorithm to iteratively solve the two subproblems. Numerical results show that this solution approach is able to yield close-to-optimum solutions with much less time than using off-the-shelf solvers. By adopting this new system, truck vehicle miles traveled (VMT) and total cost can be reduced compared to pure-truck delivery. The advantage of the system over pure-truck delivery is sensitive to factors such as penalty for servicing outside customers’ desired time windows, truck unit operating cost, time value of crowdsources, and the crowdsource mode.

Suggested Citation

  • Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    • Handle: RePEc:eee:transb:v:99:y:2017:i:c:p:62-82
    DOI: 10.1016/j.trb.2016.12.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S019126151630265X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2016.12.022?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. Madsen, Oli B. G., 1983. "Methods for solving combined two level location-routing problems of realistic dimensions," European Journal of Operational Research, Elsevier, vol. 12(3), pages 295-301, March.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. Teodor Gabriel Crainic & Nicoletta Ricciardi & Giovanni Storchi, 2009. "Models for Evaluating and Planning City Logistics Systems," Transportation Science, INFORMS, vol. 43(4), pages 432-454, November.
    4. Paolo Gianessi & Laurent Alfandari & Lucas Létocart & Roberto Wolfler Calvo, 2016. "The Multicommodity-Ring Location Routing Problem," Transportation Science, INFORMS, vol. 50(2), pages 541-558, May.
    5. Laporte, Gilbert, 1992. "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(2), pages 231-247, June.
    6. Jacobsen, S. K. & Madsen, O. B. G., 1980. "A comparative study of heuristics for a two-level routing-location problem," European Journal of Operational Research, Elsevier, vol. 5(6), pages 378-387, December.
    7. José Holguín-Veras & Michael Silas & John Polimeni & Brenda Cruz, 2008. "An Investigation on the Effectiveness of Joint Receiver–Carrier Policies to Increase Truck Traffic in the Off-peak Hours," Networks and Spatial Economics, Springer, vol. 8(4), pages 327-354, December.
    8. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    9. Qureshi, A.G. & Taniguchi, E. & Yamada, T., 2009. "An exact solution approach for vehicle routing and scheduling problems with soft time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 960-977, November.
    10. E. Feldman & F. A. Lehrer & T. L. Ray, 1966. "Warehouse Location Under Continuous Economies of Scale," Management Science, INFORMS, vol. 12(9), pages 670-684, May.
    11. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, April.
    12. Song, Jiongjiong & Regan, Amelia, 2005. "Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 914-933, December.
    13. 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.
    14. van Duin, J.H.R. & Tavasszy, L.A. & Taniguchi, E., 2007. "Real time simulation of auctioning and re-scheduling processes in hybrid freight markets," Transportation Research Part B: Methodological, Elsevier, vol. 41(9), pages 1050-1066, November.
    15. Carlos F. Daganzo, 2005. "Logistics Systems Analysis," Springer Books, Springer, edition 0, number 978-3-540-27516-9, June.
    16. Robuste, Francesc & Daganzo, Carlos F. & Souleyrette, Reginald R., 1990. "Implementing vehicle routing models," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 263-286, August.
    17. Nguyen, Viet-Phuong & Prins, Christian & Prodhon, Caroline, 2012. "Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking," European Journal of Operational Research, Elsevier, vol. 216(1), pages 113-126.
    18. Wang, Hsiao-Fan & Chen, Ying-Yen, 2013. "A coevolutionary algorithm for the flexible delivery and pickup problem with time windows," International Journal of Production Economics, Elsevier, vol. 141(1), pages 4-13.
    19. Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July.
    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. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    2. Rieck, Julia & Ehrenberg, Carsten & Zimmermann, Jürgen, 2014. "Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery," European Journal of Operational Research, Elsevier, vol. 236(3), pages 863-878.
    3. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    4. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    5. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    6. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    7. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
    8. Menezes, Mozart B.C. & Ruiz-Hernández, Diego & Verter, Vedat, 2016. "A rough-cut approach for evaluating location-routing decisions via approximation algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 89-106.
    9. Surendra Reddy Kancharla & Gitakrishnan Ramadurai, 2019. "Multi-depot Two-Echelon Fuel Minimizing Routing Problem with Heterogeneous Fleets: Model and Heuristic," Networks and Spatial Economics, Springer, vol. 19(3), pages 969-1005, September.
    10. Zhu, Stuart X. & Ursavas, Evrim, 2018. "Design and analysis of a satellite network with direct delivery in the pharmaceutical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 190-207.
    11. Li, Hongqi & Zhang, Lu & Lv, Tan & Chang, Xinyu, 2016. "The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 169-188.
    12. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    13. Vincent F. Yu & Shin-Yu Lin, 2016. "Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 526-549, January.
    14. Jenn-Rong Lin & Hsien-Chung Lei, 2009. "Distribution systems design with two-level routing considerations," Annals of Operations Research, Springer, vol. 172(1), pages 329-347, November.
    15. Yanwei Zhao & Longlong Leng & Chunmiao Zhang, 2021. "A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery," Operational Research, Springer, vol. 21(2), pages 1299-1332, June.
    16. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    17. Snoeck, André & Winkenbach, Matthias, 2020. "The value of physical distribution flexibility in serving dense and uncertain urban markets," Transportation Research Part A: Policy and Practice, Elsevier, vol. 136(C), pages 151-177.
    18. Matthias Winkenbach & Paul R. Kleindorfer & Stefan Spinler, 2016. "Enabling Urban Logistics Services at La Poste through Multi-Echelon Location-Routing," Transportation Science, INFORMS, vol. 50(2), pages 520-540, May.
    19. Mühlbauer, Ferdinand & Fontaine, Pirmin, 2021. "A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles," European Journal of Operational Research, Elsevier, vol. 289(2), pages 742-757.
    20. Yue Lu & Maoxiang Lang & Xueqiao Yu & Shiqi Li, 2019. "A Sustainable Multimodal Transport System: The Two-Echelon Location-Routing Problem with Consolidation in the Euro–China Expressway," Sustainability, MDPI, vol. 11(19), pages 1-25, October.

    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:99:y:2017:i:c:p:62-82. 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.