Metaheuristics algorithms for solving the mobile robot scheduling problem in FMS environment: A comparative study

View at publisher Summarise with VIRAT
Authors: Erlianasha Samsuria, Mohd Saiful Azimi Mahmud, Norhaliza Abdul Wahab, Muhamad Shukri Zainal Abidin, Salinda Buyamin, Muhammad Zakiyullah Romdlony
Cited by: 0
References: 36

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Modern manufacturing industries are increasingly utilizing intelligent mobile robots as part of advanced material handling systems. Robots can position themselves indoors and enable autonomous navigation, as a result of recent advances in computing power and artificial intelligence. In the meantime, material handling systems are essential to the efficiency and safety of Flexible Manufacturing System (FMS). Optimal utilization and scheduling of the available resources and equipment are essential for exploiting the automation to the fullest potential. Most real-world scheduling problems are classified as Nondeterministic Polynomial (NP)-hard problems, for which a polynomial-time solution is highly unlikely expected to exist. This means that to find the solutions, the scheduling of the material handling system in FMS requires a great deal of time. Therefore, efforts have to be made to search and develop efficient algorithms to solve such large-size problems. This paper studies the application of Genetic Algorithm (GA) to deal with scheduling a single and dual mobile robot in job-shop FMS environment. To search the near-optimal solutions for the integrated problem, an objective of minimal completion time of all tasks was measured. The performance results are evaluated using some numerical experiments that is executed via Matlab software.

Fields of Study & Subjects

Scheduling and Optimization Algorithms Advanced Manufacturing and Logistics Optimization Metaheuristic Optimization Algorithms Research

Publication details

Journal / source
AIP conference proceedings
Volume
3462
Pages
020003–020003
Publication date
1 January 2026
Language
EN