- -

A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds

Show simple item record

Files in this item

dc.contributor.author Rodríguez Molins, Mario es_ES
dc.contributor.author Salido Gregorio, Miguel Angel es_ES
dc.contributor.author Barber Sanchís, Federico es_ES
dc.date.accessioned 2015-11-16T08:57:34Z
dc.date.available 2015-11-16T08:57:34Z
dc.date.issued 2014-03
dc.identifier.issn 0924-669X
dc.identifier.uri http://hdl.handle.net/10251/57498
dc.description.abstract Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing position, a berthing time, and a number of Quay Cranes to each vessel. This problem is known as the Berth Allocation Problem and the Quay Crane Assignment Problem. Holds of vessels are also managed in order to obtain a more realistic approach. Our aim is to minimize the total waiting time elapsed to serve all these vessels. In this paper, we deal with the above problems and propose an innovative metaheuristic approach. The results are compared against other allocation methods. es_ES
dc.description.sponsorship This work has been partially supported by the research projects TIN2010-20976-C02-01 (Ministerio de Ciencia e Innovacion, Spain) the fellowship program FPU (AP2010-4405), and also with the collaboration of the maritime container terminal MSC (Mediterranean Shipping Company S.A.). en_EN
dc.language Inglés es_ES
dc.publisher Springer Verlag (Germany) es_ES
dc.relation Ministerio de Ciencia e Innovacion, Spain TIN2010-20976-C02-01 es_ES
dc.relation Ministerio de Ciencia e Innovacion, Spain AP2010-4405 es_ES
dc.relation.ispartof Applied Intelligence es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Planning es_ES
dc.subject Scheduling es_ES
dc.subject Optimization methods es_ES
dc.subject Algorithms es_ES
dc.subject Metaheuristic es_ES
dc.subject GRASP es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1007/s10489-013-0462-4
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació es_ES
dc.description.bibliographicCitation Rodríguez Molins, M.; Salido Gregorio, MA.; Barber Sanchís, F. (2014). A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds. Applied Intelligence. 40(2):273-290. doi:10.1007/s10489-013-0462-4 es_ES
dc.description.accrualMethod Senia es_ES
dc.relation.publisherversion http://dx.doi.org/10.1007/s10489-013-0462-4 es_ES
dc.description.upvformatpinicio 273 es_ES
dc.description.upvformatpfin 290 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 40 es_ES
dc.description.issue 2 es_ES
dc.relation.senia 249329
dc.identifier.eissn 1573-7497
dc.relation.references Ayvaz D, Topcuoglu H, Gurgen F (2012) Performance evaluation of evolutionary heuristics in dynamic environments. Appl Intell 37(1):130–144 es_ES
dc.relation.references Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202(3):615–627 es_ES
dc.relation.references Cheong C, Tan K, Liu D (2009) Solving the berth allocation problem with service priority via multi-objective optimization. In: IEEE symposium on computational intelligence in scheduling, 2009, CI-sched ’09, pp 95–102 es_ES
dc.relation.references Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: status and perspectives. Transp Sci 38(1):1–18 es_ES
dc.relation.references Consultants DS (2010) Global container terminal operators annual review and forecast. Annual Report es_ES
dc.relation.references Cordeau J, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth-allocation problem. Transp Sci 39(4):526–538 es_ES
dc.relation.references Daganzo C (1989) The crane scheduling problem. Transp Res, Part B, Methodol 23(3):159–175 es_ES
dc.relation.references Feo T, Resende M (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109–133 es_ES
dc.relation.references Festa P, Resende MG (2009) An annotated bibliography of grasp–part ii: applications. Int Trans Oper Res 16(2):131–172 es_ES
dc.relation.references Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res, Part B, Methodol 44(2):232–245 es_ES
dc.relation.references Guan Y, Cheung R (2004) The berth allocation problem: models and solution methods. OR Spektrum 26(1):75–92 es_ES
dc.relation.references Henesey L (2006) Overview of transshipment operations and simulation. In: MedTrade conference, Malta, April 2006, pp 6–7 es_ES
dc.relation.references Imai A, Nagaiwa K, Tat C (1997) Efficient planning of berth allocation for container terminals in Asia. J Adv Transp 31(1):75–94 es_ES
dc.relation.references Imai A, Chen H, Nishimura E, Papadimitriou S (2008) The simultaneous berth and quay crane allocation problem. Transp Res, Part E, Logist Transp Rev 44(5):900–920 es_ES
dc.relation.references Kim K, Günther H (2006) Container terminals and cargo systems. Springer, Berlin es_ES
dc.relation.references Kim KH, Park YM (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156(3):752–768 es_ES
dc.relation.references Lai KK, Shih K (1992) A study of container berth allocation. J Adv Transp 26(1):45–60 es_ES
dc.relation.references Lambrechts O, Demeulemeester E, Herroelen W (2008) Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities. J Sched 11(2):121–136 es_ES
dc.relation.references Lee D, Wang H, Miao L (2008) Quay crane scheduling with non-interference constraints in port container terminals. Transp Res, Part E, Logist Transp Rev 44(1):124–135 es_ES
dc.relation.references Lee DH, Chen JH, Cao JX (2010) The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp Res, Part E, Logist Transp Rev 46(6):1017–1029 es_ES
dc.relation.references Liang C, Huang Y, Yang Y (2009) A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput Ind Eng 56(3):1021–1028 es_ES
dc.relation.references Lim A (1998) The berth planning problem. Oper Res Lett 22(2–3):105–110 es_ES
dc.relation.references Liu J, Wan YW, Wang L (2006) Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav Res Logist 53(1):60–74 es_ES
dc.relation.references Meisel F, Bierwirth C (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Transp Res, Part E, Logist Transp Rev 45(1):196–209 es_ES
dc.relation.references Mohi-Eldin E, Mohamed E (2010) The impact of the financial crisis on container terminals (a global perspectives on market behavior). In: Proceedings of 26th international conference for seaports & maritime transport es_ES
dc.relation.references Park Y, Kim K (2003) A scheduling method for berth and quay cranes. OR Spektrum 25(1):1–23 es_ES
dc.relation.references Peterkofsky R, Daganzo C (1990) A branch and bound solution method for the crane scheduling problem. Transp Res, Part B, Methodol 24(3):159–172 es_ES
dc.relation.references Rodríguez-Molins M, Salido MA, Barber F (2010) Domain-dependent planning heuristics for locating containers in maritime terminals. In: Proceedings of the 23rd international conference on industrial engineering and other applications of applied intelligent systems. LNCS, vol 6096. Springer, Berlin, pp 742–751 es_ES
dc.relation.references Rodriguez-Molins M, Salido M, Barber F (2012) Intelligent planning for allocating containers in maritime terminals. Expert Syst Appl 39(1):978–989 es_ES
dc.relation.references Salido M, Sapena O, Barber F (2009) An artificial intelligence planning tool for the container stacking problem. In: Proceedings of the 14th IEEE international conference on emerging technologies and factory automation, pp 532–535 es_ES
dc.relation.references Salido MA, Rodriguez-Molins M, Barber F (2012) A decision support system for managing combinatorial problems in container terminals. Knowl-Based Syst 29:63–74 es_ES
dc.relation.references Stahlbock R, VoßS (2008) Operations research at container terminals: a literature update. OR Spektrum 30(1):1–52 es_ES
dc.relation.references Steenken D, VoßS, Stahlbock R (2004) Container terminal operation and operations research-a classification and literature review. OR Spektrum 26(1):3–49 es_ES
dc.relation.references Szlapczynski R, Szlapczynska J (2012) On evolutionary computing in multi-ship trajectory planning. Appl Intell 37:155–174 es_ES
dc.relation.references Theofanis S, Boile M, Golias M (2009) Container terminal berth planning. Transp Res Rec 2100:22–28 es_ES
dc.relation.references ValenciaPort F (2009) Automation and simulation methodologies for assessing and improving the capacity, performance and service level of port container terminals. Ministerio de Fomento (P19/08), Spain es_ES
dc.relation.references Vis I, De Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147:1–16 es_ES


This item appears in the following Collection(s)

Show simple item record