中英文对照外文翻译
飞鸽传输
(文档含英文原文和中文翻译)
原文:糯米酒
The optimization of container berths and shore bridge coordination scheduling Abstract
The global economic development, the container quickly raid up into exports. Rapid growth of the import and export cargo throughput brings to the container terminal larger benefits at the same time increa the burden of the port, have higher requirements on the terminal operation efficiency. How is the existing equipment of container terminals, reasonable resource allocation and scheduling, is common problem facing the container terminal. Therefore, how to improve the terminal facilities such as the maximum utilization of resources, to meet the increasing port demand, improve their competitive advantage, and has more practical meaning to improve the working efficiency of the container terminal. The main content of this study is berth, gantry cranes and t card co-allocation rearch, has plans to all ship to the port assignments during mathematical model is established with the target of
网络访问控制minimum cost, according to the characteristics of the scale model by genetic algorithm, finally validates the effectiveness of the model.
Keywords: System engineering; Water transportation; Gantry cranes allocation; Dynamic scheduling;
1 Introduction
Container terminal logistics is an organic system, made of interactive and dy namic components, such as containers, ships, berths, yards, tracks, quay cranes and yard cranes trucks, labors and communications, in a limited terminal space. It is a complex discrete event dynamic system related to kinds of complicated problems in l ogistics transport field.
Berth scheduling (berth allocation) refers to the vesl arrival before or after according to each berth free condition and physical condition of the constraint for ship berthing berth and berthing order. To port berth scheduling optimization rearch has made important progress, but rearch is only limited to the single scheduling berth and shore bridge. Of berth scheduling problem in recent years has been bad on simple berth scheduling considering more factors, but only for gantry cranes operating quence when performing a specific loading and unloading of microscopic optimization. Container ships in the port of time depend on how well the berth scheduling on one hand, on the other hand depends on the completion of tasks of gantry cranes loading and unloading time. Gantry cranes loading and unloading time tasks assigned by the Shore Bridge and gantry cranes schedulin
连锁砌块g two link form. Gantry cranes allocation is reasonably allocated to the ship to shore bridge. Scheduling is a bridge across the river shore bridge between loading and unloading task scheduling. For container terminal how to out of berth allocation, and collaborative scheduling shore bridge t card effective allocation and the arrangement of the container yard, etc are the main factors influencing the efficiency of port operations.
2 Literature review
Berth, gantry cranes and t card configuration and operation quality directly determines the operational efficiency of container ports. Container port whether can
meet customer demand depends on whether the scheduling of a better, affecting the competitiveness of the port. So how to coordinate the three configurations and scheduling caud the wide attention of scholars both at home and abroad. Most experts and scholars in different circumstances port hardware facilities according to the different methods of berth, gantry cranes, t card and etc were studied. In recent years, the berth, shore and t scheduling and allocation problem of study to become a hot topic, scholars in a wide range of further rearch.
2.1 Rearch on berth allocation problem
Edmond will berth allocation problem as queuing theory for the first time, and establish the mathematical model rearch berth allocation problem. Lai and Shih to adopt rules first come first rvice berth allocation problem, and design the corresponding heuristic algorithm for the optimization of the mathematical model of the berth allocation, and to obtain the berth allocation to wait for the mooring time, and the average berth utilization indicators for evaluation. Prove the feasibility of obtained berth allocation scheme. Kiin mixed integer programming model is established to study the for large container ship berth allocation problem to determine the ship docked location and time, the design of simulated annealing algorithm to solve the model. Since then, many scholars study of berth allocation problem scheme compared with Kim. Imai respectively studied and dynamic to static to the port to port berth allocation problem, at the same time the berth allocation in the process of container ship is introduced into the berth time priority, berth allocation was studied for the ship to port. Later, Mr Imai and Sun to adopt continuous geographical space to study the method of continuous berth allocation, established the mathematical model of the minimum vesl waiting time and operation time and coefficient using LaGrange relaxation algorithm to solve. Hann, considering the schedule and ship docked preference location problems, such as tting the berth scheduling optimization goal for waiting time while minimizing of the ship. At the same time describes what preference position of the ship is. Lee also adopt the rules of first come first rvice t有一点不准打一字
o rearch into the port ship berth allocation problem, design the corresponding heuristic algorithm to solve the berth allocation model. After this, Lee
詹姆斯乔伊斯and ship at the port of all rearch cycle to overall in the shortest time continuous berth allocation problem for the target rearch, through random greedy adaptive arch algorithm to solve the model.
2.2 Rearch on Shore Bridge factors problem
Diazole in 1989 for the first time put forward the concept of gantry cranes scheduling by the author and a mixed integer programming model was established to solve the model to determine the distribution of each ship to the shore bridge. Park and Kim first studied the static to the port of berth and gantry cranes scheduling problem. Lim under interference constraint made the gantry cranes scheduling decisions made by a branch and bound method will be a period of time the latest ship to minimize the departure time of this algorithm ability is limited but simulated annealing method feasible solution can be obtained for the same question then also has ud the genetic algorithm and greedy algorithm. Musl and had to u a more realistic shore bridge resources u function to replace the method of linear hypothesis this paper propos a new model to improve insufficient corr
ected simulation in the study of land bridge in front of the interference constraint error and put forward a improved model than other algorithms are good before fast branch and bound method bad on one-way operations. Bierwirth to before 2010 to berth allocation problem, task allocation problem shore bridge, gantry cranes scheduling problem of rearch literature made a detailed statistics and investigation and study analysis. Ship movement were studied using genetic algorithm reaches the ca of fixed alongside berths and gantry cranes scheduling problem, homework and assumes that each ship shore bridge number is fixed, the optimization goal to minimize shipping time in Hong Kong. At prent scholars to container terminal berth allocation, gantry cranes scheduling and allocation, t operations such as path planning are detailed studies. They mainly from the perspective of time and economic cost and so on, studies the optimization of container terminal handling operation link rearch, makes the anticipated goal of optimal. But can be en from the collected literature at home and abroad, the rearch of the container terminal although in-depth and meticulous, but there are still insufficient. At prent study mainly just to container terminal operation
of a single link a job scheduling optimization, or are the two assignments link joint scheduling optimization rearch. However, container terminal berth allocation, shore bridge distribution and coll
ection card is a complete operating system. If is simply the optimization study of a job link, can only reach a certain optimal operation link, it is difficult to achieve with other assignments link affinity. In the whole container operating system does not make the overall optimal.
3 Container terminal operation analys
(1) Channel
考研完形填空Channel is refers to the container ship in the in and out of the container terminal area can satisfy container ships and other water traffic tools (tug, etc.) the requirements of the safe navigation channel.
(2) Anchorage
Anchorage is ud for container ships waiting for berthing of ships docked or for a variety of water homework need water. Main floor including loading and unloading of anchorage, anchorage, shelter, water diversion fault, fault and quarantine and so on, this article propod tracing refers to anchor it wrong, is to wait for container vesls into anchored into the dock before berth waters.
(3) Berth
Berth is to point to inside the container terminal for container vesls, loading and unloading to the docking area by the a, for the container ship safety and to meet the need of loading and unloading operation waters and space. Have a certain length of call with berthing waters adjacent quay wall line, referred to as the shoreline. Berth coastline length meet the requirement of container ship loading and unloading and berthing safety distance, depth of berth satisfies the requirement of container ship's draft. Container port berths are mainly divided into two forms. Berth discrete and continuous berths. Discrete berth: container terminal of the coastline of the corresponding berth waters is divided into a number of different lengths of part, at the same time there can be only one ship in a garage to accept rvice, and any ship berthing of ships in the harbor cannot take up two berths at the same time. Continuous berth: in the container terminal to the coastline of the corresponding vesl berthing
>开封西司夜市
