Chuan Wang^1,*, Ruoyu Zhu², Yi Jiang³, Weili Liu⁴, Sang-Woon Jeon⁵, Lin Sun², Hua Wang⁶

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 change dynamically over time. Secondly,… More >

Nashwa Nageh¹, Ahmed Elshamy¹, Abdel Wahab Said Hassan¹, Mostafa Sami², Mustafa Abdul Salam^3,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 solving team formation problem. The… More >

Wajaree Weera¹, Zulqurnain Sabir², Muhammad Asif Zahoor Raja³, Sakda Noinang⁴, Thongchai Botmart^1,*

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 the solutions to the TON-DD-EFM.… More >

Prem Junswang¹, Zulqurnain Sabir², Muhammad Asif Zahoor Raja³, Soheil Salahshour⁴, Thongchai Botmart^5,*, Wajaree Weera⁵

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. The optimization of this merit… More >

S. M. Mousavi^a, M. Zandieh^b

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 compared with a genetic algorithm… More >

Tinghuai Ma^1,*, Honghao Zhou¹, Dongdong Jia¹, Abdullah Al-Dhelaan², Mohammed Al-Dhelaan², Yuan Tian³

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 the feature subset. To avoid… More >