@conference {Chafik20171983,
	title = {A hybrid bin-packing algorithm for solving the yard optimization problem},
	booktitle = {Proceedings of the International Conference on Industrial Engineering and Operations Management},
	year = {2017},
	note = {cited By 0},
	pages = {1983-1991},
	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. {\textcopyright} IEOM Society International.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019000218\&partnerID=40\&md5=9aebf3bb53d265a1dd55c143dac817a3},
	author = {Chafik, R. and Benadada, Y. and Boukachour, J.}
}
