@conference {Razouk2016,
	title = {New approaches for solving the container stacking problem},
	booktitle = {Proceedings of the 3rd IEEE International Conference on Logistics Operations Management, GOL 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {Containers shipment has grown very fast during the last ten years, in Tanger Med port for example, 3Millions containers (80\% in transshipment) TEUs (Twenty feet equivalent unit) has been changed during 2015 (Tanger Med Port authority {\textquoteright}TMPA{\textquoteright} study March{\textquoteright}2016 [1]), which correspond to an increase of 40\% comparing with the last study made in 2012. Thus, our study will deal with the port management and the improvement of the operations processes. The aim of this paper is to define a new strategies to solve the container stacking problem (CSP) using an approach of optimization. Thus we define a new MIP (Mathematical Integer Program) to deal with the operational tasks in a containers terminal. In which we optimize the number of the stacks used to store a given number of inbound containers and also we minimize the related cost of the traveling distance for inbound containers between the sea side and the yard side. This paper is organized as follow: we introduce and locate first our problem, then we present the literature review of the CSP. The problem definition and the MIP introduction will be the subject of the next section, and we finish by presenting the findings and the future perspectives. As a proposed resolution approach for our MIP, we propose a developed genetic algorithm strategy (DGAS) as a metaheuristic and the Branch \& Cut (B\&C) as an exact method. Our main objective is to avoid reshuffles and to find out the best yard configuration to store inbound containers. The DGAS will be applied to an existing instances in the literature, and the obtained numerical results is compared with the Cplex results (B\&C). The main inputs for our proposed framework are the height, weight, destination, type containers \& yard bays, and the expected departure time (EDT). Our objective at the end is to have an optimized guide to the planners to easily define the unloading plan and the storage position for each container, giving an initial stacking state and a container demand. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/GOL.2016.7731679},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85001976354\&doi=10.1109\%2fGOL.2016.7731679\&partnerID=40\&md5=423d4fb53e049a2ad56b99740b466821},
	author = {Razouk, C.a and Benadada, Y.a and Boukachour, J.b}
}
@conference {Razouk2014,
	title = {Container stacking problem - Mathematic model and resolution},
	booktitle = {ILS 2014 - 5th International Conference on Information Systems, Logistics and Supply Chain},
	year = {2014},
	note = {cited By 0},
	abstract = {Terminals are the intersection point of the different transportation modes such a s: Marine, Road, rail, so it has a crucial role in optimizing the flow of containers. Efficient container handling at terminals is important in reducing transportation costs an d keeping shipping schedules [Henesey 2008]. In this paper, we will present different container terminals problems which be divide d on three level (strategic, Tactics, operational), the composition of a container terminal, and then we will introduce and resolve the container stacking problem (CSP) in the storage yards of terminals. We present the mathematical formulation to the CSP as a general modelization including the leave time of each container, the type of the storage goods and their weight. Which will be enriching later either by the problems related to the storage yard such as rehandling problems, interference between yard cranes or by other problems related to the other component of a container terminal such as internal transportation, loading/unloadin g containers from vessel, berth allocation. Those problems are related to all the resources in terminal operations, including quay cranes, yard cranes, storage space, an d terminals trucks. We try to define the different component on the terminal basing to Steenken and al [Steenken 04], Stahlbock and Vob [Stahlbock 08] and Yuxuan [Yuxuan 05]. We define a mathematical model for the CSP including some new constraints. Then we t ry to solve the problem by using a separation and evaluation method. For each one, the problem is formulated as a mathematical programming model. At the first level, the total number of containers to be placed in each storage block is set to three. The second level determines the number of containers, the number of stack, the percentage of the free positions associated with each vessel. Numerical runs show that with small and me dium instance the proposal method significantly reduces the total distance to transport the containers between their storage blocks and the vessel berthing locations. Once we will have the optimized solution, it can be the input of simulator software. So it can be reviewed and presented by this last, in order to see the implementation of this in reality.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983165322\&partnerID=40\&md5=31107288e38643ed68e1eb90aaa0e2e0},
	author = {Razouk, C.a and Benadada, Y.b and Boukachour, J.c}
}
