Scheduling of lifting vehicle and quay crane in automated port container terminals
by Le Hoai Minh; Adnan Yassine; Moussi Riadh
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 6, No. 6, 2012

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.

Online publication date: Sat, 23-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com