CiteSpace-Based Bibliometric Review of Pickup and Delivery Problem from 1995 to 2021
Source abstract
Abstract
In this paper, we adopt the bibliometric analysis software CiteSpace to analyze the research status quo and evolution trend of pickup and delivery problem (PDP), an important real-world issue occurring in logistics and transportation. We obtain 819 documents with the topic of PDP that were published in the Web of Science core collection during the period 1995–2021, and acquire their basic situation of posting trend and category distribution. Next, we employ CiteSpace to draw scientific knowledge maps and perform the corresponding visualization analysis, which mainly include the following aspects: (a) collaboration analysis of author, country, and institution; (b) co-citation analysis of author, journal, and reference; (c) citation burst detection of keyword; (d) co-citation clustering analysis of reference. The results show that PDP research has gradually become interdisciplinary and highly comprehensive, and the evolution trend of hot topics also reflects that the research directions involve multiple academic disciplines and professional areas ranging from algorithm design to logistics management. The changing knowledge components reveal the fact that the development of PDP research is highly related to the diversity and uncertainty of realistic logistics industry contexts. Study in this paper provides comprehensive understandings of PDP research for scholars and logistics practitioners, inspiring its further investigation.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Vehicle Routing Optimization Methods · Urban and Freight Transport Logistics · Advanced Manufacturing and Logistics Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Management Science and Engineering, School of Business, Qingdao University, Qingdao 266071, China
Funding
National Natural Science Foundation of China
References (100+)
Show source-provided references
1. Routing for a Just-in-Time Supply Pickup and Delivery System10.1287/trsc.1040.0092 ↗
2. Alternative Approaches to the Crude Oil Tanker Routing and Scheduling Problem with Split Pickup and Split Delivery10.1016/j.ejor.2014.11.023 ↗
3. Louati, A., Lahyani, R., Aldaej, A., Mellouli, R., and Nusir, M. (2021). Mixed Integer Linear Programming Models to Solve a Real-Life Vehicle Routing Problem with Pickup and Delivery. Appl. Sci., 11.10.3390/app11209551 ↗
4. Joerss, M., Schröder, J., Neuhaus, F., Klink, C., and Mann, F. (2016). Parcel Delivery: The Future of Last Mile, McKinsey & Company.
5. Static Pickup and Delivery Problems: A Classification Scheme and Survey10.1007/s11750-007-0009-0 ↗
6. Dynamic Pickup and Delivery Problems10.1016/j.ejor.2009.04.024 ↗
7. Toth, P., and Vigo, D. (2014). Chapter 6: Pickup-and-Delivery Problems for Goods Transportation. Vehicle Routing, Society for Industrial and Applied Mathematics.
8. Toth, P., and Vigo, D. (2014). Chapter 7: Pickup-and-Delivery Problems for People Transportation. Vehicle Routing, Society for Industrial and Applied Mathematics.
9. Review of state of the art vehicle routing problem with pickup and delivery (VRPPD)
10. A Review of Vehicle Routing with Simultaneous Pickup and Delivery10.1016/j.cor.2020.104987 ↗
11. Constructed Wetlands, 1991–2011: A Review of Research Development, Current Trends, and Future Directions10.1016/j.scitotenv.2012.09.064 ↗
12. The Emergence of Residential Satisfaction Studies in Social Research: A Bibliometric Analysis10.1016/j.habitatint.2021.102336 ↗
13. A Systematic Literature Review and Bibliometric Analysis Based on Pricing Related Decisions in Remanufacturing10.1016/j.jclepro.2021.127265 ↗
14. Benefits to the Spanish Research Community of Regional Content Expansion in Web of Science10.1016/S1697-2600(13)70018-8 ↗
15. Study on Sustainable Urbanization Literature Based on Web of Science, Scopus, and China National Knowledge Infrastructure: A Scientometric Analysis in CiteSpace10.1016/j.jclepro.2020.121537 ↗
16. Wang, S., Zhang, M., Hu, T., Fu, X., Gao, Z., Halloran, B., and Liu, Y. (2021). A Bibliometric Analysis and Network Visualisation of Human Mobility Studies from 1990 to 2020: Emerging Trends and Future Research Directions. Sustainability, 13.10.20944/preprints202103.0421.v1 ↗
17. Zhang, J., Cenci, J., Becue, V., Koutra, S., and Ioakimidis, C.S. (2020). Recent Evolution of Research on Industrial Heritage in Western Europe and China Based on Bibliometric Analysis. Sustainability, 12.10.3390/su12135348 ↗
18. Goerlandt, F., Li, J., and Reniers, G. (2020). The Landscape of Risk Communication Research: A Scientometric Analysis. Int. J. Environ. Res. Public Health, 17.10.3390/ijerph17093255 ↗
19. Critical Evaluation of Off-Site Construction Research: A Scientometric Analysis10.1016/j.autcon.2017.12.002 ↗
20. Distribution features and intellectual structures of digital humanities10.1108/JD-05-2017-0076 ↗
21. Google scholar, scopus and the web of science: A longitudinal and cross-disciplinary comparison10.1007/s11192-015-1798-9 ↗
22. CiteSpace II: Detecting and Visualizing Emerging Trends and Transient Patterns in Scientific Literature10.1002/asi.20317 ↗
23. A Scientometric Analysis and Critical Review of Construction Related Ontology Research10.1016/j.autcon.2018.12.013 ↗
24. Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations10.1016/j.cor.2019.02.014 ↗
25. Locating a Cycle in a Transportation or a Telecommunications Network10.1002/net.20170 ↗
26. A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem10.1016/S0191-2615(02)00045-0 ↗
27. Parallel Tabu Search Heuristics for the Dynamic Multi-Vehicle Dial-a-Ride Problem10.1016/j.parco.2003.12.001 ↗
28. A Granular Tabu Search Algorithm for the Dial-a-Ride Problem10.1016/j.trb.2013.07.014 ↗
29. Exact and Meta-Heuristic Approach for a General Heterogeneous Dial-a-Ride Problem with Multiple Depots10.1016/j.trb.2014.05.007 ↗
30. An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints10.1287/trsc.1060.0165 ↗
31. Bin Packing and Cutting Stock Problems: Mathematical Models and Exact Algorithms10.1016/j.ejor.2016.04.030 ↗
32. A Destroy and Repair Algorithm for the Bike Sharing Rebalancing Problem10.1016/j.cor.2016.01.011 ↗
33. Vehicle Routing Problem Simultaneous Deliveries and Pickups with Split Loads and Time Windows10.3141/2378-13 ↗
34. Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines10.1287/trsc.2017.0798 ↗
35. A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks10.1287/ijoc.1110.0489 ↗
36. An Integer L-Shaped Algorithm for the Dial-a-Ride Problem with Stochastic Customer Delays10.1016/j.dam.2011.01.021 ↗
37. A Unified Heuristic for a Large Class of Vehicle Routing Problems with Backhauls10.1016/j.ejor.2004.09.004 ↗
38. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows10.1287/trsc.1050.0135 ↗
39. Asymptotically Optimal Algorithms for Pickup and Delivery Problems with Application to Large-Scale Transportation Systems10.1109/TAC.2013.2259993 ↗
40. A Multi-Objective Memetic Algorithm Based on Locality-Sensitive Hashing for One-to-Many-to-One Dynamic Pickup-and-Delivery Problem10.1016/j.ins.2015.09.006 ↗
41. Optimization for Dynamic Ride-Sharing: A Review10.1016/j.ejor.2012.05.028 ↗
42. Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries10.1016/j.ejor.2002.11.003 ↗
43. Solving the Dial-a-Ride Problem Using Genetic Algorithms10.1057/palgrave.jors.2602287 ↗
44. A Hybrid Genetic Algorithm for the Heterogeneous Dial-a-Ride Problem10.1016/j.cor.2016.12.008 ↗
45. Perera, T., Prakash, A., and Srikanthan, T. (2019, January 27–30). Genetic Algorithm Based Dynamic Scheduling of EV in a Demand Responsive Bus Service for First Mile Transit. Proceedings of the 2019 IEEE Intelligent Transportation Systems Conference (ITSC), Auckland, New Zealand.10.1109/ITSC.2019.8917141 ↗
46. A Hybrid Algorithm for the Multi-Depot Heterogeneous Dial-a-Ride Problem10.1016/j.cor.2020.105196 ↗
47. The Multiple Vehicle Pickup and Delivery Problem with LIFO Constraints10.1016/j.ejor.2014.12.029 ↗
48. The Tree Representation for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading10.1016/j.ejor.2011.02.008 ↗
49. A Learning-Based Memetic Algorithm for the Multiple Vehicle Pickup and Delivery Problem with LIFO Loading10.1016/j.cie.2019.106241 ↗
50. The Self-Learning Particle Swarm Optimization Approach for Routing Pickup and Delivery of Multiple Products with Material Handling in Multiple Cross-Docks10.1016/j.tre.2016.04.003 ↗
51. Adaptive Large Neighborhood Search for the Time-Dependent Profitable Pickup and Delivery Problem with Time Windows10.1016/j.tre.2020.101942 ↗
52. A Parallel Simulated Annealing Method for the Vehicle Routing Problem with Simultaneous Pickup–Delivery and Time Windows10.1016/j.cie.2015.02.005 ↗
53. Co-Citation in the Scientific Literature: A New Measure of the Relationship between Two Documents10.1002/asi.4630240406 ↗
54. System of Document Connections Based on References
55. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines10.1016/j.cor.2016.01.018 ↗
56. Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Profits, and Reserved Requests10.1016/j.ejor.2015.12.032 ↗
57. Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State–Space–Time Network Representations10.1016/j.trb.2016.03.009 ↗
58. A Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading10.1002/net.20312 ↗
59. A Hybrid Discrete Particle Swarm Optimization for Vehicle Routing Problem with Simultaneous Pickup and Delivery10.1016/j.cie.2012.01.005 ↗
60. A Suggested Computation for Maximal Multi-Commodity Network Flows10.1287/mnsc.5.1.97 ↗
61. The Pickup and Delivery Problem with Time Windows10.1016/0377-2217(91)90319-Q ↗
62. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows10.1287/trsc.1090.0272 ↗
63. An Efficient Column-Generation-Based Algorithm for Solving a Pickup-and-Delivery Problem10.1016/j.cor.2011.02.009 ↗
64. A Hybrid Algorithm for the Vehicle Routing Problem with Pickup and Delivery and Three-Dimensional Loading Constraints10.1016/j.ejor.2016.04.016 ↗
65. A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows10.1016/j.cor.2004.08.001 ↗
66. Kammarti, R., Hammadi, S., Borne, P., and Ksouri, M. (2004, January 10–13). New Hybrid Evolutionary Approach for the Pickup and Delivery Problem with Time Windows. Proceedings of the 2004 IEEE International Conference on Systems, Man & Cybernetics, Hague, The Netherlands.
67. Zhao, F., Mei, D., Sun, J., and Liu, W. (2009, January 17–19). A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Proceedings of the 2009 Chinese Control and Decision Conference, Guilin, China.
68. Schaefer, R., Cotta, C., Kołodziej, J., and Rudolph, G. (2010, January 11–15). Solving the One-Commodity Pickup and Delivery Problem Using an Adaptive Hybrid VNS/SA Approach. Proceedings of the Parallel Problem Solving from Nature, PPSN XI, Kraków, Poland.10.1007/978-3-642-15844-5 ↗
69. Meng, L., and Guo, X. (2008, January 12–15). A New Hybrid Metaheuristics for the Vehicle Routing Problem with Simultaneous Pick-up and Delivery. Proceedings of the 2008 IEEE International Conference on Service Operations and Logistics, and Informatics, Beijing, China.
70. Majumder, S., Barma, P.S., Biswas, A., Banerjee, P., Mandal, B.K., Kar, S., and Ziemba, P. (2022). On Multi-Objective Minimum Spanning Tree Problem under Uncertain Paradigm. Symmetry, 14.10.3390/sym14010106 ↗
71. Constraints in Container Loading—A State-of-the-Art Review10.1016/j.ejor.2012.12.006 ↗
72. Ant Colony Optimization for the Two-Dimensional Loading Vehicle Routing Problem10.1016/j.cor.2007.10.021 ↗
73. A Tabu Search Algorithm for a Routing and Container Loading Problem10.1287/trsc.1050.0145 ↗
74. Dynamic Memory Memetic Algorithm for VRPPD with Multiple Arrival Time and Traffic Congestion Constraints10.1109/ACCESS.2020.3023090 ↗
75. Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem Including Traffic Congestion10.1002/acs.1005 ↗
76. Ridesharing Problem with Flexible Pickup and Delivery Locations for App-Based Transportation Service: Mathematical Modeling and Decomposition Methods10.1155/2018/6430950 ↗
77. Hua, S., and Qi, M. (2019, January 12–15). An Adaptive Large Neighborhood Search Heuristic for Dynamic Ridesharing Problem. Proceedings of the 2019 IEEE 6th International Conference on Industrial Engineering and Applications (ICIEA), Tokyo, Japan.10.1109/IEA.2019.8714847 ↗
78. The Bike Sharing Rebalancing Problem with Stochastic Demands10.1016/j.trb.2018.10.015 ↗
79. An Improved General Variable Neighborhood Search for a Static Bike-Sharing Rebalancing Problem Considering the Depot Inventory10.1016/j.eswa.2020.113752 ↗
80. A Hybrid Large Neighborhood Search for the Static Multi-Vehicle Bike-Repositioning Problem10.1016/j.trb.2016.11.003 ↗
81. Static Repositioning in a Bike-Sharing System: Models and Solution Approaches10.1007/s13676-012-0017-6 ↗
82. A 3-Step Math Heuristic for the Static Repositioning Problem in Bike-Sharing Systems10.1016/j.trb.2014.10.003 ↗
83. Blum, C., and Ochoa, G. (2014, January 23–25). Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. Proceedings of the Evolutionary Computation in Combinatorial Optimisation, Granada, Spain.
84. A Modular Soft Computing Based Method for Vehicles Repositioning in Bike-Sharing Systems10.1016/j.sbspro.2012.09.785 ↗
85. Collaborative Multi-Depot Logistics Network Design with Time Window Assignment10.1016/j.eswa.2019.112910 ↗
86. A Coalition Structure Algorithm for Large-Scale Collaborative Pickup and Delivery Problem10.1016/j.cie.2020.106737 ↗
87. A Matheuristic Method for the Electric Vehicle Routing Problem with Time Windows and Fast Chargers10.1016/j.cor.2018.06.019 ↗
88. The Two-Echelon Capacitated Electric Vehicle Routing Problem with Battery Swapping Stations: Formulation and Efficient Methodology10.1016/j.ejor.2018.07.002 ↗
89. Wang, D., and Zhou, H. (2021). A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations. Appl. Sci., 11.10.3390/app112210779 ↗
90. Energy Consumption Estimation Integrated into the Electric Vehicle Routing Problem10.1016/j.trd.2019.01.006 ↗
91. The Electric Vehicle Routing Problem with Energy Consumption Uncertainty10.1016/j.trb.2019.06.006 ↗
92. Partial Recharge Strategies for the Electric Vehicle Routing Problem with Time Windows10.1016/j.trc.2016.01.013 ↗
93. Optimizing Electric Vehicle Routing Problems with Mixed Backhauls and Re-charging Strategies in Multi-Dimensional Representation Network10.1016/j.eswa.2021.114804 ↗
94. The electric vehicle routing problem with capacitated charging stations10.1287/trsc.2021.1111 ↗
95. The Dial-a-Ride Problem with Electric Vehicles and Battery Swapping Stations10.1016/j.tre.2018.08.005 ↗
96. Granular Tabu Search for the Pickup and Delivery Problem with Time Windows and Electric Vehicles10.1016/j.ejor.2019.05.010 ↗
97. Pickup and Delivery with Electric Vehicles under Stochastic Battery Depletion10.1016/j.cie.2020.106512 ↗
98. The General Pickup and Delivery Problem10.1287/trsc.29.1.17 ↗
99. The Pickup Delivery Location Problem on Networks10.1002/net.3230260408 ↗
100. A Genetic Approach to the Pickup/Delivery Station Location Problem in Segmented Flow Based Material Handling Systems10.1016/S0278-6125(99)80014-4 ↗