Simultaneous optimisation of seaside operations in container terminals: a case study of the Iranian Rajaee port
by Seyed Farzad Hoseini; Mohammad Mohammadpour Omran; Adolfo Crespo Márquez; Ahmad Makui
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 10, No. 5/6, 2018

Abstract: In marine transport, there is a growing need for optimisation surveys, which are aimed at increasing the efficiency of the whole process. In this study, the berth allocation problem, the quay crane assignment problem and the quay crane scheduling problem are simultaneously formulated into an integrated mathematical model. Afterwards, the proposed mixed integer mathematical model is coded via GAMS IDE/CPLEX software. The exact solver appears to need a huge amount of time to find the optimum solution, even for small and medium-sized problems. Hence, artificial intelligence, which is embedded in both imperialist competitive and genetic algorithms, is employed through a highly modified meta-heuristic method. This method is called a 'hybrid imperialist competitive and genetic algorithm' (HICGA) and is designed to deal with the complexity of such problems. To check the validity of the proposed model and the performance of the designed HICGA method, historical data for 24 weeks from the Iranian Rajaee port were provided.

Online publication date: Tue, 02-Oct-2018

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 Shipping and Transport Logistics (IJSTL):
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