A Genetic Alogrithm for p-Hub Median Problem

• Main Authors: Jr-Yung Lin, 林智勇
• Other Authors: Cheng-Chang Lin
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/09591478616659273266

碩士 === 國立成功大學 === 交通管理學系碩博士班 === 93 === 　　　The typed of design problem we want to choose a fixed number p of the nodes to be hubs and allocate(or connect) the remaining nodes to one or more of the chosen hubs in such a way that operating costs of resulting network are minimized, which also considered capacity restrictions on hub is known as a capacitated p-Hub median problem. 　　　Due to it’s characteristics of NP-complete, a genetic algorithm which is widely complications to optimal problems was adopted within an acceptable a mount of running time. Finally, a mainland China airline freights network used to testing the accuracy and practicability on the model.