Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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


    A Blockchain-Based Game Approach to Multi-Microgrid Energy Dispatch

    Zhikang Wang#, Chengxuan Wang#, Wendi Wu, Cheng Sun, Zhengtian Wu*

    CMES-Computer Modeling in Engineering & Sciences, Vol.138, No.1, pp. 845-863, 2024, DOI:10.32604/cmes.2023.029442

    Abstract As the current global environment is deteriorating, distributed renewable energy is gradually becoming an important member of the energy internet. Blockchain, as a decentralized distributed ledger with decentralization, traceability and tamper-proof features, is an important way to achieve efficient consumption and multi-party supply of new energy. In this article, we establish a blockchain-based mathematical model of multiple microgrids and microgrid aggregators’ revenue, consider the degree of microgrid users’ preference for electricity thus increasing users’ reliance on the blockchain market, and apply the one-master-multiple-slave Stackelberg game theory to solve the energy dispatching strategy when each market entity pursues the maximum revenue.… More >

  • Open Access


    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

    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 scheduling problem is solved by… More >

  • Open Access


    Stochastic Programming for Hub Energy Management Considering Uncertainty Using Two-Point Estimate Method and Optimization Algorithm

    Ali S. Alghamdi1, Mohana Alanazi2, Abdulaziz Alanazi3, Yazeed Qasaymeh1,*, Muhammad Zubair1,4, Ahmed Bilal Awan5, M. G. B. Ashiq6

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.3, pp. 2163-2192, 2023, DOI:10.32604/cmes.2023.029453

    Abstract To maximize energy profit with the participation of electricity, natural gas, and district heating networks in the day-ahead market, stochastic scheduling of energy hubs taking into account the uncertainty of photovoltaic and wind resources, has been carried out. This has been done using a new meta-heuristic algorithm, improved artificial rabbits optimization (IARO). In this study, the uncertainty of solar and wind energy sources is modeled using Hang’s two-point estimating method (TPEM). The IARO algorithm is applied to calculate the best capacity of hub energy equipment, such as solar and wind renewable energy sources, combined heat and power (CHP) systems, steam… More >

  • Open Access


    A PSO Improved with Imbalanced Mutation and Task Rescheduling for Task Offloading in End-Edge-Cloud Computing

    Kaili Shao1, Hui Fu1, Ying Song2, Bo Wang3,*

    Computer Systems Science and Engineering, Vol.47, No.2, pp. 2259-2274, 2023, DOI:10.32604/csse.2023.041454

    Abstract To serve various tasks requested by various end devices with different requirements, end-edge-cloud (E2C) has attracted more and more attention from specialists in both academia and industry, by combining both benefits of edge and cloud computing. But nowadays, E2C still suffers from low service quality and resource efficiency, due to the geographical distribution of edge resources and the high dynamic of network topology and user mobility. To address these issues, this paper focuses on task offloading, which makes decisions that which resources are allocated to tasks for their processing. This paper first formulates the problem into binary non-linear programming and… More >

  • Open Access


    A Novel Collaborative Evolutionary Algorithm with Two-Population for Multi-Objective Flexible Job Shop Scheduling

    Cuiyu Wang, Xinyu Li, Yiping Gao*

    CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1849-1870, 2023, DOI:10.32604/cmes.2023.028098

    Abstract Job shop scheduling (JS) is an important technology for modern manufacturing. Flexible job shop scheduling (FJS) is critical in JS, and it has been widely employed in many industries, including aerospace and energy. FJS enables any machine from a certain set to handle an operation, and this is an NP-hard problem. Furthermore, due to the requirements in real-world cases, multi-objective FJS is increasingly widespread, thus increasing the challenge of solving the FJS problems. As a result, it is necessary to develop a novel method to address this challenge. To achieve this goal, a novel collaborative evolutionary algorithm with two-population based… More >

  • Open Access


    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

    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 embedded into Tabu search to… More >

  • Open Access


    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

    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 on an in-degree selection mechanism.… More >

  • Open Access


    Competitive and Cooperative-Based Strength Pareto Evolutionary Algorithm for Green Distributed Heterogeneous Flow Shop Scheduling

    Kuihua Huang1, Rui Li2, Wenyin Gong2,*, Weiwei Bian3, Rui Wang1

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 2077-2101, 2023, DOI:10.32604/iasc.2023.040215

    Abstract This work aims to resolve the distributed heterogeneous permutation flow shop scheduling problem (DHPFSP) with minimizing makespan and total energy consumption (TEC). To solve this NP-hard problem, this work proposed a competitive and cooperative-based strength Pareto evolutionary algorithm (CCSPEA) which contains the following features: 1) An initialization based on three heuristic rules is developed to generate a population with great diversity and convergence. 2) A comprehensive metric combining convergence and diversity metrics is used to better represent the heuristic information of a solution. 3) A competitive selection is designed which divides the population into a winner and a loser swarms… More >

  • Open Access


    Hyper-Heuristic Task Scheduling Algorithm Based on Reinforcement Learning in Cloud Computing

    Lei Yin1, Chang Sun2, Ming Gao3, Yadong Fang4, Ming Li1, Fengyu Zhou1,*

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1587-1608, 2023, DOI:10.32604/iasc.2023.039380

    Abstract The solution strategy of the heuristic algorithm is pre-set and has good performance in the conventional cloud resource scheduling process. However, for complex and dynamic cloud service scheduling tasks, due to the difference in service attributes, the solution efficiency of a single strategy is low for such problems. In this paper, we presents a hyper-heuristic algorithm based on reinforcement learning (HHRL) to optimize the completion time of the task sequence. Firstly, In the reward table setting stage of HHRL, we introduce population diversity and integrate maximum time to comprehensively determine the task scheduling and the selection of low-level heuristic strategies.… More >

  • Open Access


    Urban Drainage Network Scheduling Strategy Based on Dynamic Regulation: Optimization Model and Theoretical Research

    Xiaoming Fei*

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1293-1309, 2023, DOI:10.32604/iasc.2023.038607

    Abstract With the acceleration of urbanization in China, the discharge of domestic sewage and industrial wastewater is increasing, and accidents of sewage spilling out and polluting the environment occur from time to time. Problems such as imperfect facilities and backward control methods are common in the urban drainage network systems in China. Efficient drainage not only strengthens infrastructure such as rain and sewage diversion, pollution source monitoring, transportation, drainage and storage but also urgently needs technical means to monitor and optimize production and operation. Aiming at the optimal control of single-stage pumping stations and the coordinated control between two-stage pumping stations,… More >

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