Optimization of Pricing for Priority Use of Port Berths
DOI:
https://doi.org/10.62051/ajmse.v1n2.05Keywords:
Berth Planning, Priority Rights, ModelingAbstract
With the growth of container shipping demand and the increasing size of vessels, the scarcity of frontline port resources, such as berths and quay cranes, has become increasingly prominent. Traditional port operations usually treat berth allocation, quay crane assignment and charging mechanisms as separate decisions, making it difficult to fully reflect the internal relationship among resource scarcity, differentiated service demand and port revenue management. As a differentiated service with service commitment attributes, berth priority usage rights can guide vessels’ choices through pricing mechanisms and provide a new approach for optimizing port resource allocation and improving revenue. Therefore, this thesis studies the pricing problem of berth priority usage rights, focusing on the coordinated optimization relationship among priority pricing, berth planning and quay crane allocation. This thesis first defines the service connotation of berth priority usage rights, regarding them as differentiated services in which the port provides vessels with earlier latest service completion commitments. On the demand side, reservation price and consumer utility theory are introduced to describe vessels’ willingness to pay for different priority levels. Vessels make choices according to the net utility formed by the difference between the reservation price and the actual price of each level. When positive net utility exists, a vessel chooses the priority level with the highest utility; when all paid priority levels fail to provide positive net utility, the vessel chooses the non-priority option. In this way, the priority price is not only a charging parameter, but also an important decision variable that affects vessels’ priority-level choices, demand structure and resource allocation results.
Downloads
References
[1] Lim A. The berth planning problem[J]. Operations Research Letters, 1998, 22(2-3): 105-110.
[2] Yang Haidong. Simulation of Port Berth Systems to Solve Berth Allocation Problems [D]. Tianjin: Tianjin University, 2007.
[3] Imai A, Nishimura E, Papadimitriou S. The dynamic berth allocation problem for a container port[J]. Transportation Research Part B, 2001, 35(4): 401-417.
[4] Nishimura E, Imai A, Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms[J]. European Journal of Operational Research, 2001, 131(2): 282-292.
[5] Zhen L, Zhuge D, Wang S, Wang K. Integrated berth and yard space allocation under uncertainty[J]. Transportation Research Part B: Methodological, 2022, 162: 1-27.
[6] Kim K H, Moon K C. Berth scheduling by simulated annealing[J]. Transportation Research Part B, 2003, 37(6): 541-560.
[7] Imai A, Sun X, Nishimura E, Papadimitriou S. Berth allocation in a container port: using a continuous location space approach[J]. Transportation Research Part B, 2005, 39(3): 199-221.
[8] Cordeau J F, Laporte G, Legato P, Moccia L. Models and tabu search heuristics for the berth-allocation problem[J]. Transportation Science, 2005, 39(4): 526-538.
[9] Zhang Yantao. Research and Simulation on the Optimization of Berth Scheduling Problem Based on Genetic Algorithm [D]. Wuhan: Wuhan University of Technology, 2005.
[10] Monaco M F, Sammarra M. The berth allocation problem: a strong formulation solved by a Lagrangean approach[J]. Transportation Science, 2007, 41(2): 265-280.
[11] Zhen L, Liang Z, Zhuge D, Lee L H, Chew E P. Daily berth planning in a tidal port with channel flow control[J]. Transportation Research Part B: Methodological, 2017, 106: 193-217.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Academic Journal of Management Science and Engineering

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







