2010年在華南理工大學計算機科學與工程學院獲得學士學位，2014年在香港城市大學商學院獲得博士學位，2014年加入南京大學工程管理學院，2017年被聘為南京大學副教授。主要研究的領(lǐng)域是運籌優(yōu)化算法設(shè)計、智慧物流、智能制造等，主持國家自然科學基金青年項目一項，參與多項國家自然科學基金項目，帶領(lǐng)團隊開發(fā)了一款求解車輛路徑問題（Vehicle Routing Problem）的算法包。更多信息介紹請看http://luodequan.github.io。

1. 運籌優(yōu)化算法理論及其應(yīng)用: 資源調(diào)度與分配，車輛路徑優(yōu)化，組合拍賣，電力系統(tǒng)優(yōu)化

2. 整數(shù)規(guī)劃算法設(shè)計: 各類求解整數(shù)規(guī)劃問題的精確算法和啟發(fā)式算法設(shè)計，包括Branch-and-Price算法、Branch-and-Cut算法、禁忌搜索等    

2018年以隊長的身份參加京東物流舉辦的“全球運籌優(yōu)化挑戰(zhàn)賽”在城市物流運輸車輛智能調(diào)度賽題獲得第一名，獎金30萬人民幣。

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 Luo and 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.

1. 電子商務(wù)企業(yè)物流配送車輛調(diào)度研究，國家自然科學基金青年項目， 2016-2018, 主持人

2. 運輸服務(wù)聯(lián)合采購的問題的研究，國家自然科學基金面上項目，2016-2019，主要參加人