In this paper, we are going to investigate the growth of the Iranian maritime transport with a focus mainly on the North - South transit Corridor, review of dry ports in order to support the Iranian container terminals at the south ports in order to increase the volume of container storages at the terminals. For the purpose of assessing the outcome of port operational management, the Balanced ...

Container handling problems at the container terminals are NP-hard problems. In this paper, we propose a new handling operation’s design and simulation of empty containers, taking into account the interrelated activities at the container terminal. This simulation have been built using a doubled trailer. It moves containers from quayside to yard side or the opposite depending on the flow in cont...

Our motivation is to determine whether risks such as implementation error-proneness can be isolated into three types of containers at design time. This paper identifies several container candidates in other research that fit the risk container concept. Two industrial case studies were used to determine which of three container types tested is most effective at isolating and predicting at design...

Container terminals offer transfer facilities to move containers from vessels to trucks, trains and barges and vice versa. Within the terminal the container yard serves as a temporary buffer where incoming containers are piled up in stacks. Only the topmost container of each stack can be accessed. If another container has to be retrieved, containers stored above it must be relocated first. Cont...

A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k∗-container if it contains all the vertices of G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let (G) be the connectivity of G. A graph G is super connected if G is i∗-connected for all 1 i (G). A bipartite graph G is k∗-laceable if the...

This paper presented a genetic algorithm (GA) to solve the container storage problem in the port. This problem is studied with different container types such as regular, open side, open top, tank, empty and refrigerated containers. The objective of this problem is to determine an optimal containers arrangement, which respects customers’ delivery deadlines, reduces the re-handle operations of co...

This study recruited 16 industrial workers to examine the effects of material, weight, and base area of container on reduction of grip force (ΔGF) and heart rate for a 100-m manual carrying task. This study examined 2 carrying materials (iron and water), 4 carrying weights (4.4, 8.9, 13.3, 17.8 kg), and 2 base areas of container (24 × 24 cm, 35 × 24 cm). This study showed that carrying water si...

This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing two dimensional (2D) arbitrary sized heterogeneous box packing into a container, by considering practical constraints facing in the shipment container loading industries. Objective of this research is to pack heterogeneous boxes of varying length, width and constant height into a container of standard dimension, without viol...

For a long time, the term virtualization implied talking about hypervisor-based virtualization. However, in the past few years container-based virtualization got mature and especially Docker gained a lot of attention. Hypervisor-based virtualization provides strong isolation of a complete operating system whereas container-based virtualization strives to isolate processes from other processes a...

We propose a novel container-centric memory allocation scheme. In this scheme, the container’s semantics guide the memory allocation, which results in data locality improvement and execution time reduction. The container-centric allocation provides the benefits of custom memory allocation, with the portability advantage. Applications need not change a single line of code, but rather change the ...