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

An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport

Author

Listed:
  • Tang, Jiafu
  • Yu, Yang
  • Li, Jia

Abstract

Door-to-Door service of Pickup and Delivery of Customers to the Airport (D2PDCA) is a new service provided by certain Airline Ticket Sales Agencies (ATSAs) in China. This new service provides an attractive alternative way by picking up customer at this/her specified position and at any time he/she preferred and delivering to the airport more conveniently than airport shuttle and thus earn high customer service quality. Compared with the single-trip mode, the multi-trip mode of D2PDCA (MTM-D2PDCA) service can reduce travel distances, the number of vehicles required and the operating cost. To obtain the exact solution of the MTM-D2PDCA problem, we propose a novel, exact algorithm based on the trip-chain-oriented set-partitioning (TCO-SP) model, where a trip-chain represents multiple trips made by a specific vehicle. In the exact algorithm, we propose an improved label-correcting method to remove infeasible trip-chains quickly and thus speed the search process. Based on the feasible trip-chains, the MTM-D2PDCA problem is formulated as the novel TCO-SP model, which can be solved exactly by the optimization software CPLEX. In addition, we present several mathematical insights into the relationship between the number of trip-chains and the number of local optimal trips that are applicable in both theory and practice. Extensive experiments are conducted to illustrate the application of the model and demonstrate the cost savings of the MTM-D2PDCA mode over the single-trip mode and provide managerial insights into successfully operating a MTM-D2PDCA service.

Suggested Citation

  • Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.
    • Handle: RePEc:eee:transe:v:73:y:2015:i:c:p:114-132
    DOI: 10.1016/j.tre.2014.11.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554514001902
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2014.11.001?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. M. L. Balinski & R. E. Quandt, 1964. "On an Integer Program for a Delivery Problem," Operations Research, INFORMS, vol. 12(2), pages 300-304, April.
    2. Gulczynski, Damon & Golden, Bruce & Wasil, Edward, 2010. "The split delivery vehicle routing problem with minimum delivery amounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 612-626, September.
    3. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2007. "An exact algorithm for a single-vehicle routing problem with time windows and multiple routes," European Journal of Operational Research, Elsevier, vol. 178(3), pages 755-766, May.
    4. 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.
    5. 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.
    6. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    7. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    8. 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.
    9. Liu, Shuguang & Huang, Weilai & Ma, Huiming, 2009. "An effective genetic algorithm for the fleet size and mix vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(3), pages 434-445, May.
    10. Desrochers, Martin & Soumis, Francois, 1988. "A reoptimization algorithm for the shortest path problem with time windows," European Journal of Operational Research, Elsevier, vol. 35(2), pages 242-254, May.
    11. Li, Jing-Quan & Mirchandani, Pitu B. & Borenstein, Denis, 2009. "A Lagrangian heuristic for the real-time vehicle rescheduling problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(3), pages 419-433, May.
    12. Derigs, Ulrich & Kurowsky, René & Vogel, Ulrich, 2011. "Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services," European Journal of Operational Research, Elsevier, vol. 213(1), pages 309-319, August.
    13. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    14. 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.
    15. J C S Brandão & A Mercer, 1998. "The multi-trip vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 49(8), pages 799-805, August.
    16. Ann Melissa Campbell & Martin Savelsbergh, 2004. "Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 38(3), pages 369-378, August.
    17. Yu, Bin & Yang, Zhong Zhen, 2011. "An ant colony optimization model: The period vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(2), pages 166-181, March.
    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. Wan, Li & Tang, Junqing & Wang, Lihua & Schooling, Jennifer, 2021. "Understanding non-commuting travel demand of car commuters – Insights from ANPR trip chain data in Cambridge," Transport Policy, Elsevier, vol. 106(C), pages 76-87.
    2. Jin, Jian Gang & Meng, Qiang & Wang, Hai, 2021. "Feeder vessel routing and transshipment coordination at a congested hub port," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 1-21.
    3. Zhen, Lu & Ma, Chengle & Wang, Kai & Xiao, Liyang & Zhang, Wei, 2020. "Multi-depot multi-trip vehicle routing problem with time windows and release dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
    4. Rick Grahn & Sean Qian & Chris Hendrickson, 2023. "Optimizing first- and last-mile public transit services leveraging transportation network companies (TNC)," Transportation, Springer, vol. 50(5), pages 2049-2076, October.
    5. Sun, Wei & Yu, Yang & Wang, Junwei, 2019. "Heterogeneous vehicle pickup and delivery problems: Formulation and exact solution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 181-202.
    6. Yu, Yang & Wang, Sihan & Wang, Junwei & Huang, Min, 2019. "A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 511-527.
    7. Huang, Nan & Li, Jiliu & Zhu, Wenbin & Qin, Hu, 2021. "The multi-trip vehicle routing problem with time windows and unloading queue at depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    8. Yang, Weibo & Ke, Liangjun & Wang, David Z.W. & Lam, Jasmine Siu Lee, 2021. "A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    9. Liu, Shixin & Qin, Shujin & Zhang, Ruiyou, 2018. "A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 25-41.
    10. Wang, Zheng, 2018. "Delivering meals for multiple suppliers: Exclusive or sharing logistics service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 496-512.

    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. 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.
    2. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    3. 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.
    4. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    5. Andrew Lim & Zhenzhen Zhang & Hu Qin, 2017. "Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals," Transportation Science, INFORMS, vol. 51(2), pages 688-705, May.
    6. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    7. 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.
    8. Aristide Mingozzi & Roberto Roberti & Paolo Toth, 2013. "An Exact Algorithm for the Multitrip Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 193-207, May.
    9. Zhang, Zhenzhen & Liu, Mengyang & Lim, Andrew, 2015. "A memetic algorithm for the patient transportation problem," Omega, Elsevier, vol. 54(C), pages 60-71.
    10. Macedo, Rita & Alves, Cláudio & Valério de Carvalho, J.M. & Clautiaux, François & Hanafi, Saïd, 2011. "Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model," European Journal of Operational Research, Elsevier, vol. 214(3), pages 536-545, November.
    11. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    12. Daniel Schubert & André Scholz & Gerhard Wäscher, 2017. "Integrated Order Picking and Vehicle Routing with Due Dates," FEMM Working Papers 170007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    13. Daniel Schubert & André Scholz & Gerhard Wäscher, 2018. "Integrated order picking and vehicle routing with due dates," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1109-1139, October.
    14. Boctor, Fayez F. & Renaud, Jacques & Cornillier, Fabien, 2011. "Trip packing in petrol stations replenishment," Omega, Elsevier, vol. 39(1), pages 86-98, January.
    15. Shi, Wen & Shang, Jennifer & Liu, Zhixue & Zuo, Xiaolu, 2014. "Optimal design of the auto parts supply chain for JIT operations: Sequential bifurcation factor screening and multi-response surface methodology," European Journal of Operational Research, Elsevier, vol. 236(2), pages 664-676.
    16. Rosario Paradiso & Roberto Roberti & Demetrio Laganá & Wout Dullaert, 2020. "An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 68(1), pages 180-198, January.
    17. Grigorios D. Konstantakopoulos & Sotiris P. Gayialis & Evripidis P. Kechagias, 2022. "Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification," Operational Research, Springer, vol. 22(3), pages 2033-2062, July.
    18. Cattaruzza, Diego & Absi, Nabil & Feillet, Dominique & Vidal, Thibaut, 2014. "A memetic algorithm for the Multi Trip Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 833-848.
    19. Halvorsen-Weare, Elin E. & Fagerholt, Kjetil & Nonås, Lars Magne & Asbjørnslett, Bjørn Egil, 2012. "Optimal fleet composition and periodic routing of offshore supply vessels," European Journal of Operational Research, Elsevier, vol. 223(2), pages 508-517.
    20. Timo Gschwind & Stefan Irnich, 2015. "Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 49(2), pages 335-354, May.

    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:73:y:2015:i:c:p:114-132. 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.