Shengchao Zhou

Shengchao Zhou

Auto-generated profile, based on publicly available information

Shengchao Zhou

Yunnan Power Grid Co., Ltd. Kunming Power Supply Bureau, Kunming

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
26 September 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
SZShengchao Zhou
Shengchao Zhou
LXLining Xing
Lining Xing
XZXu Zheng
Xu Zheng
NDNi Du
Ni Du
LWLing Wang
Ling Wang
QZQingfu Zhang
Qingfu Zhang
Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity constraint and then sort the batches to minimize the makespan. A self-adaptive differential evolution algorithm is developed for addressing the problem. In our proposed algorithm, mutation operators are adaptively chosen based on their historical performances. Also, control parameter values are adaptively determined based on their historical performances. Our proposed algorithm is compared to CPLEX, existing metaheuristics for this problem and conventional differential evolution algorithms through comprehensive experiments. The experimental results demonstrate that our proposed self-adaptive algorithm is more effective than other algorithms for this scheduling problem.

22 October 2013 in International Journal of Production Research
Verified
Journal Article
Closed access
SZShengchao Zhou
Shengchao Zhou
HCHuaping Chen
Huaping Chen
RXRui Xu
Rui Xu
XLXueping Li
Xueping Li
Batch scheduling is a prevalent policy in many industries such as burn-in operations in semiconductor manufacturing and heat treatment operations in metalworking. In this paper, we consider the problem of minimising makespan on a single batch processing machine in the presence of dynamic job arrivals and non-identical job sizes. The problem under study is NP-hard. Consequently, we develop a number of efficient construction heuristics. The performance of the proposed heuristics is evaluated by comparing their results to two lower bounds, and other solution approaches published in the literature, namely the first-fit longest processing time-earliest release time (FFLPT-ERT) heuristic, hybrid genetic algorithm (HGA), joint genetic algorithm and dynamic programming (GA+DP) approach and ant colony optimisation (ACO) algorithm. The computational experiments demonstrate the superiority of the proposed heuristics with respect to solution quality, especially for the problems with small size jobs. Moreover, the computational costs of the proposed heuristics are very low.

1 May 2021
Verified
Conference Paper
Closed access
SZShengchao Zhou
Shengchao Zhou
YZYanping Zhou
Yanping Zhou
YWYucheng Wei
Yucheng Wei
LKLinchun Kang
Linchun Kang
XZXiaoli Zhang
Xiaoli Zhang
The loop-closing operation is usually used to transfer power supply without power interruption in the distribution network, but the excessive current induced by loop-closing will endanger the safety and stability of the distribution network. This paper presents a multi-objective optimal control method of loop-closing in distribution network. Firstly, the mathematical optimization model of loop-closing optimal regulation is established, which not only ensures the security of loop-closing operation, but also takes into account the stability and voltage quality of distribution network operation. Then, Pareto entropy-based multi-objective particle swarm optimization (PE-MOPSO) algorithm is proposed to solve the optimization problem. Finally, an actual example is simulated based on MATLAB platform. The simulation results show that the optimization model is correct, and PE-MOPSO algorithm has good diversity and convergence, and can give a reasonable control scheme.