Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.


Download BibTeX


Quay partitioning problem


[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ D ] phd student | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication


Published in

International Transactions in Operational Research

Journal year: 2024 | Journal volume: vol. 31 | Journal number: iss. 3

Article type

scientific article

Publication language


  • maritime container terminal design
  • berth allocation problem
  • combinatorial optimization

EN In this paper, we introduce the quay partitioning problem (QPP), that is, a problem of partitioning quay length into berths for minimum ship waiting time. Such a problem arises when designing the terminal layout. Two schemes of quay layout are considered: with at most one ship in a berth and with at most two ships in a berth. Ship arrival times, service times, lengths, and weights are given. We show that QPP is NP-hard. The two versions of QPP are formulated as mixed integer linear programs (MIPs). Scalability of solving QPPs as MIPs is studied. We investigate, analytically and in computational experiments, features of the QPP solutions such as (i) changes in solution quality when one long berth length is used versus choosing various berth lengths flexibly, (ii) what lengths of berths are chosen when ship lengths mixture is changing, (iii) what is the impact of congestion on the chosen berth lengths, and (iv) how much is one quay layout scheme better than the other.

Date of online publication


Pages (from - to)

1554 - 1584




Ministry points / journal


Impact Factor

3,1 [List 2022]

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.