Shenghai Qiu

Shenghai Qiu

Auto-generated profile, based on publicly available information

Shenghai Qiu

Nanjing Institute of Technology

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
24 May 2024
Verified
Conference Paper
Open access
MLMingyang Lu
Mingyang Lu
YWyunxia wang
yunxia wang
SQShenghai Qiu
Shenghai Qiu
NLNian Li
Nian Li
YSYun Shi
Yun Shi
In order to enhance the efficacy of mobile robots, a new dung beetle optimization algorithm (NewDBO) is proposed. It is improved using four strategies to improve the search capability and convergence speed of the algorithm. The efficacy of the enhanced algorithm is evaluated through the use of test functions and its application to the path planning problem. The results indicate that the improved algorithm exhibits faster convergence speed and better optimization ability than the comparison algorithm, and the shortest path can be obtained while ensuring the minimum number of turns in the path planning problem, which verifies the algorithm's feasibility and robustness.

3 July 2026 in Processes
Verified
Journal Article
Open access
PDF file
WWWeimin Wang
Weimin Wang
SQShenghai Qiu
Shenghai Qiu
JCJia Chen
Jia Chen
QJQinghai Jiang
Qinghai Jiang
Coordinating a shared fleet across multiple owners under tight time windows is a challenging multi-objective problem balancing cost, timeliness, and equity. We study it for multi-cooperative agricultural machinery dispatch, formulating the Multi-Cooperative Agricultural Machinery Scheduling Problem under Continuous Workload Sharing (MAMSP-CWS) as a three-objective model that minimizes inter-area transfer cost, time-window violation, and cross-cooperative workload imbalance. To approximate the Pareto front, we develop a Multi-Objective Hybrid Particle Swarm Optimization with Tabu Search and Sparsity Repair (MO-HPSO-TS-SR), which couples particle-swarm search, tabu-search refinement, and a sparsity-repair operator within an external crowding-distance archive. The method is evaluated on three scales (a real instance from Liyang, China, and two synthetic ones) against NSGA-II-CWS and HTSMOGA-CWS over 20 independent runs each. MO-HPSO-TS-SR attains the best mean value on every metric-by-scale combination, with a decisive convergence advantage (hypervolume and IGD; Holm-adjusted p<0.001, Cliff’s δ≈1). A mechanism decomposition identifies Sparsity Repair as the dominant contributor to hypervolume, with Tabu Search as a complementary refiner. The advantage over NSGA-II-CWS widens with problem scale, from 19.4% on the Small instance to 74.2% on the Large instance, reflecting the disproportionate degradation of the genetic baseline rather than a growing advantage of the proposed method. Beyond agriculture, the framework extends to other continuous-encoding scheduling problems, providing a transferable decision-support tool.


20 September 2022
Verified
Book Chapter
Closed access
PDF file
ZWZhiliang Wang
Zhiliang Wang
HSHongru Shi
Hongru Shi
SQShenghai Qiu
Shenghai Qiu