An investigation into berth allocation and quay crane assignment based on hybrid parallel genetic algorithm

2009 International Conference on Artificial Intelligence and Computational Intelligence, AICI 2009

Volumn 2, Issue , 2009, Pages 48-53

  He, Junliang ^a   Mi, Weijian ^a   Chang, Daofang ^b   Yan, Wei ^a  

^a SHANGHAI MARITIME UNIVERSITY   (China)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Berth allocation; Heuristic algorithm; Objective programming; Parallel genetic algorithm; Quay crane assignment; Rolling horizon technique

Indexed keywords

BERTH ALLOCATION; OBJECTIVE PROGRAMMING; PARALLEL GENETIC ALGORITHMS; QUAY CRANE ASSIGNMENT; QUAY CRANES;

ARTIFICIAL INTELLIGENCE; CRANES; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; PORT TERMINALS; TRANSFER CASES (VEHICLES);

ELECTRIC LOAD FORECASTING;

EID: 77949285171     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AICI.2009.41     Document Type: Conference Paper

References (10)

1. Dirk, S., Stefan, V. and Robert, S, "Container terminal operation and operations research - a classification and literature review," OR Spectrum, vol.26, Jan.2004, pp. 3-49, doi: 10.1007/s00291-003-0157-z
2. Robert, S. and Stefan, V, "Operations research at container terminals: a literature update," OR Spectrum, vol.30, Jan.2008, pp. 1-52, doi: 10.1007/s00291-007-0100-9.
3. Imai, A., Nishimura, E. and Papadimitriou, S, "The dynamic berth allocation problem for a container port," Transportation Research Part B: Methodological, vol. 35, May.2001, pp.401-417, doi:10.1016/S0191-2615(99) 00057-0.
4. Imai, A., Sun, X., Nishimura, E., Papadimitriou, S, "Berth allocation in a container port: using a continuous location space approach," Transportation Research Part B, vol. 39, Mar.2005, No. 3, pp. 199-221, doi:10.1016/j.trb.2004.04.004.
5. Chang, D.F., Yan, W., Chen, C.H., Jiang, Z.H, "A berth allocation strategy using heuristics algorithm and simulation optimization," International Journal of Computer Applications in Technology, vol.32, Nov.2008, pp. 272-281, doi:10.1504/IJCAT.2008.021382.
6. Peterkofsky, R. I., Daganzo, C. F, "A branch and bound solution method for the crane scheduling problem," Transportation Research Part B, vol. 24, Jun.1990, pp.159-172, doi:10.1016/0191-2615(90)90014-P .
7. Meisel,F., and Bierwirth, C, "Heuristics for the integration of crane productivity in the berth allocation problem," Transportation Research Part E: Logistics and Transportation Review, vol.45, Jan.2009, pp.196-209, doi:10.1016/j.tre.2008.03.001.
8. Zhang, C. Q., Liu, J. Y., Wan, Y. W., Murty, K. G. (2003). "Storage space allocation in container terminals," Transportation Research Part B, vol.37, Dec.2003, pp. 883-903, doi:10.1016/S0191-2615(02)00089-9.
9. He, J.L., Chang, D.F., Mi, W.J., Yan, W, "A strategy for yard crane scheduling based on hybrid parallel genetic algorithm," Proc. IEEE Symp.Knowledge Acquisition and Modeling(KAM2008), IEEE Press, Dec. 2008, pp.678-683,doi: 10.1109/KAM.2008.81.
10. Xie C, Yan, W, "An investigation into bay allocation model and algorithm for outbound containers," Proc. IEEE Symp.Knowledge Acquisition and Modeling(KAM2008), IEEE Press, Dec. 2008, pp.672-677,doi: 10.1109/KAM.2008.80.