Authors: Jelić, Sobodan
Kovač, Nataša
Davidović, Tatjana 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: MILP FOR INTEGRATED BERTH ALLOCATION AND CRANE OPERATIONS SCHEDULING IN CONTAINER TERMINALS
First page: 258
Last page: 263
Related Publication(s): Proceedings
Conference: SYM-OP-IS 2024, 51st symposium on operational research, Tara 16-19. Sept. 2024
Issue Date: 2024
Rank: M33
ISBN: 978-86-6022-703-6
URL: https://symopis2024.ftn.uns.ac.rs/wp-content/uploads/2024/11/SYM-OP-IS-2024_PROCEEDINGS_final.pdf
Abstract: 
In this paper, we consider an integrated model that addresses three key operations in container
terminals: the berth allocation problem (BAP), the quay crane assignment problem (QCAP), and the quay
crane scheduling problem (QCSP). A Mixed-Integer Linear Programming (MILP) formulation is developed and
utilized with the Gurobi exact solver to obtain (near) optimal solutions for small-sized, randomly generated
instances.
Keywords: Port operations | quay cranes | rectangle packing | operations scheduling | total cost minimization
Publisher: Novi Sad : Fakultet tehničkih nauka
Project: This research was partially supported by the Science Fund of the Republic of Serbia, Green program of cooperation between science and industry, project: EO and in-situ based information framework to support generating Carbon Credits in forestry. The funds were also provided by the Serbian Ministry of Science, Technological Development, and Innovations, Contract No. 451-03-66/2024-03/ 200029.

Show full item record

Page view(s)

6
checked on Dec 22, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.