نتایج جستجو برای: coordinated quay crane scheduling and assignment problem
تعداد نتایج: 16932438 فیلتر نتایج به سال:
This paper addresses the joint quay crane and truck scheduling problem at a container terminal, considering the coordination of the two types of equipment to reduce their idle time between performing two successive tasks. For the unidirectional flow problem with only inbound containers, in which trucks go back to quayside without carrying outbound containers, a mixed-integer linear programming ...
The continuous berth allocation and quay crane assignment problem considers the size of berths ships, number cranes, dynamic ships non-crossing constraints cranes. In this work, a mixed-integer linear programming model is established, aiming at minimizing total stay time delay penalty ships. To solve model, separated into discrete segments via proposed discretization strategy. Thereafter, large...
Both of berth allocation and quay crane assignment are one of the most complex parts in container terminal operations, which significantly affect the operational efficiency, energy consumption and operational cost of the entire container terminal. Therefore, it is necessary to develop an efficient strategy for integrated berth allocation and quay crane assignment (BACP) from the perspective of ...
yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in...
The baseline plan of terminals will be impacted to a certain extent after being affected by uncertain events, such as vessel delay and unscheduled arrival, resulting in disorderly terminal operations, wasted resources, reduced loading unloading efficiency, which further aggravates congestion. To effectively cope with the disturbance operations above events improve operational efficiency contain...
The scheduling problem is one of the most important operation in maritime ports. In this study we solved for a single quay crane and multiple yard trucks port Tripoli-Lebanon. previous proposed two exact methods but faced large instances CPU time. For reason, paper developed heuristic method (genetic algorithm) to obtain near optimal solution with an acceptable main objective minimize completio...
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
Maritime transportation plays a crucial role in the international economy. Port container terminals around the world compete to attract more traffic and are forced to offer better quality of service. This entails reducing operating costs and vessel service times. In doing so, one of the most important problems they face is the Berth Allocation and quay Crane Assignment Problem (BACAP). This pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید