Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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


    Enhanced Arithmetic Optimization Algorithm Guided by a Local Search for the Feature Selection Problem

    Sana Jawarneh*

    Intelligent Automation & Soft Computing, Vol.39, No.3, pp. 511-525, 2024, DOI:10.32604/iasc.2024.047126

    Abstract High-dimensional datasets present significant challenges for classification tasks. Dimensionality reduction, a crucial aspect of data preprocessing, has gained substantial attention due to its ability to improve classification performance. However, identifying the optimal features within high-dimensional datasets remains a computationally demanding task, necessitating the use of efficient algorithms. This paper introduces the Arithmetic Optimization Algorithm (AOA), a novel approach for finding the optimal feature subset. AOA is specifically modified to address feature selection problems based on a transfer function. Additionally, two enhancements are incorporated into the AOA algorithm to overcome limitations such as limited precision, slow More >

  • Open Access


    Enhanced Hybrid Equilibrium Strategy in Fog-Cloud Computing Networks with Optimal Task Scheduling

    Muchang Rao, Hang Qin*

    CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 2647-2672, 2024, DOI:10.32604/cmc.2024.050380

    Abstract More devices in the Intelligent Internet of Things (AIoT) result in an increased number of tasks that require low latency and real-time responsiveness, leading to an increased demand for computational resources. Cloud computing’s low-latency performance issues in AIoT scenarios have led researchers to explore fog computing as a complementary extension. However, the effective allocation of resources for task execution within fog environments, characterized by limitations and heterogeneity in computational resources, remains a formidable challenge. To tackle this challenge, in this study, we integrate fog computing and cloud computing. We begin by establishing a fog-cloud environment… More >

  • Open Access


    A Scheme Library-Based Ant Colony Optimization with 2-Opt Local Search for Dynamic Traveling Salesman Problem

    Chuan Wang1,*, Ruoyu Zhu2, Yi Jiang3, Weili Liu4, Sang-Woon Jeon5, Lin Sun2, Hua Wang6

    CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.2, pp. 1209-1228, 2023, DOI:10.32604/cmes.2022.022807

    Abstract The dynamic traveling salesman problem (DTSP) is significant in logistics distribution in real-world applications in smart cities, but it is uncertain and difficult to solve. This paper proposes a scheme library-based ant colony optimization (ACO) with a two-optimization (2-opt) strategy to solve the DTSP efficiently. The work is novel and contributes to three aspects: problem model, optimization framework, and algorithm design. Firstly, in the problem model, traditional DTSP models often consider the change of travel distance between two nodes over time, while this paper focuses on a special DTSP model in that the node locations… More >

  • Open Access


    Enhanced Heap-Based Optimizer Algorithm for Solving Team Formation Problem

    Nashwa Nageh1, Ahmed Elshamy1, Abdel Wahab Said Hassan1, Mostafa Sami2, Mustafa Abdul Salam3,4,*

    CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 5245-5268, 2022, DOI:10.32604/cmc.2022.030906

    Abstract Team Formation (TF) is considered one of the most significant problems in computer science and optimization. TF is defined as forming the best team of experts in a social network to complete a task with least cost. Many real-world problems, such as task assignment, vehicle routing, nurse scheduling, resource allocation, and airline crew scheduling, are based on the TF problem. TF has been shown to be a Nondeterministic Polynomial time (NP) problem, and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms. This paper proposes two improved swarm-based algorithms for… More >

  • Open Access


    Swarming Computational Efficiency to Solve a Novel Third-Order Delay Differential Emden-Fowler System

    Wajaree Weera1, Zulqurnain Sabir2, Muhammad Asif Zahoor Raja3, Sakda Noinang4, Thongchai Botmart1,*

    CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 4833-4849, 2022, DOI:10.32604/cmc.2022.030888

    Abstract The purpose of this research is to construct an integrated neuro swarming scheme using the procedures of the artificial neural networks (ANNs) with the use of global search particle swarm optimization (PSO) along with the competent local search interior-point programming (IPP) called as ANN-PSOIPP. The proposed computational scheme is implemented for the numerical simulations of the third order nonlinear delay differential Emden-Fowler model (TON-DD-EFM). The TON-DD-EFM is based on two types along with the particulars of shape factor, delayed terms, and singular points. A merit function is performed using the optimization of PSOIPP to find More >

  • Open Access


    An Advanced Stochastic Numerical Approach for Host-Vector-Predator Nonlinear Model

    Prem Junswang1, Zulqurnain Sabir2, Muhammad Asif Zahoor Raja3, Soheil Salahshour4, Thongchai Botmart5,*, Wajaree Weera5

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5823-5843, 2022, DOI:10.32604/cmc.2022.027629

    Abstract A novel design of the computational intelligent framework is presented to solve a class of host-vector-predator nonlinear model governed with set of ordinary differential equations. The host-vector-predator nonlinear model depends upon five groups or classes, host plant susceptible and infected populations, vectors population of susceptible and infected individuals and the predator population. An unsupervised artificial neural network is designed using the computational framework of local and global search competencies of interior-point algorithm and genetic algorithms. For solving the host-vector-predator nonlinear model, a merit function is constructed using the differential model and its associated boundary conditions.… More >

  • Open Access


    An Efficient Hybrid Algorithm for a Bi-objectives Hybrid Flow Shop Scheduling

    S. M. Mousavia, M. Zandiehb

    Intelligent Automation & Soft Computing, Vol.24, No.1, pp. 9-16, 2018, DOI:10.1080/10798587.2016.1261956

    Abstract This paper considers the problem of scheduling n independent jobs in g-stage hybrid flow shop environment. To address the realistic assumptions of the proposed problem, two additional traits were added to the scheduling problem. These include setup times, and the consideration of maximum completion time together with total tardiness as objective function. The problem is to determine a schedule that minimizes a convex combination of objectives. A procedure based on hybrid the simulated annealing; genetic algorithm and local search so-called HSA-GA-LS are proposed to handle this problem approximately. The performance of the proposed algorithm is More >

  • Open Access


    Feature Selection with a Local Search Strategy Based on the Forest Optimization Algorithm

    Tinghuai Ma1,*, Honghao Zhou1, Dongdong Jia1, Abdullah Al-Dhelaan2, Mohammed Al-Dhelaan2, Yuan Tian3

    CMES-Computer Modeling in Engineering & Sciences, Vol.121, No.2, pp. 569-592, 2019, DOI:10.32604/cmes.2019.07758

    Abstract Feature selection has been widely used in data mining and machine learning. Its objective is to select a minimal subset of features according to some reasonable criteria so as to solve the original task more quickly. In this article, a feature selection algorithm with local search strategy based on the forest optimization algorithm, namely FSLSFOA, is proposed. The novel local search strategy in local seeding process guarantees the quality of the feature subset in the forest. Next, the fitness function is improved, which not only considers the classification accuracy, but also considers the size of More >

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