Tareq Hamadneh¹, Khalid Kaabneh², Ibraheem AbuFalahah³, Gulnara Bektemyssova^4,*, Galymzhan Shaikemelev⁴, Dauren Umutkulov⁴, Sayan Omarov⁵, Zeinab Monrazeri⁶, Frank Werner⁷, Mohammad Dehghani^6,*

CMC-Computers, Materials & Continua, Vol.80, No.2, pp. 2721-2741, 2024, DOI:10.32604/cmc.2024.054317 - 15 August 2024

Abstract This paper introduces a groundbreaking metaheuristic algorithm named Magnificent Frigatebird Optimization (MFO), inspired by the unique behaviors observed in magnificent frigatebirds in their natural habitats. The foundation of MFO is based on the kleptoparasitic behavior of these birds, where they steal prey from other seabirds. In this process, a magnificent frigatebird targets a food-carrying seabird, aggressively pecking at it until the seabird drops its prey. The frigatebird then swiftly dives to capture the abandoned prey before it falls into the water. The theoretical framework of MFO is thoroughly detailed and mathematically represented, mimicking the frigatebird’s… More >

Prasanna Kumar Kannughatta Ranganna¹, Siddesh Gaddadevara Matt², Chin-Ling Chen^3,4,*, Ananda Babu Jayachandra⁵, Yong-Yuan Deng^4,*

CMC-Computers, Materials & Continua, Vol.80, No.2, pp. 2557-2578, 2024, DOI:10.32604/cmc.2024.051634 - 15 August 2024

Abstract In recent decades, fog computing has played a vital role in executing parallel computational tasks, specifically, scientific workflow tasks. In cloud data centers, fog computing takes more time to run workflow applications. Therefore, it is essential to develop effective models for Virtual Machine (VM) allocation and task scheduling in fog computing environments. Effective task scheduling, VM migration, and allocation, altogether optimize the use of computational resources across different fog nodes. This process ensures that the tasks are executed with minimal energy consumption, which reduces the chances of resource bottlenecks. In this manuscript, the proposed framework… More >

Mariem Belhor^1,2,3, Adnen El-Amraoui^1,*, Abderrazak Jemai², François Delmotte¹

Computer Systems Science and Engineering, Vol.48, No.1, pp. 271-271, 2024, DOI:10.32604/csse.2023.048573 - 26 January 2024

Abstract This article has no abstract. More >

Pavel Trojovský^*, Mohammad Dehghani

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1695-1730, 2023, DOI:10.32604/cmes.2023.028314 - 26 June 2023

Abstract This paper introduces a new metaheuristic algorithm called Migration Algorithm (MA), which is helpful in solving optimization problems. The fundamental inspiration of MA is the process of human migration, which aims to improve job, educational, economic, and living conditions, and so on. The mathematical modeling of the proposed MA is presented in two phases to empower the proposed approach in exploration and exploitation during the search process. In the exploration phase, the algorithm population is updated based on the simulation of choosing the migration destination among the available options. In the exploitation phase, the algorithm… More >

Abeeda Akram¹, Kashif Zafar¹, Adnan Noor Mian², Abdul Rauf Baig³, Riyad Almakki³, Lulwah AlSuwaidan³, Shakir Khan^3,4,*

Computer Systems Science and Engineering, Vol.46, No.3, pp. 3685-3701, 2023, DOI:10.32604/csse.2023.032024 - 03 April 2023

Abstract One of the important research issues in wireless sensor networks (WSNs) is the optimal layout designing for the deployment of sensor nodes. It directly affects the quality of monitoring, cost, and detection capability of WSNs. Layout optimization is an NP-hard combinatorial problem, which requires optimization of multiple competing objectives like cost, coverage, connectivity, lifetime, load balancing, and energy consumption of sensor nodes. In the last decade, several meta-heuristic optimization techniques have been proposed to solve this problem, such as genetic algorithms (GA) and particle swarm optimization (PSO). However, these approaches either provided computationally expensive solutions… More >

Hadi Givi^1,*, Marie Hubálovská²

CMC-Computers, Materials & Continua, Vol.74, No.3, pp. 5283-5300, 2023, DOI:10.32604/cmc.2023.034695 - 28 December 2022

Abstract Metaheuristic algorithms are one of the most widely used stochastic approaches in solving optimization problems. In this paper, a new metaheuristic algorithm entitled Billiards Optimization Algorithm (BOA) is proposed and designed to be used in optimization applications. The fundamental inspiration in BOA design is the behavior of the players and the rules of the billiards game. Various steps of BOA are described and then its mathematical model is thoroughly explained. The efficiency of BOA in dealing with optimization problems is evaluated through optimizing twenty-three standard benchmark functions of different types including unimodal, high-dimensional multimodal, and More >

Farhad Soleimanian Gharehchopogh^1,*, Benyamin Abdollahzadeh¹, Bahman Arasteh²

CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.3, pp. 1981-2006, 2023, DOI:10.32604/cmes.2023.024172 - 23 November 2022

Abstract Travelling Salesman Problem (TSP) is a discrete hybrid optimization problem considered NP-hard. TSP aims to discover the shortest Hamilton route that visits each city precisely once and then returns to the starting point, making it the shortest route feasible. This paper employed a Farmland Fertility Algorithm (FFA) inspired by agricultural land fertility and a hyper-heuristic technique based on the Modified Choice Function (MCF). The neighborhood search operator can use this strategy to automatically select the best heuristic method for making the best decision. Lin-Kernighan (LK) local search has been incorporated to increase the efficiency and More >

Mariem Belhor^1,2,3, Adnen El-Amraoui^1,*, Abderrazak Jemai², François Delmotte¹

Computer Systems Science and Engineering, Vol.45, No.1, pp. 1-19, 2023, DOI:10.32604/csse.2023.029058 - 16 August 2022

Abstract This research focuses on the home health care optimization problem that involves staff routing and scheduling problems. The considered problem is an extension of multiple travelling salesman problem. It consists of finding the shortest path for a set of caregivers visiting a set of patients at their homes in order to perform various tasks during a given horizon. Thus, a mixed-integer linear programming model is proposed to minimize the overall service time performed by all caregivers while respecting the workload balancing constraint. Nevertheless, when the time horizon become large, practical-sized instances become very difficult to More >

C. P. Thamil Selvi^1,*, R. PushpaLakshmi²

Computer Systems Science and Engineering, Vol.44, No.3, pp. 2439-2456, 2023, DOI:10.32604/csse.2023.029254 - 01 August 2022

Abstract One of the drastically growing and emerging research areas used in most information technology industries is Bigdata analytics. Bigdata is created from social websites like Facebook, WhatsApp, Twitter, etc. Opinions about products, persons, initiatives, political issues, research achievements, and entertainment are discussed on social websites. The unique data analytics method cannot be applied to various social websites since the data formats are different. Several approaches, techniques, and tools have been used for big data analytics, opinion mining, or sentiment analysis, but the accuracy is yet to be improved. The proposed work is motivated to do… More >

M. Manikandan^1,*, A. Rajiv Kannan

Computer Systems Science and Engineering, Vol.43, No.2, pp. 625-641, 2022, DOI:10.32604/csse.2022.022662 - 20 April 2022

Abstract In the Acoustics channel, it is incredibly challenging to offer data transfer for time-sourced applications in an energy-efficient manner due to higher error rate and propagation delay. Subsequently, conventional re-transmission over any failure generally initiates significantly larger end-to-end delay, and therefore it is not probable for time-based services. Moreover, standard techniques without any re-transmission consume enormous energy. This investigation proposes a novel multi-hop energy-aware transmission-based intelligent water wave optimization strategy. It ensures reduced end-to-end while attaining potential amongst overall energy efficiency end-to-end packet delay. It merges a naturally inspired meta-heuristic approach with multi-hop routing for… More >