Title: Scheduling of lifting vehicle and quay crane in automated port container terminals

Authors: Le Hoai Minh; Adnan Yassine; Moussi Riadh

Addresses: Laboratoire de Mathématique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540, 76058 Le Havre, France. ' Laboratoire de Mathématique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540, 76058 Le Havre, France; Institut Suprieur d'Etudes Logistiques (ISEL), Quai Frissard – B.P. 1137, 76063 Le Havre Cedex, France. ' Laboratoire de Mathématique Appliquée du Havre, 25 Rue Phillipe Lebon, B.P. 540, 76058 Le Havre, France

Abstract: Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions.

Keywords: lifting vehicles; container ports; container terminals; mixed integer programming; difference of convex functions; DC programming; DCA; branch and bound; scheduling; quay cranes; optimisation.

DOI: 10.1504/IJIIDS.2012.050092

International Journal of Intelligent Information and Database Systems, 2012 Vol.6 No.6, pp.516 - 531

Received: 29 Jan 2011
Accepted: 06 Mar 2012
Published online: 23 Aug 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article