Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Optimization of Aluminum Alloy Formation Process for Selective Laser Melting Using a Differential Evolution-Framed JAYA Algorithm

    Siwen Xu1, Hanning Chen2, Rui Ni1, Maowei He2, Zhaodi Ge3, Xiaodan Liang2,*

    CMC-Computers, Materials & Continua, Vol.86, No.2, pp. 1-25, 2026, DOI:10.32604/cmc.2025.071398 - 09 December 2025

    Abstract Selective Laser Melting (SLM), an advanced metal additive manufacturing technology, offers high precision and personalized customization advantages. However, selecting reasonable SLM parameters is challenging due to complex relationships. This study proposes a method for identifying the optimal process window by combining the simulation model with an optimization algorithm. JAYA is guided by the principle of preferential behavior towards best solutions and avoidance of worst ones, but it is prone to premature convergence thus leading to insufficient global search. To overcome limitations, this research proposes a Differential Evolution-framed JAYA algorithm (DEJAYA). DEJAYA incorporates four key enhancements More >

  • Open Access

    ARTICLE

    Environmental and Economic Optimization of Multi-Source Power Real-Time Dispatch Based on DGADE-HDJ

    Bin Jiang1, Houbin Wang2,*

    Energy Engineering, Vol.122, No.5, pp. 2001-2057, 2025, DOI:10.32604/ee.2025.062765 - 25 April 2025

    Abstract Considering the special features of dynamic environment economic dispatch of power systems with high dimensionality, strong coupling, nonlinearity, and non-convexity, a GA-DE multi-objective optimization algorithm based on dual-population pseudo-parallel genetic algorithm-differential evolution is proposed in this paper. The algorithm is based on external elite archive and Pareto dominance, and it adopts the cooperative co-evolution mechanism of differential evolution and genetic algorithm. Average entropy and cubic chaotic mapping initialization strategies are proposed to increase population diversity. In the proposed method, we analyze the distribution of neighboring solutions and apply a new Pareto solution set pruning approach.… More >

  • Open Access

    ARTICLE

    A New Metaheuristic Approach to Solving Benchmark Problems: Hybrid Salp Swarm Jaya Algorithm

    Erkan Erdemir1,*, Adem Alpaslan Altun2

    CMC-Computers, Materials & Continua, Vol.71, No.2, pp. 2923-2941, 2022, DOI:10.32604/cmc.2022.022797 - 07 December 2021

    Abstract Metaheuristic algorithms are one of the methods used to solve optimization problems and find global or close to optimal solutions at a reasonable computational cost. As with other types of algorithms, in metaheuristic algorithms, one of the methods used to improve performance and achieve results closer to the target result is the hybridization of algorithms. In this study, a hybrid algorithm (HSSJAYA) consisting of salp swarm algorithm (SSA) and jaya algorithm (JAYA) is designed. The speed of achieving the global optimum of SSA, its simplicity, easy hybridization and JAYA's success in achieving the best solution… More >

  • Open Access

    ARTICLE

    An Improved Algorithm of K-means Based on Evolutionary Computation

    Yunlong Wang1,2,3, Xiong Luo1,2,4,*, Jing Zhang1,2,3, Zhigang Zhao1, Jun Zhang5

    Intelligent Automation & Soft Computing, Vol.26, No.5, pp. 961-971, 2020, DOI:10.32604/iasc.2020.010128

    Abstract K-means is a simple and commonly used algorithm, which is widely applied in many fields due to its fast convergence and distinctive performance. In this paper, a novel algorithm is proposed to help K-means jump out of a local optimum on the basis of several ideas from evolutionary computation, through the use of random and evolutionary processes. The experimental results show that the proposed algorithm is capable of improving the accuracy of K-means and decreasing the SSE of K-means, which indicates that the proposed algorithm can prevent K-means from falling into the local optimum to More >

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