Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    A Sustainable WSN System with Heuristic Schemes in IIoT

    Wenjun Li1, Siyang Zhang1, Guangwei Wu2, Aldosary Saad3, Amr Tolba3,4, Gwang-jun Kim5,*

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 4215-4231, 2022, DOI:10.32604/cmc.2022.024204

    Abstract Recently, the development of Industrial Internet of Things has taken the advantage of 5G network to be more powerful and more intelligent. However, the upgrading of 5G network will cause a variety of issues increase, one of them is the increased cost of coverage. In this paper, we propose a sustainable wireless sensor networks system, which avoids the problems brought by 5G network system to some extent. In this system, deploying relays and selecting routing are for the sake of communication and charging. The main aim is to minimize the total energy-cost of communication under the precondition, where each terminal… More >

  • Open Access

    ARTICLE

    Annealing Harmony Search Algorithm to Solve the Nurse Rostering Problem

    Mohammed Hadwan1,2,3,*

    CMC-Computers, Materials & Continua, Vol.71, No.3, pp. 5545-5559, 2022, DOI:10.32604/cmc.2022.024512

    Abstract A real-life problem is the rostering of nurses at hospitals. It is a famous nondeterministic, polynomial time (NP) -hard combinatorial optimization problem. Handling the real-world nurse rostering problem (NRP) constraints in distributing workload equally between available nurses is still a difficult task to achieve. The international shortage of nurses, in addition to the spread of COVID-19, has made it more difficult to provide convenient rosters for nurses. Based on the literature, heuristic-based methods are the most commonly used methods to solve the NRP due to its computational complexity, especially for large rosters. Heuristic-based algorithms in general have problems striking the… More >

  • Open Access

    ARTICLE

    Binary Fruit Fly Swarm Algorithms for the Set Covering Problem

    Broderick Crawford1,*, Ricardo Soto1, Hanns de la Fuente Mella1, Claudio Elortegui1, Wenceslao Palma1, Claudio Torres-Rojas1, Claudia Vasconcellos-Gaete2, Marcelo Becerra1, Javier Peña1, Sanjay Misra3

    CMC-Computers, Materials & Continua, Vol.71, No.3, pp. 4295-4318, 2022, DOI:10.32604/cmc.2022.023068

    Abstract Currently, the industry is experiencing an exponential increase in dealing with binary-based combinatorial problems. In this sense, metaheuristics have been a common trend in the field in order to design approaches to solve them successfully. Thus, a well-known strategy consists in the use of algorithms based on discrete swarms transformed to perform in binary environments. Following the No Free Lunch theorem, we are interested in testing the performance of the Fruit Fly Algorithm, this is a bio-inspired metaheuristic for deducing global optimization in continuous spaces, based on the foraging behavior of the fruit fly, which usually has much better sensory… More >

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