:::

詳目顯示

回上一頁
題名:漸增式資源配置之決策支援系統--以警用巡邏箱配置為例
書刊名:管理與系統
作者:王健亞 引用關係林政彥 引用關係陳海燕
作者(外文):Wang, Jen-yaLin, Cheng-yenChen, Hai-yen
出版日期:2010
卷期:17:2
頁次:頁339-372
主題關鍵詞:漸增的資源配置基因演算法巡邏箱IncrementalResource allocationGenetic algorithmPatrol box
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:3
  • 點閱點閱:239
一般的資源配置問題大多是在給定條件下追求具有最大效益或最低成本的資源配置,一旦有新資源加入(條件異動)就必須重新分配,所以新增資源後配置結果能否與之前配置結果相容將對整體成本有重要的影響。過去資源配置方法欲從m處預定地選出n處配置資源時,大多無法在舊有配置結果上新增資源,而且還可能因人爲疏忽在同一地點設置多個資源,造成配置後的資源不是相距太近就是相隔太遠的缺點,所以需要更有效的資源配置方法。爲解決此類資源配置問題,本文首先分析此類資源配置問題特性;其次根據決策者需求來設計合適的目標函數;最後以基因演算法與地理資訊系統爲基礎建構一決策支援系統提供決策者合適的資源配置建議。文中實驗結果除能顯示本文所提方法確實可以避免上述不當配置之外,或許也可以提供其他領域中類似的資源配置問題參考之用。
General resource allocation problems usually aim to pursue the maximum benefits or the lowest cost under given conditions. Once some extra resources are available (i.e., condition changed), we need to re-allocate these resources. Therefore, whether a re-allocation remains consistent with the previous one becomes a decisive factor in cost reduction. When choosing n proper places out of m, traditional resource allocation schemes may suffer from the following drawbacks. They cannot add new resources directly to a previous allocation and thus the previous allocation will be utterly repudiated. Moreover, they might assign multiple resources almost to the same place due to culpable disregard. Consequently, two allocated resources may be too distant from or too close to each other. A more practical method is thus called for. In this paper, a practical method is proposed to solve such kind of problems. First, the properties of the problem are analyzed. Second, a suitable objective function is defined according to decision makers' needs. Finally, a decision support system is implemented to provide proper resource allocation suggestions, which is based on Genetic Algorithm (GA) and Geographic Information System (GIS). The experimental results show that the proposed method can prevent inappropriate resource allocations and also suggest that it may be useful to some similar cases in other fields.
期刊論文
1.黃世孟、賴光真(19950800)。都市地區國民中學學區劃分多準則評估模式之建立。建築學報,13,89-104。new window  延伸查詢new window
2.黃世孟、賴光真(1995)。「都市地區國民中學學區劃分多準則評估模式之建立」。中華民國建築學會建築學報,第十三期,89-104 頁。  延伸查詢new window
3.Bertossi, A. A., Pinotti, C. M., and Tan, R. B.,(2003)。“Channel Assignment with Separation for Interference Avoidance in Wireless Networks,”。IEEE Transactions on Parallel and Distributed Systems,vol. 14,no. 3,pp. 222-235。  new window
4.Blum, C. and Roli, A.,(2003)。“Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison,”。ACM Computing Surveys,vol. 35,no. 3,pp. 268-308。  new window
5.Heuvel, J. V. D., Leese, R. A., and Shepherd, M. A.,(1998)。“Graph Labeling and Radio Channel Assignment,”。Journal of Graph Theory,vol. 29,no. 4,pp. 263-283。  new window
6.Rozner, E., Mehta, Y., Akella, A., and Qiu, L.,(2007)。“Traffic-Aware Channel Assignment in Wireless LANs,”。ACM SIGMOBILE Mobile Computing and Communications Review,vol. 11,no. 2,pp. 43-44。  new window
7.Smith, D. H., Hurley, S., and Thiel, S. U.,(1998)。“I mproving Heuristics for the Frequency Assignment Problem,”。European Journal of Operation Research,vol. 107,no. 1,pp. 76-86。  new window
8.Bertossi, A. A.、Pinotti, C. M.、Tan, R. B.(2003)。Channel Assignment with Separation for Interference Avoidance in Wireless Networks。IEEE Transactions on Parallel and Distributed Systems,14(3),222-235。  new window
9.Heuvel, J. V. D.、Leese, R. A.、Shepherd, M. A.(1998)。Graph Labeling and Radio Channel Assignment。Journal of Graph Theory,29(4),263-283。  new window
10.Blum, C.、Roli, A.(2003)。Metaheuristics in Combinatorial Optimization--Overview and Conceptual Comparison。ACM Computing Surveys,35(3),268-308。  new window
11.Rozner, E.、Mehta, Y.、Akella, A.、Qiu, L.(2007)。Traffic-Aware Channel Assignment in Wireless LANs。ACM SIGMOBILE Mobile Computing and Communications Review,11(2),43-44。  new window
12.Smith, D. H.、Hurley, S.、Thiel, S. U.(1998)。Improving Heuristics for the Frequency Assignment Problem。European Journal of Operation Research,107(1),76-86。  new window
會議論文
1.王健亞、游清柱、陳海燕、陳致超(2007)。「利用基因演算法解決警用巡邏箱選址問題-以台中市立人派出所為例」。台中。40-49 頁。  延伸查詢new window
2.Zander, J.,(2000)。“Trends in Resource Management Future Wireless Networks,”。Chicago。pp. 159-163。  new window
3.王健亞、游清柱、陳海燕、陳致超(2007)。利用基因演算法解決巡邏箱選址問題--以臺中市立人派出所為例。臺中。40-49。  延伸查詢new window
4.Zander, J.(2000)。Trends in Resource Management Future Wireless Networks。Chicago。159-163。  new window
學位論文
1.張登欽(1984)。「國民中學學校、規模、區位、學區劃分之研究-台北市松山區實證探討」。  延伸查詢new window
2.林志交(2002)。「基因演算法於模型影像套合計算之應用」。  延伸查詢new window
3.張家生(1979)。「計量管理應用於校址選擇與學區劃分之研究」。  延伸查詢new window
4.陳海燕(2003)。「一種自動化區域規劃演算法」。  延伸查詢new window
5.鍾靜(1984)。「線性規劃應用於學區劃分之研究」。  延伸查詢new window
6.張家生(1979)。計算管理應用於校址選擇與學區劃分之研究。國立政治大學。  延伸查詢new window
7.林志交(2002)。基因演算法於模型影像套合計算之應用。國立成功大學。  延伸查詢new window
8.陳海燕(2003)。一種自動化區域規劃演算法。私立東海大學。  延伸查詢new window
9.鍾靜(1984)。線性規劃應用於學區劃分之研究。私立淡江大學。  延伸查詢new window
圖書
1.Holland, J. H.(1992)。Adaptation in natural and artificial systems。University of Michigan Press。  new window
2.Lee, R. C. T.、Tseng, S. S.、Chang, R. C.、Tsai, Y. T.(2005)。Introduction to the Design and Analysis of Algorithms。McGraw-Hill:旗標出版社。  new window
3.Goldberg, D. E.(1989)。Gene Algorithm in Search, Optimization and Machine Learning。New York:Massachusetts:Addison-Wesley。  new window
4.梁定澎(2006)。決策支援系統與企業智慧。臺北市:智勝文化事業文化有限公司。  延伸查詢new window
5.梁定澎(1996)。決策支援系統與企業智慧。臺北市。  延伸查詢new window
其他
1.ESRI.(2008)。ArcGIS Network Analyst,http://www.esri.com/software/arcgis/extensions/networkanalyst/index.html。  new window
2.DANIWEB.(2008),http://www.daniweb.com/forums/post614801.html。  new window
3.ESRI.(2008)。NetEngine,http://www.esri.com/software/netengine/about/overview.html。  new window
4.MapInfo.(2008)。Envinsa Platform and Routing J Server SDK,http://www.mapinfo.com/solutions/capabilities/logistics。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top