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

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：以混合基因演算法求解多桶格車輛途程問題
書刊名：管理資訊計算
作者：林高正 引用關係／曾文宏／陳建甫／蔡巧卿
作者(外文)：Lin, Kao-cheng／Tseng, Wen-hung／Chen, Chien-fu／Tsai, Chiao-ching
出版日期：2018
卷期：7:特刊1
頁次：頁126-136
主題關鍵詞：多桶格車輛途程問題；桶格限制；相容限制；基因演算法；先分群再定路線法；Multi-compartments vehicle routing problem；Compartment constraint；Compatibility constraint；Genetic algorithm；Cluster-first route-second
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:1
  • 點閱點閱:5
本研究提出一個求解多桶格車輛途程問題的混合基因演算法。除常見的容量限制與時窗限制外，這問題還具有桶格限制、相容限制與指定限制，是個具多重限制的困難NP-hard問題，實務上通常採用啟發式解法求解。而對困難NP-hard問題而言，傳統啟發式解通常存在著相當的改進空間，因此有必要利用有效的搜尋機制加以改良。本文就在探討如何以基因搜尋機制改良林高正、曾文宏、陳建甫、蔡巧卿(2017)所提出的先分群再定路線啟發式解，並進行數值實驗以比較相關解法。
The multi-compartments vehicle routing problem is not only an NP-hard problem in strong sense, but also has multiple constraints. In addition to the classical capacity and time-window constraints, this problem also has compartment, compatibility, and assignment constraints. For such a problem, a solution found by traditional heuristics usually can be improved by using a searching scheme. In this paper, a hybrid genetic algorithm for the multi-compartments vehicle routing problem, that uses the cluster-first route-second heuristic proposed by Lin, Tseng, Chen, and Tsai (2017) to generate the initial population and to design the related genetic operators, is proposed.
期刊論文
1.Laporte, G.、Osman, I. H.(1995)。Routing Problems: A Bibliography。Annals of Operations Research，61，227-262。  new window
2.Braysy, O.、Gendreau, M.(2005)。Vehicle routing problem with time windows, part II: Metaheuristics。Transportation Science，39(1)，119-139。  new window
3.Braysy, O.、Gendreau, M.(2005)。Vehicle routing problem with time windows, Part I: Route construction and local search algorithms。Transportation Science，39(1)，104-118。  new window
4.Desrochers, M.、Lenstra, J. K.、Savelsbergh, M.(1990)。A classification scheme for vehicle routing and scheduling problems。European Journal of Operational Research，46(3)，322-332。  new window
5.Laporte, G.(1992)。The vehicle routing problem: An overview of exact and approximate algorithms。European Journal of Operational Research，59(3)，345-358。  new window
6.Toth, P.、Vigo, D.(2002)。Models, relaxations and exact approaches for the capacitated vehicle routing problem。Discrete Applied Mathematics，123(1-3)，487-512。  new window
7.Prim, R. C.(1957)。Shortest connection networks and some generalizations。Bell System Technical Journal，36(6)，1389-1401。  new window
8.林高正、曾文宏、陳建甫、蔡巧卿(20170800)。以先集群再定路線法求解多桶格車輛途程問題。管理資訊計算，6(特刊1)，149-160。new window  延伸查詢new window
9.Dantzig, George B.、Ramser, J. H.(1959)。The Truck Dispatching Problem。Management Science，6(1)，80-91。  new window
研究報告
1.Christofides, N.(1976)。Worst-case analysis of a new heuristic for the travelling salesman problem。Pittsburgh：Carnegie-Mellon University。  new window
學位論文
1.陳建甫(2006)。以基因搜尋法求解多桶格車輛途程問題(碩士論文)。南台科技大學。  延伸查詢new window
圖書
1.Myers, Raymond H.、Montgomery, Douglas C.(2002)。Response Surface Methodology: Process and Product Optimization Using Designed Experiments。New York：John Wiley & Sons。  new window
2.Gen, Mitsuo、Cheng, Runwei(1997)。Genetic Algorithms and Engineering Design。John Wiley & Sons。  new window
3.Reinelt, G.(1994)。The Traveling Salesman: Computational Solutions for TSP Applications。Springer-Verlag。  new window
4.Golden, B. L.、Assad, A. A.(1988)。Vehicle Routing: Methods and Studies。Elsevier Science Publishers B.V.。  new window
5.Ball, M. O.、Magnanti, T. L.、Monma, C. L.、Nemhauser, G. L.(1995)。Handbooks in Operations Research and Management Science, Volume 8: Network Routing。Amsterdam：Elsevier Science。  new window
6.Golden, B.、Raghavan, S.、Wasil, E.(2008)。The Vehicle Routing Problem: Latest Advances and New Challenges。New York：Springer。  new window
7.Toth, P.、Vigo, D.(2002)。The Vehicle Routing Problem。Philadelphia, PA：Society for Industrial and Applied Mathematics。  new window
8.Toth, P.、Vigo, D.(2014)。Vehicle Routing: Problems, Methods, and Applications。Philadelphia, PA：Society for Industrial and Applied Mathematics。  new window
9.Horowitz, E.、Sahni, S.、Rajasrkaran, S.(1997)。Computer Algorithms/C++。New York：Computer Science Press。  new window
10.Ahuja, R. K.、Orlin, J. B.、Magnanti, T. L.(1993)。Network Flows: Theory, Algorithms, and Applications。Prentice-Hall。  new window
11.Goldberg, David Edward(1989)。Genetic algorithms in search, optimization, and machine learning。Addison-Wesley。  new window
12.Holland, J. H.(1975)。Adaptation in Natural and Artificial Systems: An Introductory Analysis with Application to Biology, Control, and Artificial Intelligence。MI：University of Michigan Press。  new window
圖書論文
1.Christofides, N.(1985)。Vehicle routing。The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization。Chichester：John Wiley & Sons。  new window
2.Gendreau, M.、Larporte, G.、Potvin, J.-Y.(2002)。Metaheuristics for the capacitated VRP。The Vehicle Routing Problem。Philadelphia, PA：Society for Industrial and Applied Mathematics。  new window
3.Laporte, G.、Nobert, Y.(1987)。Exact algorithms for the vehicle routing problem。Surveys in Combinatorial Optimization。Amsterdam：North-Holland。  new window
4.Laporte, G.(1997)。Vehicle routing。Annotated Bibliographies in Combinatorial Optimization。Chichester：Wiley。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

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

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