ZMZhenfang Ma

Zhenfang Ma

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zhenfang Ma has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Exact and Deep Q-Network Assisted Swarm Intelligence Methods for Scheduling Multiobjective Heterogeneous Unmanned Surface Vehicles

    by Hui Yu, Kaizhou Gao, Zhenfang Ma, Ling Wang

    In complex navigational environments, effective unmanned surface vehicle (USV) scheduling is critical. However, the obstacle avoidance problems are often ignored in the literature. This study addresses the multi-objective heterogeneous USV scheduling problems with obstacle avoidance. The objective is to minimize the maximum completion time and total carbon emissions. First, a mathematical model is developed to describe the concerned problems. Second, an A* algorithm is employed to obtain a path between task points with avoiding obstacles. Third, to obtain a high-quality scheduling scheme, an improved artificial bee colony (ABC) algorithm with deep Q-network (DQN) is designed. According to the problem nature, six novel rules are designed for finding high-quality solutions in initialized population. Five local search strategies are designed based on the structure of solution space. The scales of the instances and different objectives are utilized to designed a DQN, which recommends suitable local search strategies during iterations for improving convergence speed. Then, the Gurobi solver is employed to verify the proposed model. The effectiveness of the proposed strategies is verified by 13 instances with different scales. Finally, the experimental results and discussions show that the designed ABC with DQN has the strongest competitiveness among all compared algorithms.


  • Open Access

    Solving Heterogeneous USV Scheduling Problems by Problem-Specific Knowledge Based Meta-Heuristics with Q-Learning

    by Zhenfang Ma, Kaizhou Gao, Hui Yu, Naiqi Wu

    This study focuses on the scheduling problem of heterogeneous unmanned surface vehicles (USVs) with obstacle avoidance pretreatment. The goal is to minimize the overall maximum completion time of USVs. First, we develop a mathematical model for the problem. Second, with obstacles, an A* algorithm is employed to generate a path between two points where tasks need to be performed. Third, three meta-heuristics, i.e., simulated annealing (SA), genetic algorithm (GA), and harmony search (HS), are employed and improved to solve the problems. Based on problem-specific knowledge, nine local search operators are designed to improve the performance of the proposed algorithms. In each iteration, three Q-learning strategies are used to select high-quality local search operators. We aim to improve the performance of meta-heuristics by using Q-learning-based local search operators. Finally, 13 instances with different scales are adopted to validate the effectiveness of the proposed strategies. We compare with the classical meta-heuristics and the existing meta-heuristics. The proposed meta-heuristics with Q-learning are overall better than the compared ones. The results and comparisons show that HS with the second Q-learning, HS + QL2, exhibits the strongest competitiveness (the smallest mean rank value 1.00) among 15 algorithms.