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

On dynamic pickup and delivery vehicle routing with several time windows and waiting times

Author

Listed:
  • Fabri, A.
  • Recht, P.

Abstract

In 2001, Caramia and his coauthors introduced a very fast and efficient heuristic for rooting a fleet of vehicles for dynamic combined pickup and delivery services [Caramia, M., Italiano, G.F., Oriolo, G., Pacifici, A., Perugia, A., 2001. Routing a fleet of vehicles for dynamic combined pickup and delivery services. In: Proceedings of the Symposium on Operation Research 2001, Springer-Verlag, Berlin/Heidelberg, pp. 3-8.]. The authors assume that every client names a stretch-factor that denotes the maximal relative deviation from the shortest path between pickup and delivery point. Waiting times are not allowed. As these assumptions are not very realistic, this paper now presents the results of adapting this algorithm to the dynamic pickup and delivery vehicle routing problem with several time windows. Waiting times of vehicles are admitted. Moreover, the computational results are considerably improved by local search techniques making use of free computational capacity.

Suggested Citation

  • Fabri, A. & Recht, P., 2006. "On dynamic pickup and delivery vehicle routing with several time windows and waiting times," Transportation Research Part B: Methodological, Elsevier, vol. 40(4), pages 335-350, May.
    • Handle: RePEc:eee:transb:v:40:y:2006:i:4:p:335-350
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(05)00058-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Healy, Patrick & Moll, Robert, 1995. "A new extension of local search applied to the Dial-A-Ride Problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 83-104, May.
    3. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    4. Jaw, Jang-Jei & Odoni, Amedeo R. & Psaraftis, Harilaos N. & Wilson, Nigel H. M., 1986. "A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 243-257, June.
    5. L. J. J. van der Bruggen & J. K. Lenstra & P. C. Schuur, 1993. "Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 27(3), pages 298-311, August.
    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. Ghorpade, Tejas & Rangaraj, Narayan, 2022. "Order first split second heuristic for alternative routing strategy for freight railways," Transport Policy, Elsevier, vol. 124(C), pages 139-148.
    2. Ferrucci, Francesco & Bock, Stefan, 2015. "A general approach for controlling vehicle en-route diversions in dynamic vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 76-87.
    3. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    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. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    6. Li, Chongshou & Gong, Lijun & Luo, Zhixing & Lim, Andrew, 2019. "A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing," Omega, Elsevier, vol. 89(C), pages 71-91.
    7. Tsubouchi, Kota & Yamato, Hiroyuki & Hietaka, Kazuo, 2009. "A research on the new Demand Responsive Transit service in Japan," 50th Annual Transportation Research Forum, Portland, Oregon, March 16-18, 2009 207730, Transportation Research Forum.
    8. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    9. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
    10. Herminghaus, Stephan, 2019. "Mean field theory of demand responsive ride pooling systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 119(C), pages 15-28.
    11. 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.
    12. Farzaneh Karami & Wim Vancroonenburg & Greet Vanden Berghe, 2020. "A periodic optimization approach to dynamic pickup and delivery problems with time windows," Journal of Scheduling, Springer, vol. 23(6), pages 711-731, December.
    13. Cheung, Bernard K.-S. & Choy, K.L. & Li, Chung-Lun & Shi, Wenzhong & Tang, Jian, 2008. "Dynamic routing model and solution methods for fleet management with mobile technologies," International Journal of Production Economics, Elsevier, vol. 113(2), pages 694-705, June.
    14. Gupta, Gautam & Goodchild, Anne & Hansen, Mark, 2011. "A competitive, charter air-service planning model for student athlete travel," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 128-149, January.
    15. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.

    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. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2006. "A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1117-1139, October.
    2. Mitrovic-Minic, Snezana & Laporte, Gilbert, 2004. "Waiting strategies for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 635-655, August.
    3. Mitrovic-Minic, Snezana & Krishnamurti, Ramesh & Laporte, Gilbert, 2004. "Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 669-685, September.
    4. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    5. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    6. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2008. "The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments," European Journal of Operational Research, Elsevier, vol. 185(2), pages 534-551, March.
    7. Lauri Häme & Harri Hakula, 2015. "A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances," Transportation Science, INFORMS, vol. 49(2), pages 295-310, May.
    8. Li, Chongshou & Gong, Lijun & Luo, Zhixing & Lim, Andrew, 2019. "A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing," Omega, Elsevier, vol. 89(C), pages 71-91.
    9. Luo, Ying & Schonfeld, Paul, 2007. "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 736-755, August.
    10. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    11. Dong, Xiaotong & Chow, Joseph Y.J. & Waller, S. Travis & Rey, David, 2022. "A chance-constrained dial-a-ride problem with utility-maximising demand and multiple pricing structures," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    12. 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.
    13. Schilde, M. & Doerner, K.F. & Hartl, R.F., 2014. "Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 18-30.
    14. Kirchler, Dominik & Wolfler Calvo, Roberto, 2013. "A Granular Tabu Search algorithm for the Dial-a-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 120-135.
    15. Jan Christiaens & Greet Vanden Berghe, 2020. "Slack Induction by String Removals for Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(2), pages 417-433, March.
    16. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    17. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1605-1615, December.
    18. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    19. Yanik, Seda & Bozkaya, Burcin & deKervenoael, Ronan, 2014. "A new VRPPD model and a hybrid heuristic solution approach for e-tailing," European Journal of Operational Research, Elsevier, vol. 236(3), pages 879-890.
    20. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.

    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:eee:transb:v:40:y:2006:i:4:p:335-350. 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.