- 通信地址：
- 电子邮箱： luyongliang@fzu.edu.cn
陆永亮，男，河南信阳人，博士，博士后，硕士生导师，副研究员，福建省高层次人才(C类)。华中科技大学硕士、博士、博士后。主持国家自然科学基金面上项目、中国博士后科学基金面上项目各一项。主要研究方向为运筹优化，智能优化算法设计，车辆路径优化，网络建模与优化等。目前，以第一作者（或通讯作者）身份在European Journal of Operational Research、Computers & Operations Research等多个著名的运筹学和管理科学国际高水平期刊上发表SCI论文15篇，其中英国商学院协会(ABS)界定的四星期刊3篇，ABS三星期刊6篇，中国管理科学高质量国际期刊(FMS)目录A类3篇，FMS B类9篇，JCR Q1期刊 10多篇。长期担任Expert Systems with Applications、Knowledge-Based Systems、Information Sciences、Engineering Applications of Artificial Intelligence等多个SCI期刊匿名评审专家。
硕士招生：管理科学与工程（学术型），信息管理与信息系统（学术型）， 物流工程与管理（专业型），工业工程与管理（专业型）
[1]通讯作者. An effective hybrid evolutionary algorithm for the clustered orienteering problem. European Journal of Operational Research, 2023, in press.(SCI,FMS A,ABS 4)
[2]第一作者. 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)
[3]第一作者. A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Computers & Operations Research, 144(1):105799, 2022.(SCI, FMS B, ABS 3)
[4]第一作者. 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)
[5]第一作者. 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)
[6]第一作者. 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)
[7]通讯作者. A parallel adaptive memory algorithm for the capacitated modular hub location problem. Computers & Operations Research, 153,106173, 2023. (SCI, FMS B, ABS 3)
[8]通讯作者.Breakout local search for the cyclic cutwidth minimization problem. Journal of Heuristics,1-36, 2022.(SCI, FMS B, ABS 3)
[9]第一作者. Hybrid evolutionary search for the traveling repairman problem with profits. Information Sciences，502:91-108，2019.(SCI, FMS B, JCR Q1)
[10]第一作者. A highly effective hybrid evolutionary algorithm for the covering salesman problem. Information Sciences, 564, 144-162,2021.(SCI, FMS B, JCR Q1)
[11]第一作者. Memetic algorithm for the multiple traveling repairman problem with profits. Engineering Applications of Artificial Intelligence, 80:35-47, 2019 (SCI, JCR Q1)
[12]第一作者. An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Engineering Applications of Artificial Intelligence, 95, 103890,2020(SCI, JCR Q1)
[13] 第一作者. 自适应大邻域搜索求解着色旅行商问题，运筹与管理，录用待刊，2022.
经管微信公众号