Using Genetic Algorithms to Solve Quasi-Transportation Problem Modeled Multi-plant Order Allocation Problems / 以遺傳演算法求解類運輸問題模式化的多廠訂單分配問題

碩士 / 國立臺灣大學 / 工業工程學研究所 / 90 / The research field of multi-plant order allocation problems are less to present in the past. When a company receives large quantity of orders, it is the important issue of satisfy the requirement under finite production resource. In this research, a model for order allocation which multi-plant can produce a various of product is developed. The objective is to minimize total cost, including operation cost、setup cost、transportation cost and the penalty cost of order delay. And the capacity load in production planning horizon of each plants is also handled. This research proposes a mixed-integer programming(MIP) model to solve this kind of problems. In addition, a special model of quasi-transportation problem is proposed, and three genetic code of genetic algorithms(GAs) is adopted to solve quasi-transportation problem modeled multi-plant order allocation problems. Due to the fact that parameter settings and operator selections may significantly influence the computation results of genetic models, Taguchi method is conducted to test these variations and options. Moverover, a computational study is performed, in which the proposed three genetic code method is evaluated by different test problems and compare with optimal solution. Analysis results demonstrate the effectiveness of the GA method in solving the multi-plant order allocation problems.

Identiferoai:union.ndltd.org:TW/090NTU00030013
Date January 2002
CreatorsTzu-Chieh Lin, 林慈傑
ContributorsFeng-Cheng Yang, 楊烽正
Source SetsNational Digital Library of Theses and Dissertations in Taiwan
Languagezh-TW
Detected LanguageEnglish
Type學位論文 ; thesis
Format150

Page generated in 0.0395 seconds