İhracat konteynerlerinin elleçleme sayısını enazlamak için sezgisel yöntemler

In the growing international trade, the number of import, export and transit containers is ever increasing. Therefore, the importance of the container terminals and their efficient managements are highlighted. In this thesis, we study stacking policies in a container terminal for export containers, due to their characteristics. Different than the literature, we considered both the space allocations for containers arrived recently and the pick up operations before the departure of the containers. We assume that an initial configuration exists in the storage yards for already stored containers. The containers arrived recently are allocated to the blocks in the storage yard based on this initial configuration by taking the departure time of the containers into account, which are known beforehand since they are export containers. Hence the retrieval sequences of the containers within blocks are known. Another important aspect of our study is the inclusion of the remarshaling operation, which is used to speed up the retrieval of the export containers. Throughout these stacking operations (allocation, remarshaling, and pick up), some containers already stored in the blocks might be moved into other positions and these moves are known as relocations. These relocations cause major time and cost expenses in the container terminals since any relocation may result in several rehandling operations. Hence the main focus of this thesis is to deal with the rehandlings. We propose several heuristic approaches to estimate the locations for the containers arrived recently and maybe relocated export containers in order to minimize the number of rehandlings. We then analyze the performance of these proposed heuristic algorithms with a set of randomly generated problem instances considering different initial configurations under different container terminal scenarios.