The issue of integrated scheduling and sequencing operation of unloading and loading equipment in container ports has been one of the most important issues concerning time efficiency. In addition, with the emergence of green harbor concepts, the inclusion of criteria for minimizing energy consumption, fuel and emission reduction are among the other issues that have been noticed by planners in the field of energy efficiency. Furthermore, due to the complexity and scope of activities of a container terminal, uncertainty in operational parameters such as transportation time, time of readiness and entry of work into the system and the velocity of the transportation fleet are inevitable in this operational environment. Therefore, this research with the aim of sharing trucks among loading and unloading equipment, proposes a robust multi-objective integer programming model for the synchronized scheduling of truck operations with other handling equipment to decrease the fuel consumption of trucks and the flow time of containers, considering the uncertainty in operational parameters as fuzzy numbers. To find the Pareto solutions for this model, the ε-Constraint technique is employed. Finally, the performance of the model in deterministic and uncertain modes is evaluated, compared and analyzed employing the inputs gathered from Shahid Rajaei port. The findings demonstrate that using this model will result in a substantial decrease in both fuel consumption and flow time of containers in comparison to the current procedure. Additionally, results will demonstrate the extent to which the terminal's fuel and time consumption will increase under conditions of uncertainty in operational parameters when the optimal plans derived from the robust model are implemented.

During the past two decades, there has been an increase on maritime freight traffic particularly in container flow. Thus, the Berth Allocation Problem (BAP) can be considered among the primary optimization problems encountered in port terminals. In this paper, we address the Dynamic Berth Allocation Problem (DBAP) in a conventional layout terminal which differs from the popular discrete layout terminal in that each berth can serve multiple vessels simultaneously if their total length is equal or less than the berth length. Then, a Modified Sailfish Optimizer (MSFO) meta-heuristic based on hunting sailfish behavior is developed as an alternative for solving this problem. Finally, computational experiments and comparisons are presented to show the efficiency of our method against other methods presented in the literature in one hand. We also discuss the productivity of a container terminal based on different scenarios which can happen.

This work is devoted to the study of the Uncertain Quay Crane Scheduling Problem (QCSP), where the loading /unloading times of containers and travel time of quay cranes are considered uncertain. The problem is solved with a Simulation Optimization approach which takes advantage of the great possibilities offered by the simulation to model the real details of the problem and the capacity of the optimization to find solutions with good quality. An Ant Colony Optimization (ACO) meta-heuristic hybridized with a Variable Neighborhood Descent (VND) local search is proposed to determine the assignments of tasks to quay cranes and the sequences of executions of tasks on each crane. Simulation is used inside the optimization algorithm to generate scenarios in agreement with the probabilities of the distributions of the uncertain parameters, thus, we carry out stochastic evaluations of the solutions found by each ant. The proposed optimization algorithm is tested first for the deterministic case on several well-known benchmark instances. Then, in the stochastic case, since no other work studied exactly the same problem with the same assumptions, the Simulation Optimization approach is compared with the deterministic version. The experimental results show that the optimization algorithm is competitive as compared to the existing methods and that the solutions found by the Simulation Optimization approach are more robust than those found by the optimization algorithm.

Today, with ever-increasing competition in global economic conditions, the necessity of effective implementation of strategy map has become an inevitable and necessary. The strategy map represents a general and structured framework for strategic objectives and plays an important role in forming competitive advantages for organizations. It is important to find important factors influencing strategy map and prioritize them based on suitable factors. In this paper, we propose an integration of BSC and Fuzzy DEMATEL technique to rank different items influencing strategy of a production plan. The proposed technique is implemented for real-world case study of glass production.

The world trade has tremendous growth in marine transportation. This paper studies yard crane scheduling problem between different blocks in container terminal. Its purpose is to minimize total travel time of cranes between blocks and total delayed workload in blocks at different periods. In this way the problem is formulated as a mixed integer programming (MIP) model. The block pairs between which yard cranes will be transferred, during the various periods, is determined by this model. Afterwards the model is coded in LINGO software, which benefits from branch and bound algorithm to solve. Computational results determine the yard cranes movement sequence among blocks to achieve minimum total travel time for cranes and minimum total delayed workload in blocks at different planning periods. Also the results show capability and adequacy of the developed model.