| A branch-and-cut algorithm for a realistic dial-a-ride problem M Liu, Z Luo, A Lim Transportation Research Part B: Methodological 81, 267-288, 2015 | 128 | 2015 |
| A review on the electric vehicle routing problems: Variants and algorithms H Qin, X Su, T Ren, Z Luo Frontiers of Engineering Management 8, 370-389, 2021 | 100 | 2021 |
| Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints Z Luo, H Qin, A Lim European Journal of Operational Research 234 (1), 49-60, 2014 | 92 | 2014 |
| Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost Z Luo, H Qin, W Zhu, A Lim Transportation Science 51 (2), 668-687, 2017 | 72 | 2017 |
| On service consistency in multi-period vehicle routing Z Luo, H Qin, CH Che, A Lim European Journal of Operational Research 243 (3), 731-744, 2015 | 71 | 2015 |
| A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems L Wei, Z Luo, R Baldacci, A Lim INFORMS Journal on Computing 32 (2), 428-443, 2020 | 69 | 2020 |
| A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints T Liu, Z Luo, H Qin, A Lim European Journal of Operational Research 266 (2), 487-497, 2018 | 66 | 2018 |
| Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost Z Luo, H Qin, D Zhang, A Lim Transportation Research Part E: Logistics and Transportation Review 85, 69-89, 2016 | 64 | 2016 |
| A two-phase branch-and-price-and-cut for a dial-a-ride problem in patient transportation Z Luo, M Liu, A Lim Transportation Science 53 (1), 113-130, 2019 | 62 | 2019 |
| A survey of truck–drone routing problem: Literature review and research prospects YJ Liang, ZX Luo Journal of the Operations Research Society of China 10 (2), 343-377, 2022 | 47 | 2022 |
| A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing C Li, L Gong, Z Luo, A Lim Omega 89, 71-91, 2019 | 37 | 2019 |
| On-demand delivery from stores: Dynamic dispatching and routing with random demand S Liu, Z Luo Manufacturing & Service Operations Management 25 (2), 595-612, 2023 | 33 | 2023 |
| An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem Z Luo, B Cheang, A Lim, W Zhu European Journal of Operational Research 229 (3), 673-682, 2013 | 33 | 2013 |
| A benders decomposition approach for the multivehicle production routing problem with order-up-to-level policy Z Zhang, Z Luo, R Baldacci, A Lim Transportation Science 55 (1), 160-178, 2021 | 31 | 2021 |
| A hybrid adaptive large neighborhood search and tabu search algorithm for the electric vehicle relocation problem L Cai, X Wang, Z Luo, Y Liang Computers & Industrial Engineering 167, 108005, 2022 | 26 | 2022 |
| Exact algorithms for the vehicle routing problem with time windows and combinatorial auction Z Zhang, Z Luo, H Qin, A Lim Transportation Science 53 (2), 427-441, 2019 | 26 | 2019 |
| An efficient forest-based tabu search algorithm for the split-delivery vehicle routing problem Z Zhang, H He, Z Luo, H Qin, S Guo Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 22 | 2015 |
| Learning to pack: A data-driven tree search algorithm for large-scale 3D bin packing problem Q Zhu, X Li, Z Zhang, Z Luo, X Tong, M Yuan, J Zeng Proceedings of the 30th ACM International Conference on Information …, 2021 | 21 | 2021 |
| Two exact algorithms for the traveling umpire problem L Xue, Z Luo, A Lim European Journal of Operational Research 243 (3), 932-943, 2015 | 21 | 2015 |
| Exact approaches for the pickup and delivery problem with loading cost L Xue, Z Luo, A Lim Omega 59, 131-145, 2016 | 20 | 2016 |
