陆永亮

基本信息

研究方向
运筹优化,智能优化算法设计,车辆路径优化,网络建模与优化
讲授课程
联系方式
  • 通信地址:
  • 电子邮箱: luyongliang@fzu.edu.cn
个人简介

陆永亮,男,河南固始人,硕士生导师,副研究员(校聘),福建省高层次人才(C)。华中科技大学硕士、博士、博士后。主要研究方向为运筹优化,智能优化算法设计,车辆路径优化,网络建模与优化等。目前,以第一作者(或通讯作者)身份在European Journal of Operational ResearchComputers & Operations ResearchInformation Sciences等多个著名的管理科学和运筹学国际主流期刊上发表SCI/SSCI论文10多篇,其中英国商学院协会(ABS)界定的4级期刊1篇,3级期刊6篇,FMS A1篇,B8篇,JCR一区期刊论文10篇。长期担任Expert Systems with ApplicationsKnowledge-Based SystemsEngineering Applications of Artificial Intelligence等多个SCI期刊匿名评审专家。


硕士招生:管理科学与工程(学术型), 物流工程与管理(专业型),工业工程与管理(专业型)

学习经历
工作经历
科研项目
获奖经历
近年发表的主要论文
代表性期刊论文 :
[1]第一作者. A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints. European Journal of Operational Research, 268(1):54-69, 2018.(SCI,FMS A, ABS 4)
[2]第一作者. A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem.  Computers & Operations Research, 144(1):105799, 2022.(SCI, FMS B, ABS 3)
[3]第一作者. A Hybrid Dynamic Programming and Memetic Algorithm to the Traveling Salesman Problem with Hotel Selection. Computers & Operations Research, 90:193-207, 2018.(SSCI & SCI, FMS B, ABS 3)
[4]第一作者. Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. Computers & Operations Research, 97:18-30, 2018.(SCI, FMS B, ABS 3)
[5]第一作者. A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research, 101:285-297,2019.(SCI, FMS B, ABS 3)
[6]通讯作者. A parallel adaptive memory algorithm for the capacitated modular hub location problem. Computers & Operations Research, 153,106173, 2023. (SCI, FMS B, ABS 3)
[7]通讯作者.Breakout local search for the cyclic cutwidth minimization problem. Journal of Heuristics,1-36, 2022.(SCI, FMS B, ABS 3)
[8]第一作者. Hybrid evolutionary search for the traveling repairman problem with profits. Information Sciences,502:91-108,2019.(SCI, FMS B)
[9]第一作者. A highly effective hybrid evolutionary algorithm for the covering salesman problem. Information Sciences, 564, 144-162, 2021.(SCI, FMS B)
[10]第一作者. Memetic algorithm for the multiple traveling repairman problem with profits. Engineering Applications of Artificial Intelligence, 80:35-47, 2019 (SCI, JCR Q1)
[11]第一作者.  An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Engineering Applications of Artificial Intelligence, 95, 103890, 2020(SCI, JCR Q1)
[12] 第一作者. 自适应大邻域搜索求解着色旅行商问题,运筹与管理,录用待刊,2022.
出版著作