李相勇    

  博士,教授,博士生导师

 

管理科学与工程系

电话/传真:021-65982307

电子邮箱:xyli@tongji.edu.cn

通信地址:四平路1500号同济大厦A楼1903室 (200092)

简历:点击下载简历

 

 

    李相勇,管理科学与工程系教授,博士生导师。2007年于上海交通大学安泰经济与管理学院获得管理学博士学位。主要研究领域为服务网络设计与优化、数据驱动运营优化、收益管理和定价等,研究致力于为运营、运输、物流和通讯等服务系统的规划、管理和决策建立有效的优化模型和方法。讲授课程包括运筹学、管理优化方法等。

  李相勇教授作为作者/合作者在INFORMS Journal on Computing、European Journal of Operational Research、OMEGA、International Journal of Production Economics、Journal of the Operational Research Society、Transportation Research Part E、Computers and Operations Research、Computers and Industrial Engineering、系统工程理论与实践、管理科学学报等国际国内学术期刊上发表论文多篇。

    李相勇教授担任期刊International Journal of Systems Science: Operations & Logistics编委会委员,担任NetworksEuropean Journal of Operational Research、OMEGA等多个学术期刊审稿人。

      研究曾获上海市科技进步三等奖,论文曾获中国物流学术年会优秀论文一等奖和二等奖。入选了教育部新世纪优秀人才支持计划和上海市浦江人才计划。

 

 

研究领域

  • 理论方法:整数规划,组合优化,随机优化
  • 应用:服务网络设计与优化,数据驱动运营优化,收益管理和定价

教育背景

  • 2004-2007   管理学博士 上海交通大学
  • 2001-2004   工学硕士 西南交通大学
  • 1997-2001   工学学士 西南交通大学

学术经历

  •  2007.11-2009.12   加拿大温莎大学奥德特商学院 博士后
  •  2007.9-2007.10     香港城市大学商学院 助理研究员 (Research Associate)

学术服务

  • 国际期刊International Journal of Systems Science: Operations & Logistics编委会委员
  • NetworksEJOROMEGA、IJPE、JORS等多个学术期刊的审稿人
  • 运筹学和管理学研究协会INFORMS会员
  • 中国运筹学会会员
  • 中国物流协会会员

主持和参与项目

  • 国家自然科学基金 (71672126)  面向O2O即时配送服务的订单匹配问题研究  2017.1-2020.12  主持
  • 教育部人文社会科学研究规划基金项目 (15YJA630030)   面向策略规划的速递服务网络设计与优化研究  2015.1-2017.12 主持
  • 教育部新世纪优秀人才计划项目  考虑资源管理的服务网络设计与优化  2014.1-2016.12 主持
  • 国家自然科学基金 (71101105)  考虑消费者双曲时间偏好行为的动态定价策略研究  2012.1-2014.12  主持
  • 上海市哲学社会科学规划课题 (2011EGL004)  考虑复杂消费者行为的网络零售商动态定价策略研究  2012.1-2013.12  主持
  • 博士点基金 (20110072120013)  考虑消费者惰性行为的动态定价策略研究  2012.1-2013.12  主持
  • 浦江人才计划项目  网络零售环境下考虑消费者双曲时间偏好行为的动态定价策略研究  2011.10-2013.9  主持
  • 国家自然科学基金重点项目 (71532015)  零售商自有品牌的定价策略与供应链协调机制  2016.1-2020.12 参与

发表论文

  • Xiangyong Li, Lanjian Zhu, Fazle Baki, A.B. Chaouch. 2018. Tabu Search and Iterated Local Search for the Cyclic Bottleneck Assignment Problem. Computers and Operations Research, 96 120-130. 
  • Xiangyong Li, Chongfang Yue, Y. Aneja, Si Chen, Youzhi Cui. 2018. An Iterated Heuristic for the Regenerator Location Problem. Applied Soft Computing,70 182-194. New Large Testing instances
  • Xiangyong Li, Y. Aneja. 2017. Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms. European Journal of Operational Research, 257(1) 25-40.
  • Xiangyong Li, Kai Wei, Y. Aneja, P. Tian. 2017. Design-balanced capacitated multicommodity network design with heterogeneous assets.Omega-International Journal of Management Science, 67(3)145-159.
  • Xiangyong Li, Kai Wei, Y. Aneja, P. Tian, Youzhi Cui. 2017. Matheuristics for the single-path design-balanced service network design problem. Computers and Operations Research, 77(1) 141-153.
  • Xiangyong Li, Shaochong Lin, P. Tian, Y. Aneja. 2017. Models and column generation approach for the resource-constrained minimum cost path problem with relays. Omega-International Journal of Management Science, 66(1) 79-90.
  • Xiangyong Li, Shaochong Lin, Si Chen, Y.P. Aneja, Peng Tian, Youzhi Cui. 2017. An iterated metaheuristic for the directed network design problem with relays. Computers & Industrial Engineering, 113, 35-45.
  • Li, X., N. Rafaliya, M. F. Baki, B. A. Chaouch. 2017. Scheduling Elective Surgeries: The Tradeoff among Bed Capacity, Waiting Patients and Operating Room Utilization Using Goal Programming[J]. Health Care Management Science, 20(1): 33-54
  • Xiangyong Li, F. Baki, P. Tian, B. A. Chaouch. 2014. A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing. Omega-International Journal of Management Science 42(1) 75-87.
  •  Xiangyong Li*, Y.P. Aneja. 2012. A branch-and-cut approach for the minimum energy broadcasting problem in wireless networks. INFORMS Journal on Computing 24(3) 443-456.
  •  Xiangyong Li*, Y.P. Aneja, Jiazhen Huo. 2012 Using branch-and-price approach to solve the directed network design problem with relays. OMEGA – The International Journal of Management Science 40(5) 672-679.
  •  Xiangyong Li, SCH Leung, Peng Tian. 2012. A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Systems with Applications 39(1) 365-374.
  •  Xiangyong Li*, Y.P. Aneja, Jiazhen Huo. 2012. A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem.  OMEGA – The International Journal of Management Science 40(2)210-217.
  •  Li Zhao, Peng Tian, Xiangyong Li*. 2012. Dynamic pricing in the presence of consumer inertia, OMEGA – The International Journal of Management Science 40(2)137-148 .
  •  Xiangyong Li, Md. Fazle Baki, Yash P. Aneja. 2011. Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic. Computers & Operations Research 38(1)152-164.
  •  Y.P. Aneja, R.Chandrasekaran, Xiangyong Li*, K.P.K. Nair. 2010. A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks. European Journal of Operational Research 204(3),604-612.
  •  Xiangyong Li*, Peng Tian, Stephen C.H. Leung. 2010. Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithms. International Journal of Production Economics 125(1) 137-145 .
  •  X-Y Li*, Y.P. Aneja, F. Baki. 2010. An ant colony optimization metaheuristic for single-path multicommodity network flow problems. Journal of the Operational Research Society 61(9), 1340-1355.
  •  Xiangyong Li*, Peng Tian , Y.P. Aneja. 2010. An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transportation Research Part E 46(6), 1111-1127.
  •  Xiangyong Li, F. Baki, Y.P. Aneja. 2010. An ant colony optimization metaheuristic for machine-part cell formation problems. Computers & Operations Research 37(12)2071-2081 .
  •  X-Y Li*, P. Tian, SCH Leung. 2009. An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. Journal of the Operational Research Society 60(7) 1012-1025.
  •  Kanchan Das, Fazle Baki, Xiangyong Li. 2009. Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system. Computers & Industrial Engineering 56(1)283-293.
  •  Xiangyong Li, Y.P. Aneja. 2009. A branch-and-cut algorithm for the minimum energy symmetric connectivity problem in wireless networks. Lecture Notes in Computer Science, Vol. 5573, 494-506.

工作论文

  • Xiangyong Li, Y.P. Aneja. 2017. The Generalized Regenerator Location Problem: Facets and New Branch-and-Cut Algorithm. Submission under review.
  • Xiangyong Li, Jieqi Li, Y.P. Aneja, Zhaoxia Guo, Peng Tian. 2017. Integrated Order Allocation and Order Routing Problem for e-Order Fulfillment. Submission under review.
  • Xiangyong Li, Yi Ding, Kai Pan, Y.P. Aneja, Peng Tian. 2017. Single-path Service Network Design Problem with Resource Constraints.  Revision under review.
  • Dapei Jiang, Xiangyong Li,  2018. Two-echelon Multi-depot Vehicle Routing Problem with Time Windows and Synchronization. Submission under review.
  • Xiangyong Li, Kai Wei. 2016. Service Network Design with Heterogeneous Resource Constraints: Branch-and-Price Approach. Submission under review.
  • Xiangyong Li, Chunyan Li. 2016. Single-path Service Network Design with Heterogeneous Assets. Working paper.
  • Xiangyong Li, Lanjian Zhu. 2018. Robust Optimization for Cyclic Bottleneck Assignment Problem with Uncertain Demand Matrix. Working paper.
  • Xiangyong Li, Xuefei Wang. 2018. Order Fulfillmemnt Problem in the O2O Environment. Working paper.
  • Xiangyong Li, Zhongmin Da. 2018. E-Order Fulfillment with Outsourced Delivery. Working paper.
  • Xiangyong Li, Zhaoxia Guo, Kai Pan, Xuyang Xing. 2018. Data-Driven Taxi Capacity Expansion Planning under Demand Uncertainty. Working paper.
  • Xiangyong Li, Y.P. Aneja. 2018. A Branch-and-Benders-Cut Approach for the Survivable Regenerator Location Problem. Working paper.
  • Xiangyong Li, Y.P. Aneja. 2018. Benders Decomposition Approach for a Scheduling Problem. Working paper.

 

 我的学生

博士生

  • 魏 凯 (2013级),博士论文:考虑资源管理的服务网络设计问题
  • 蒋大培 (2014级),博士论文:面向城市物流的服务网络设计与优化问题
  • 荆卉婷 (2016级)

硕士生

  • 岳崇芳 (2013级),已毕业 (上海市优秀毕业生),工作单位:中国邮政速递物流股份有限公司上海市分公司
  • 林少冲 (2013级),已毕业,香港城市大学攻读博士学位
  • 李春燕 (2014级),已毕业,宁波银行
  • 朱兰剑 (2014级),已毕业,刃之砺信息科技(上海)有限公司
  • 李颉琦 (2015级),已毕业 (上海市优秀毕业生),强生(上海)医疗器材有限公司
  • 丁 毅 (2015级),已毕业,上海银行股份有限公司
  • 汪雪霏 (2016级),在读
  • 笪忠敏 (2016级),在读
  • 裘佳晴 (2017级),在读
  • 邢旭阳 (2017级),在读

   

   “成就学生”是我的培养目标。欢迎对管理科学和运筹学领域感兴趣,具有一定数理和计算机基础,有志于从事学术研究,追逐梦想路上的小伙伴加入我们,一起合作研究,成就梦想。

    如有兴趣,欢迎联系我 @021-65982307,xyli@tongji.edu.cn