IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v55y2017i9p2470-2488.html
   My bibliography  Save this article

A policy of picking up parcels for express courier service in dynamic environments

Author

Listed:
  • Xian Cheng
  • Shaoyi Liao
  • Zhongsheng Hua

Abstract

As a particular logistics service, the express courier service has seen considerable growth recently, which resulted in an unprecedented fierce competition. Besides, the development of information and communication technologies has enabled express company to manage their service. With the purpose of improving service quality and operation efficiency for express company, we focus on the problem of intercity express courier routing in courier-triggered pickup service. A novel pickup policy for courier routing is proposed based on the idea of centrality measures and the nearest-neighbour (NN) policy by considering the un-serviced customer requests as a globally coupled network. This policy enables to dispatch the idle courier to the more central request location, which allows the courier to easily serve the neighbouring requests around the central request location, thus securing both global and local performance. We also propose a simple prototype of real-time fleet management system where the proposed pickup policy is embedded into it. To evaluate the efficiency and practicability of the pickup policy, we conduct comprehensive computational experiments to generate various testing scenarios; moreover, two widely used dispatching policies – NN and first-come-first-served (FCFS) – are considered as the benchmark policy. Results show that the proposed pickup policy significantly outperforms the NN and FCFS policies in terms of waiting time and total service time.

Suggested Citation

  • Xian Cheng & Shaoyi Liao & Zhongsheng Hua, 2017. "A policy of picking up parcels for express courier service in dynamic environments," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2470-2488, May.
  • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:9:p:2470-2488
    DOI: 10.1080/00207543.2016.1231431
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1231431
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2016.1231431?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. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Working papers 3286-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Ilgaz Sungur & Yingtao Ren & Fernando Ordóñez & Maged Dessouky & Hongsheng Zhong, 2010. "A Model and Algorithm for the Courier Delivery Problem with Uncertainty," Transportation Science, INFORMS, vol. 44(2), pages 193-205, May.
    3. Yan, Shangyao & Lin, Jenn-Rong & Lai, Chun-Wei, 2013. "The planning and real-time adjustment of courier routing and scheduling under stochastic travel times and demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 53(C), pages 34-48.
    4. Li, Jing-Quan & Mirchandani, Pitu B. & Borenstein, Denis, 2009. "Real-time vehicle rerouting problems with time windows," European Journal of Operational Research, Elsevier, vol. 194(3), pages 711-727, May.
    5. T Andersson & P Värbrand, 2007. "Decision support tools for ambulance dispatch and relocation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(2), pages 195-201, February.
    6. Masson, Renaud & Ropke, Stefan & Lehuédé, Fabien & Péton, Olivier, 2014. "A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes," European Journal of Operational Research, Elsevier, vol. 236(3), pages 849-862.
    7. Ghiani, Gianpaolo & Manni, Emanuele & Quaranta, Antonella & Triki, Chefi, 2009. "Anticipatory algorithms for same-day courier dispatching," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 96-106, January.
    8. Jan M. Chaiken & Richard C. Larson, 1972. "Methods for Allocating Urban Emergency Units: A Survey," Management Science, INFORMS, vol. 19(4-Part-2), pages 110-130, December.
    9. S Lee, 2013. "Centrality-based ambulance dispatching for demanding emergency situations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(4), pages 611-618, April.
    10. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    11. Dimitris J. Bertsimas & Garrett van Ryzin, 1991. "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, INFORMS, vol. 39(4), pages 601-615, August.
    12. 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.
    13. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    14. Mantel, Ronald J. & Landeweerd, Henri R. A., 1995. "Design and operational control of an AGV system," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 257-266, October.
    15. Daniel Urrutiaguer, 2004. "Programme innovations and networks of French public theatres," The Service Industries Journal, Taylor & Francis Journals, vol. 24(1), pages 37-55, January.
    16. Bock, Stefan, 2010. "Real-time control of freight forwarder transportation networks by integrating multimodal transport chains," European Journal of Operational Research, Elsevier, vol. 200(3), pages 733-746, February.
    17. Gómez, Daniel & Figueira, José Rui & Eusébio, Augusto, 2013. "Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems," European Journal of Operational Research, Elsevier, vol. 226(2), pages 354-365.
    18. Bard, Jonathan F. & Jarrah, Ahmad I., 2009. "Large-scale constrained clustering for rationalizing pickup and delivery operations," Transportation Research Part B: Methodological, Elsevier, vol. 43(5), pages 542-561, June.
    19. Chang, Tsung-Sheng & Yen, Hui-Mei, 2012. "City-courier routing and scheduling problems," European Journal of Operational Research, Elsevier, vol. 223(2), pages 489-498.
    20. Nanry, William P. & Wesley Barnes, J., 2000. "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 107-121, February.
    21. Kiron Ravindran & Anjana Susarla & Deepa Mani & Vijay Gurbaxani, 2015. "Social Capital and Contract Duration in Buyer-Supplier Networks for Information Technology Outsourcing," Information Systems Research, INFORMS, vol. 26(2), pages 379-397, June.
    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. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    2. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, January.
    3. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    4. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
    5. María I. Restrepo & Frédéric Semet & Thomas Pocreau, 2019. "Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery," Transportation Science, INFORMS, vol. 53(4), pages 1150-1174, July.
    6. Wang, Xuping & Ruan, Junhu & Shi, Yan, 2012. "A recovery model for combinational disruptions in logistics delivery: Considering the real-world participators," International Journal of Production Economics, Elsevier, vol. 140(1), pages 508-520.
    7. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    8. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    9. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    10. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    11. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
    12. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    13. Maskooki, Alaleh & Deb, Kalyanmoy & Kallio, Markku, 2022. "A customized genetic algorithm for bi-objective routing in a dynamic network," European Journal of Operational Research, Elsevier, vol. 297(2), pages 615-629.
    14. Abdulkader, M.M.S. & Gajpal, Yuvraj & ElMekkawy, Tarek Y., 2018. "Vehicle routing problem in omni-channel retailing distribution systems," International Journal of Production Economics, Elsevier, vol. 196(C), pages 43-55.
    15. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
    16. TALARICO, Luca & MEISEL, Frank & SÖRENSEN, Kenneth, 2014. "Ambulance routing for disaster response with patient groups," Working Papers 2014005, University of Antwerp, Faculty of Business and Economics.
    17. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
    18. Neves-Moreira, F. & Amorim, P. & Guimarães, L. & Almada-Lobo, B., 2016. "A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations," European Journal of Operational Research, Elsevier, vol. 248(2), pages 487-506.
    19. Douglas G. Macharet & Armando Alves Neto & Vila F. Camara Neto & Mario F. M. Campos, 2018. "Dynamic region visit routing problem for vehicles with minimum turning radius," Journal of Heuristics, Springer, vol. 24(1), pages 83-109, February.
    20. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:55:y:2017:i:9:p:2470-2488. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.