首页> 外文期刊>Journal of Chemical Engineering of Japan >Multi-Objective Optimization for Site Location Problems through Hybrid Genetic Algorithm with Neural Networks
【24h】

Multi-Objective Optimization for Site Location Problems through Hybrid Genetic Algorithm with Neural Networks

机译:基于神经网络的混合遗传算法的场地定位问题多目标优化

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

With the aim of developing a flexible optimization method for managing conflict resolution, this paper concerns itself with site location problems under multi-objectives. As known from the term NIMBY (Not In My Back Yard), disposal site location problems of hazardous waste is an eligible case study associated with environmental and economic concerns. After describing the problem generally as a multi-objective mixedinteger program, we have proposed an intelligence supported approach that extends the hybrid genetic algorithm developed by the author to derive the best-compromise solution. For this purpose, we have developed a novel modeling method of value function using neural networks, and incorporated it into the approach. As a result, we can provide a practical and effective method in which the hybrid strategy maintains its advantages of relying on good matches between the solution methods and the problem properties such as a genetic algorithm for unconstrained discrete optimization and a mathematical program for constrained continuous ones. Finally, by taking an example formulated as a multi-objective mixed-integer linear program, we have examined the effectiveness of the proposed approach numerically.
机译:为了开发一种灵活的用于解决冲突的优化方法,本文涉及多目标下的站点定位问题。从术语NIMBY(不在后院)中知道,危险废物的处置场所位置问题是与环境和经济问题相关的合格案例研究。在将问题大致描述为多目标混合整数程序后,我们提出了一种智能支持的方法,该方法扩展了作者开发的混合遗传算法,以得出最佳妥协解决方案。为此,我们开发了一种使用神经网络的新型价值函数建模方法,并将其纳入该方法。结果,我们可以提供一种实用且有效的方法,在这种方法中,混合策略将保持其优势,即依靠求解方法和问题属性之间的良好匹配,例如用于无约束离散优化的遗传算法和用于约束连续求解的数学程序。 。最后,通过以多目标混合整数线性程序为例,我们从数值上验证了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号