Zigao Wu

Dr. Zigao Wu

North China Electric Power University, Baoding, Hebei, China
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 November 2018 in Computers & Operations Research
Verified
Journal Article
Closed access
ZWZigao Wu
Zigao Wu
SSShudong Sun
Shudong Sun
Shichang XiaoShichang Xiao
Shichang Xiao

22 March 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
Shichang XiaoShichang Xiao
Shichang Xiao
PPPan Peng
Pan Peng
ZPZheng Peng
Zheng Peng
ZWZigao Wu
Zigao Wu
The half-open multi-depot vehicle routing problem (HOMDVRP) is a typical decision optimization problem in the field of collaborative logistics that considers resource sharing. This study aims to develop an effective meta-heuristic algorithm for solving the HOMDVRP. Firstly, a mixed-integer programming model of HOMDVRP is established to minimize the total travel distance of the vehicles. After that, a novel hybrid adaptive simulated annealing and tempering algorithm (HASATA) is proposed based on the features of HOMDVRP. The proposed algorithm combines the strengths of the simulated annealing algorithm and the large-neighborhood search algorithm to balance the algorithm’s searching capabilities in both breadth and depth. Meanwhile, an adaptive Markov chain length mechanism and a tempering mechanism are designed to improve the algorithm’s computational efficiency and convergence ability. Finally, simulation experiments are conducted to verify the effectiveness of the proposed model and the computational performance of the proposed algorithm. Four comparison algorithms are selected and analyzed using 24 groups of problem instances. The comparison results show that the proposed HASATA can solve the HOMDVRP more efficiently and obtain a solution with better optimization performance and satisfactory stability.

10 June 2019 in Mathematics
Verified
Journal Article
Open access
PDF file
ZWZigao Wu
Zigao Wu
SYShaohua Yu
Shaohua Yu
Tiancheng LiTiancheng Li
Tiancheng Li
In the real-world manufacturing system, various uncertain events can occur and disrupt the normal production activities. This paper addresses the multi-objective job shop scheduling problem with random machine breakdowns. As the key of our approach, the robustness of a schedule is considered jointly with the makespan and is defined as expected makespan delay, for which a meta-model is designed by using a data-driven response surface method. Correspondingly, a multi-objective evolutionary algorithm (MOEA) is proposed based on the meta-model to solve the multi-objective optimization problem. Extensive experiments based on the job shop benchmark problems are conducted. The results demonstrate that the Pareto solution sets of the MOEA are much better in both convergence and diversity than those of the algorithms based on the existing slack-based surrogate measures. The MOEA is also compared with the algorithm based on Monte Carlo approximation, showing that their Pareto solution sets are close to each other while the MOEA is much more computationally efficient.

31 October 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
Shichang XiaoShichang Xiao
Shichang Xiao
ZWZigao Wu
Zigao Wu
HDHongyan Dui
Hongyan Dui
This paper addresses the robust job-shop scheduling problems (RJSSP) with stochastic deteriorating processing times by considering the resilience of the production schedule. To deal with the disturbances caused by the processing time variations, the expected deviation between the realized makespan and the initial makespan is adopted to measure the robustness of a schedule. A surrogate model for robust scheduling is proposed, which can optimize both the schedule performance and robustness of RJSSP. Specifically, the computational burden of simulation is considered a deficiency for robustness evaluation under the disturbance of stochastic processing times. Therefore, a resilience-based surrogate robustness measure (SRM-R) is provided for the robustness estimation in the surrogate model. The proposed SRM-R considers the production resilience and can utilize the available information on stochastic deteriorating processing times and slack times in the schedule structure by analyzing the disturbance propagation of the correlated operations in the schedule. Finally, a multi-objective hybrid estimation of distribution algorithm is employed to obtain the Pareto optimal solutions of RJSSP. The simulation experiment results show that the presented SRM-R is effective and can provide the Pareto solutions with a lower computational burden. Furthermore, an RJSSP case derived from the manufacturing environment demonstrates that the proposed approach can generate satisfactory robust solutions with significantly improved computational efficiency.

1 January 2019 in Procedia CIRP
Verified
Journal Article
Open access
ZWZigao Wu
Zigao Wu
SSShudong Sun
Shudong Sun

Verified
Journal Article
Open access
PDF file
Shichang XiaoShichang Xiao
Shichang Xiao
SDShuaishuai Deng
Shuaishuai Deng
SYShaohua Yu
Shaohua Yu
ZPZheng Peng
Zheng Peng
ZWZigao Wu
Zigao Wu
This paper investigates the energy-efficient collaborative scheduling of dual-trolley quay cranes (DTQCs) and automated guided vehicles (AGVs) in automated container terminals (ACTs). Considering operational constraints such as mixed bidirectional flows, limited buffers, precedence constraints, and deadlocks, this complex logistical system is formally characterized as a blocking hybrid flow shop scheduling problem (BHFSSP-BFLB). To systematically minimize the total energy consumption, a mathematical framework grounded in a mixed-integer programming model is developed. To solve the model efficiently, an improved genetic algorithm (IGA) is proposed featuring a two-layer encoding approach to respect precedence and mitigate deadlocks. Furthermore, an active scheduling strategy based on machine idle time insertion is incorporated during decoding to shorten the makespan without increasing energy consumption. Numerical experiments demonstrate that the IGA can significantly decrease the makespan while reducing total energy consumption: compared with a standard genetic algorithm (GA) without active scheduling, the proposed IGA reduces the makespan by 32.35% on average. In addition, the makespan under energy minimization is within 1.5% of that under makespan minimization, indicating that energy optimization yields an almost minimal makespan. Sensitivity analysis further evaluates the effects of DTQC-AGV configurations and buffer capacities, offering practical insights for decision-makers.