Binhui Wang, Hongfeng Wang^*

CMC-Computers, Materials & Continua, Vol.82, No.1, pp. 371-388, 2025, DOI:10.32604/cmc.2024.058885 - 03 January 2025

Abstract The distributed permutation flow shop scheduling problem (DPFSP) has received increasing attention in recent years. The iterated greedy algorithm (IGA) serves as a powerful optimizer for addressing such a problem because of its straightforward, single-solution evolution framework. However, a potential draw-back of IGA is the lack of utilization of historical information, which could lead to an imbalance between exploration and exploitation, especially in large-scale DPFSPs. As a consequence, this paper develops an IGA with memory and learning mechanisms (MLIGA) to efficiently solve the DPFSP targeted at the mini-mal makespan. In MLIGA, we incorporate a memory… More >

Xiaoqing Wang¹, Peng Duan^1,*, Leilei Meng^1,*, Kaidong Yang²

CMC-Computers, Materials & Continua, Vol.80, No.1, pp. 931-947, 2024, DOI:10.32604/cmc.2024.050612 - 18 July 2024

Abstract Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario. In this study, we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem (TSP) with life-strength constraints. To address this problem, we proposed an improved iterated greedy (IIG) algorithm. First, a push-forward insertion heuristic (PFIH) strategy was employed to generate a high-quality initial solution. Second, a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ability. Furthermore,… More >