نتایج جستجو برای: coordinated quay crane scheduling and assignment problem

تعداد نتایج: 16932438  

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

2012
Mario Rodríguez-Molins Federico Barber María R. Sierra Jorge Puente Miguel A. Salido

Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a...

2009
Giovanni Giallombardo Luigi Moccia Matteo Salani Ilaria Vacca

In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). We present two formulations: a mixed intege...

Journal: :Transportation Science 2013
Ilaria Vacca Matteo Salani Michel Bierlaire

In this paper we study the simultaneous optimization of berth allocation and quay crane assignment in seaport container terminals. We propose a model based on an exponential number of variables that is solved via column generation. An exact branch-and-price algorithm is implemented to produce optimal integer solutions to the problem. In particular, we present several accelerating techniques for...

2007
Der-Horng Lee Hui Qiu Wang Lixin Miao

Nowadays competition between port container terminals, especially between geographically close ones, is rapidly increasing. How to improve the competitiveness of port container terminals is, therefore, an immediate challenge, with which port operators are confronted. In terms of port competitiveness, the makespan of a container vessel, which is the latest completion time among all handling task...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید