@conference {Chafik2016,
	title = {Stacking policy for solving the container stacking problem at a containers terminal},
	booktitle = {ILS 2016 - 6th International Conference on Information Systems, Logistics and Supply Chain},
	year = {2016},
	note = {cited By 0},
	abstract = {Maritime container terminals are facilities where cargo containers are transshipped between ships or between ships and land vehicles (tucks or trains). They can be automated; semi- Automated or static ones depend on the type of the equipments that they contain. There are crucial resources at container terminals; the yard, cranes and the vehicles. The yard refers to the temporary storage area where inbound, outbound containers can be stored. While we have two kinds of cranes depending on the type of the yard we are working on: yard crane and quay crane. Vehicles are used to transfer the container between the seaside and yard side (the external trucks XTs are not considerable in our study). The decision of the container stacking position is the most important operational task for the incoming containers which affects not only the productivity of the stacking but also for the later retrieval and also to avoid the unproductive moves to access to the requested containers stored in the stack. Our aim is to define a new approach to design the container stacking problem using an approach of optimization and simulation. Thus in this paper we will define a new MIP which has as objective the minimization of the number of the stacks used to store a given number of inbound containers, and to define afterwards a simulation model using a simulation software (Arena) which has as input the result of the optimization model. So we will try first to define a relocation model using the standard (FCFS) then the Best fit decrease (BFD) from the bin packing algorithm to store and maintain the storage area and to avoid unproductive moves and reshuffles to find out the requested container sequence. The main inputs are high, weight, destination and the delivery time of each container. Our objective is to have, based on heuristics, a guide to the planner to obtain an optimized stacking / reshuffling plan, given a stacking state and a container demand. We will try to minimize the number of reshuffles as well as the number of stacks used and obtaining a conclusion about possible yard configurations.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84985990061\&partnerID=40\&md5=fc357733313d1ef8bc1eb86ae909b126},
	author = {Chafik, R.a and Benadada, Y.b and Boukachour, J.c}
}
@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}
}
