Zhenyu Yan^1,*, Haotian Bian²

Computer Systems Science and Engineering, Vol.47, No.2, pp. 2241-2257, 2023, DOI:10.32604/csse.2023.040603

Abstract As millimeter waves will be widely used in the Internet of Things (IoT) and Telematics to provide high bandwidth communication and mass connectivity, the coverage optimization of base stations can effectively improve the quality of communication services. How to optimize the convergence speed of the base station coverage solution is crucial for IoT service providers. This paper proposes the Muti-Fusion Sparrow Search Algorithm (MFSSA) optimize the situation to address the problem of discrete coverage maximization and rapid convergence. Firstly, the initial swarm diversity is enriched using a sine chaotic map, and dynamic adaptive weighting is added to the discoverer location… More >

Mutasem K. Alsmadi^1,*, Ghaith M. Jaradat², Malek Alzaqebah³, Ibrahim ALmarashdeh¹, Fahad A. Alghamdi¹, Rami Mustafa A. Mohammad⁴, Nahier Aldhafferi⁴, Abdullah Alqahtani⁴

CMC-Computers, Materials & Continua, Vol.72, No.1, pp. 1995-2014, 2022, DOI:10.32604/cmc.2022.025077

Abstract Timetabling problem is among the most difficult operational tasks and is an important step in raising industrial productivity, capability, and capacity. Such tasks are usually tackled using metaheuristics techniques that provide an intelligent way of suggesting solutions or decision-making. Swarm intelligence techniques including Particle Swarm Optimization (PSO) have proved to be effective examples. Different recent experiments showed that the PSO algorithm is reliable for timetabling in many applications such as educational and personnel timetabling, machine scheduling, etc. However, having an optimal solution is extremely challenging but having a sub-optimal solution using heuristics or metaheuristics is guaranteed. This research paper seeks… More >

K. Gayathri Devi^*, R. S. Mishra, A. K. Madan

Intelligent Automation & Soft Computing, Vol.31, No.1, pp. 429-448, 2022, DOI:10.32604/iasc.2022.019330

Abstract An NP-hard problem like Flexible Job Shop Scheduling (FJSP) tends to be more complex and requires more computational effort to optimize the objectives with contradictory measures. This paper aims to address the FJSP problem with combined and contradictory objectives, like minimization of make-span, maximum workload, and total workload. This paper proposes ‘Hybrid Adaptive Firefly Algorithm’ (HAdFA), a new enhanced version of the classic Firefly Algorithm (FA) embedded with adaptive parameters to optimize the multi objectives concurrently. The proposed algorithm has adopted two adaptive strategies, i.e., an adaptive randomization parameter (α) and an effective heterogeneous update rule for fireflies. The adaptations… More >