Outbound Containers Research Articles

Simulation-Based Optimization for Storage Allocation Problem of Outbound Containers in Automated Container Terminals

Storage allocation of outbound containers is a key factor of the performance of container handling system in automated container terminals. Improper storage plans of outbound containers make QC waiting inevitable; hence, the vessel handling time will be lengthened. A simulation-based optimization method is proposed in this paper for the storage allocation problem of outbound containers in automated container terminals (SAPOBA). A simulation model is built up by Timed-Colored-Petri-Net (TCPN), used to evaluate the QC waiting time of storage plans. Two optimization approaches, based on Particle Swarm Optimization (PSO) and Genetic Algorithm (GA), are proposed to form the complete simulation-based optimization method. Effectiveness of this method is verified by experiment, as the comparison of the two optimization approaches.

A Heuristic Procedure for the Outbound Container Relocation Problem during Export Loading Operations

During export ship loading operations, it is often necessary to perform relocation movements with containers that interfere with access to the desired container in the ship loading sequence. This paper presents a real-time heuristic procedure for the container relocation problem employing reachstacker vehicles as container handling equipment. The proposed heuristic searches for good relocation coordinates within a set of nearby bays. The heuristic has a parameter that determines how far from the original bay a container may be relocated. The tradeoff between reducing relocation movements and limiting vehicle travel distances is examined and the performance of the heuristic is compared with a common practice in the smaller container terminals in Chile and Mexico. Finally, a mathematical model for the container relocation problem is presented.

A bilevel storage pricing model for outbound containers in a dry port system

Serving as a potential solution for seaport congestion and capacity limitation, dry port development is increasingly popular in the freight transport industry. This paper pioneers the research on dry port operations by modelling the storage pricing problem for outbound containers. The interaction between a dry port and multiple shippers is modelled as a bilevel program. The optimal properties of the proposed model under certain conditions are derived analytically, from which a closed-form solution is obtained. Contrary to intuition, the increase of container delivery frequency from shippers may lead to the reduction of dry port’s profit according to model outcomes.

Supply Chain Strategies for the International Interoceanic Mazatlan-Houston Logistic Corridor

Describe the interoceanic Mazatlan-Houston Logistic Corridor (MHLC) as an alternative route to create sustainablecompetitive advantages for Mexican, USA, and international firms competing in an international marketplace. Takinginto account the competitive advantages of utilizing this corridor for international trade, we analyze supply chainstrategies for Mexican and international companies demanding economical logistic solutions in this region. It wasfound that the MHLC benefits efficient industry segments with demand well known in advance. It was also found thatthe potential of both inbound and outbound container traffic to the Asia-Pacific marketplace along this internationalcommerce corridor fluctuates between 39,000 and 761,000 TEU´s.

Location assignment for outbound containers with adjusted weight proportion

This paper studies the location assignment for arriving outbound containers during container-receiving stage. For the problem, the literature assumed that the proportion of the remaining containers on a weight group keeps unchanged throughout the container-receiving process. This assumption is inconsistent with the practice that it should be constantly adjusted according to the containers that have already been received. We therefore propose two other handling ways in this paper, leading to two new dynamic programming models. These two models are compared with the existent model on small-scale instances. For large-scale instances, a two-stage heuristic is proposed. In the first stage, a neighborhood searching heuristic is developed to generate the priority sequence of stacking patterns for each weight group of containers; in the second stage, a rollout-based heuristic is proposed to improve the incumbent solution by simulating more stack alternatives for each arriving container. The numerical experiments show that the model with adjusted weight proportion can significantly reduce state size and improve stacking quality, and that the proposed two-stage heuristic is effective and efficient for large-scale instances.

A storage allocation algorithm for outbound containers based on the outer–inner cellular automaton

The storage allocation problem of outbound containers in container yard is usually optimized by two successive stages, yard-bay allocation problem (YBAP) and space allocation problem (SAP), but they cannot obtain global optimal solution. This paper proposes an outer–inner cellular automaton algorithm (CAOI) to solve this problem, using YBAP and SAP as an integrated optimization process. Our work can be divided into several parts: (1) The outer cellular automaton (CAO) model is established to solve YBAP, and the inner cellular automaton (CAI) model is established to solve SAP. (2) In CAO model, an End–Front–Front–End (EFFE) transition rule is designed to make a cell change its state more instructive. (3) In CAI model, cells are initialized through a branch and bound method based on least-cost priority queue (LCBB). LCBB makes initial CAI cell space in an approximate optimal state. (4) An integrated strategy for CAO and CAI model is proposed, by which CAO and CAI execute co-evolution under the control of CAOI. Extensive experiments show CAOI achieves a better performance in solving storage allocation problem than other state-of-the-art methods, which synchronously optimizes the container transportation distance, the number of allocated yard-bays and rehandles.

Conservative allocation models for outbound containers in container terminals

This paper examines location assignment for outbound containers in container terminals. It is an extension to the previous modeling work of Kim et al. (2000) and Zhang et al. (2010). The previous model was an “optimistic” handling way and gave a moderate punishment for placing a lighter container onto the top of a stack already loaded with heavier containers. Considering that the original model neglected the stack height and the state-changing magnitude information when interpreting the punishment parameter and hid too much information about the specific configurations for a given stack representation, we propose two new “conservative” allocation models in this paper. One considers the stack height and the state-changing magnitude information by reinterpreting the punishment parameter and the other further considers the specific configurations for a given stack representation. Solution qualities for the “optimistic” and the two “conservative” allocation models are compared on two performance indicators. The numerical experiments indicate that both the first and second “conservative” allocation models outperform the original model in terms of the two performance indicators. In addition, to overcome computational difficulties encountered by the dynamic programming algorithm for large-scale problems, an approximate dynamic programming algorithm is presented as well.

Trip Allocation and Stacking Policies at a Container Terminal

There are three crucial resources at container terminals; the yard, cranes and the vehicles. The main objective of the terminal is the efficient use of these resources while performing different operations. The yard is a temporary storage area where containers remain until transported to their next location by truck, train or vessel. Containers are stacked on top of each other in order to utilize the yard space efficiently. However, stacking cranes can only directly access those containers at the top of the stack. As a result, reshuffling/shifting occurs, defined as an unproductive move of a container required to access another container stored underneath. We focus on increasing the efficiency of the yard via consideration of the container stacking optimization problem for transshipment, inbound and outbound containers at a container terminal. The objective of the problem is to minimize container storage and retrieval times through avoidance of reshuffles, resulting in more efficient loading/unloading operations, and in turn minimizing the dwell time of containers. The main inputs are the type, weight, discharge port/location, destined vessel/vehicle of the container, and the expected departure time. Different stacking policies are proposed in this study, and we also investigate the problem of allocating the transit container to outbound vessels to minimize dwell time at the terminal. Transit containers require multiple sea-trips to reach their final destination. Vessels departing from the terminal and destined for the same port may provide exchangeable trips for this type of container, based on their several attributes and capacity restrictions. We consider this problem taking into account several factors that affect container/trip allocation decisions. The solution of this problem also has implications for the stacking problem.

The possible influence of the shipper on carbon emissions from deep-sea container supply chains: An empirical analysis

This article examines the extent to which shippers can influence the level of carbon emissions from the deep-sea container supply chain. It uses data collected in an online questionnaire survey of 34 large UK shippers, supplemented by the results of focus group discussions and interviews with a range of key stakeholders, including shipping lines, freight forwarders, logistics companies and port operators. The online sample comprised shippers responsible for inbound and/or outbound deep-sea containers flows. The amount of leverage that they can exert on ‘carbon-sensitive’ decisions depends partly on the Incoterms that they employ and their use of freight forwarders. Many large shippers still retain significant influence over the choice of carriers used for deep-sea and port feeder services, consignment routing and scheduling and the choice of port. Shippers responsible for inbound flows reported high levels of container fill, though opportunities exist for improving the weight utilisation of outbound containers, possibly by moving to a port-centric logistics model. Around 40 per cent of the shippers consulted currently measure CO2 emissions from their deep-sea container supply chains with only 6 per cent explicitly implementing carbon reduction initiatives. The research shows the importance of adopting a broader supply chain approach to decarbonisation in the maritime sector and emphasises the need for a multi-stakeholder perspective that recognises the important role of the shipper in the process.

Storage yard operations in container terminals: Literature overview, trends, and research directions

Inbound and outbound containers are temporarily stored in the storage yard at container terminals. A combination of container demand increase and storage yard capacity scarcity create complex operational challenges for storage yard managers. This paper presents an in-depth overview of storage yard operations, including the material handling equipment used, and highlights current industry trends and developments. A classification scheme for storage yard operations is proposed and used to classify scientific journal papers published between 2004 and 2012. The paper also discusses and challenges the current operational paradigms on storage yard operations. Lastly, the paper identifies new avenues for academic research based on current trends and developments in the container terminal industry.

Study on Vessel Slot Planning Problem in Stowage Process of Outbound Containers

Study on Vessel Slot Planning Problem in Stowage Process of Outbound Containers

Modeling and solution of the joint quay crane and truck scheduling problem

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 model is formulated to minimize the makespan. Several valid inequalities and a property of the optimal solutions for the problem are derived, and two lower bounds are obtained. An improved Particle Swarm Optimization (PSO) algorithm is then developed to solve this problem, in which a new velocity updating strategy is incorporated to improve the solution quality. For small sized problems, we have compared the solutions of the proposed PSO with the optimal solutions obtained by solving the model using the CPLEX software. The solutions of the proposed PSO for large sized problems are compared to the two lower bounds because CPLEX could not solve the problem optimally in reasonable time. For the more general situation considering both inbound and outbound containers, trucks may go back to quayside with outbound containers. The model is extended to handle this problem with bidirectional flow. Experiment shows that the improved PSO proposed in this paper is efficient to solve the joint quay crane and truck scheduling problem.

The RHSA strategy for the allocation of outbound containers based on the hybrid genetic algorithm

Secure storage yard is one of the optimal core goals of container transportation; thus, making the necessary storage arrangements has become the most crucial part of the container terminal management systems (CTMS). This paper investigates a random hybrid stacking algorithm (RHSA) for outbound containers that randomly enter the yard. In the first stage of RHSA, the distribution among blocks was analyzed with respect to the utilization ratio. In the second stage, the optimization of bay configuration was carried out by using the hybrid genetic algorithm. Moreover, an experiment was performed to test the RHSA. The results show that the explored algorithm is useful to increase the efficiency.

A novel algorithm based on the unified neutral theory of biodiversity and biogeography model for block allocation of outbound container

Block allocation problem (BAP) is the key part of container terminal management. To make full use of the limited yard resources and to reduce the turnaround and transportation time, this paper focuses on the objectives of BAP offering multiple work ways, avoiding loading or collecting containers at the same time, and minimising the total distance between the berths and the blocks. The solution of BAP is similar to the model that individuals choose proper islands to live in the unified neutral theory of biodiversity and biogeography (UNTBB). The difficulty lies on that the UNTBB model is a complicated stochastic process. A novel algorithm based on the modified UNTBB model is proposed. Based on this modified UNTBB model, this paper proposed a grouping strategy to reduce the solution set. To guarantee the consecutive container groups not to put in the same block and to assure a consecutive and parallel loading process, a strategy that kills any one of the species existing prey relationship is put forward. Moreover, a greedy strategy is constructed to select an island to accelerate the ecological balance among islands. All these strategies are included into UNTBB to make ecological selection more instructive and faster. The optimal solution in the modified UNTBB model is the optimisation result of the BAP. The experiments show that the novel algorithm proposed in this paper achieves a better performance than the other conventional methods.

Improving the service operations of container terminals

PurposesIn the relevant literature about container terminals (CTs), most studies focused on the internal operational management of CT operators. In practice, for improving the performance of CT operators, the external customers’ requirements should also be considered. The purpose of this paper is to discuss the improvement of service operations of CTs from users’ requirement perspectives.Design/methodology/approachIn this paper, the customer requirements for container terminal are first examined. Based on the customer requirements, a quality function deployment (QFD) model is then constructed to translate the customer requirements into service operations of the container terminals, by which CT operators may make policies to improve their service operations. As an empirical study, the container terminal of Yang‐Ming Shipping Line (YML CT) at Kaohsiung Port and its users were investigated to validate the model.FindingsThe result proposes 19 customer requirement attributes from users’ perspectives and 15 service operations from CT operators’ perspectives. Further, the top five customer requirement attributes by importance degree are: consistency of bill of lading; accuracy of dynamic information on cargos; accuracy of EDI information for receiving and releasing of containers; professional ability of operators to deal with cargo damage; and cargo safety.Practical implicationsThe results indicate the top five service operations in need of improvement for the YML CT are: storage operation in depot; outbound container operation; hazardous container storage; inbound container operation; and T1 arrangement.Originality/valueIn this paper, a QFD model was constructed to improve the service operations of CTs. The proposed model may provide valuable references for future research on container terminals.

Parametric analysis of evolutionary algorithms for the storage location of outbound containers at a seaport terminal

The research aims to minimise the handling time of containers in the storage yard. In such a way it finds an efficient strategy and a loading schedule that avoids unnecessary container moves in the yard. Two loading strategies are examined, namely LCFS and FCFS in terms of handling time in the storage area. Results show that an LCFS loading schedule is far more efficient than an FCFS schedule. A genetic algorithm (GA) is used to optimise both loading schemes. The objectives of the optimisation problem are two-fold: on the one hand one wants to minimise the handling time, and on the other hand one wants to minimise the number of re-handles. The effect of the genetic operators on the solutions are analysed and results show that a GA with mutation as operator only is best in finding efficient solutions. A sensitivity analysis based on Sobol’s method is carried out to test the importance of the parameter values of the GA.

A Tabu Search Heuristic for the Inland Container Transportation Problem

The Inland Container Transportation Problem describes the movement of full and empty containers among a number of terminals, depots and customers in a hinterland region. A trucking company with a homogeneous fleet of trucks has to serve customers which either receive goods by inbound containers or ship goods by outbound containers. While keeping given hard time constraints the total operating time of all trucks has to be minimized. A comprehensive mathematical formulation which considers vehicle routing and scheduling and empty container repositioning simultaneously is defined. The problem is solved by an efficient Tabu Search Heuristic. Computational experiments carried out on small- and large-sized instances indicate that the proposed algorithm performs well with respect to effectiveness and efficiency.

Harmony search to solve the container storage problem with different container types

This paper presents an adaptation of the harmony search algorithm to solve the storage allocation problem for inbound and outbound containers. This problem is studied considering multiple container type (regular, open side, open top, tank, empty and refrigerated) which lets the situation more complicated, as various storage constraints appeared. The objective is to find an optimal container arrangement which respects their departure dates, and minimize the re-handle operations of containers. The performance of the proposed approach is verified comparing to the results generated by genetic algorithm and LIFO algorithm.

Optimizing the yard layout in container terminals

The main activities of container terminals are to load outbound containers on to vessels, discharge inbound containers from vessels, and store those containers in the yard before loading (or after ...

Genetic procedure for the Single Straddle Carrier Routing Problem

This paper concentrates on minimizing the total travel time of the Straddle Carrier during the loading operations of outbound containers in a seaport container terminal. Genetic Algorithm is well-known meta-heuristic approach inspired by the natural evolution of the living organisms. Heuristic procedure is developed to solve this problem by recourse to some genetic operators. A numerical experimentation is carried out in order to evaluate the performance and the efficiency of the solution.