1. 电子商务企业物流配送车辆调度研究，国家自然科学基金青年项目， 2016-2018, 主持人

2. 运输服务联合采购的问题的研究，国家自然科学基金面上项目，2016-2019，主要参加人

1.LijunWei, Zhixing Luo*, Roberto Baldacci and Andrew Lim. A new branch-and-price-and-cut algorithm for one-dimensional bin packing problems. INFORMS Journal on Computing,accepted, 2018

2.ZhixingLuo, Zhenzhen Zhang, HuQin and Andrew Lim. Exact Algorithms for the Vehicle Routing Problem with TimeWindows and Combinatorial Auction. Transportation Science, accpted, 2018

3.ZhixingLuo*, Mengyang Liu and Andrew Lim. A two-phasebranch-and-price-and-cut for a dial-a-ride problem in patient transportation. Transportation Science, 53 (1), 113-130, 2018

4.Chongshou Li, Lijun Gong, ZhixingLuo*, and Andrew Lim, A branch-and-price-and-cut algorithmfor a pickup and delivery problem in retailing, Omega, accpted, 2018

5.TianLiu, Zhixing Luo, Hu Qin and Andrew Lim. A branch-and-cut algorithm for the two-echeloncapacitated vehicle routing problem with grouping constraints. European Journalof Operational Research, 266 (2), 487-497, 2018

6.ZhixingLuo, Hu Qin, Wenbin Zhu and Andrew Lim, Branch-and-price-and-cut for thesplit-delivery vehicle routing problem with time windows and linearweight-related cost. Transportation Science, 51 (2), 668-687, 2016

7.ZhixingLuo, Hu Qin, Wenbin Zhu and Andrew Lim, Branch-and-price-and-cut for themanpower routing problem with synchronization constraints. Naval Research Logistics, 63(2):138-171, 2016

8.ZhixingLuo, Hu Qin and Andrew Lim, Vehicle routing problem with stochastic demandsand the toll-by-weight scheme. Transportation Research Part E: Logistics andTransportation Review, 85:69-8, 2016

9.Li Xue, Zhixing Luo*and Andrew Lim, Exact approaches for the pickup anddelivery problem with loading cost. Omega, 59:131-145, 2016

10. WenbinZhu, Zhixing Luo, Andrew Lim and Wee-Chong Oon, A fastimplementation for the 2D/3D box placement problem. Computational Optimizationand Applications, 63(2):585-612, 2016

11. MengyangLiu, Zhixing Luo*and Andrew Lim, A branch-and-cut algorithm for arealistic dial-a-ride problem. Transportation Research Part B: Methodological, 81:267-288, 2015

12.ZhixingLuo, Hu Qin, Chan Hou Che and Andrew Lim, On service consistency inmulti-period vehicle routing. European Journal of Operational Research, 243 (3):731-744, 2015

13. Li Xue, Zhixing Luoand Andrew Lim, Two exact algorithms for thetraveling umpire problem. European Journal of Operational Research, 243 (3):932-943, 2015

14. ZhixingLuo, Hu Qin and Andrew Lim, Branch-and-price-and-cut for the multiple travelingrepairman problem with distance constraints. European Journal of OperationalResearch, 234 (1):49-60, 2014.

15. ZhixingLuo, Andrew Lim and Wenbin Zhu, An adaptive ejectionpool with toggle-rule diversification approach for the capacitated team orienteeringproblem. European Journal of Operational Research, 229 (3):673-682, 2013.

车辆路径问题算法包(http://120.55.69.180:8080/docs/tutorial.html/docs/tutorial.html)

该算法包由罗志兴副教授主导开发，基于京东全球运筹优化挑战赛的代码，采用模块化设计，用户通过简单的调用就可以实现一个高效的车辆路径问题算法，同时提供丰富的接口支持用户进行二次开发。目前该算法包具有以下特性：

a)支持多种配送模式、约束条件和目标函数，包括

1）常规配送模式

2）取货送货模式（Pickup and Delivery）

3）需求可拆分（Split-Demand）

4）多车型（Heterogeneous Vehicle）

5）多仓库（Multi-Depot）

6）多行程（Multiple-Trip）

7）容量约束（Capacity Constraint）

8）时间窗约束（Time Windows Constraint）

9）工作时长约束（Duration Constraint）

10）顾客分区访问

11）多时间窗（Multiple Time Windows）

12）车辆行驶速度受交通的影响（Time-Dependent Travel Time）

13）三维装箱（3D Bin Packing）

14）最小化车辆数目

15）最小化车辆固定成本

16）最小化行驶距离

17）最大化收益（不要求每个节点必须访问）

上述的配送模式、约束条件和目标函数可以任意组合。

b)支持多线程并发，既适用于计算时间要求苛刻的业务场景，也适用计算时间要求相对宽松但追求高质量解的业务场景。

c)支持二次开发，只需要实现给定的接口就可以轻松处理新的约束和目标函数。