1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.AI2021★ 1 cited
A new neighborhood structure for job shop scheduling problems
Jin Xie, Xinyu Li, Liang Gao +1
Job shop scheduling problem (JSP) is a widely studied NP-complete combinatorial optimization problem. Neighborhood structures play a critical role in solving JSP. At present, there…
cs.NE2018
Differential Evolution with Better and Nearest Option for Function Optimization
Haozhen Dong, Liang Gao, Xinyu Li +2
Differential evolution(DE) is a conventional algorithm with fast convergence speed. However, DE may be trapped in local optimal solution easily. Many researchers devote themselves…
cs.NE2018
Whale swarm algorithm with the mechanism of identifying and escaping from extreme points for multimodal function optimization
Bing Zeng, Xinyu Li, Liang Gao +2
Most real-world optimization problems often come with multiple global optima or local optima. Therefore, increasing niching metaheuristic algorithms, which devote to finding multip…