[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

The berth allocation problem (BAP), which defines a processing interval and a berth at the quay wall for each ship to be (un-)loaded, is an essential decision problem for efficiently operating a container port. In this paper, we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled floating platforms, which encase ships moored at the immobile quay and provide additional quay cranes for accelerating container processing. Furthermore, additional ships can be processed at the seaside of the platform, so that scarce berthing space at a terminal is enlarged. We formalize the BAP with mobile quay walls and provide suitable solution procedures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Baird, A. J. (2006). Optimising the container transhipment hub location in northern Europe. Journal of Transport Geography, 14, 195–214.

    Article  Google Scholar 

  • Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202, 615–627.

    Article  Google Scholar 

  • Chae, J.-W., Park, W.-S., & Jeong, G. (2008). A hybrid quay wall proposed for a very large container ship in the west terminal of Busan new port. in International conference on coastal engineering in Hamburg, Germany.

  • Chen, J. H., Lee, D.-H., & Cao, J.-X. (2011). Heuristics for quay crane scheduling at indented berth. Transportation Research Part E, 47, 1005–1020.

    Google Scholar 

  • Cheng, T. C. E., & Sin, C. C. S. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271–292.

    Google Scholar 

  • Cordeau, J.-F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39, 526–538.

    Article  Google Scholar 

  • Drewry Shipping Consultants. (2006). Ship management. London: Drewry Shipping Consultants.

    Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

  • Glover, F. (1977). Heuristic for integer programming using surrogate constraints. Decision Sciences, 8, 156–166.

    Article  Google Scholar 

  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Annals of Discrete Mathematics, 5, 287–326.

    Article  Google Scholar 

  • Huang, E. T., & Chen, H. C. (2003). Ship berthing at a floating pier. in Proceedings of the 13th international offshore and polar engineering conference (Vol. III, pp. 683–690).

  • Imai, A., Nishimura, E., Hattori, M., & Papadimitriou, S. (2007). Berth allocation at indented berths for megacontainerships. European Journal of Operational Research, 179, 579–593.

    Google Scholar 

  • Imai, A., Nishimura, E., & Papadimitriou, S. (2008). Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E, 44, 136–151.

    Article  Google Scholar 

  • Jackson, J. R. (1956). A computing procedure for a line balancing problem. Management Science, 2, 261–271.

    Article  Google Scholar 

  • Kim, M. H., Kumar, B., & Chae, J. W. (2006). Performance evaluation of loading/offloading from floating quay to super container ship. in Proceedings of the sixteenth international offshore and polar engineering conference.

  • Kim, J., & Morrison, J. R. (2011). Offshore port service concepts: Classification and economic feasibility. Flexible Services and Manufacturing Journal (in press).

  • Kumar, B. (2005). Dynamic analysis of floating quay and container ship for container loading and offloading operation. Master’s Thesis, Texas A &M University.

  • Lim, A. (1998). The berth planning problem. Operations Research Letters, 22, 105–110.

    Article  Google Scholar 

  • Morrison, J. R., & Lee, T. (2009). Decoupling (un)loading operations from the land–sea interface in port service: The mobile floating port concept. Proceedings of the 5th international conference on axiomatic design, Lisbon (pp. 57–63).

  • Nam, H., & Lee, T. (2012). A scheduling problem for a novel container transport system: A case of mobile harbor operation schedule. Flexible Services and Manufacturing Journal (in press).

  • Stahlbock, R., & Voß, S. (2008). Operations research at container terminals: A literature update. OR Spectrum, 30, 1–52.

    Article  Google Scholar 

  • Steenken, D., Voß, S., & Stahlbock, R. (2004). Container terminal operation and operations research—A classification and literature review. OR Spectrum, 26, 3–49.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Operations Management, Friedrich-Schiller-Universität Jena, Carl-Zeiß-Straße 3, 07743 , Jena, Germany

    Simon Emde & Nils Boysen

  2. Lehrstuhl für Quantitative Planung, Universität Siegen, Hölderlinstraße 3, 57076 , Siegen, Germany

    Dirk Briskorn

Authors
  1. Simon Emde
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nils Boysen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dirk Briskorn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nils Boysen.

Appendices

Appendix 1: Mixed integer programming model for BAP–MQW

See Table 4.

Table 4 Notation
Full size table

Applying the notation summarized in Table 4 the mixed-integer programming model for BAP–MQW consists of objective function (2) and constraints (3)–(11).

$$\begin{aligned} \mathrm{Minimize}\, Z = \sum _{j=1,\ldots ,n} \left( P_{j} + 2\cdot D\cdot y_j \right) , \end{aligned}$$
(2)

subject to

$$\begin{aligned}&\sum _{j=1,\ldots ,n} \left( x^\mathrm{in}_{i,j}+x^\mathrm{out}_{i,j}\right) = 1 \quad \forall \, i=1,\ldots ,n, \end{aligned}$$
(3)
$$\begin{aligned}&P_{j} \ge \sum _{i=1,\ldots ,n}c_i\cdot f^\mathrm{in}\cdot x^\mathrm{in}_{i,j}\quad \forall \, j=1,\ldots ,n, \end{aligned}$$
(4)
$$\begin{aligned}&P_{j} \ge \sum _{i=1,\ldots ,n}c_i\cdot f^\mathrm{out}\cdot x^\mathrm{out}_{i,j}\quad \forall \, j=1,\ldots ,n, \end{aligned}$$
(5)
$$\begin{aligned}&n\cdot y_{j} \ge \sum _{i=1,\ldots ,n} \left( x^\mathrm{in}_{i,j}+x^\mathrm{out}_{i,j}\right) \quad \forall \, j=1,\ldots ,n, \end{aligned}$$
(6)
$$\begin{aligned}&\sum _{i = 1}^n{x^\mathrm{in}_{i,j}} \le 1 \quad \forall \, j = 1, \ldots , n, \end{aligned}$$
(7)
$$\begin{aligned}&x^\mathrm{in}_{i,j} \in \{0,1\} \quad \forall \, i=1,\ldots ,n, j=1,\ldots ,n, \end{aligned}$$
(8)
$$\begin{aligned}&x^\mathrm{out}_{i,j} \in \{0,1\} \quad \forall \, i=1,\ldots ,n, j=1,\ldots ,n, \end{aligned}$$
(9)
$$\begin{aligned}&y_{j} \in \{0,1\} \quad \forall \, j=1,\ldots ,n, \end{aligned}$$
(10)
$$\begin{aligned}&P_{j} \ge 0 \quad \forall \, j=1,\ldots ,n. \end{aligned}$$
(11)

Objective (2) minimizes the makespan. Equation (3) ensures that each ship is assigned to exactly one slot. Note that we do not need more than \(n\) slots. Hence, we consider a fixed number of \(n\) slots and allow slots to remain empty. Constraints (4) and (5) force \(P_{j}\) to be at least slot \(j\)’s duration. Inequalities (6) force \(y_j\) to equal 1 if at least one ship is assigned to \(j\), while constraints (7) restrict the number of inner ships per slot to one. Constraints (8)–(11) define the domain of the variables.

Appendix 2: Instances solved in the computational study

See Table 5.

Table 5 Instances generated for the computational study
Full size table

Table 5 lists the instances generated for the computational study of this paper. Columns \(n\) and \(\rho \) describe the parameters used in the instance generation (see Sect. 5 for details), ship container loads lists the number of containers to be (un-)loaded for each of the \(n\) ships, and opt. shows the optimal makespan in minutes for \(f^\mathrm{in} = 0.25, \, f^\mathrm{out} = 0.35\) and \(D = 30\).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Emde, S., Boysen, N. & Briskorn, D. The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions. J Sched 17, 289–303 (2014). https://doi.org/10.1007/s10951-013-0358-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-013-0358-5

Keywords

Search

Navigation