Séminaire conjoint CIRRELT-Chaire de recherche du Canada en distributique-Chaire de recherche du Canada en logistique et en transport
TITRE : Scheduling Two Automated Stacking Cranes to Handle Container Storage and Retrieval Requests with Precedence Constraints and Not-Given Storage Locations
CONFÉRENCIER : Amir Hossein Gharehgozli, Erasmus University, Pays-Bas / Netherlands
DATE et ENDROIT : 6 décembre 2011, 10h30, salle 5441, Pavillon André-Aisenstadt, Campus de l’Université de Montréal
RESPONSABLE : Gilbert Laporte
RÉSUMÉ : We study how to find storage locations for storage requests while a set of container storage and retrieval requests has to be sequenced. Two automated stacking cranes stack and retrieve containers from a single block of containers, located in the stack area of an automated container yard. The cranes cannot pass each other and have to be apart for a fixed separation distance. There is a single input/output (I/O) point at the seaside and a single I/O point at the landside of the block. Every I/O point has a set of storage containers each with a given set of empty locations in the block suitable to store the container. Every retrieval container can be delivered to any I/O point either at the landside or at the seaside depending on whether it is to be transported by ship or truck/train. The problem is modeled as a multiple generalized asymmetric traveling salesman problem with precedence constraints (mGATSP-PC). In addition, extra constraints regarding the interaction of the cranes have to be satisfied. The objective is to minimize the makespan of the cranes. An adaptive large neighborhood search (ALNS) is used to solve the model. The performance of the ALNS is compared with CPLEX.