A domain-specific knowledge-based heuristic for the Blocks Relocation Problem
Tóm tắt
Từ khóa
Tài liệu tham khảo
Boysen, 2010, Determining crane areas in intermodal transshipment yards: the yard partition problem, Eur. J. Oper. Res., 204, 336, 10.1016/j.ejor.2009.10.031
Caserta, 2009, A new binary description of the blocks relocation problem and benefits in a look ahead heuristic, vol. 5482, 37
Caserta, 2011, Container rehandling at maritime container terminals, vol. 49, 247
Caserta, 2012, A mathematical formulation and complexity considerations for the blocks relocation problem, Eur. J. Oper. Res., 219, 96, 10.1016/j.ejor.2011.12.039
Caserta, 2011, Applying the corridor method to a blocks relocation problem, OR Spectrum, 33, 915, 10.1007/s00291-009-0176-5
Casey, 2012, Optimising container storage processes at multimodal terminals, J. Oper. Res. Soc., 63, 1126, 10.1057/jors.2011.113
Dechter, 1985, Generalized best-first search strategies and the optimality of A∗, J. ACM, 32, 505, 10.1145/3828.3830
Dekker, 2007, Advanced methods for container stacking, 131
Delling, 2009, Engineering route planning algorithms, vol. 5515, 117
Expósito-Izquierdo, 2012, Pre-marshalling problem: heuristic solution method and instances generator, Expert Syst. Appl., 39, 8337, 10.1016/j.eswa.2012.01.187
Forster, 2012, A tree search procedure for the container relocation problem, Comput. Oper. Res., 39, 299, 10.1016/j.cor.2011.04.004
Gutiérrez, 2011, Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem, Knowl.-Based Syst., 24, 102, 10.1016/j.knosys.2010.07.010
Ishino, 2006, An information value based approach to design procedure capture, Adv. Eng. Inform., 20, 89, 10.1016/j.aei.2005.04.002
Kim, 2006, A heuristic rule for relocating blocks, Comput. Oper. Res., 33, 940, 10.1016/j.cor.2004.08.005
Kozan, 2006, Mathematical modelling of container transfers and storage locations at seaport terminals, OR Spectrum, 28, 519, 10.1007/s00291-006-0048-1
Lee, 2007, An optimization model for the container pre-marshalling problem, Comput. Oper. Res., 34, 3295, 10.1016/j.cor.2005.12.006
Lee, 2010, A heuristic for retrieving containers from a yard, Comput. Oper. Res., 37, 1139, 10.1016/j.cor.2009.10.005
Ng, 2005, Yard crane scheduling in port container terminals, Appl. Math. Modell., 29, 263, 10.1016/j.apm.2004.09.009
Nickerson, 1994, The teaching of thinking and problem solving, 409
Petering, 2009, Effect of block width and storage yard layout on marine container terminal performance, Transp. Res. Part E: Logist. Transp. Rev., 45, 591, 10.1016/j.tre.2008.11.004
Rijsenbrij, 2011, Sustainable container terminals: a design approach, vol. 49, 61
Rothlauf, 2009, On the bias and performance of the edge-set encoding, IEEE Trans. Evol. Comput., 13, 486, 10.1109/TEVC.2008.2008799
Rothlauf, 2011
Schalkoff, 2011
Sheskin, 2007
Stahlbock, 2008, Operations research at container terminals: a literature update, OR Spectrum, 30, 1, 10.1007/s00291-007-0100-9
Steenken, 2004, Container terminal operation and operations research – a classification and literature review, OR Spectrum, 26, 3, 10.1007/s00291-003-0157-z
Vazirani, 2003
Vis, 2006, A comparative analysis of storage and retrieval equipment at a container terminal, Int. J. Prod. Econ., 103, 680, 10.1016/j.ijpe.2006.01.002
Vis, 2003, Transshipment of containers at a container terminal: an overview, Eur. J. Oper. Res., 147, 1, 10.1016/S0377-2217(02)00293-X
Yan, 2011, An investigation into knowledge-based yard crane scheduling for container terminals, Adv. Eng. Inform., 25, 462, 10.1016/j.aei.2011.03.001
Zhang, 2010, An investigation of ida∗ algorithms for the container relocation problem, vol. 6096, 31