首页 | 本学科首页   官方微博 | 高级检索  
     


A problem space genetic algorithm in multiobjective optimization
Authors:Ayten Turkcan  M. Selim Akturk
Affiliation:(1) Department of Industrial Engineering, Bilkent University, 06533 Bilkent, Ankara, Turkey
Abstract:In this study, a problem space genetic algorithm (PSGA) is used to solve bicriteria tool management and scheduling problems simultaneously in flexible manufacturing systems. The PSGA is used to generate approximately efficient solutions minimizing both the manufacturing cost and total weighted tardiness. This is the first implementation of PSGA to solve a multiobjective optimization problem (MOP). In multiobjective search, the key issues are guiding the search towards the global Pareto-optimal set and maintaining diversity. A new fitness assignment method, which is used in PSGA, is proposed to find a well-diversified, uniformly distributed set of solutions that are close to the global Pareto set. The proposed fitness assignment method is a combination of a nondominated sorting based method which is most commonly used in multiobjective optimization literature and aggregation of objectives method which is popular in the operations research literature. The quality of the Pareto-optimal set is evaluated by using the performance measures developed for multiobjective optimization problems.
Keywords:Bicriteria scheduling  nonidentical parallel CNC machines  flexible manufacturing systems  local search  genetic algorithm  Pareto-optimality
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号