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

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：調適型導引螞蟻演算法求解時窗收卸貨問題之研究
書刊名：運輸計劃
作者：李泰琳／張靖 引用關係
作者(外文)：Li, Tai-lin／Chang, Ching
出版日期：2010
卷期：39:1
頁次：頁99-132
主題關鍵詞：螞蟻演算法；導引區域搜尋法；時間窗收卸貨問題；Ant colony optimization；Guided local search；Pickup and delivery problem with time windows
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:11
  • 點閱點閱:27
本研究主要結合導引區域搜尋技術 (guided local search, GLS) 與李泰琳等人提出的調適型螞蟻演算法 (adaptive ant colony system, AACS)，設計調適型導引螞蟻演算法(guided adaptive ant colony system, GAACS) 求解時窗收卸貨問題(pickup and delivery problem with time windows , PDPTW)。首先，引用李泰琳等人所提出之問題規模精簡策略與關連式旅行成本網絡結構，將PDPTW 轉換為無時窗的近似收卸貨問題 (similar pickup and delivery problem, SPDP)，其優點為在計算過程中不需要考慮時窗限制；其次，提出GAACS 演算法整合的觀念。演算法績效測試為應用國際標準題庫VRPTW 例題，配合Lau 與Liang (2002)方法進行修改，產生具有標竿解之PDPTW 例題18 題進行測試，問題規模皆為100 個作業，結果顯示GAACS 可以在25.9 分鐘平均時間，求得與標竿解平均差異僅1.8%之近似最佳解。
The Pick Up and Delivery Problem with Time Windows (PDPTW) was solved via the proposed Guided Adaptive Ant Colony System (GAACS), which was integrated by the Guided Local Search (GLS) and Adaptive Ant Colony System (AACS) proposed by Lee Tai-Lin, etc. However, in order to solve the PDPTW more efficiently and effectively, a PDPTW was transferred to be a new similar PDP (SPDP) without time window via the Time Window Partitioning and Discretization Strategy. In order to show the contribution of the GAACS, 18 Solomon benchmark VRP problems were transferred to be PDPTW problems via the method developed by Lau and Liang. According to the computation results, we obtained the average percentages of errors of the best published solutions among18 PDPTW test instances, with 1.80% and an average computation time of 25.9 minutes. This shows that our proposed GAACS method can solve PDPTW accurately in a reasonable time.
期刊論文
1.Mitrovic-Minic, S.、Laporte, Gilbert(2004)。Waiting Strategies for the Dynamic Pickup and Delivery Problem with Time Windows。Transportation Research Part B: Methodological，38(7)，635-655。  new window
2.Bullnheimer, B.、Hartl, R. F.、Strauss, C.(1999)。A new rank based version of the ant system-a computational study。Central European Journal of Operations Research，7(1)，25-38。  new window
3.Dumas, Y.、Desrosiers, J.、Soumis, F.(1991)。Pickup and Delivery Problem with Time Windows。European Journal of Operational Research，54(1)，7-22。  new window
4.Fabian, J.、Perez, L.(2005)。A Meta-heuristic Applied for a Topologic Pickup and Delivery Problem with Time Windows。Lecture Notes in Computer Science，3516，924-928。  new window
5.Le Louam, F. X.、Gendreau, M.、Potvin, J. Y.(2004)。GENI Ants for the Traveling Salesman Problem。Annals of Operations Research，131，187-201。  new window
6.Lu, Q.、Dessouky, M.(2004)。An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem。Transportation Science，38(4)，503-514。  new window
7.Nanry, W. P.、Barnes, J. W.(2000)。Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search。Transportation Research Part B，34(2)，107-121。  new window
8.Psarafis, H.(1983)。An Exact Algorithm for the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem。Transportation Science，17(4)，351-361。  new window
9.Dorigo, Marco、Gambardella, Luca Maria(1997)。Ant Colony System: A cooperative learning approach to the traveling salesman problem。IEEE Transactions on Evolutionary Computation，1(1)，53-66。  new window
10.Dorigo, M.、Gambardella, L. M.(1997)。Ant Colonies for the Traveling Salesman Problem。BioSystems，43(2)，73-81。  new window
11.Mladenović, N.、Hansen, P.(1997)。Variable Neighborhood Search。Computers & Operations Research，24(11)，1097-1100。  new window
12.林志鴻(20050300)。宅配業車輛路線規劃問題之模式建立與求解。運輸學刊，17(1)，65-93。new window  延伸查詢new window
13.Rochat, Yves、Taillard, Éric D.(1995)。Probabilistic Diversification and Intensification in Local Search for Vehicle Routing。Journal of Heuristics，1(1)，147-167。  new window
14.韓復華、王國琛(20020600)。巨集啟發式解法在求解大規模旅行推銷員問題之應用。運輸學刊，14(2)，1-14。new window  延伸查詢new window
15.梅明德、謝浩明(20010600)。時窗限制動態車輛路線問題之線上型路線建立啟發式解法。運輸學刊，13(2)，73-111。new window  延伸查詢new window
16.陳家和、丁慶榮(20050900)。應用螞蟻演算法於時窗限制車輛途程問題之研究。運輸學刊，17(3)，261-280。new window  延伸查詢new window
17.李泰琳、張靖(20080900)。應用時窗分割與整數化策略簡化時窗收卸貨問題之研究。運輸學刊，20(3)，313-350。new window  延伸查詢new window
18.李泰琳、張靖、卓裕仁(20070300)。調適型螞蟻演算法應用於旅行推銷員問題之研究。運輸學刊，19(1)，89-120。new window  延伸查詢new window
19.Tsang, E and Voudouris, C.(1995)。“Fast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem”。Technical Report CSM-246, Department of Computer Science, University of Essex。  new window
20.Savelsbergh, M. W. P. and Solomon, M.(1995)。“The General Pickup and Delivery Problem”。Transportation Science，vol. 29,no. 1，17-29。  new window
21.Appelgren, L. H.(1969)。“A Column Generation Algorithm for a Ship Scheduling Problem”。Transportation Science，vol. 3,no. 1，53-68。  new window
22.Lau, H. C. and Liang, Z.(2002)。“Pickup and Delivery with Time Windows - Algorithms and Test Case Generation”。International Journal on Artificial Intelligence Tools，vol. 11,no. 3，455-472。  new window
23.朱經武、劉曄、洪秀華(2004)。「同時考慮以自有車輛收送或或委託貨運公司服務之啟發式演算法」。海運學報，第13期，147-162。new window  延伸查詢new window
24.Psarafis, H.(1980)。“A Dynamic Programming Solution to the Single Vehicle Many to Many Immediate Request Dial-a-Ride Problem”。Transportation Science，vol.14,no. 2，130-54。  new window
25.Sexton, T. R. and Bodin, L. D.(1985)。“Optimizing Single Vehicle Many-to-Many Dial-a-Ride Problem with Desired Delivery Time: I Scheduling”。Transportation Science，vol. 19,no. 4，378-410。  new window
26.Sexton, T. R. and Bodin, L. D.(1985)。“Optimizing Single Vehicle Many-to-Many Dial-a-Ride Problem with Desired Delivery Time: II Routing”。Transportation Science，vol. 19,no. 4，411-435。  new window
27.Bent, R. and Van Hentenryck, P.(2006)。“A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows”。Computers and Operations Research，vol. 33,no. 4，875-893。  new window
28.Dror, M.(1994)。“Note on the Complexity of the Shortest Path Models for Column Generations in the VRPTW”。Operations Research，vol. 42,no. 5，977-978。  new window
29.Kolen, A. W. J., Rinnooy Kan, A. G. H., and Trienekens, H. W. J. M.(1987)。“Vehicle Routing with Time Windows”。Operations Research，vol. 35,no. 2，266-273。  new window
30.Desrosiers, J., Dumas, Y., Solomon, M. M., and Sournis, E.(1995)。“Time Constrained Routing and Scheduling”。Handbooks in Operations Research and Management Science，vol. 8，35-139。  new window
31.Mester D. and Bräysy O.(2005)。“Active Guided Evolution Strategies for the Large Scale Vehicle Routing Problem with Time Windows”。Computers & Operations Research，vol. 32，1593-1614。  new window
32.Voudouris, C. and Tsang, E.(1998)。“Guided Local Search and Its Application to the Travelling Salesman Problem”。European Journal of Operational Research，vol. 132,no. 2，80-110。  new window
33.Voudouris, C. and Tsang, E.(1999)。“Theory and Methodology Guided Local Search and Its Application to the Traveling Salesman Problem”。European Journal of Operational Reasearch，vol. 113，469-499。  new window
34.Tsang, E. and Voudouris, C.(1997)。“Fast Local Search Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem”。Operations Research Letters，vol. 20,no. 3，119-127。  new window
35.Balas, E. and Vazacopoulos, A.(1998)。“A Guided Local Search with Shifting Bottleneck for Job Shop Scheduling”。Management Science，vol. 44,no. 2，262-275。  new window
36.Faroe, O., Pisinger, D., and Zachariasen, M.(2003)。“Guided Local Search for the Three-Dimensional Bin Packing Problem”。INFORMS Journal on Computing，vol. 15，267-283。  new window
37.Lin, S.(1965)。“Computer Solutions for the Traveling Salesman Problem”。Bell Systems Technology Journal，vol. 44，2245-2269。  new window
38.Zhong, Y. and Cole, M. H.(2005)。“A Vehicle Routing Problem with Backhauls and Time Windows: A Guided Local Search Solution”。Transportation Research Part E，vol. 41，131-144。  new window
會議論文
1.Gambardella, L. M.、Dorigo, M.(1996)。Solving Symmetric and Asymmetric TSPs by Ant Colonies。The IEEE International Conference on Evolutionary Computation，622-627。  new window
2.Stiitzle, T.、Hoos, H. H.(1997)。The MAX-MIN Ant System and Local Search for the Travelling Salesman Problem。The IEEE International Conference on Evolutionary Computation，309-314。  new window
3.Gambardella, L. M.、Dorigo, M.(1995)。Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem。The Eleventh Intemational Conference on Machine Learning。Tahoe City, CA：Morgan Kaufmann。252-260。  new window
4.彭冠儒、陳正芳(2002)。「混合送貨、收貨的車輛途程問題」150-157。  延伸查詢new window
5.韓復華、卓裕仁、陳國清(1999)。「五種巨集啟發式解法在VRP問題上之應用與比較」72-82。  延伸查詢new window
6.Kilby, P., Prosser, P., and Shaw, P.(1997)。“Guided Local Search for the Vehicle Routing Problem”。Sophia, Antipolis, France。1-10。  new window
7.Voudouris, C. and Tsang, E.(1996)。“Partial Constraint Satisfaction Problems and Guided Local Search”。London。337-356。  new window
8.Voudouris, C. and Tsang, E.(1998)。“Solving the Radio Link Frequency Assignment Problem Using Guided Local Search”。Aalborg, Demark。  new window
研究報告
1.Voudouris, C. and Tsang, E.(1995)。“Function Optimization Using Guided Local Search”。  new window
2.Voudouris, C. and Tsang, E.(1995)。“Guided Local Search”。  new window
3.Voudouris, C. and Tsang, E.(1995)。“Partial Constraint Satisfaction Problems and Guided Local Search”。  new window
4.Taillard É. Badeau P. Gendreau M. Guertain F. and Potvin J. Y.(1995)。“A New Neighbourhood Structure for the Vehicle Routing Problem with Time Windows”。  new window
5.Doerner, K., Hartl, R. F., and Reimann, M.(2000)。“Ant Colony Optimization Applied to the Pickup and Delivery Problem”。  new window
學位論文
1.Wang, X.(2001)。Algorithms and Strategies for Dynamic Carrier Fleet Operations: Applications to Local Trucking Operations，U.S.A。  new window
2.Kohl, N.(1995)。Exact Methods for Time Constrained Routing and Related Scheduling Problems(博士論文)。Technical University of Denmark。  new window
3.Dorigo, M.(1992)。Optimization, learning and natural algorithm(博士論文)。Politecnico di Milano，Italy。  new window
4.黃信翔、王晉元(2005)。「解決具時間窗限制的提送貨問題」。  延伸查詢new window
5.Davenport, A.(1997)。“GENET: A Connectionist Architecture for Constraint Satisfaction”。  new window
6.Mills, P.(2002)。“Extensions To Guided Local Search”。  new window
7.Voudouris, C.(1997)。“Guided Local Search for Combinatorial Problems”。  new window
圖書
1.Stützle T. and Hoos H. H.(1998)。“Improvements on the Ant System: Introducing the MAX-MIN Ant System”。Artificial Neural Network and Genetic Algorithms。New York。  new window
2.Voudouris, C. and Tsang, E. P. K.(2003)。“Guided Local Search”。Handbook of Metaheuristics。Kluwer。  new window
3.Savelsbergh, M. W. P.(1988)。Computer Aided Routing, Centrum Voor Wiskunde en Informatica。Amsterdam。  new window
4.Kilby, P., Prosser, P., and Shaw, P.(1999)。“Guided Local Search for the Vehicle Routing Problem with Time Windows”。META-HEURISTICS Advances and Trends in Local Search Paradigms for Optimization。Boston。  new window
圖書論文
1.Stiitzle, T.、Hoos, H. H.(1999)。MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems。Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

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

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