臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：路徑基礎類粒子群最佳化演算法於求解含凹形節線成本最小成本轉運問題之研究
書刊名：運輸計劃
作者：顏上堯／李旺蒼／施佑林
作者(外文)：Yan, Shangyao／Lee, Wang-tsang／Shih, Yu-lin
出版日期：2007
卷期：36:3
頁次：頁393-423
主題關鍵詞：凹形節線成本；網路流動問題；粒子群最佳化演算法；遺傳演算法；門檻值接受法；Concave arc cost；Network flow problem；Particle swarm optimization；Genetic algorithm；Threshold accepting
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(2) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:0
  • 點閱點閱:23
本研究針對含平方根凹形節線成本之最小成本網路流動問題，以粒子群最佳化演算法之搜尋概念為基礎，並結合遺傳演算法、門檻值接受法與凹形成本 網路啟發解法之技術，發展一以路徑為基礎之混合式全域搜尋法，以有效的求解問題。為評估本演算法之求解績效，本研究隨機產生多個網路問題，並以 C++ 語言撰寫所有相關的電腦程式，進行測試分析。測試結果顯示本演算法比新近發展之鄰近搜尋演算法及遺傳演算法更能有效地求解含平方根凹形節線成本之最小成本網路流動問題。
In this research, a particle swarm optimization algorithm was employed, coupled with the techniques of a genetic algorithm, and threshold acceptance method and concave cost network heuristics, to develop a path-based global search algorithm for efficiently solving minimum cost network flow problems with square root concave arc costs. To evaluate the proposed algorithm, several network flow problems are randomly generated. C++ is used to code all the necessary programs for the tests. The results indicate that the proposed algorithm is more effective than recently designed local search algorithms and genetic algorithms for solving minimum cost network flow problems with square root concave arc costs.
期刊論文
1.Dueck, G.、Scheuer, T.(1990)。Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing。Journal of Computational Physics，90(1)，161-175。  new window
2.Reynolds, Craig W.(1987)。Flocks, herds and schools: A distributed behavioral model。ACM SIGGRAPH Computer Graphics，21(4)，25-34。  new window
3.Glover, F.(1989)。Tabu Search。ORSA Journal on Computing，1，190-206。  new window
4.Kirkpatrick, Scott、Gelatt, C. D. Jr.、Vecchi, M. P.(1983)。Optimization by simulated annealing。Science，220(4598)，671-680。  new window
5.Larsson, T.、Migdalas, A.、Ronnqvist, M.(1994)。A Lagrangian Heuristic for the Capacitated Concave Minimum Cost Network Flow Problem。European Journal of Operational Research，78，116-129。  new window
6.Gallo, G.、Sandi, C.(1979)。Adjacent Extreme Flows and Application to Min Concave Cost Flow Problems。Networks，9，95-121。  new window
7.Gallo, G.、Sandi, C.、Sodini, C.(1980)。An Algorithm for the Min Concave Cost Flow Problem。European Journal of Operational Research，4，248-255。  new window
8.Thach, P. T.(1992)。A Decomposition Method Using a Pricing Mechanism for Min Concave Cost Flow Problems with a Hierarchical Structure。Mathematical Programming，53，339-359。  new window
9.Guisewite, G. M.、Pardalos, P. M.(1993)。A Polynomial Time Solvable Concave Network Flow Problems。Networks，23，143-147。  new window
10.Yaged, B.(1971)。Minimum Cost Routing for Static Network Models。Networks，1，139-172。  new window
11.Balakrishnan, A.、Graves, S. C.(1989)。A Composite Algorithm for a Concave-Cost Network Flow Problem。Networks，19，175-202。  new window
12.Amiri, A.、Pirkul, H.(1997)。New Formulation and Relaxation to Solve a Concave Cost Network Flow Problem。Journal of the Operational Research Society，48，278-287。  new window
13.Nourie, F. J.、Guder, F.(1994)。A Restricted-Entry Method for a Transportation Problem with Piecewise-Linear Concave Cost。Computers & Operations Research，21，723-733。  new window
14.Dukwon, K.、Panos, M.(2000)。Dynamic Slope Scaling and Trust Interval Techniques for Solving Concave Piecewise Linear Network Flow Problems。Networks，35，216-222。  new window
15.顏上堯、陳建榮、湯慶輝(2004)。含凹形節線成本最小成本轉運問題鄰近搜尋法之研究。運輸計劃季刊，33(2)，277-306。new window  延伸查詢new window
16.顏上堯、羅守正(1998)。禁制搜尋法於求解凹形成本運輸網路問題之研究。中國工程學刊，21(3)，327-335。  延伸查詢new window
17.顏上堯、Young, Hwei-Fwa(1996)。A Decision Support Framework for Multi-Fleet Routing and Multi-Stop Flight Scheduling。Transportation Research，30(5)，379-398。  new window
18.Kuhn, H. W.、Baumol, W. J.(1962)。An Approximate Algorithm for the Fixed-Charge Transportation Problem。Naval Research Logistics Quarterly，9，1-16。  new window
19.Blumenfeld, D. E.、Burns, L. D.、Diltz, J. D.、Daganzo, C. F.(1985)。Analyzing Trade-offs between Transportation, Inventory, and Production Costs on Freight Network。Transportation Research，19B，361-380。  new window
20.顏上堯、Juang, Der-Shin、陳建榮、Lai, Wei-Shen(2005)。Global and Local Search Algorithms for Concave Cost Transshipment Problems。Journal of Global Optimization，33(1)，123-156。  new window
21.Suwan, R.、Sawased, T.(1999)。Link Capacity Assignment in Packet-Switched Networks: The Case of Piecewise Linear Concave Cost Function。IEICE Transactions on Communications，E82-B(10)，1566-1576。  new window
22.Zangwill, Willard I.(1968)。Minimum Concave Cost Flows in Certain Networks。Management Science，14(7)，429-450。  new window
23.Shi, Y.(2004)。Particle Swarm Optimization。IEEE Connections，2，8-13。  new window
24.顏上堯、羅守正(1999)。Probabilistic Local Search Algorithms for Concave Cost Transportation Network Problems。European Journal of Operational Research，117(3)，511-521。  new window
會議論文
1.Shi, Y. H.、Eberhart, R. C.(1998)。A modified particle swarm optimizer。the IEEE International Conference on Evolutionary Computation，(會議日期: 19980504-09)。Anchorage, AK。69-73。  new window
2.Eberhart, R. C.、Kennedy, J.(1995)。A New Optimizer Using Particle Swarm Theory。The Sixth International Symposium on Micro Machine and Human Science。Nagoya。39-43。  new window
3.Shi, Y.、Eberhart, R. C.(1998)。Parameter Selection in Particle Swarm Optimization。Evolutionary Programming VII: 7th International Conference。New York, NY：Springer Verlag。591-600。  new window
4.Kennedy, James、Eberhart, Russell C.(1995)。Particle swarm optimization。1995 IEEE International Conference on Neural Networks，(會議日期: 27 Nov.-1 Dec. 1995)。IEEE Service Center。1942-1948。  new window
5.Kennedy, J.、Eberhart, R. C.(1997)。A Discrete Binary Version of the Particle Swarm Algorithm。0。4104-4108。  new window
6.Salerno, J.(1997)。Using the Particle Swarm Optimization Technique to Train a Recurrent Neural Model。0。45-49。  new window
7.Kennedy, J.、Spears, W.(1998)。Matching Algorithms to Problems: An Experimental Test of the Particle Swarm and Some Genetic Algorithms on the Multimodal Problem Generator。IEEE World Congress on Computational Intelligence，74-77。  new window
8.Shi, Y.、Eberhart, R. C.(2001)。Particle Swarm Optimization: Development, Applications, and Resources。Piscataway, NJ/ Seoul, South Korea。  new window
研究報告
1.Jordan, W. C.(1986)。Scale Economies on Multi-commodity Networks。0。  new window
學位論文
1.曾俊傑(2001)。一個智慧型指紋辨識系統的設計方法論(碩士論文)。義守大學。  延伸查詢new window
2.葉思緯(2004)。應用粒子群最佳化演算法於多目標存貨分類之研究(碩士論文)。元智大學。  延伸查詢new window
3.徐育良(2002)。以粒子群最佳化為基礎之電腦遊戲角色設計之研究，0。  延伸查詢new window
4.葉麗雯(2002)。供應商產能有限及價格折扣下多產品多供應商最佳化採購決策，0。  延伸查詢new window
5.張榮芳(2001)。電力用戶負載歸類及整合，0。  延伸查詢new window
圖書
1.Goldberg, D. E.(1989)。Gene Algorithm in Search, Optimization and Machine Learning。New York：Massachusetts：Addison-Wesley。  new window
2.Glover, F.、Laguna, M.(1997)。Tabu Search。Kluwer Academic Publishers。  new window
3.Ahuja, R. K.、Orlin, J. B.、Magnanti, T. L.(1993)。Network Flows: Theory, Algorithms, and Applications。Prentice-Hall。  new window
4.Garey, Michael R.、Johnson, David S.(1979)。Computers and Intractability: A Guide to the theory of NP-Completeness。W. H. Freeman and Company。  new window
5.Rech, P.、Barton, L. G.(1970)。A Non-Convex Transportation Algorithm。Applications of Mathematical Programming Techniques。沒有紀錄。  new window
6.Boyd, Robert、Richerson, Peter J.(1985)。Culture and the Evolutionary Process。Chicago, IL：University of Chicago Press。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：1188（臺灣：1185，外國：3） ／ 本年度總使用人次：2541260 ／ 訪客人次（自102年09月）：68341174
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上