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

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：應用混合式粒子群演算法進行離散型船席及變動式橋式起重機指派
書刊名：運輸學刊
作者：徐賢斌 引用關係
作者(外文)：Hsu, Hsien-pin
出版日期：2017
卷期：29:1
頁次：頁1-33
主題關鍵詞：船席指派問題；橋式起重機指派問題；粒子群演算法；動態排序；Berth allocation problem；Quay crane assignment problem；Hybrid particle swarm optimization；Genetic algorithm
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:8
期刊論文
1.Yuan, X.、Wang, L.、Yuan, Y.(2008)。Application of enhanced PSO approach to optimal scheduling of hydro system。Energy Conversion and Management，49(11)，2966-2972。  new window
2.Tang, L.、Zhao, J.、Liu, J.(2014)。Modeling and solution of the joint quay crane and truck scheduling problem。European Journal of Operational Research，236(3)，978-990。  new window
3.Vis, I. F. A.、de Koster, R.(2003)。Transshipment of container at a container terminal: An overview。European Journal of Operational Research，147(1)，1-16。  new window
4.Bierwirth, Christian、Meisel, Frank(2010)。A survey of berth allocation and quay crane scheduling problems in container terminals。European Journal of Operational Research，202(3)，615-627。  new window
5.Wang, F.、Lim, A.(2007)。A stochastic beam search for the berth allocation problem。Decision Support Systems，42(4)，2186-2196。  new window
6.Imai, A.、Chen, H. C.、Nishimura, E.、Papadimitriou, S.(2008)。The simultaneous berth and quay crane allocation problem。Transportation Research Part E: Logistics and Transportation Review，44(5)，900-920。  new window
7.Meisel, F.、Bierwirth, C.(2009)。Heuristic for the integration of crane productivity in the berth allocation problem。Transportation Research Part E: Logistics and Transportation Review，45(1)，196-209。  new window
8.Raa, B.、Dullaert, W.、Schaeren, R. V.(2011)。An enriched model for the integrated berth allocation and quay crane assignment problem。Expert Systems with Applications，38(11)，14136-14147。  new window
9.Chang, D.、Jiang, Z. H.、Yan, W.、He, J. L.(2010)。Integrating berth allocation and quay crane assignments。Transportation Research Part E: Logistics and Transportation Review，46(6)，975-990。  new window
10.Han, X. L.、Lu, Z. Q.、Xi, L. F.(2010)。A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time。European Journal of Operational Research，207(3)，1327-1340。  new window
11.Liang, C.、Guo, J.、Yang, Y.(2011)。Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in birth allocation planning。Journal of Intelligent Manufacturing，22(3)，471-479。  new window
12.Liu, B.、Wang, L.、Jin, Y. H.(2008)。An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers。Computers & Operations Research，35(9)，2791-2806。  new window
13.Sha, D. Y.、Lin, H. H.(2010)。A multi-objective PSO for job-shop scheduling problems。Expert System with Applications，37(2)，1065-1070。  new window
14.Brown, G. G.、Lawphongpanich, S.、Thurman, K. P.(1994)。Optimizing ship berthing。Naval Research Logistics，41(1)，1-15。  new window
15.Imai, A.、Nagaiwa, K. I.、Tat, C. W.(1997)。Efficient planning of berth allocation for container terminals in Asia。Journal of Advanced Transportation，31(1)，75-94。  new window
16.Imai, A.、Nishimura, E.、Papadimitriou, S.(2003)。Berth allocation with service priority。Transportation Research Part B: Methodological，37(5)，437-457。  new window
17.Buhrkal, Z.、Zuglian, S.、Ropke, S.、Larsen, J.、Lusby, R.(2011)。Models for the discrete berth allocation problem: A computational comparison。Transportation Research Part E: Logistics and Transportation Review，47(4)，461-473。  new window
18.Xu, D.、Li, C. L.、Leung, J. Y. T.(2012)。Berth allocation with time-dependent physical limitations on vessels。European Journal of Operational Research，216(1)，47-56。  new window
19.Lee, Y.、Chen, C. Y.(2009)。An optimization heuristic for the berth scheduling problem。European Journal of Operational Research，196(2)，500-508。  new window
20.Zhen, L.、Lee, L. H.、Chew, E. P.(2011)。A decision model for berth allocation under uncertainty。European Journal of Operational Research，212(1)，54-68。  new window
21.Liang, C. J.、Huang, Y. F.、Yang, Y.(2009)。A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning。Computers & Industrial Engineering，56(3)，1021-1028。  new window
22.Giallombardo, G.、Moccia, L.、Salani, M.、Vacca, I.(2010)。Modeling and solving the Tactical Berth Allocation Problem。Transportation Research Part B: Methodological，44(2)，232-245。  new window
23.Zhang, C.、Zheng, L.、Zhang, Z.、Shi, L.、Armstrong, A. J.(2010)。The allocation of berths and quay cranes by using a sub-gradient optimization technique。Computers & Industrial Engineering，58(1)，40-50。  new window
24.Hansen, P.、Oǧuz, C.、Mladenović, N.(2008)。Variable neighborhood search for minimum cost berth allocation。European Journal of Operational Research，191(3)，636-649。  new window
25.Golias, M.、Portal, I.、Konur, D.、Kaisar, E.、Kolomvos, G.(2014)。Robust berth scheduling at marine container terminals via hierarchical optimization。Computers & Operations Research，41，412-422。  new window
26.Imai, A.、Nishimura, E.、Papadimitriou, S.(2001)。The dynamic berth allocation problem for a container port。Transportation Research Part B: Methodological，35(4)，401-417。  new window
27.Kim, K. H.、Moon, K. C.(2003)。Berth scheduling by simulated annealing。Transportation Research Part B: Methodological，37(6)，541-560。  new window
28.Ratnaweera, A.、Halgamuge, S. K.、Watson, H. C.(2004)。Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients。IEEE Transactions on Evolutionary Computation，8(3)，240-255。  new window
29.Bierwirth, C.、Meisel, F.(2015)。A Follow-up Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals。European Journal of Operational Research，244(3)，675-689。  new window
30.徐賢斌(20140300)。A HPSO Approach for Solving the Simultaneous Dynamic DBAP and QCAP in a Container Terminal。國立高雄海洋科大學報，28，97-117。new window  new window
31.Martins, M. S. R.、Fuchs, S. C.、Pando, L. U.、Lüders, R.、Delgado, M. R.(2013)。PSO with Path Relinking for Resource Allocation Using Simulation Optimization。Computers and Industrial Engineering，65(2)，322-330。  new window
32.Lin, S. Y.、Horng, S. J.、Kao, T. W.、Huang, D. K.、Fahn, C. S.、Lai, J. L.、Chen, R. J.、Kuo, I. H.(2010)。An Efficient Bi-Objective Personnel Assignment Algorithm Based on a Hybrid Particle Swarm Optimization Model。Expert System with Applications，37(12)，7825-7830。  new window
33.Ting, C. J.、Wu, K. C.、Chou, H.(2014)。Particles Warm Optimization Algorithm for the Berth Allocation Problem。Expert Systems with Applications，41(4)，1543-1550。  new window
34.Salido, M. A.、Mario, R. M.、Barber, F.(2012)。A Decision Support System for Managing Combinatorial Problems in a Container Terminal。Knowledge-based Systems，29，63-74。  new window
35.Wang, S.、Zheng, J.、Zheng, K.、Guo, J.、Liu, X.(2012)。Multi Resource Scheduling Problem Based on an Improved Discrete Particle Swarm Optimization。Physics Procedia，25，576-582。  new window
36.Türkoğulları, Y. B.、Takşın, Z. C.、Aras, N.、Altınel, İ. K.(2014)。Optimal Berth Allocation and Time-Invariant Quay Crane Assignment in Container Terminals。European Journal of Operational Research，235(1)，88-101。  new window
37.Zhou, P. F.、Kang, H. G.(2008)。Study on Berth and Quay-Crane Allocation under Stochastic Environment in Container Terminal。Systems Engineering--Theory and Practice，28(1)，161-169。  new window
38.Imai, A.、Sun, X.、Nishimura, E.、Papadimitriou, S.(2005)。Berth allocation in a container port: using a continuous location space approach。Transportation Research Part B: Methodological，39(3)，199-221。  new window
會議論文
1.Kennedy, J.、Eberhart, R. C.(1995)。Particle swarm optimization。IEEE International Conference on Neural Networks。IEEE Service Center。1942-1948。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

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

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