Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Research on Optimization of Dual-Resource Batch Scheduling in Flexible Job Shop

    Qinhui Liu, Zhijie Gao, Jiang Li*, Shuo Li, Laizheng Zhu

    CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 2503-2530, 2023, DOI:10.32604/cmc.2023.040505 - 30 August 2023

    Abstract With the rapid development of intelligent manufacturing and the changes in market demand, the current manufacturing industry presents the characteristics of multi-varieties, small batches, customization, and a short production cycle, with the whole production process having certain flexibility. In this paper, a mathematical model is established with the minimum production cycle as the optimization objective for the dual-resource batch scheduling of the flexible job shop, and an improved nested optimization algorithm is designed to solve the problem. The outer layer batch optimization problem is solved by the improved simulated annealing algorithm. The inner double resource More >

  • Open Access

    ARTICLE

    A Hybrid Heuristic Service Caching and Task Offloading Method for Mobile Edge Computing

    Yongxuan Sang, Jiangpo Wei*, Zhifeng Zhang, Bo Wang

    CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 2483-2502, 2023, DOI:10.32604/cmc.2023.040485 - 30 August 2023

    Abstract Computing-intensive and latency-sensitive user requests pose significant challenges to traditional cloud computing. In response to these challenges, mobile edge computing (MEC) has emerged as a new paradigm that extends the computational, caching, and communication capabilities of cloud computing. By caching certain services on edge nodes, computational support can be provided for requests that are offloaded to the edges. However, previous studies on task offloading have generally not considered the impact of caching mechanisms and the cache space occupied by services. This oversight can lead to problems, such as high delays in task executions and invalidation… More >

  • Open Access

    ARTICLE

    An Improved Soft Subspace Clustering Algorithm for Brain MR Image Segmentation

    Lei Ling1, Lijun Huang2, Jie Wang2, Li Zhang2, Yue Wu2, Yizhang Jiang1, Kaijian Xia2,3,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.3, pp. 2353-2379, 2023, DOI:10.32604/cmes.2023.028828 - 03 August 2023

    Abstract In recent years, the soft subspace clustering algorithm has shown good results for high-dimensional data, which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features. The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information, which has strong results for image segmentation, but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center. However, the clustering algorithm is susceptible to the influence of noisy data and reliance on initialized clustering centers and falls into a… More >

  • Open Access

    ARTICLE

    Optimizing Region of Interest Selection for Effective Embedding in Video Steganography Based on Genetic Algorithms

    Nizheen A. Ali1, Ramadhan J. Mstafa2,3,*

    Computer Systems Science and Engineering, Vol.47, No.2, pp. 1451-1469, 2023, DOI:10.32604/csse.2023.039957 - 28 July 2023

    Abstract With the widespread use of the internet, there is an increasing need to ensure the security and privacy of transmitted data. This has led to an intensified focus on the study of video steganography, which is a technique that hides data within a video cover to avoid detection. The effectiveness of any steganography method depends on its ability to embed data without altering the original video’s quality while maintaining high efficiency. This paper proposes a new method to video steganography, which involves utilizing a Genetic Algorithm (GA) for identifying the Region of Interest (ROI) in… More >

  • Open Access

    ARTICLE

    Multi-Objective Optimization of Traffic Signal Timing at Typical Junctions Based on Genetic Algorithms

    Zeyu Zhang1, Han Zhu1, Wei Zhang1, Zhiming Cai2,*, Linkai Zhu2, Zefeng Li2

    Computer Systems Science and Engineering, Vol.47, No.2, pp. 1901-1917, 2023, DOI:10.32604/csse.2023.039395 - 28 July 2023

    Abstract With the rapid development of urban road traffic and the increasing number of vehicles, how to alleviate traffic congestion is one of the hot issues that need to be urgently addressed in building smart cities. Therefore, in this paper, a nonlinear multi-objective optimization model of urban intersection signal timing based on a Genetic Algorithm was constructed. Specifically, a typical urban intersection was selected as the research object, and drivers’ acceleration habits were taken into account. What’s more, the shortest average delay time, the least average number of stops, and the maximum capacity of the intersection… More >

  • Open Access

    ARTICLE

    An Effective Neighborhood Solution Clipping Method for Large-Scale Job Shop Scheduling Problem

    Sihan Wang, Xinyu Li, Qihao Liu*

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1871-1890, 2023, DOI:10.32604/cmes.2023.028339 - 26 June 2023

    Abstract The job shop scheduling problem (JSSP) is a classical combinatorial optimization problem that exists widely in diverse scenarios of manufacturing systems. It is a well-known NP-hard problem, when the number of jobs increases, the difficulty of solving the problem exponentially increases. Therefore, a major challenge is to increase the solving efficiency of current algorithms. Modifying the neighborhood structure of the solutions can effectively improve the local search ability and efficiency. In this paper, a genetic Tabu search algorithm with neighborhood clipping (GTS_NC) is proposed for solving JSSP. A neighborhood solution clipping method is developed and… More >

  • Open Access

    ARTICLE

    A Multi-Object Genetic Algorithm for the Assembly Line Balance Optimization in Garment Flexible Job Shop Scheduling

    Junru Liu, Yonggui Lv*

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 2421-2439, 2023, DOI:10.32604/iasc.2023.040262 - 21 June 2023

    Abstract Numerous clothing enterprises in the market have a relatively low efficiency of assembly line planning due to insufficient optimization of bottleneck stations. As a result, the production efficiency of the enterprise is not high, and the production organization is not up to expectations. Aiming at the problem of flexible process route planning in garment workshops, a multi-object genetic algorithm is proposed to solve the assembly line balance optimization problem and minimize the machine adjustment path. The encoding method adopts the object-oriented path representation method, and the initial population is generated by random topology sorting based… More >

  • Open Access

    ARTICLE

    Hyperparameter Optimization for Capsule Network Based Modified Hybrid Rice Optimization Algorithm

    Zhiwei Ye1, Ziqian Fang1, Zhina Song1,*, Haigang Sui2, Chunyan Yan1, Wen Zhou1, Mingwei Wang1

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 2019-2035, 2023, DOI:10.32604/iasc.2023.039949 - 21 June 2023

    Abstract Hyperparameters play a vital impact in the performance of most machine learning algorithms. It is a challenge for traditional methods to configure hyperparameters of the capsule network to obtain high-performance manually. Some swarm intelligence or evolutionary computation algorithms have been effectively employed to seek optimal hyperparameters as a combinatorial optimization problem. However, these algorithms are prone to get trapped in the local optimal solution as random search strategies are adopted. The inspiration for the hybrid rice optimization (HRO) algorithm is from the breeding technology of three-line hybrid rice in China, which has the advantages of… More >

  • Open Access

    ARTICLE

    Non-Cooperative Game of Coordinated Scheduling of Parallel Machine Production and Transportation in Shared Manufacturing

    Peng Liu1,*, Ke Xu1,2, Hua Gong1,2

    CMC-Computers, Materials & Continua, Vol.76, No.1, pp. 239-258, 2023, DOI:10.32604/cmc.2023.038232 - 08 June 2023

    Abstract Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry, the coordinated scheduling problem of parallel machine production and transportation is investigated. The problem takes into account the coordination of production and transportation before production as well as the disparities in machine spatial position and performance. A non-cooperative game model is established, considering the competition and self-interest behavior of jobs from different customers for machine resources. The job from different customers is mapped to the players in the game model, the corresponding optional processing machine and location are mapped to the… More >

  • Open Access

    ARTICLE

    Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

    Shehab Abdulhabib Alzaeemi1, Kim Gaik Tay1,*, Audrey Huong1, Saratha Sathasivam2, Majid Khan bin Majahar Ali2

    Computer Systems Science and Engineering, Vol.47, No.1, pp. 1163-1184, 2023, DOI:10.32604/csse.2023.038912 - 26 May 2023

    Abstract Radial Basis Function Neural Network (RBFNN) ensembles have long suffered from non-efficient training, where incorrect parameter settings can be computationally disastrous. This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network (SRBFNN) through the behavior’s integration of satisfiability programming. Inspired by evolutionary algorithms, which can iteratively find the near-optimal solution, different Evolutionary Algorithms (EAs) were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation (SRBFNN-2SAT). The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different… More >

Displaying 31-40 on page 4 of 247. Per Page