A Genetic Alogrithm for p-Hub Median Problem
碩士 === 國立成功大學 === 交通管理學系碩博士班 === 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 consider...
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 |
Similar Items
-
A Heuristic for the p-Hub Median Problem with Multiple Allocation
by: Yuan-Xiang Zhong, et al.
Published: (2005) -
A Heuristic Algorithm for the p-Hub Median Problem with Single Allocation
by: Ja-Sung Yu, et al.
Published: (2006) -
Numerical alogrithms for PWM modulators.
by: Green, Walter Battman.
Published: (2012) -
Apply Ant Colony Optimization for Solving Uncapacitated P-Hub Median Problem
by: Kang-Ting Ma, et al.
Published: (2008) -
Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques
by: Xiaoqian Sun, et al.
Published: (2017-01-01)