Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Miao, Zhonghua"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    Multi-Objective Teaching-Learning-Based Optimizer for a Multi-Weeding Robot Task Assignment Problem
    (TSINGHUA SCIENCE AND TECHNOLOGY, 2024-10) Kang, Nianbo; Miao, Zhonghua; Pan, Quan-Ke; Li, Weimin); Tasgetiren, M. Fatih
    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.

| Başkent Üniversitesi | Kütüphane | Açık Bilim Politikası | Açık Erişim Politikası | Rehber |

DSpace software copyright © 2002-2025 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify