Leilei Meng

Dr. Leilei Meng

Liaocheng University, Liaocheng, Shandong, China
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2020 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
Leilei MengLeilei Meng
Leilei Meng
CZChaoyong Zhang
Chaoyong Zhang
YRYaping Ren
Yaping Ren
Biao ZhangBiao Zhang
Biao Zhang
CLChang Lv
Chang Lv

1 February 2019 in Journal of Cleaner Production
Verified
Journal Article
Closed access
Leilei MengLeilei Meng
Leilei Meng
CZChaoyong Zhang
Chaoyong Zhang
XSXinyu Shao
Xinyu Shao
YRYaping Ren
Yaping Ren

29 May 2019 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
Biao ZhangBiao Zhang
Biao Zhang
QPQuan-Ke Pan
Quan-Ke Pan
LGLiang Gao
Liang Gao
Leilei MengLeilei Meng
Leilei Meng
Xinyu LiXinyu Li
Xinyu Li
KPKun-Kun Peng
Kun-Kun Peng
This paper investigates an energy-efficient hybrid flowshop scheduling problem with the consideration of machines with different energy usage ratios, sequence-dependent setups, and machine-to-machine transportation operations. To minimize the makespan and total energy consumption simultaneously, a mixed-integer linear programming (MILP) model is developed. To solve this problem, a three-stage multiobjective approach based on decomposition (TMOA/D) is suggested, in which each solution is bound with a main weight vector and a set of its neighbors. Accordingly, a variable direction strategy is developed to ensure each solution along its main direction is thoroughly exploited and can jump to the neighboring directions using a proximity principle. To ensure an active schedule of arranging jobs to machines, a two-level solution representation is employed. In the first phase, each solution attempts to improve itself along its current weight vector through a developed neighborhood-based local search. In the second phase, the promising solutions are selected through the technique for order preference by similarity to an ideal solution. Then, they attempt to update themselves with a proposed global replacement strategy via incorporation with their closing solutions. In the third phase, a solution conducts a large perturbation when it goes through all its assigned weight vectors. Extensive experiments are conducted to test the performance of TMOA/D, and the results demonstrate that TMOA/D has a very competitive performance.

1 April 2021 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
YDYu Du
Yu Du
JLJun-Qing Li
Jun-Qing Li
CLChao Luo
Chao Luo
Leilei MengLeilei Meng
Leilei Meng

23 July 2018 in International Journal of Production Research
Verified
Journal Article
Closed access
Leilei MengLeilei Meng
Leilei Meng
CZChaoyong Zhang
Chaoyong Zhang
XSXinyu Shao
Xinyu Shao
YRYaping Ren
Yaping Ren
CRCaile Ren
Caile Ren
This paper investigates an energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines (HFSP-UPM) with the energy-saving strategy of turning off and on. We first analyse the energy consumption of HFSP-UPM and formulate five mixed integer linear programming (MILP) models based on two different modelling ideas namely idle time and idle energy. All the models are compared both in size and computational complexities. The results show that MILP models based on different modelling ideas vary dramatically in both size and computational complexities. HFSP-UPM is NP-Hard, thus, an improved genetic algorithm (IGA) is proposed. Specifically, a new energy-conscious decoding method is designed in IGA. To evaluate the proposed IGA, comparative experiments of different-sized instances are conducted. The results demonstrate that the IGA is more effective than the genetic algorithm (GA), simulating annealing algorithm (SA) and migrating birds optimisation algorithm (MBO). Compared with the best MILP model, the IGA can get the solution that is close to an optimal solution with the gap of no more than 2.17% for small-scale instances. For large-scale instances, the IGA can get a better solution than the best MILP model within no more than 10% of the running time of the best MILP model.

1 April 2022 in Robotics and Computer-Integrated Manufacturing
Verified
Journal Article
Closed access
CLChao Lu
Chao Lu
YHYuanxiang Huang
Yuanxiang Huang
Leilei MengLeilei Meng
Leilei Meng
LGLiang Gao
Liang Gao
BZBiao Zhang
Biao Zhang
JZJiajun Zhou
Jiajun Zhou