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

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：應用螞蟻演算法提升售後服務保修專員指派績效之研究
書刊名：醒吾學報
作者：李泰琳／鄧淑貞／林靜芬
作者(外文)：Li, Tai-lin／Dent, Shu-jen／Lin, Ching-fen
出版日期：2015
卷期：52
頁次：頁11-32
主題關鍵詞：高科技廠；售後服務；保修專員指派；High-tech factory；After-sales service；Engineers assignment
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:21
  • 點閱點閱:15
期刊論文
1.Bent, R.、Van Hentenryck, P.(2006)。Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows。Computers and Operations Research，33(4)，875-893。  new window
2.Christofides, N.、Eilon, S.(1969)。An Algorithm for Vehicle Dispatching Problem。Operational Research Quarterly，20(3)，309-318。  new window
3.Dorigo, M.、Di. Caro, G.、Gambardella, L. M.(1999)。Ant Algorithm for Discrete Optimization。Artificial Life，5(3)，137-172。  new window
4.Dror, M.(1994)。Note on the Complexity of the Shortest Path Models for Column Generations in the VRPTW。Operations Research，42(5)，977-978。  new window
5.Lau, H. C.、Liang, Z.(2002)。Pickup and Delivery with Time Windows--Algorithms and Test Case Generation。Intemational Journal on Artificial Intelligence Tools，11(3)，455-472。  new window
6.Penna, T. J. P.(1995)。Traveling Salesman Problem and Tsallis Statistics。Physical Review E，51(1)，1-3。  new window
7.Rochat, Y.、Taillard, E. D.(1995)。Diversification and Intensification in Local Search for Vehicle Routing。Journal of Heuristics，1(1)，147-167。  new window
8.Sexton, T. R.、Bodin, L. D.(1985)。Optimizing Single Vehicle Many-to-Many Dial-a-Ride Problem with Desired Delivery Time: II Routing。Transportation Science，19(4)，411-435。  new window
9.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
10.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
11.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
12.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
13.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
14.Lu, Q.、Dessouky, M.(2004)。An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem。Transportation Science，38(4)，503-514。  new window
15.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
16.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
17.Toussaint, K. J.、Golden, B. L.(1994)。Heuristics to Improve the Clarity of Base/Time Plots。Computers and Operations Research，21(5)，573-586。  new window
18.Watkins, C. J. C. H.、Dayan, P.(1992)。Q-Learning。Machine Learning，8(3)，279-292。  new window
19.Reinelt, G.(1994)。The Traveling Salesman: Computational Solutions for TSP Applications。Lecture Notes in Computer Science，840，1-223。  new window
20.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
21.Dorigo, M.、Gambardella, L. M.(1997)。Ant Colonies for the Traveling Salesman Problem。BioSystems，43(2)，73-81。  new window
22.Dorigo, M.、Maniezzo, V.、Colorni, A.(1996)。The ant system: Optimizatoin by a colony of cooperating agents。IEEE Transactions on Systems, Man, and Cybernetics--Part B，26(1)，29-41。  new window
23.韓復華、楊智凱(19960600)。門檻接受法在TSP問題上之應用。運輸計劃，25(2)，163-187。new window  延伸查詢new window
24.韓復華、楊智凱、卓裕仁(19970600)。應用門檻接受法求解車輛路線問題之研究。運輸計劃，26(2)，253-280。new window  延伸查詢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.韓復華、王國琛(2000)。巨集啓發式解法在求解大規模旅行推銷員問題之研究。臺北：逢甲大學。195-204。  延伸查詢new window
3.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
4.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
5.Colorni, A.、Dorigo, M.、Maniezzo, V.(1991)。Distributed Optimization by Ant Colonies。The First European Conference on Artificial Life。Paris：Elsevier。134-142。  new window
研究報告
1.Dorigo, M.、Maniezzo, V.、Colorni, A.(1991)。Positive Feedback as a Search Strategy。Milano：Dipartimento di Elettronica e Informatica, Politecnico di Milano。  new window
2.Dorigo, M.、Maniezzo, V.、Colorni, A.(1991)。The Ant System: An Autocatalytic Optimizing Process。Italy：Dipartimento di Elettronica e Informatica, Politecnico di Milano。  new window
3.王國琛(2000)。巨集啟發式解法在求解大規模旅行推銷員問題之應用 (計畫編號：NSC89-2815-C009-014-E)。國立交通大學運輸工程與管理學系。new window  延伸查詢new window
學位論文
1.Kohl, N.(1995)。Exact Methods for Time Constrained Routing and Related Scheduling Problems(博士論文)。Technical University of Denmark。  new window
2.Davenport, A.(1997)。GENET: A Connectionist Architecture for Constraint Satisfaction(博士論文)。University of Essex。  new window
3.王生德(2004)。以巨集啟發式方法求解時窗限制回程取貨車輛路線問題(VRPBTW)之研究(碩士論文)。中華大學。  延伸查詢new window
4.毛志奇(2004)。建立動態之人員派遣排程研究--以電腦資訊服務業為例(碩士論文)。屏東科技大學。  延伸查詢new window
5.曾慶勳(2007)。整合GPS與工時作業系統於叫修代理人系統之研究(碩士論文)。大葉大學。  延伸查詢new window
6.劉俊廷(2013)。導入行動報修系統對於外勤單位影響之探討(碩士論文)。中國文化大學。  延伸查詢new window
7.Dorigo, M.(1992)。Optimization, learning and natural algorithm(博士論文)。Politecnico di Milano，Italy。  new window
8.Stützle, T.(1998)。Local Search Algorithms for Combinatorial Problems--Analysis, Improvements and New Applications(博士論文)。Darmstadt University of Technology，Darmstadt, Germany。  new window
9.楊智凱(1995)。以門檻接受法改善TSP及VRP路網成本之研究(碩士論文)。國立交通大學。  延伸查詢new window
圖書
1.Dorigo, M.、Di Caro, G.(1999)。Ant Colony Optimization Meta-Heuristic。Mcgraw Hill。  new window
2.Stützle, T.、Dorigo, M.(1999)。Algorithms for the Traveling Salesman Problem, IRIDIA, Universit Libre de Bruxelles。Belgium：Universit Libre de Bruxelles。  new window
圖書論文
1.Desrosiers, J.、Dumas, Y.、Solomon, M. M.、Soumis, E(1995)。Time Constrained Routing and Scheduling。Network Routing。Elsevier。  new window
2.Stiitzle, T.、Hoos, H. H.(1998)。Improvements on the Ant System: Introducing the MAX-MIN Ant System。Artificial Neural Network and Genetic Algorithms。  new window
3.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

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

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