计算机科学
数学优化
初始化
启发式
局部搜索(优化)
调度(生产过程)
粒子群优化
迭代局部搜索
作业车间调度
人工智能
机器学习
数学
地铁列车时刻表
程序设计语言
操作系统
作者
Minglong Gao,Kaizhou Gao,Zhenfang Ma,Weiyu Tang
标识
DOI:10.1016/j.swevo.2023.101358
摘要
This work addresses multiple unmanned surface vessel (USV) scheduling problems with minimizing maximum completion time. First, a mathematical model is developed with considering battery capacity and uncertain mapping time. Second, meta-heuristics and Q-learning are combined for solving the concerned problems. Based on the feature of USV scheduling problems, six heuristic rules are designed to obtain high-quality initializing solutions. According to the structure of solution space, six local search operators are designed. Q-learning is employed to select a premium local search operator in each iteration for improving the search efficiency of meta-heuristics. Finally, the performance of the proposed meta-heuristics with Q-learning based local search are verified by solving 10 cases with different scales. The experimental results and statistical tests demonstrate the competitiveness of the proposed algorithms for solving USVs scheduling problems. The particle swarm optimization with the first Q-learning strategy for local search selection is the best one among all compared algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI