Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads
Qingfeng Chen, Kunpeng Li, Zhixue Liu
Transportation Research Part E Logistics and Transportation Review (2014) Vol. 69, pp. 218-235
Closed Access | Times Cited: 47

Showing 1-25 of 47 citing articles:

The vehicle routing problem: State of the art classification and review
Kris Braekers, Katrien Ramaekers, Inneke Van Nieuwenhuyse
Computers & Industrial Engineering (2015) Vol. 99, pp. 300-313
Open Access | Times Cited: 1003
A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants
Raafat Elshaer, Hadeer Awad
Computers & Industrial Engineering (2019) Vol. 140, pp. 106242-106242
Closed Access | Times Cited: 233
Review of Vehicle Routing Problems: Models, Classification and Solving Algorithms
Haifei Zhang, Hongwei Ge, Jinlong Yang, et al.
Archives of Computational Methods in Engineering (2021) Vol. 29, Iss. 1, pp. 195-221
Closed Access | Times Cited: 85
Collaborative multi-depot pickup and delivery vehicle routing problem with split loads and time windows
Yong Wang, Qin Li, Xiangyang Guan, et al.
Knowledge-Based Systems (2021) Vol. 231, pp. 107412-107412
Closed Access | Times Cited: 52
The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode
Yali Li, Jun Yang
Computers & Industrial Engineering (2024) Vol. 190, pp. 110076-110076
Closed Access | Times Cited: 6
A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry
Darat Dechampai, Ladda Tanwanichkul, Kanchana Sethanan, et al.
Journal of Intelligent Manufacturing (2015) Vol. 28, Iss. 6, pp. 1357-1376
Closed Access | Times Cited: 60
An exact algorithm for the container drayage problem under a separation mode
Yujian Song, Jiantong Zhang, Zhe Liang, et al.
Transportation Research Part E Logistics and Transportation Review (2017) Vol. 106, pp. 231-254
Closed Access | Times Cited: 54
A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms
Asefeh Hasani Goodarzi, Reza Tavakkoli‐Moghaddam, Alireza Amini
Computers & Industrial Engineering (2020) Vol. 149, pp. 106832-106832
Closed Access | Times Cited: 45
Rich vehicle routing problem with last-mile outsourcing decisions
Juan J. Alcaraz, Luis Caballero-Arnaldos, Javier Vales‐Alonso
Transportation Research Part E Logistics and Transportation Review (2019) Vol. 129, pp. 263-286
Closed Access | Times Cited: 44
Green split multiple-commodity pickup and delivery vehicle routing problem
Jiao Zhao, Hongxia Dong, Ning Wang
Computers & Operations Research (2023) Vol. 159, pp. 106318-106318
Closed Access | Times Cited: 13
A Multi-Commodity Two-Echelon Vehicle Routing Problem with Split Delivery and Supply-Demand Mismatch
Ru Gao, Lijuan Wang, Jianghan Zhu, et al.
(2025)
Closed Access
Diversity-based niche genetic algorithm for bi-objective mixed fleet vehicle routing problem with time window
Shengli Du, Shilong Li, Honggui Han, et al.
Neural Computing and Applications (2025)
Closed Access
A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem
Ruibin Bai, Ning Xue, Jianjun Chen, et al.
Transportation Research Part B Methodological (2015) Vol. 79, pp. 134-148
Open Access | Times Cited: 41
An unpaired pickup and delivery vehicle routing problem with multi-visit
Dongyang Xu, Kunpeng Li, Xuxia Zou, et al.
Transportation Research Part E Logistics and Transportation Review (2017) Vol. 103, pp. 218-247
Closed Access | Times Cited: 38
New exact solution approaches for the split delivery vehicle routing problem
Gizem Özbaygın, Oya Ekin Karaşan, Hande Yaman
EURO Journal on Computational Optimization (2017) Vol. 6, Iss. 1, pp. 85-115
Open Access | Times Cited: 37
Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics
David Rey, Khaled Almi’ani, Divya Jayakumar Nair
Transportation Research Part E Logistics and Transportation Review (2018) Vol. 112, pp. 19-46
Closed Access | Times Cited: 37
Fair allocation and cost-effective routing models for food rescue and redistribution
Divya Jayakumar Nair, David Rey, Vinayak Dixit
IISE Transactions (2017) Vol. 49, Iss. 12, pp. 1172-1188
Closed Access | Times Cited: 35
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
Chongshou Li, Lijun Gong, Zhixing Luo, et al.
Omega (2018) Vol. 89, pp. 71-91
Closed Access | Times Cited: 32
An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup
Yuxin Liu, Zihang Qin, Jin Liu
Mathematics (2023) Vol. 11, Iss. 15, pp. 3328-3328
Open Access | Times Cited: 9
An exact algorithm for unpaired pickup and delivery vehicle routing problem with multiple commodities and multiple visits
Dongyang Xu, Lu Zhen, Hing Kai Chan, et al.
Transportation Research Part C Emerging Technologies (2024) Vol. 160, pp. 104488-104488
Closed Access | Times Cited: 3
Food Rescue and Delivery
Divya Jayakumar Nair, Hanna Grzybowska, David Rey, et al.
Transportation Research Record Journal of the Transportation Research Board (2016) Vol. 2548, Iss. 1, pp. 81-89
Closed Access | Times Cited: 25
Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets
Farivar Ranjbaran, Ali Husseinzadeh Kashan, Abolfazl Kazemi
International Journal of Production Research (2019) Vol. 58, Iss. 6, pp. 1741-1775
Closed Access | Times Cited: 23
An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows
Z. Q. Zhu, Yanru Chen, M.I.M. Wahab
Computers & Operations Research (2024) Vol. 170, pp. 106761-106761
Closed Access | Times Cited: 2
Cooperation and profit allocation for two-echelon logistics pickup and delivery problems with state–space–time networks
Yong Wang, Shuanglu Zhang, Xiangyang Guan, et al.
Applied Soft Computing (2021) Vol. 109, pp. 107528-107528
Closed Access | Times Cited: 17
Toward Safe and Efficient Human–Swarm Collaboration: A Hierarchical Multi-Agent Pickup and Delivery Framework
Xin Gong, Tieniu Wang, Tingwen Huang, et al.
IEEE Transactions on Intelligent Vehicles (2022) Vol. 8, Iss. 2, pp. 1664-1675
Closed Access | Times Cited: 12
Page 1 - Next Page

Scroll to top