检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北方工业大学理学院,北京
出 处:《应用数学进展》2023年第10期4195-4207,共13页Advances in Applied Mathematics
摘 要:优化问题是工业生产中十分常见的一类问题,但在具体的实际应用中,单目标优化往往无法满足实际的需求。工厂需要在保证利润的前提下降低自己的成本,如能耗、人工、生产时间等。此时单目标优化无法较好地给出需要的可行解,采用多目标优化能较为简单地解决此类问题。NSGA-II算法在解决此类问题时具有较好的可行性,本文主要介绍NSGA-II算法的发展与原理,并以模拟工业生产的实际情况给出了简单的应用案例。Optimization problems are common in industrial production, but in specific practical applications, single-objective optimization often fails to meet the actual requirements. Factories need to reduce their costs, such as energy consumption, labor, and production time, while ensuring profitability. In such cases, single-objective optimization cannot provide satisfactory feasible solutions, and mul-ti-objective optimization can effectively address these problems. The NSGA-II algorithm demon-strates good feasibility in solving such problems. This paper primarily introduces the development and principles of the NSGA-II algorithm and provides a simple application case based on simulated industrial production scenarios.
关 键 词:多目标优化 NSGA-II算法 PARETO占优
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49