跳到主要內容

臺灣博碩士論文加值系統

(34.204.198.73) 您好!臺灣時間:2024/07/16 17:44
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:郭紋伶
研究生(外文):Wen-Ling Kuo
論文名稱:越庫作業系統之時窗車輛指派問題
論文名稱(外文):Truck Dock Assignment Problem in a Cross Docking System with Operational Time Constraint
指導教授:廖慶榮廖慶榮引用關係
指導教授(外文):Ching-Jong Liao
學位類別:碩士
校院名稱:國立臺灣科技大學
系所名稱:工業管理系
學門:商業及管理學門
學類:其他商業及管理學類
論文種類:學術論文
論文出版年:2010
畢業學年度:98
語文別:英文
論文頁數:29
中文關鍵詞:啟發式粒子群演算法越庫作業卡車指派問題
外文關鍵詞:HeuristicsParticle Swarm OptimizationCrossdockDock assignment
相關次數:
  • 被引用被引用:5
  • 點閱點閱:702
  • 評分評分:
  • 下載下載:177
  • 收藏至我的研究室書目清單書目收藏:0
越庫作業被認為是一個在供應鏈管理中能夠有效控制存貨流動的方法。在本論文中,我們探討越庫作業系統之時窗車輛指派問題。在這個模型之中,每台車輛都有時間窗的限制,且車輛數超過現有的碼頭數,此問題同時包含越庫作業系統中倉儲的容量限制。在本篇論文主要的目的是決定卡車的最佳指派,使得卡車停靠在碼頭的總運營成本和對未完成發貨的處罰成本最小化。此問題主要受三個因素影響:(1) 車輛到達和離開時間窗,(2) 碼頭間的運輸成本,(3) 越庫作業系統的總容量限制。我們提出兩個啟發法求解此問題,並配合粒子群演算法 (PSO)。實驗結果證明,該啟發式演算法比現有的禁忌搜索(TS)法在計算時間與結果上,表現均為優良,而 PSO也可在短的時間內得到近似最佳解。
In this paper, we consider a truck dock assignment problem with an operational time constraint in a crossdock where the number of trucks exceeds the number of docks available. The objective of the problem is to find an optimal truck dock assignment to minimize the sum of the total dock operational cost and the penalty cost for all the unfulfilled shipments. The problem is limited by the crossdock capacity where the cargo temporary storage. The problem feasibility is affected by three factors: the arrival and departure time windows of each truck, the operational time for the cargo shipments among the docks, and the total capacity available to the crossdock. Two heuristics are proposed in this paper for the problem. To obtain a better solution, a Particle Swarm Optimization (PSO) algorithm combined with the heuristics is also proposed. Computational experiments show that the heuristics alone perform better than an existing tabu search (TS) algorithm in terms of computation time and solution quality. The PSO algorithm also outperforms the TS algorithm when both employing the heuristics.
CHINESE ABSTRACT I
ENGLISH ABSTRACT II
LIST OF FIGURES IV
LIST OF TABLES V
Chapter 1 INTRODUCTION 1
1.1 Problem description 1
1.2 Research process and thesis organization 4
Chapter 2 LITERATURE REVIEW 7
Chapter 3 PROPOSED HEURISTIC 10
3.1 Heuristic 1 10
3.2 Heuristic 2 11
3.3 Adjusting infeasible solutions 12
Chapter 4 PARTICLE SWARM OPTIMIZATION 14
4.1 Velocity of PSO 14
4.2 PSO framework 15
Chapter 5 COMPUTATIONAL RESULTS 19
Chapter 6 CONCLUDING REMARKS AND FUTURE RESEARCH 26
6.1 Conclusions 26
6.2 Future studies 26
REFERENCES 28
Allahverdi, A. and Al-Anzi, F.S., A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Computers & Operations Research, 2006, 33, 1056–1080.
Apte, M. Uday, Viswanathan, S., Effective cross docking for improving distribution efficiencies. International Journal of Logistics: Research and Applications, 2000, 3, 291–302.
Babic, O., Teodorovic, D., Tosic, V., Aircraft stand assignment to minimize walking. Journal of Transportation Engineering, 1984, 110, 55–66.
Bartholdi, J. J. and Gue, K. R., The best shape for a crossdock. Transportation Science,2004, 38, 235–244.
Boysen N, Fliedner M., Cross dock scheduling: classification, literature review and research agenda. Omega, 2009, 38, 413–422
Chen, P., Guo, Y., Lim, A., and Rodrigues, B., Multiple crossdocks with inventory and time windows. Computers and Operations Research, 2006, 33, 43–63.
Ding, H., Lim, A., Rodrigues, B., Zhu, Y., New heuristics for the over-constrained flight to gate assignments. Journal of the Operational Research Society, 2004, 55, 760–768.
Ding, H., Lim, A., Rodrigues, B., Zhu, Y., The over-constrained airport gate assignment problem. Computers and Operational Research, 2005, 32, 1867–1880.
Eberhart RC, Kennedy J., A new optimizer using particle swarm theory. Proceedings of the sixth international symposium on micro machine and human science. IEEE Service Center. Piscataway, NJ, Nagoya, Japan, 1995, 39–43.
Lim, A., Miao, Z., Rodrigues, B., Xu, Z., Transshipment through crossdocks with inventory and time windows. Naval Research Logistics, 2005a, 52, 724.
Lim, A., Rodrigues, B., Zhu, Y., Airport gate scheduling with time windows. Artificial Intelligence Review, 2005b, 24, 5–31.
Kreng, V. B. and Chen, F. T., The benefits of a cross-docking delivery strategy: a supply chain collaboration approach. Production Planning & Control, 2008, 19, 229–241.
Settles, M., Soule, T., Breeding swarms: a GA/PSO hybrid, Proceedings of the 2005 conference on genetic and evolutionary computation, 2005, 161–168.
Miao, Z., Lim, A., Ma, H., Truck dock assignment problem with operational time constraint within crossdocks. European Journal of Operational Research, 2009, 105–115
Napolitano, M., Making the Move to Cross Docking. Warehousing Education and Research Council, 2000.
Nils Boysen, Truck scheduling at zero-inventory cross docking terminals. Computers & Operations Research, 2010, 37, 32–41
Obata, T., The quadratic assignment problem: Evaluation of exact and heuristic algorithms. Technical report, 2000.
Sung, C. S., Song, S. H., Integrated service network design for a cross-docking supply chain network. Journal of the Operational Research Society, 2003, 54, 1283–1295.
Vis, Iris F. A. and Roodbergen, K. J., Positioning of goods in a cross-docking environment. Computers & Industrial Engineering, 2008, 54, 677–689.
Yu, W., Egbelu, P.J., Scheduling of inbound and outbound trucks in cross docking systems with temporary storage. European Journal of Operational Research, 2008, 184, 377–396.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊