Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem

碩士 === 國立高雄應用科技大學 === 工業工程與管理系碩士班 === 95 === This study deals with solving continuous uncapacitated single -hub median problem with Euclidean distance by using a method based on Genetic algorithms (GA). By treating －hub median problems as clustering problems, this is a kind of method to deal with...

Full description

Bibliographic Details
Main Authors:	Guo-Liang Zheng, 鄭國良
Other Authors:	Kuang-Han Hsieh
Format:	Others
Language:	zh-TW
Published:	2007
Online Access:	http://ndltd.ncl.edu.tw/handle/06093697775035354470

id	ndltd-TW-095KUAS0041029
record_format	oai_dc
spelling	ndltd-TW-095KUAS00410292015-10-13T14:13:12Z http://ndltd.ncl.edu.tw/handle/06093697775035354470 Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem 在基因演算法中使用MergeandSplit功能以解決連續型無容量限制之單一指派p－中心中位問題 Guo-Liang Zheng 鄭國良碩士國立高雄應用科技大學工業工程與管理系碩士班 95 This study deals with solving continuous uncapacitated single -hub median problem with Euclidean distance by using a method based on Genetic algorithms (GA). By treating －hub median problems as clustering problems, this is a kind of method to deal with this kind of problem effectively and rapidly. In this paper, a heuristic method is constructed by modifying a traditional Genetic algorithm with a merge and split procedure, and its performance is compared with tradition Genetic algorithms. We present the results of extensive computational experience with both the merge and split procedure and the traditional Genetic algorithm. Kuang-Han Hsieh 謝廣漢 2007 學位論文 ; thesis 0 zh-TW
collection	NDLTD
language	zh-TW
format	Others
sources	NDLTD
description	碩士 === 國立高雄應用科技大學 === 工業工程與管理系碩士班 === 95 === This study deals with solving continuous uncapacitated single -hub median problem with Euclidean distance by using a method based on Genetic algorithms (GA). By treating －hub median problems as clustering problems, this is a kind of method to deal with this kind of problem effectively and rapidly. In this paper, a heuristic method is constructed by modifying a traditional Genetic algorithm with a merge and split procedure, and its performance is compared with tradition Genetic algorithms. We present the results of extensive computational experience with both the merge and split procedure and the traditional Genetic algorithm.
author2	Kuang-Han Hsieh
author_facet	Kuang-Han Hsieh Guo-Liang Zheng 鄭國良
author	Guo-Liang Zheng 鄭國良
spellingShingle	Guo-Liang Zheng 鄭國良 Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem
author_sort	Guo-Liang Zheng
title	Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem
title_short	Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem
title_full	Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem
title_fullStr	Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem
title_full_unstemmed	Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem
title_sort	using merge and split scheme in ga for solving continuous uncapacitate single p－hub median problem
publishDate	2007
url	http://ndltd.ncl.edu.tw/handle/06093697775035354470
work_keys_str_mv	AT guoliangzheng usingmergeandsplitschemeingaforsolvingcontinuousuncapacitatesinglephubmedianproblem AT zhèngguóliáng usingmergeandsplitschemeingaforsolvingcontinuousuncapacitatesinglephubmedianproblem AT guoliangzheng zàijīyīnyǎnsuànfǎzhōngshǐyòngmergeandsplitgōngnéngyǐjiějuéliánxùxíngwúróngliàngxiànzhìzhīdānyīzhǐpàipzhōngxīnzhōngwèiwèntí AT zhèngguóliáng zàijīyīnyǎnsuànfǎzhōngshǐyòngmergeandsplitgōngnéngyǐjiějuéliánxùxíngwúróngliàngxiànzhìzhīdānyīzhǐpàipzhōngxīnzhōngwèiwèntí
_version_	1717750106234552320

Using Merge and Split scheme in GA for solving continuous uncapacitate single p－hub median problem

Similar Items