Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/45351
DC FieldValueLanguage
dc.contributor.authorLin, M.D.en_US
dc.contributor.author林明德zh_TW
dc.contributor.authorLiu, Y.H.en_US
dc.contributor.authorLiu, G.F.en_US
dc.contributor.authorChu, C.W.en_US
dc.date2007zh_TW
dc.date.accessioned2014-06-06T08:14:55Z-
dc.date.available2014-06-06T08:14:55Z-
dc.identifier.issn0305-215Xzh_TW
dc.identifier.urihttp://hdl.handle.net/11455/45351-
dc.description.abstractThe optimization problems of water distribution networks are complex, multi- modal and discrete-variable problems that cannot be easily solved with conventional optimization algorithms. Heuristic algorithms such as genetic algorithms, simulated annealing, tabu search and ant colony optimization have been extensively employed over the last decade. This article proposed an optimization procedure based on the scatter search ( SS) framework, which is also a heuristic algorithm, to obtain the least-cost designs of three well- known looped water distribution networks ( two- loop, Hanoi and New York networks). The computational results obtained with the three benchmark instances indicate that SS is able to find solutions comparable to those provided by some of the most competitive algorithms published in the literature.en_US
dc.language.isoen_USzh_TW
dc.relationEngineering Optimizationen_US
dc.relation.ispartofseriesEngineering Optimization, Volume 39, Issue 7, Page(s) 857-876.en_US
dc.relation.urihttp://dx.doi.org/10.1080/03052150701503611en_US
dc.subjectscatter searchen_US
dc.subjectwater distribution networken_US
dc.subjectoptimizationen_US
dc.subjectprogramming gradient-methoden_US
dc.subjectdistribution-systemsen_US
dc.subjectgenetic algorithmsen_US
dc.subjectsupply networksen_US
dc.subjectoptimizationen_US
dc.titleScatter search heuristic for least-cost design of water distribution networksen_US
dc.typeJournal Articlezh_TW
dc.identifier.doi10.1080/03052150701503611zh_TW
Appears in Collections:環境工程學系所
文件中的檔案:

取得全文請前往華藝線上圖書館



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.