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

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：遺傳演算法於配送點選擇之應用
書刊名：資訊管理研究. 中央大學
作者：潘順興／陳振明 引用關係／陳稼興
作者(外文)：Pan, Steve／Chen, Jen-ming／Chen, Jiah-shing
出版日期：1997
卷期：2:1
頁次：頁49-75
主題關鍵詞：遺傳演算法；配送點選擇；最佳化；Genetic algorithms；Plant location problem；Optimization
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:27
　　　　　配送點位置的選擇是在規劃一個製造或服務配送網路時的一個核心問題。由於遺 傳算法對解答空間的要求較少，我們根據決策者的實際需要，建立了一個採用配送點設置及 關閉成本、貨物運送成本、以及貨物持有成本這三個重要因素的多因子非線性數學模型。另 外，我們針對突變在搜尋早期的重要性以及晚期造成偏差的缺失，提出了一個採用適性搜尋 策略的遺傳演算法，並以嚴謹的測試驗證此適性搜尋策略的效益。
　　　　　The application of genetic algorithms (GA) on the capacitated plant location problem is studied in this paper. Since GA imposes less constraints on the solution space, a more realistic plant location model is constructed with three most important factors: facility setup and closing costs, transportation cost, and inventory holding cost. In addition to constructing the new model, we incorporated an adaptive search strategy in traditional GA to improve its effectiveness. A large number of experiments were performed to demonstrate the effectiveness of this adaptive search strategy.
期刊論文
1.Hakimi, S. L.、Kuo, C.-C.(1991)。On a General Network Location-Production-Allocation Problem。European Journal of Operational Research，55(1)，31-45。  new window
2.Aikens, C. H.(1985)。Facility Location Models for Distribution Planning。European Journal of Operational Research，22(3)，263-279。  new window
3.Conway, D. G.、Venkatarmannan, M. A.(1994)。Genetic Search and the Dynamic Facility Layout Problem。Computers and Operations Research，21(8)，955-960。  new window
4.Akinc, U.、Khumawala, M.(1977)。An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem。Management Science，23，585-594。  new window
5.Baker, B. M.(1982)。Linear Relaxations of the Capacitated Warehouse Location Problem。Journal of the Operational Research Society，33，475-479。  new window
6.Barcelo, J.、Fernandex, E.、Jornsten, K. O.(1991)。Computational Results from a New Lagrangian Relaxation Algorithm for the Capacitated Plant Location Problem。European Journal of Operational Research，53，38-45。  new window
7.Brandeau, M. L.、Chiu, S. S.(1989)。An Overview of Representative Problems in Location Research。Management Science，35(6)，645-674。  new window
8.Chen, C.-L.、Vempati, V. S.、Aljaber, N.(1995)。An Application of Genetic Algorithm for Flow Shop Problems。European Journal of Operational Research，80，389-396。  new window
9.Christofides, N.、Beasley, J. E.(1983)。An algorithm for the Capacitated Warehouse Location Problem。Journal of the Operational Research Society，12，19-28。  new window
10.Qornuejols, G.、Sridharan, R.、Thizy, J. M.(1991)。A Comparison of .Heuristics and Relaxations for the Capacitated Plant Location Problem。European Journal of Operational Research，50，280-297。  new window
11.Davis, P. R.、Ray, T. L.(1969)。A Branch and Bound Algorithm for the Capacitated Facilities Location Problem。Naval Research Logistics Quarterly，16，331-344。  new window
12.Domschke, W.、Drexl, A.(1985)。ADD-Heuristics, Starting Procedures for Capacitated Plant Location Models。European Journal of Operational Research，21，47-53。  new window
13.Geoffrion, A. M.、McBride, R.(1978)。Lagrangean Relaxation Applied to the Capacitated Facility Location Problem。AIIE Trsmsactions，10，40-47。  new window
14.Houck, C. R.、Joines, J. A.、Kay, M. G.(1996)。Comparison of Genetic Algorithms, Random Restart and Two-Opt Switching for Solving Large Location-Allocation Problems。Computers and Operations Research，23，587-596。  new window
15.Jacobson, S. K.(1983)。Heuristics for the Capacitated Plant Location Model。European Journal of Operational Research，12，253-261。  new window
16.Khumawala, B. M.(1974)。An Efficient Heuristic Procedure for the Capacitated Warehouse Location Problem。Naval Research Logistics Quarterly，21，609-623。  new window
17.Kroger, B.(1995)。Guillotineable Bin Packing: A Genetic Approach。European Journal of Operational Research，84，645-661。  new window
18.Lee, C. Y.、Choi, J. Y.(1995)。A Genetic Algorithm for Job Sequencing Problems with Distinct Due Dates and General Early-Tardy Penalty Weights。Computers and Operations Research，22，857-869。  new window
19.Nauss, R. M.(1978)。An Improved Algorithm for the Capacitated Facility Location Problem。Journal of the Operational Research Society，29，1195-1201。  new window
20.Nordstorm, A.-L.、Tufekci, S.(1994)。A Genetic Algorithm for the Talent Scheduling Problem。Computers and Operations Research，21，927-940。  new window
21.Pirkul, H.(1989)。The Uncapacitated Facility Location Problem with Primary and Secondary Facility Requirements。HE Transactions，21，337-348。  new window
22.Sa, G.(1969)。Approximate Solutions to the Capacitated Plant Location Problem。Opersitions Research，17，1005-1016。  new window
23.Sridharan, R.(1995)。The Capacitated Plant Location Problem。European Journal of Operational Research，87，203-213。  new window
24.Thomas, J.(1995)。Down But Not Out。Distribution，94，6-14。  new window
25.Van Roy, T. J.(1986)。A Cross Decomposition Algorithm for Capacitated Facility Location。Operations Research，34(1)，145-163。  new window
26.Srinivas, M.、Patnaik, L. M.(1994)。Genetic Algorithms: A Survey。IEEE Computer，27(6)，17-26。  new window
圖書
1.Goldberg, D. E.(1991)。Genetic Algorithms in Search, Optimization, and Machine Learning。New York, NY：Adision-Wesley Publishing Company。  new window
2.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.Hunter, A.(1995)。SUGAL User Manual，http://www.tra.jan-software.demon.co.uk。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

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

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