Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

    Zhaolin Lv1, Yuexia Zhao2, Hongyue Kang3,*, Zhenyu Gao3, Yuhang Qin4

    CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2337-2360, 2024, DOI:10.32604/cmc.2023.045826

    Abstract Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize… More >

  • Open Access

    ARTICLE

    Using Improved Particle Swarm Optimization Algorithm for Location Problem of Drone Logistics Hub

    Li Zheng, Gang Xu*, Wenbin Chen

    CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 935-957, 2024, DOI:10.32604/cmc.2023.046006

    Abstract Drone logistics is a novel method of distribution that will become prevalent. The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption, resulting in cost savings for the company’s transportation operations. Logistics firms must discern the ideal location for establishing a logistics hub, which is challenging due to the simplicity of existing models and the intricate delivery factors. To simulate the drone logistics environment, this study presents a new mathematical model. The model not only retains the aspects of the current models, but also considers the degree of transportation difficulty from the logistics hub to… More >

  • Open Access

    ARTICLE

    A Strengthened Dominance Relation NSGA-III Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem

    Liang Zeng1,2, Junyang Shi1, Yanyan Li1, Shanshan Wang1,2,*, Weigang Li3

    CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 375-392, 2024, DOI:10.32604/cmc.2023.045803

    Abstract The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems. It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives. The Non-dominated Sorting Genetic Algorithm III (NSGA-III) is an effective approach for solving the multi-objective job shop scheduling problem. Nevertheless, it has some limitations in solving scheduling problems, including inadequate global search capability, susceptibility to premature convergence, and challenges in balancing convergence and diversity. To enhance its performance, this paper introduces a strengthened dominance relation NSGA-III algorithm based on differential evolution… More >

  • Open Access

    ARTICLE

    Stability and Error Analysis of Reduced-Order Methods Based on POD with Finite Element Solutions for Nonlocal Diffusion Problems

    Haolun Zhang1, Mengna Yang1, Jie Wei2, Yufeng Nie2,*

    Digital Engineering and Digital Twin, Vol.2, pp. 49-77, 2024, DOI:10.32604/dedt.2023.044180

    Abstract This paper mainly considers the formulation and theoretical analysis of the reduced-order numerical method constructed by proper orthogonal decomposition (POD) for nonlocal diffusion problems with a finite range of nonlocal interactions. We first set up the classical finite element discretization for nonlocal diffusion equations and briefly explain the difference between nonlocal and partial differential equations (PDEs). Nonlocal models have to handle double integrals when using finite element methods (FEMs), which causes the generation of algebraic systems to be more challenging and time-consuming, and discrete systems have less sparsity than those for PDEs. So we establish a reduced-order model (ROM) for… More >

  • Open Access

    ARTICLE

    A Deep Learning Approach to Shape Optimization Problems for Flexoelectric Materials Using the Isogeometric Finite Element Method

    Yu Cheng1,2,5, Yajun Huang3, Shuai Li4, Zhongbin Zhou5, Xiaohui Yuan1,2,*, Yanming Xu5,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 1935-1960, 2024, DOI:10.32604/cmes.2023.045668

    Abstract A new approach for flexoelectric material shape optimization is proposed in this study. In this work, a proxy model based on artificial neural network (ANN) is used to solve the parameter optimization and shape optimization problems. To improve the fitting ability of the neural network, we use the idea of pre-training to determine the structure of the neural network and combine different optimizers for training. The isogeometric analysis-finite element method (IGA-FEM) is used to discretize the flexural theoretical formulas and obtain samples, which helps ANN to build a proxy model from the model shape to the target value. The effectiveness… More >

  • Open Access

    ARTICLE

    Fast and Accurate Predictor-Corrector Methods Using Feedback-Accelerated Picard Iteration for Strongly Nonlinear Problems

    Xuechuan Wang1, Wei He1,*, Haoyang Feng1, Satya N. Atluri2

    CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 1263-1294, 2024, DOI:10.32604/cmes.2023.043068

    Abstract Although predictor-corrector methods have been extensively applied, they might not meet the requirements of practical applications and engineering tasks, particularly when high accuracy and efficiency are necessary. A novel class of correctors based on feedback-accelerated Picard iteration (FAPI) is proposed to further enhance computational performance. With optimal feedback terms that do not require inversion of matrices, significantly faster convergence speed and higher numerical accuracy are achieved by these correctors compared with their counterparts; however, the computational complexities are comparably low. These advantages enable nonlinear engineering problems to be solved quickly and accurately, even with rough initial guesses from elementary predictors.… More > Graphic Abstract

    Fast and Accurate Predictor-Corrector Methods Using Feedback-Accelerated Picard Iteration for Strongly Nonlinear Problems

  • Open Access

    ARTICLE

    Highly Accurate Golden Section Search Algorithms and Fictitious Time Integration Method for Solving Nonlinear Eigenvalue Problems

    Chein-Shan Liu1, Jian-Hung Shen2, Chung-Lun Kuo1, Yung-Wei Chen2,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 1317-1335, 2024, DOI:10.32604/cmes.2023.030618

    Abstract This study sets up two new merit functions, which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems. For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less, where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector. 1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues. Simultaneously, the real… More >

  • Open Access

    ARTICLE

    Binary Archimedes Optimization Algorithm for Computing Dominant Metric Dimension Problem

    Basma Mohamed1,*, Linda Mohaisen2, Mohammed Amin1

    Intelligent Automation & Soft Computing, Vol.38, No.1, pp. 19-34, 2023, DOI:10.32604/iasc.2023.031947

    Abstract In this paper, we consider the NP-hard problem of finding the minimum dominant resolving set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B. A resolving set is dominating if every vertex of G that does not belong to B is a neighbor to some vertices in B. The dominant metric dimension of G is the cardinality number of the minimum dominant resolving set. The dominant metric dimension is computed by a binary version of the Archimedes optimization… More >

  • Open Access

    CORRECTION

    Correction: Learning-Based Metaheuristic Approach for Home Healthcare Optimization Problem

    Mariem Belhor1,2,3, Adnen El-Amraoui1,*, Abderrazak Jemai2, François Delmotte1

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

    Abstract This article has no abstract. More >

  • Open Access

    ARTICLE

    Toward Improved Accuracy in Quasi-Static Elastography Using Deep Learning

    Yue Mei1,2,3, Jianwei Deng1,2, Dongmei Zhao1,2, Changjiang Xiao1,2, Tianhang Wang4, Li Dong5, Xuefeng Zhu1,6,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.1, pp. 911-935, 2024, DOI:10.32604/cmes.2023.043810

    Abstract Elastography is a non-invasive medical imaging technique to map the spatial variation of elastic properties of soft tissues. The quality of reconstruction results in elastography is highly sensitive to the noise induced by imaging measurements and processing. To address this issue, we propose a deep learning (DL) model based on conditional Generative Adversarial Networks (cGANs) to improve the quality of nonhomogeneous shear modulus reconstruction. To train this model, we generated a synthetic displacement field with finite element simulation under known nonhomogeneous shear modulus distribution. Both the simulated and experimental displacement fields are used to validate the proposed method. The reconstructed… More >

Displaying 11-20 on page 2 of 784. Per Page