A non-formalization description model based on the bipartite graph was established to express the key factors and the matching relationship between the parts. The model could also make individual changes easily. According to proportion of the parts' quantity, the selective assembly could be divided into two kinds of matching problem, which were 1-matching and d-matching. The restrictions for d-matching were defined. Making use of a 0-1 matrix, the non-formalization- description was transformed to a formalization model which was easy to be calculated by the algorithm. On this base, a genetic algorithm was put forward for the model, and a case of selective assembly was applied to prove the model.
參考文獻
相似文獻
引證文獻
引用本文
劉明周,陳誠和,葛茂根,張銘鑫,扈靜.機械產品選配問題的二分圖非形式化描述[J].農業(yè)機械學報,2007,38(11):133-136.[J]. Transactions of the Chinese Society for Agricultural Machinery,2007,38(11):133-136.