.png){kind=icon}
返回
An effective multi-objective evolutionary algorithm for multiple spraying robots task assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101558.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses a multiple agricultural spraying robots task assignment problem in the greenhouse environment. The objective of the problem is to obtain a set of Pareto solutions that simultaneously optimize the total travel distance and maximum completion time of all robots. To solve this problem, an effective multi-objective evolutionary algorithm is proposed. In the proposed algorithm, an initial population with high quality and diversity is generated by a heuristic allocation strategy based on robot capacity constraints. During the evolutionary phase, a crossover strategy based on information in the non-dominated solution set is designed for exploration in the global scope. A multi-objective local search with an iterated greedy idea is introduced to improve the exploration ability of the algorithm. Meanwhile, a restart operator based on the ideal point is presented to jump out of the local optimum. Finally, extensive experiments based on different scales are conducted. The results show that the proposed algorithm significantly outperforms several state-of-the-art multiobjective algorithms in the literature.
Keyword:
Agricultural spraying robots
Task assignment
Multi-objective evolutionary algorithm
Heuristic
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏A Strengthened Dominance Relation Considering Convergence and Diversity for Evolutionary Many-Objective Optimization进化多目标优化中考虑收敛性和多样性的增强优势关系
OAAI
OAAI分享收藏
查看更多内容