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

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：以先集群再定路線法求解多桶格車輛途程問題
書刊名：管理資訊計算
作者：林高正／曾文宏／陳建甫／蔡巧卿
作者(外文)：Lin, Kao-cheng／Tseng, Wen-hung／Chen, Chien-fu／Tsai, Chiao-ching
出版日期：2017
卷期：6:特刊1
頁次：頁149-160
主題關鍵詞：多桶格車輛途程問題；桶格限制；相容限制；啟發式解法；先集群再定路線法；Multi-compartments vehicle routing problem；Compartment constraint；Compatibility constraint；Heuristic algorithm；Cluster-first route-second
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(2) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:5
本文在探討如何以先集群再定路線啟發式解法求解多桶格車輛途程問題。除常見的容量限制與時窗限制外，多桶格車輛途程問題還具有桶格限制、相容限制與指定限制，是個具多重限制困難的NP-hard問題。對具多重限制困難的NP-hard問題而言，傳統啟發式解法不論是在實務應用、分枝與界限法之界限函數設計、或基因演算法之起始族群建立和遺傳算子設計上均扮演著重要的角色。
In this paper, a cluster-first route-second heuristic is proposed to solve the multi-compartments vehicle routing problem. In addition to the classical capacity and time-window constraints, this problem also has compartment, compatibility, and assignment constraints. It is not only an NP-hard problem in strong sense, but also has multiple constraints. For such a problem, heuristic algorithms can be used in solving practical problems, deriving bounding functions for a branch and bound algorithm, and generating the initial population and designing genetic operators for a genetic algorithm.
期刊論文
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.Martel, C.(2002)。The expected complexity of Prim's minimum spanning tree algorithm。Information Processing Letters，81(4)，197-201。  new window
8.Prim, R. C.(1957)。Shortest connection networks and some generalizations。Bell System Technical Journal，36(6)，1389-1401。  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.Gen, Mitsuo、Cheng, Runwei(1997)。Genetic Algorithms and Engineering Design。John Wiley & Sons。  new window
2.Han, J.、Kamber, M.(2001)。Data mining: Concepts and techniques。San Francisco：Morgan Kaufmann Publishers。  new window
3.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
4.Golden, B.、Raghavan, S.、Wasil, E.(2008)。The Vehicle Routing Problem: Latest Advances and New Challenges。New York：Springer。  new window
5.Golden, B.、Assad, A. A.(1988)。Vehicle Routing: Methods and Studies。North-Holland：Elsevier Science Publisher B.V.。  new window
6.Reinelt, G.(1994)。The Traveling Salesman: Computational Solutions for TSP Applications。Berlin：Springer-Verlag。  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.Ahuja, R. K.、Orlin, J. B.、Magnanti, T. L.(1993)。Network Flows: Theory, Algorithms, and Applications。Prentice-Hall。  new window
10.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
圖書論文
1.Bramel, J.、Simichi-Levi, D.(2002)。Set-covering-based algorithms for the capacitated VRP。The Vehicle Routing Problem。Philadelphia：Society for Industrial and Applied Mathematics。  new window
2.Christofides, N.(1985)。Vehicle routing。The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization。Chichester：John Wiley & Sons。  new window
3.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
4.Laporte, G.、Semet, F.(2002)。Classical heuristics for the capacitated VRP。The Vehicle Routing Problem。Philadelphia, PA：Society for Industrial and Applied Mathematics。  new window
5.Laporte, G.、Nobert, Y.(1987)。Exact algorithms for the vehicle routing problem。Surveys in Combinatorial Optimization。Amsterdam：North-Holland。  new window
6.Laporte, G.(1997)。Vehicle routing。Annotated Bibliographies in Combinatorial Optimization。Chichester：Wiley。  new window
7.Naddef, D.、Rinaldi, G.(2002)。Branch-and-cut algorithms for the capacitated VRP。The Vehicle Routing Problem。Philadelphia：Society for Industrial and Applied Mathematics。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

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

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