检索结果-内蒙古大学图书馆

Optimizing TRMS stability: a multi-objective genetic algorithm approach to PID controller design

ENGINEERING COMPUTATIONS 2025年第2期42卷 710-721页

作者： Celebi, Baris Bilgic, Bogac Istanbul Univ Cerrahpasa Dept Mech Engn Istanbul Turkiye

PurposeThis paper aims to enhance the stability and control of twin rotor multi-input multi-output system (TRMS) helicopters by introducing a novel approach that utilizes a multi-objective genetic algorithm (MOGA) for optimizing proportional, integral, derivative (PID) controllers in simultaneous pitch and yaw ***/methodology/approachThe TRMS, a common prototype for helicopter motion studies, is introduced, and a PID controller is designed for pitch and yaw stabilization. The gains of the PID controller are optimized using a MOGA, a technique not previously proposed for TRMS in the *** various controllers have been explored in literature for TRMS stabilization, a MOGA-optimized PID controller for TRMS has not been proposed before. Simultaneous optimization of both pitch and yaw motions using two PID controllers is expected to yield improved *** limitations/implicationsThe study focuses on simulations, and experimental validation is not conducted. The MOGA is introduced as an optimization technique, and future studies may explore its application in experimental ***/valueThis study introduces a novel approach by utilizing a MOGA to optimize PID controller gains for TRMS. Simultaneous optimization of pitch and yaw motions aims to enhance robustness, providing a unique contribution to the field of helicopter control.

关键词： Twin Rotor multi-Input multi-Output System PID controller multi-objective genetic algorithm Helicopter control Motion stabilization

来源：评论

学校读者我要写书评

暂无评论

Structural optimization of mining decanter centrifuge based on response surface method and multi-objective genetic algorithm

引用

CHEMICAL ENGINEERING AND PROCESSING-PROCESS INTENSIFICATION 2025年 212卷

作者： Cong, Peichao Zhou, Dong Li, Wenbin Deng, Murong Guangxi Univ Sci & Technol Sch Mech & Automot Engn Liuzhou 545006 Peoples R China

A significant quantity of slime water generated during coal mining poses a serious threat to the health of underground workers and the environment. The decanter centrifuge is widely employed in slime water treatment due to its high efficiency in solid-liquid separation. This paper proposes a structural optimization framework for the mine decanter centrifuge based on the Response Surface Method (RSM) and multi-objective genetic algorithm (MOGA). Firstly, a three-dimensional numerical model of the decanter centrifuge was established, and the reliability of the model was verified by experimental and theoretical analysis. Subsequently, the Box-Behnken design method and RSM were employed to construct a response surface model that links input parameters (drum half cone angle, screw pitch, and spiral blade Inclination angle) with target variables (solid phase recovery rate and overflow liquid phase solids content). The interactions between each input parameter and target variable were assessed using analysis of variance (ANOVA), which confirmed the model's effectiveness and generalization capability. Finally, MOGA was employed to optimize the centrifuge's structural parameters, resulting in an 8.16 % increase in solid recovery rate and a 35.84 % reduction in overflow liquid solid content. It offers a valuable reference for the structural optimization of decanter centrifuges in coal slurry separation.

关键词： Decanter centrifuge Response surface methodology multi-objective genetic algorithm Structural optimization

来源：评论

学校读者我要写书评

暂无评论

A Q-learning-based improved multi-objective genetic algorithm for solving distributed heterogeneous assembly flexible job shop scheduling problems with transfers

引用

JOURNAL OF MANUFACTURING SYSTEMS 2025年 79卷 398-418页

作者： Yang, Zhijie Hu, Xinkai Li, Yibing Liang, Muxi Wang, Kaipu Wang, Lei Tang, Hongtao Guo, Shunsheng Wuhan Univ Technol Sch Mech & Elect Engn Wuhan 430070 Peoples R China Wuhan Univ Technol Hubei Digital Mfg Key Lab Wuhan 430070 Peoples R China

With the advancement of economic globalization, the distributed heterogeneous factory environment has become the mainstream in manufacturing enterprises. Scheduling flexible job shops in such a production environment holds practical value. However, due to the high complexity of certain jobs, the transfer of jobs between different factories are often required in practical production to balance machine load rates. Accordingly, this study addresses the distributed heterogeneous assembly flexible job shop scheduling problem with transfers, aiming to minimize both the makespan and total energy consumption. First, a multi-objective optimization model is formulated to define the problem, wherein knowledge of factory assignment and processing sequence for operations is summarized. Subsequently, given the complexity of this problem, a Q-learning-based improved multi-objective genetic algorithm (QL-IMOGA) is proposed as an effective approach. Within the proposed algorithm, a hybrid population initialization method is designed, considering factory load balancing and the earliest product completion time, to generate a high-quality initial population. Furthermore, two types of crossover operators, four types of mutation operators, and six objective-oriented neighborhood search operators are devised to enhance the algorithm's exploration and exploitation capabilities. Q-learning is employed for adaptive adjustment of key parameters to improve both convergence speed and solution quality. The effectiveness of the proposed population initialization method and neighborhood search operators is validated through 15 test cases. The results demonstrate that the proposed algorithm significantly outperformed four advanced meta-heuristic algorithms. Furthermore, it is observed that the solution employing the job transfer strategy led to an average reduction of 7.5% in makespan, a 3.9% decrease in total energy consumption, and an 8.4 % improvement in factory load rates compared to the soluti

关键词： Q -learning-based multi-objective genetic algorithm Distributed heterogeneous assembly Job transfer Flexible job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Optimization of ultra-thin battery heat transfer structures using entropy minimization and multi-objective genetic algorithm

引用

JOURNAL OF ENERGY STORAGE 2025年 122卷

作者： Yao, Xiaole Li, Yuxuan He, Hao Shi, Qianlei Liu, Qian Zhu, Xiaoqing Ju, Xing Xu, Chao North China Elect Power Univ Beijing Lab New Energy Storage Technol Beijing 102206 Peoples R China

Considering the strict constraints on battery module space and cost, two types of ultra-thin battery heat transfer structures were proposed and numerically optimized in this paper. The grooved patterns of microstructures are developed based on the manifold microchannel (MMC) and manifold micro pin fin (MMPF) concepts. The effects of geometrical parameter variations on the system's thermodynamic irreversibility are investigated. The structural optimization uses the Entropy Generation Minimization method and multi-objective genetic algorithm. The effects of eight independent geometrical parameters on the performance of the micro-structured heat sinks are analyzed by statistical analysis, and the finding is that the inlet manifold width and the height of the microchannel/micro-pin-fin strongly affect the entropy generation of the system. The entropy generation becomes lower as the wider the inlet manifold and the lower the microchannel/micro-pin-fin. The multi-objective genetic algorithm determines that the entropy generation characteristics are a function of these two crucial parameters. The irreversible losses of the optimized MMC and MMPF heat sinks are reduced by 88.53 % and 83.47 %, respectively, and the thermodynamic efficiencies, eta W- S, are increased from 97.51 % and 97.83 % to 99.59 % and 99.75 %, respectively, compared to the initial geometries.

关键词： Battery thermal management micro-structured heat sink Entropy generation minimization multi-objective genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

multi-objective genetic algorithm for Optimizing an ELM-Based Driver Distraction Detection System

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2022年第8期23卷 11946-11959页

作者： Echanobe, Javier Basterretxea, Koldo del Campo, Ines Martinez, Victoria Vidal, Naiara Univ Basque Country UPV EHU Dept Elect & Elect Bilbao 48940 Vizcaya Spain

Driver Assistance Systems (DAS) have been progressively incorporated into commercial vehicles in recent years. All these systems are paving the way for the forthcoming autonomous vehicle which will become a reality in the near future. Existing systems are based on numerous electronic systems with advanced skills, high performances, and high degrees of adaptability and intelligence. As is to be expected, these cutting-edge features require, in most cases, the use of powerful computing platforms. However, the deployment of such platforms is not an easy task, since they have to be integrated in the vehicle where there exist important restrictions regarding size, power consumption and cost. In this sense, every smart proposal aimed at reducing the complexity of these systems without degrading performance, is always a valuable contribution in the field. In this work, we propose a methodology to reduce the dimensionality of a driver distraction recognition system. The methodology is based on a multi-objective genetic algorithm that looks for the minimum set of useful features collected during the driving task and also for the simplest recognition system. The recognition algorithm is an Extreme Learning Machine (ELM) whose simplicity and fast learning procedure make it especially suitable to be used by a genetic algorithm which needs to evaluate thousands of candidate solutions. The proposed methodology has been tested with a real-world database collected from different drivers performing an itinerary with an instrumented car. The results obtained validate the proposal as a method to reduce the complexity of a driver distraction recognition system.

关键词： Vehicles Task analysis Visualization Proposals Feature extraction Automobiles genetic algorithms DAS driver distraction ELM multi-objective genetic algorithm feature selection

来源：评论

学校读者我要写书评

暂无评论

multi-objective genetic algorithm Based Deep Learning Model for Automated COVID-19 Detection Using Medical Image Data

引用

JOURNAL OF MEDICAL AND BIOLOGICAL ENGINEERING 2021年第5期41卷 678-689页

作者： Bansal, S. Singh, M. Dubey, R. K. Panigrahi, B. K. Indian Inst Technol Delhi Comp Sci & Engn Dept New Delhi 110016 India Robert Bosch Engn & Business Solut Private Ltd He 123 Hosur Rd7th Block Bengaluru 560095 Karnataka India Indian Inst Technol Delhi Elect Engn Dept New Delhi 110016 India

Purpose In early 2020, the world is amid a significant pandemic due to the novel coronavirus disease outbreak, commonly called the COVID-19. Coronavirus is a lung infection disease caused by the Severe Acute Respiratory Syndrome Coronavirus 2 virus (SARS-CoV-2). Because of its high transmission rate, it is crucial to detect cases as soon as possible to effectively control the spread of this pandemic and treat patients in the early stages. RT-PCR-based kits are the current standard kits used for COVID-19 diagnosis, but these tests take much time despite their high precision. A faster automated diagnostic tool is required for the effective screening of COVID-19. Methods In this study, a new semi-supervised feature learning technique is proposed to screen COVID-19 patients using chest CT scans. The model proposed in this study uses a three-step architecture, consisting of a convolutional autoencoder based unsupervised feature extractor, a multi-objective genetic algorithm (MOGA) based feature selector, and a Bagging Ensemble of support vector machines based binary classifier. The proposed architecture has been designed to provide precise and robust diagnostics for binary classification (COVID ***). A dataset of 1252 COVID-19 CT scan images, collected from 60 patients, has been used to train and evaluate the model. Results The best performing classifier within 127 ms per image achieved an accuracy of 98.79%, the precision of 98.47%, area under curve of 0.998, and an F1 score of 98.85% on 497 test images. The proposed model outperforms the current state of the art COVID-19 diagnostic techniques in terms of speed and accuracy. Conclusion The experimental results prove the superiority of the proposed methodology in comparison to existing *** study also comprehensively compares various feature selection techniques and highlights the importance of feature selection in medical image data problems.

关键词： Coronavirus (COVID-19) Convolutional autoencoder multi-objective genetic algorithm Feature subset selection

来源：评论

学校读者我要写书评

暂无评论

multi-objective genetic algorithm for solving N-version program design problem

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2006年第9期91卷 1083-1094页

作者： Yamachi, Hidemi Tsujimura, Yasuhiro Kambayashi, Yasushi Yamamoto, Hisashi Nippon Inst Technol Dept Comp & Informat Engn Miyashiro Saitama 3458501 Japan Tokyo Metropolitan Inst Technol Dept Prod & Informat Syst Engn Tokyo 1910065 Japan

N-version programming (N-VP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost. (C) 2005 Elsevier Ltd. All

关键词： fault tolerant software N-version program multi-objective genetic algorithm Pareto solutions distance-based selection

来源：评论

学校读者我要写书评

暂无评论

multi-objective genetic algorithm for cell formation problem considering cellular layout and operations scheduling

引用

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING 2012年第7期25卷 625-635页

作者： Arkat, Jamal Farahani, Mehdi Hosseinabadi Ahmadizar, Fardin Univ Kurdistan Dept Ind Engn Sanandaj 416 Iran

Integrated design of cellular manufacturing (CM) systems consist of three major decisions: cell formation (CF), cellular layout (CL) and planning issues such as cellular scheduling (CS). This article presents a mathematical model to concurrently identify the formation of cells, cellular layout and the operations sequence with the objective of minimising total transportation cost of parts as well as minimising makespan. A multi-objective genetic algorithm (MOGA) is then developed to solve the problem. The proposed MOGA exploits a novel evolutionary process which enables it to efficiently find Pareto optimal solutions. Computational results show the advantages of the proposed integrated approach and the superiority of the proposed MOGA over some well-known multi-objective evolutionary algorithms.

关键词： cell formation cellular layout operations scheduling multi-objective genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

multi-objective genetic algorithm based innovative wind farm layout optimization method

引用

ENERGY CONVERSION AND MANAGEMENT 2015年 105卷 1318-1327页

作者： Chen, Ying Li, Hua He, Bang Wang, Pengcheng Jin, Kai Texas A&M Univ Kingsville Dept Mech & Ind Engn Kingsville TX 78363 USA

Layout optimization has become one of the critical approaches to increase power output and decrease total cost of a wind farm. Previous researches have applied intelligent algorithms to optimizing the wind farm layout. However, those wind conditions used in most of previous research are simplified and not accurate enough to match the real world wind conditions. In this paper, the authors propose an innovative optimization method based on multi-objective genetic algorithm, and test it with real wind condition and commercial wind turbine parameters. Four case studies are conducted to investigate the number of wind turbines needed in the given wind farm. Different cost models are also considered in the case studies. The results clearly demonstrate that the new method is able to optimize the layout of a given wind farm with real commercial data and wind conditions in both regular and irregular shapes, and achieve a better result by selecting different type and hub height wind turbines. Published by Elsevier Ltd.

关键词： Wind farm Layout optimization multi-objective genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

multi-objective genetic algorithm for berth allocation problem considering daytime preference

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2015年 89卷 2-14页

作者： Hu, Zhi-Hua Shanghai Maritime Univ Logist Res Ctr Shanghai 200135 Peoples R China

Maximization of operational efficiency and minimization of cost are pursued by terminal operators, whereas daytime preference is increasingly emphasized by governments, terminal operators and workers. Daytime preference in berth allocation schedule refers to schedule the workloads in nights as fewer as possible, which improves working comfort, safety, and green and energy-savings degrees, but may decrease the throughput and total operational efficiency. By extending existing dynamic discrete berth allocation model, a bi-objective model considering daytime preference is established to minimize the delayed workloads and the workloads in nights. Based on the well known NSGA-II algorithm, a multi-objective genetic algorithm (moGA) is developed for solving the bi-objective model by using a two-part representation scheme. The sensitivities of the algorithmic parameters and tradeoffs between daytime preference and delayed workloads are analyzed by numerical experiments. The algorithmic aspects of the proposed approach and the effects of daytime preference on solutions are all examined. Finally, the managerial implications are discussed. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Berth allocation problem Dynamic discrete berth allocation problem Shiftwork multi-objective genetic algorithm Maritime terminal

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：