The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximi...The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximizing commonality across the family of products and optimizing the performances of each product in the family. A 2-level chromosome structured genetic algorithm （2LCGA） is proposed to solve this class of problems and its performance is analyzed in comparing its results with those obtained with other methods. By interpreting the chromosome as a 2-level linear structure, the variable commonality genetic algorithm （GA） is constructed to vary the amount of platform commonality and automatically searches across varying levels of commonality for the platform while trying to resolve the tradeoff between commonality and individual product performance within the product family during optimization process. By incorporating a commonality assessing index to the problem formulation, the 2LCGA optimize the product platform and its corresponding family of products in a single stage, which can yield improvements in the overall performance of the product family compared with two-stage approaches （the first stage involves determining the best settings for the platform variables and values of unique variables are found for each product in the second stage）. The scope of the algorithm is also expanded by introducing a classification mechanism to allow mul- tiple platforms to be considered during product family optimization, offering opportunities for superior overall design by more efficacious tradeoffs between commonality and performance. The effectiveness of 2LCGA is demonstrated through the design of a family of universal electric motors and comparison against previous results.展开更多
This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage ti...This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.展开更多
基金This project is supported by National Natural Science Foundation of China(No.70471022,No.70501021)the Joint Research Scheme of National Natural Science Foundation of China(No,70418013) Hong Kong Research Grant Council,China(No.N_HKUST625/04).
文摘The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximizing commonality across the family of products and optimizing the performances of each product in the family. A 2-level chromosome structured genetic algorithm （2LCGA） is proposed to solve this class of problems and its performance is analyzed in comparing its results with those obtained with other methods. By interpreting the chromosome as a 2-level linear structure, the variable commonality genetic algorithm （GA） is constructed to vary the amount of platform commonality and automatically searches across varying levels of commonality for the platform while trying to resolve the tradeoff between commonality and individual product performance within the product family during optimization process. By incorporating a commonality assessing index to the problem formulation, the 2LCGA optimize the product platform and its corresponding family of products in a single stage, which can yield improvements in the overall performance of the product family compared with two-stage approaches （the first stage involves determining the best settings for the platform variables and values of unique variables are found for each product in the second stage）. The scope of the algorithm is also expanded by introducing a classification mechanism to allow mul- tiple platforms to be considered during product family optimization, offering opportunities for superior overall design by more efficacious tradeoffs between commonality and performance. The effectiveness of 2LCGA is demonstrated through the design of a family of universal electric motors and comparison against previous results.
基金Thailand Research Fund (Grant #MRG5480176)National Research University Project of Thailand Office of Higher Education Commission
文摘This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.
