共查询到19条相似文献,搜索用时 250 毫秒
1.
2.
日前.南通检验检疫局对南通口岸场地堆放的用于外贸出口的集装箱空箱进行了一次集中查验,这些集装箱主要由境内调拨及外贸重箱回箱构成。通过查验,该局发现集装箱空箱卫生状况不容乐观,“空箱不空”的情况较为普遍。 相似文献
3.
4.
<正>据深圳市港务管理局快速统计,深圳港2010年集装箱吞吐量达到2250.97万TEU,同比增长23.3%,超出2008年水平5.1%,创出年度新高。重、空箱比例为63.9%和36.1%,其中重箱为1438.31万TEU,增长19.2%,重箱进出 相似文献
5.
轮胎式空箱门式起重机在中小码头的应用 总被引:2,自引:2,他引:0
随着集装箱运输的迅猛发展,各码头的集装箱吞吐量迅速增长,中小码头堆场原来多数采用的正面吊处理重箱、堆高机处理空箱的装卸作业工艺,由于场地堆存利用率低、装卸效率低而逐步转向集装箱门式起重机堆存装卸工艺.2005年5月,我公司委托交通部水运科学研究所开发1台LJMJ0523轮胎式空箱门式起重机,专门用于租用场地的空箱处理. 相似文献
6.
7.
2.2堆场的回空箱检验 货主对进口重箱进行拖运、拆箱是一个容易造成集装箱损坏、在箱内遗留垃圾的过程.向货主追究修理和清洁赔偿责任是减少船公司修箱成本的重要环节.其关键在于货主返回空箱时的进场检验.返空箱在GATE IN时,堆场必须对箱子进行检验,不仅要看箱体外表面,而且要开门检查箱内情况,重点查看木地板、内壁有无损坏,地板和内壁上是否遗留垃圾. 相似文献
8.
海运空箱调运模糊优化研究 总被引:1,自引:0,他引:1
介绍应用模糊规划的方法研究海运集装箱空箱调运问题,模型以空箱调运和租借费用最小为目标函数,考虑空箱供给能力、空箱需求量和空箱运输容量限制等条件,并考虑到空箱需求量是模糊数时的情况。 相似文献
9.
10.
11.
Ship slot capacity is the main sale resource of container shipping lines. However, shipping lines often encounter situations, such as serious ship delays, that require adjustments of shipping schedules, causing the original delivery plans of some consignments to be altered. This study proposes an integer programming model for slot reallocation planning, based on a given adjusted schedule. Decisions regarding empty container repositioning are also examined. This model aims to maximise a company’s benefits from deliveries of consignments and movements of empty containers. Available slots are subject to port rotation changes, allowable port handlings and ship capacity. A case study of a deep ocean loop demonstrates optimal slot reallocation, and empty container repositioning is used for illustrative purposes. The reallocation characteristics due to benefit items and the model’s applicability to large-scale examples are discussed. 相似文献
12.
根据集装箱堆场空箱堆取作业的特点,提出了一种四卷筒轻型空箱RMG的方案,对其关键技术进行研究。目前该机型已用于空箱堆场作业,其适应性强、性价比高,特别适合于专业空箱堆场和中小码头应用。 相似文献
13.
This paper addresses a fundamental question related to nearly all container liner shipping planning models: whether the implicit assumption of identical container delivery pattern every week is valid in a situation of identical shipping services and identical cargo demand every week. We prove that when the number of containers transported from one port to the next is formulated as a continuous variable, the resulting mathematical model with an identical container delivery pattern is equivalent to the model with general container delivery patterns which can be different in different weeks. When the number of containers transported is formulated as an integer variable, the model with an identical container delivery pattern is not equivalent to the model with general container delivery patterns. However, the difference between the optimal objective values of the two models is negligible for practical applications. In sum, little, if not nothing, is lost by assuming an identical container delivery pattern in liner shipping planning models. 相似文献
14.
15.
ABSTRACTThis paper integrates empty container reposition with container shipping network design considering the container life stages. A mixed-integer linear programming model is built to determine the liner shipping network, the initial launch ports of new containers, the ports for scrapping obsolete containers, the empty container reposition scheme and the containers of different life stages being used for a specific voyage. A case study is done by taking liner shipping among China, Japan and South Korea, Southeast Asia, Europe and the US as an example. The results show that over 93% of new containers are put into use in China while 63% of old containers are scrapped in Europe or the US, and 73% of containers used for packing cargoes from China to the US are those at the Decline Stage or the Exit Stage. 相似文献
16.
17.
18.
Jiangbo Xing 《Maritime Policy and Management》2017,44(6):744-760
This paper focuses on the container rerouting due to a disruption, aims at making the optimal container flow recovery plan for the affected liner shipping company. First, we make the initial effort to bring up with a basic framework of disruption management for liner shipping. Second, we present a compact integer linear programming model for addressing the container rerouting problem under the proposed framework in a hub-and-spoke liner shipping network, based on a given recovery vessel schedule that determines to omit a port of call. Other shipping companies’ services and other modes (roadway, railway, and airline) as candidate alternative means to transport the miss-connected containers are also incorporated in the proposed model. The container flow recovery plan would select the optimal alternative paths for the miss-connected containers balancing the trade-off between container transport costs and delivery delay penalty costs. Finally, a case study from a global liner shipping company is investigated and the computational results indicate the model can be solved effectively and efficiently for the real-scale problem. Thus, the proposed approach in this paper can supply real-time decision support tool for the liner shipping operators on handling the process of container flow recovery. 相似文献
19.
Ceyhun Güven 《Maritime Policy and Management》2019,46(2):201-216
Container transportation plays a critical role in the global shipping network and container terminals need to improve their operations to increase efficiency. Storage yard of a container terminal is a temporary area where the containers stay until they are shipped to their next destination. We concentrate on increasing the efficiency of the storage yard by developing online stacking policies for each incoming container. An unproductive move of a container, performed to reach another container stored underneath, is called reshuffling. The objective in container stacking problem is to minimise the number of reshuffles, thereby increasing the efficiency of terminal operations. Additional weight-related operational constraints bring additional complexity to the online stacking decisions. We propose a mathematical model for the optimal online assignment of an incoming export, transit, import or empty container. We also propose an optimal online stacking policy and compare it with a random policy through simulation. Additionally, lower bounds for the performance measures are obtained through simulation by relaxing the operational constraints of the problem in a third stacking policy. We present and discuss the computational results in terms of four main performance measures. 相似文献