IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v61y2014icp40-55.html
   My bibliography  Save this article

A vehicle routing problem with multiple overlapped batches

Author

Listed:
  • Yu, Mingzhu
  • Qi, Xiangtong

Abstract

This paper considers a vehicle routing problem faced by an express company which tackles complicated operations involving time window constraints, multiple delivery and pick-up customer visits per day, multiple trips per vehicle, and latency cost for each delivery. It is challenging in that it involves multiple delivery and pick-up batches and the time spans of the batches are overlapped. We formally define the problem and develop two tabu search algorithms. By computational experiments, we find one algorithm outperforms the other by getting better solution in much shorter time. Moreover, our approach produces a significant cost saving for the company.

Suggested Citation

  • Yu, Mingzhu & Qi, Xiangtong, 2014. "A vehicle routing problem with multiple overlapped batches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 40-55.
    • Handle: RePEc:eee:transe:v:61:y:2014:i:c:p:40-55
    DOI: 10.1016/j.tre.2013.10.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554513001701
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2013.10.004?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. Toth, Paolo & Vigo, Daniele, 1999. "A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls," European Journal of Operational Research, Elsevier, vol. 113(3), pages 528-543, March.
    2. Belarmino Adenso-Díaz & Mónica González & Emérita García, 1998. "A Hierarchical Approach to Managing Dairy Routing," Interfaces, INFORMS, vol. 28(2), pages 21-31, April.
    3. Javier Faulin & Pablo Sarobe & Jorge Simal, 2005. "The DSS LOGDIS Optimizes Delivery Routes for FRILAC’s Frozen Products," Interfaces, INFORMS, vol. 35(3), pages 202-214, June.
    4. Ropke, Stefan & Pisinger, David, 2006. "A unified heuristic for a large class of Vehicle Routing Problems with Backhauls," European Journal of Operational Research, Elsevier, vol. 171(3), pages 750-775, June.
    5. Hong, Sung-Chul & Park, Yang-Byung, 1999. "A heuristic for bi-objective vehicle routing with time window constraints," International Journal of Production Economics, Elsevier, vol. 62(3), pages 249-258, September.
    6. Potvin, Jean-Yves & Rousseau, Jean-Marc, 1993. "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 66(3), pages 331-340, May.
    7. Murat Köksalan & Haldun Süral, 1999. "Efes Beverage Group Makes Location and Distribution Decisions for Its Malt Plants," Interfaces, INFORMS, vol. 29(2), pages 89-103, April.
    8. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    9. Christophe Duhamel & Jean-Yves Potvin & Jean-Marc Rousseau, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows," Transportation Science, INFORMS, vol. 31(1), pages 49-59, February.
    10. SALEHIPOUR, Amir & SÖRENSEN, Kenneth & GOOS, Peter & BRÄYSY, Olli, 2008. "An efficient GRASP+VND metaheuristic for the traveling repairman problem," Working Papers 2008008, University of Antwerp, Faculty of Business and Economics.
    11. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    12. J-F Chen & T-H Wu, 2006. "Vehicle routing problem with simultaneous deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 579-587, May.
    13. Brandao, Jose, 2006. "A new tabu search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 173(2), pages 540-555, September.
    14. Zhong, Yingjie & Cole, Michael H., 2005. "A vehicle routing problem with backhauls and time windows: a guided local search solution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(2), pages 131-144, March.
    15. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    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. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    2. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    3. Seung Hyun Kim & Sang Hoon Bae, 2016. "Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm," Transportation Planning and Technology, Taylor & Francis Journals, vol. 39(6), pages 574-585, August.
    4. Marques, Alexandra & Soares, Ricardo & Santos, Maria João & Amorim, Pedro, 2020. "Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls," Omega, Elsevier, vol. 92(C).
    5. Anna Corinna Cagliano & Alberto Marco & Giulio Mangano & Giovanni Zenezini, 2017. "Levers of logistics service providers’ efficiency in urban distribution," Operations Management Research, Springer, vol. 10(3), pages 104-117, December.
    6. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.

    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. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    2. 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.
    3. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    4. Jean-Yves Potvin, 2009. "State-of-the Art Review ---Evolutionary Algorithms for Vehicle Routing," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 518-548, November.
    5. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    6. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    7. S Mitra, 2008. "A parallel clustering technique for the vehicle routing problem with split deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1532-1546, November.
    8. Ropke, Stefan & Pisinger, David, 2006. "A unified heuristic for a large class of Vehicle Routing Problems with Backhauls," European Journal of Operational Research, Elsevier, vol. 171(3), pages 750-775, June.
    9. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    10. Zhenzhen Zhang & Zhixing Luo & Hu Qin & Andrew Lim, 2019. "Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction," Transportation Science, INFORMS, vol. 53(2), pages 427-441, March.
    11. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    12. Christos D. Tarantilis & Afroditi K. Anagnostopoulou & Panagiotis P. Repoussis, 2013. "Adaptive Path Relinking for Vehicle Routing and Scheduling Problems with Product Returns," Transportation Science, INFORMS, vol. 47(3), pages 356-379, August.
    13. Phuong Khanh Nguyen & Teodor Gabriel Crainic & Michel Toulouse, 2017. "Multi-trip pickup and delivery problem with time windows and synchronization," Annals of Operations Research, Springer, vol. 253(2), pages 899-934, June.
    14. 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.
    15. S. Irnich, 2008. "A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 270-287, May.
    16. 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.
    17. Gajpal, Yuvraj & Abad, P.L., 2009. "Multi-ant colony system (MACS) for a vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 196(1), pages 102-117, July.
    18. Olli Bräysy & Wout Dullaert & Geir Hasle & David Mester & Michel Gendreau, 2008. "An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 371-386, August.
    19. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    20. Han, Shuihua & Zhao, Ling & Chen, Kui & Luo, Zong-wei & Mishra, Deepa, 2017. "Appointment scheduling and routing optimization of attended home delivery system with random customer behavior," European Journal of Operational Research, Elsevier, vol. 262(3), pages 966-980.

    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:transe:v:61:y:2014:i:c:p:40-55. 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/600244/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.