（1）车辆路线VRP：

1. “A Hybrid Algorithm for the Vehicle Routing Problem", J. Ang, W. Ho, and A. Lim, International Journal on Artificial Intelligence Tools 10(3) 431-449 (2001).

2. “Local Search with Annealing-like Restarts to solve the VRPTW", H. Li and A. Lim, European Journal on Operational Research, Volume 150, No. 1 (2003 October), 115-127.

3. "Multi-depot Vehicle Routing Problem: two-stage and one-stage approach", A. Lim and F. Wang, IEEE Transactions on Automation Science and Engineering, volume 2, No 4, October 2005, 397-402.

4. “Tabu Search embedded Simulated Annealing for the Shortest Route Cut and Fill Problem,” A. Lim, B. Rodrigues, J. Zhang, Journal of Operational Research Society, Volume 56, Number 7, 816-825, 2005.

5. “The One-Commodity Pickup and Delivery Travelling Salesman Problem on a Path or a Tree,” A. Lim, F. Wang, Z. Xu, Networks, Volume 48, Issue 1 (August 2006) 24-35.

6. “A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time windows”, A. Lim and X. Zhang, Informs Journal on Computing, Volume 19, Number 3, 443-457.

7. “The Tree Representation for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading,” Y. Li, A. Lim, H. Qin, and T. Du, European Journal on Operational Research, Volume 212, Issue 3, page 482-496, 2011

8. “An Investigation into the Vehicle Routing Problem with Time Window and Link Capacity Constraints,” H. Ma, B. Cheang, A. Lim, L. Zhang, Y. Zhu, Omega – International Journal of Management Science, Volume 40, Issue 3, June 2012, Pages 336-347.

9. "The Single Vehicle Routing Problem with Toll-by-Weight Scheme: a Branch and Bound Approach", Zizhen Zhang, Hu Qin, Andrew Lim and Wenbin Zhu, European Journal of Operational Research, Volume 220, No. 2, July 2012,295-304.

10. "Multiple Pickup and Delivery Traveling Salesman Problem with Last-in-first-out Loading and Distance Constraints", B. Cheang, X. Gao, A. Lim, H. Qin and W.B. Zhu, European Journal of Operational Research, Volume 223, Issue 1, November 2012, 60-75.

11. “A Memetic Algorithm for the Multiperiod Vehicle Routing Problem with Profit,” Z. Zhang, C. Che, B. Cheang, A. Lim, H. Qin, European Journal of Operational Research,  Volume 229, Issue 3, 2013, Pages 573-584.

12. “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, 2013, Volume 229, Issue 3, Pages 673-682.

13. “Branch-and-Price-and-Cut for the Multiple Traveling Repairman Problem with Distance Constraints,” Z. Luo, A. Lim, H. Qin, European Journal of Operational Research, Issue 1, Volume 234, April 2014, 49-60.

14. “An Iterative 3-Component Heuristic for the Team Orienteering Problem with Time Windows,” Q. Hu, A. Lim, European Journal of Operational Research, Volume 232, Issue 2, 16 January 2014, Pages 276–286.

15. “An Improved Approximation Algorithm for the Capacitated TSP with Pickup and Delivery on a Tree”, Z. Xu, X. Lai, A. Lim, F. Wang, Networks 63(2), March 2014, 179-195.

16. “An adaptive neighborhood search algorithm for a heterogeneous vehicle routing problem with three-dimensional loading constraints,” L. Wei, Z. Zhang, A. Lim, IEEE Computational Intelligence, October 2014, Volume 9, number 4, 18-30.  

17. “On Service Consistency in Multi-Period Vehicle Routing,” Z. Luo, H. Qin, C. Che, A. Lim, European Journal of Operational Research, Volume 243, Issue 3, 16 June 2015, Pages 731-744.

18. “A variable neighborhood search for the capacitated vehicle routing problem with two dimensional loading constraints,” L. Wei, Z. Zhang, D. Zhang, A. Lim, European Journal of Operational Research, Volume 243, Issue 3, 16 June 2015, Pages 798-814.

19. “Two Exact Algorithms for the Umpire Traveling Problem,” L. Xue, Z. Luo and A. Lim, European Journal on Operational Research, Volume 243, Issue 3, 16 June 2015, Pages 932-943.

20. “A Memetic Algorithm for Patient Transportation”, Z. Zhang, M. Liu, A. Lim, OMEGA, Volume 54, July 2015, Pages 60–71.

21. “A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem”, Q. Hu, W. Ming, Z. Zhang, Y. Xie, A. Lim, Computers and Operations Research, Volume 59, July 2015, Pages 78-93.

22. “An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints,” Z. Zhang, L. Wei, A. Lim, Transportation Research Part B, Volume 82, December 2015, Pages 20-35

23. “A Branch-and-Cut Algorithm for a Realistic Dial-a-Ride Problem,” Z. Luo, M. Liu, A. Lim, Transportation Research Part B, Volume 81, Part 1, November 2015, Pages 267–288.

24. “Adaptive Large Neighborhood Search Heuristics for the Vehicle Routing Problem with Stochastic Demands and Weight-related Cost,” Z. Luo, H. Qin, D. Zhang and A. Lim, Transportation Research Part E, Logistics and Transportation Review 01/2016, volume 85, 69-89.

25. “Branch-and-price for the pickup and delivery problem with loading cost,” L. Xue, Z. Luo, A. Lim, OMEGA, Volume 59, Part B, March 2016, Pages 131-145.

26. “Pickup and delivery service with manpower planning in Hong Kong Public Hospitals,” A. Lim, H. Qin, Z. Zhang, Transportation Science, Volume 51, Issue 2, May 2017, Pages 688-705.

27. “Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost,” Luo, H. Qin, W. Zhu, A. Lim Transportation Science, Volume 51(2), May 2017, Pg 668-687.

28. “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, Vol 266(2), 16 April 2018, Pages 487-497.

29. “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, Volume 53, issue 1, Jan-Feb 2019, Pages 113-130.

30. “Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction,” Z. Zhang, Z. Luo, H. Qin, A. Lim, Transportation Science, Volume 53(2), Mar-Apr 2019, Pages 427-441.

31. “Multi-commodity Demand Fulfillment via Simultaneous Pickup and Delivery for a Fast Fashion Retailer,” Z Zhang, B Cheang, C Li, A Lim, Computers & Operations Research, 103:81-96 (2019).

32. “A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing,” C Li, L Gong, Z Luo, A Lim, Omega, Vol. 89, Dec. 2019, Pages 71-91.

33. “Optimal Solution of Vehicle Routing Problems with Fractional Objective Function”, R. Baldacci, A. Lim, E. Traversi, R. Wolfer Calvo, Transportation Science, 54(2): 434-452 (2020).

34. “An integrated route, temperature and humidity planning problem for the distribution of perishable products”, Yijing Liang, Fan Liu, Andrew Lim, Dezhi Zhang, Computers Industrial Engineering, Volume 147, 106623 (2020).

35. “A Benders Decomposition Approach for the Multi-Vehicle Production Routing Problem with Order-up-to-level Policy,” Z. Zhang, Z. Luo, R. Baldacci, A. Lim, Transportation Science, Volume 55(1), pp160-178 (2021).

36. “Multi-Trip Time-Dependent Vehicle Routing Problem with Time Windows,” B. Pan, Z. Zhang, A. Lim, European Journal of Operational Research, 291(1), 218-231 (2021).

37. “A hybrid algorithm for time-dependent vehicle routing problem with time windows,” B. Pan, Z. Zhang, A. Lim, Computers and Operations Research, Volume 128, 105193 (2021).

38. “Robust Data-Driven Vehicle Routing with Time Windows”, Y. Zhang, Z. Zhang, A. Lim, M. Sim, Operations Research, 69(2): 469-485 (2021).

39. “A Branch-and-price-and-cut algorithm for the cable routing problem in solar power plants,” Z. Luo, H. Qin, TCE Cheng, Q. Wu, Informs Journal on Computing, 33(2): 452-476 (2021).

40. “Heterogeneous Attentions for Solving Pickup and Delivery Problem via Deep Reinforcement Learning, IEEE Transactions on Intelligent Transportation System, 23 (3), 2306-2315 (2021).

41. “A Heuristic Algorithm for Solving a Large-scale Real-world Territory Design Problem,” L. Zhou, L Zhen, R Baldacci, M Boschetti, Y. Dai, A Lim, Omega, 103, 102442 (2021).

42. “Learning Improvement Heuristics for Solving Routing Problems", Wu, Yaoxin; Song, Wen; Cao, Zhiguang; Zhang, Jie; Lim, Andrew, IEEE Transactions on Neural Networks and Learning Systems, 33 (9), 5057-5069 (2021).

43. “The Multi-visit Traveling Salesman Problem with Multi-Drones,” Luo, Z., Pan, B., Zhang, Z., Liu, Z., and Lim, A., Transportation Research Part C: Emerging Technologies, 128, 103172 (2021).

44. “Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem”, J Li; Y Ma; R. Gao; Z. Cao; A. Lim; W. Song; J. Zhang, IEEE Transactions on Cybernetics 52 (12), 13572-13585 (2022).

45. “Data-driven optimization: A flexible route pricing method for Non-Truck Operating Common Carriers”, X Chen, F Li, J Jiang, B Jia, A Lim, J Wu, Transportation Research Part E: Logistics and Transportation Review 161, 102678 (2022)

46. “A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips”,  Z Luo, R Gu, M Poon, Z Liu, A Lim, Computers & Operations Research 148, 106015 (2022).

47. “Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems”, W. Song, Z. Cao, J. Zhang, C. Xu, A. Lim, Engineering Applications of Artificial Intelligence, 109, 104603 (2022).

（2）集装箱装箱

48. “A Multifaced Buildup Algorithm for Three Dimensional Packing”, A. Lim, B. Rodrigues, Y. Wang, Omega (2003), Volume 31 (6), 471-481.

49. “The Two-Dimensional Packing Problem for Irregular Objects”, P. Chen, Z. Fu, A. Lim and B. Rodrigues, International Journal on Artificial Intelligent Tools, volume 13, number 3, September 2004, 429-448.

50. “3D Container Packing Heuristics”, A. Lim, B. Rodrigues, Y. Yang, Applied Intelligence, Vol. 22, No. 2 (March/April 2005), 125-134.

51. “The Multiple Container loading Cost Minimization Problem”, C. Che, W. Huang, A. Lim, W. Zhu, European Journal on Operational Research, Volume 214 (2011), 501-511.

52. “A Skyline Heuristic for the 2D Rectangular Packing and Strip Packing Problems,” Wei Lijun, W. Zhu, W. Oon, A. Lim, European Journal on Operational Research, Volume 215, Issue 2, 1 December 2011, Pages 337-346.

53. “An Iterated Construction Approach with Dynamic Prioritization for Solving the Container Loading Problems,” A. Lim, H. Ma, J. Xu, X. Zhang, Expert Systems With Applications, Volume 39, Issue 4, March 2012, Pages 4292-4305.

54. “A Two-stage Tabu Search Algorithm with Enhanced Packing Heuristics for the 3L-CVRP and M3L-CVRP,” W. Zhu, H. Qin, A. Lim, L. Wang, Computers and Operations Research, volume 39, number 9, 2178-2195 (2012).

55. “A Reference Length Approach for the 3D Strip Packing Problem”, L. J. Wei, W.C. Oon, W. B. Zhu, A. Lim, European Journal of Operational Research, vol. 220, No. 1, 2012, 37-47.

56. “An Investigation of IDA* Algorithms for the Container Relocation Problem”, W.B. Zhu, H. Qin, A. Lim, H.D. Zhang, IEEE Transactions on Automation Science and Engineering, Volume 9, No. 4, October 2012, 710-722.

57. “A New Iterative-Doubling Greedy-Lookahead Algorithm for the Single Container Loading Problem”, W.B. Zhu, A. Lim, European Journal of Operational Research, Volume 222, Issue 3, November 2012, 408-417.

58. “Space Defragmentation for Packing Problems”, W.B. Zhu, Z. Y. Zhang, W.C. Oon, A. Lim, European Journal of Operational Research, Volume 222, Issue 3, November 2012, 452-463.

59. "A Prototype Column Generation Strategy for the Multiple Container Loading Problem", W.B. Zhu, W.L. Huang, A. Lim, European Journal of Operational Research, Volume 223, Issue 1, November 2012, 27-39.

60. “The Six Elements to Block-Building Approaches for the Single Container Loading Problem”, W.B. Zhu, W. C. Oon, A. Lim, Y. J. Weng, Applied Intelligence, 37(3): 431-445 (2012).

61. “Goal-driven Approach to the 2D Bin Packing and Variable-sized Bin Packing Problems”, L.J. Wei, W.B. Zhu, W.C. Oon, A. Lim, European Journal of Operational Research, Volume 224, Issue 1, 1 Jan 2013, Pages 110–121.

62. “The Single Container Loading Problem with Axle Weight Constraints,” A .Lim, H. Ma, C. Qiu, W. Zhu, International Journal of Production Economics, Volume 144, Issue 1, July 2013, Pages 358-369.

63. “A Multi-Round Beam Search Approach for the Single Container Loading Problem with Shipment Priority”, N. Wang, W Zhu, A. Lim, International Journal of Production Economics, Volume 145, Issue 2, October 2013, Pages 531–540.

64. “The freight consolidation and containerization problem,” H. Qin, Z. Zhang, Z. Qi, A. Lim, European Journal of Operational Research, Issue 1, Volume 234, April 2014, 37-48.

65. “A Block-based Layer Building Approach for the 2D Guillotine Strip Packing Problem,” L. Wei, T. Tian, W. Zhu, A. Lim, European Journal of Operational Research, Volume 239, Issue 1, 16 November 2014, Pages 58-69.

66. “The two-dimensional vector packing problem with piecewise linear cost function”, Q. Hu, A. Lim, W. Zhu, Omega, Volume 50, January 2015, Pages 43-53.

67. “A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem,” L. Wei, W. Zhu, A. Lim, European Journal of Operational Research, Volume 241, Issue 1, Feb 2015, Pages 39-49.

68. “A bidirectional building approach for the 2D constrained guillotine knapsack packing problem,” L. Wei and A. Lim, European Journal of Operational Research, Volume 242, Issue 1, 1 April 2015, Pages 63-71.

69. “Multiple Container Loading with Preference,” T. Tian, W. Zhu, A. Lim, L. Wei, European Journal of Operational Research, Volume 248, Issue 1, 1 Jan 2016, Pages 84-94.

70. “A Fast Implementation for the 2D/3D box placement”, W. Zhu, Z. Luo, A. Lim, W. Oon, Computational Optimization and Applications, March 2016, Volume 63, Issue 2, pp 585-612.

71. "A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function", Q. Hu, W. Zhu, A. Lim, H. Qin, European Journal of Operational Research, Vol 260(1), 1 July 2017, Pages 70-80.

72. “The two-dimensional vector packing problem with general costs”, Q. Hu, L. Wei, and A. Lim, Omega-International Journal of Management Science, Volume 74, January 2018, Pages 59-69.

73. “The Single Polybag Loading Problem”, Y Che, Y Liu, Q Gao, A Lim, Q Hu, Electronic Notes in Discrete Mathematics 69, (2018), 69-76.

74. “A best-fit branch-and-bound algorithm for the unconstrained two-dimensional non-guillotine cutting problem,” L. Wei, Q. Hu, A. Lim, Q. Liu, European Journal of Operational Research, Volume 270 (2), October 2018, 448-474.

75. “An adaptive selection approach for the 2D rectangle packing area minimization problem”, L. Wei, W. Zhu, A. Lim, Q. Liu, X. Chen, Omega-International Journal of Management Science, Volume 80, October 2018, 22-30.

76. “A branch-and-price algorithm for the two-dimensional vector packing problem”, L Wei, M Lai, A Lim, Q Hu, European Journal of Operational Research 281 (1), 25-35 (2020).

77. “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).

78. “An exact algorithm for two-dimensional vector packing problem with volumetric weight and general cost,” T. Wang, Q. Hu, A. Lim, European Journal of Operational Research, 300 (1), 20-34 (2022).

79. “A Dynamic Multi-modal Deep Reinforcement Learning framework for 3D Bin Packing Problem”, A. Zhao, T. Li, L. Lin, Knowledge Based Systems (2024).v