.png){kind=icon}
返回
Multi-Objective Teaching-Learning-Based Optimizer for a Multi-Weeding Robot Task Assignment Problem
.png){kind=icon}
OA
AI
DOI：10.26599/TST.2023.9010075.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the emergence of the artificial intelligence era, all kinds of robots are traditionally used in agricultural production. However, studies concerning the robot task assignment problem in the agriculture field, which is closely related to the cost and efficiency of a smart farm, are limited. Therefore, a Multi-Weeding Robot Task Assignment (MWRTA) problem is addressed in this paper to minimize the maximum completion time and residual herbicide. A mathematical model is set up, and a Multi-Objective Teaching-Learning-Based Optimization (MOTLBO) algorithm is presented to solve the problem. In the MOTLBO algorithm, a heuristic-based initialization comprising an improved Nawaz Enscore, and Ham (NEH) heuristic and maximum load-based heuristic is used to generate an initial population with a high level of quality and diversity. An effective teaching-learning-based optimization process is designed with a dynamic grouping mechanism and a redefined individual updating rule. A multi-neighborhood-based local search strategy is provided to balance the exploitation and exploration of the algorithm. Finally, a comprehensive experiment is conducted to compare the proposed algorithm with several state-of-the-art algorithms in the literature. Experimental results demonstrate the significant superiority of the proposed algorithm for solving the problem under consideration.
Keyword:
Smart agriculture
Heuristic algorithms
Sociology
Production
Search problems
Mathematical models
Task analysis
genetic algorithm
heuristic algorithm
Multi-Weeding Robot Task Assignment (MWRTA)
teaching optimization algorithm
期刊
T
IF:
3.5
论文数:
987
被引数:
2.5K
机构
引用论文
Local and random searches for dispatch and conflict-free routing problem of capacitated AGV systems
PREAI
分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容