Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (3)
  • Open Access

    ARTICLE

    Muti-Fusion Swarm Intelligence Optimization Algorithm in Base Station Coverage Optimization Problems

    Zhenyu Yan1,*, Haotian Bian2

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

    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… More >

  • Open Access

    ARTICLE

    An Enhanced Particle Swarm Optimization for ITC2021 Sports Timetabling

    Mutasem K. Alsmadi1,*, Ghaith M. Jaradat2, Malek Alzaqebah3, Ibrahim ALmarashdeh1, Fahad A. Alghamdi1, Rami Mustafa A. Mohammad4, Nahier Aldhafferi4, Abdullah Alqahtani4

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

    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… More >

  • Open Access

    ARTICLE

    A Dynamic Adaptive Firefly Algorithm for Flexible Job Shop Scheduling

    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 - 03 September 2021

    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 More >

Displaying 1-10 on page 1 of 3. Per Page