Skip to main content
Erschienen in: Cluster Computing 1/2017

10.11.2016

Decision support based automatic container sequencing system using heuristic rules

verfasst von: Yi Ding, Xu-Jun Wei, Yang Yang, Tian-Yi Gu

Erschienen in: Cluster Computing | Ausgabe 1/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Container terminals in seaports constitute interfaces between the seaborne transport and transport-over-land of goods in global transport chains. The loading and unloading of containers are performed using quay cranes (QCs), which is the most important equipment for handling servicing vessels at a container terminal. Following tremendous growth in global container transshipments, terminals are facing increasing demand. Terminals at Shanghai are equipped with Tandem Lift which can lift two 40’ containers simultaneously to improve the efficiency of the QCs. A reasonable container combinations of Tandem Lift and container operation sequence are required to improve the servicing of vessels, meanwhile the dual cycling container operation of quay cranes has to be investigated. This paper presents a two-stage mathematical model and two-level heuristic algorithm for planning the container operation sequence using Tandem Lift in a feasible computational time. Based on the proposed methodology, a decision support system, called the Tandem Lift Container Sequence System (TLCSS). A case study of Shanghai Shengdong International Port Company (SSICT) proves that consideration of the container sequence with Tandem Lift dramatically shortens servicing time of vessels with the TLCSS.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Kim, K.H., Park, Y.M.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 1563, 752–768 (2004)CrossRefMATH Kim, K.H., Park, Y.M.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 1563, 752–768 (2004)CrossRefMATH
2.
Zurück zum Zitat Der Horng, Lee, Wang, H.Q., Miao, L.: Quay crane scheduling with non-interference constraints in port container terminals’. Transp. Res. Part E Logist. Transp. Rev. 441, 124–135 (2008) Der Horng, Lee, Wang, H.Q., Miao, L.: Quay crane scheduling with non-interference constraints in port container terminals’. Transp. Res. Part E Logist. Transp. Rev. 441, 124–135 (2008)
3.
4.
Zurück zum Zitat Zhu, Y., Lim, A.: Crane scheduling with non-crossing constraint. J. Oper. Res. Soc. 5757, 1464–1471 (2006)CrossRefMATH Zhu, Y., Lim, A.: Crane scheduling with non-crossing constraint. J. Oper. Res. Soc. 5757, 1464–1471 (2006)CrossRefMATH
5.
Zurück zum Zitat Liu, J., Wan, Y.W., Wang, L.: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav. Res. Logist. 53(1), 60–74 (2006)MathSciNetCrossRefMATH Liu, J., Wan, Y.W., Wang, L.: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav. Res. Logist. 53(1), 60–74 (2006)MathSciNetCrossRefMATH
6.
Zurück zum Zitat Goodchild, A.V., Daganzo, C.F.: Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transp. Sci. 404, 473–483 (2006)CrossRef Goodchild, A.V., Daganzo, C.F.: Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transp. Sci. 404, 473–483 (2006)CrossRef
7.
Zurück zum Zitat Goodchild, A.V., Daganzo, C.F.: Crane double cycling in container ports: planning methods and evaluation. Transp. Res. Part B Methodol. 418, 875–891 (2007)CrossRef Goodchild, A.V., Daganzo, C.F.: Crane double cycling in container ports: planning methods and evaluation. Transp. Res. Part B Methodol. 418, 875–891 (2007)CrossRef
8.
Zurück zum Zitat Zhang, H., Kim, K.H.: Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput. Ind. Eng. 563, 979–992 (2009)CrossRef Zhang, H., Kim, K.H.: Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput. Ind. Eng. 563, 979–992 (2009)CrossRef
9.
Zurück zum Zitat Meisel, F., Wichmann, M.: Container sequencing for quay cranes with internal reshuffles. Oper. Res. Spektrum 32(3), 569–591 (2010)CrossRefMATH Meisel, F., Wichmann, M.: Container sequencing for quay cranes with internal reshuffles. Oper. Res. Spektrum 32(3), 569–591 (2010)CrossRefMATH
10.
Zurück zum Zitat Chen, L., Langevin, A., Lu, Z.: Integrated scheduling of crane handling and truck transportation in a maritime container terminal. Eur. J. Oper. Res. 225(1), 142–152 (2013)CrossRefMATH Chen, L., Langevin, A., Lu, Z.: Integrated scheduling of crane handling and truck transportation in a maritime container terminal. Eur. J. Oper. Res. 225(1), 142–152 (2013)CrossRefMATH
11.
Zurück zum Zitat Zhen, Lu: Task assignment under uncertainty: stochastic programming and robust optimisation approaches. Int. J. Product. Res. 53(5), 1–16 (2014) Zhen, Lu: Task assignment under uncertainty: stochastic programming and robust optimisation approaches. Int. J. Product. Res. 53(5), 1–16 (2014)
12.
Zurück zum Zitat Kaveshgar, Narges, Huynh, N.: Integrated quay crane and internal truck scheduling for unloading inbound containers. Int. J. Product. Econ. 159(3), 168–177 (2015)CrossRef Kaveshgar, Narges, Huynh, N.: Integrated quay crane and internal truck scheduling for unloading inbound containers. Int. J. Product. Econ. 159(3), 168–177 (2015)CrossRef
13.
Zurück zum Zitat Delavar, A.G., Aryan, Y.: HSGA: a hybrid heuristic algorithm for workflow scheduling in cloud systems. Clust. Comput. 17(1), 129–137 (2014)CrossRef Delavar, A.G., Aryan, Y.: HSGA: a hybrid heuristic algorithm for workflow scheduling in cloud systems. Clust. Comput. 17(1), 129–137 (2014)CrossRef
14.
Zurück zum Zitat Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615–627 (2010)MathSciNetCrossRefMATH Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615–627 (2010)MathSciNetCrossRefMATH
15.
Zurück zum Zitat Bierwirth, C., Meisel, F.: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244, 675–689 (2015)MathSciNetCrossRefMATH Bierwirth, C., Meisel, F.: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244, 675–689 (2015)MathSciNetCrossRefMATH
16.
Zurück zum Zitat Türkoğulları, Y.B., et al.: Optimal berth allocation time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur. J. Oper. Res. 2543, 985–1001 (2016)MathSciNetCrossRefMATH Türkoğulları, Y.B., et al.: Optimal berth allocation time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur. J. Oper. Res. 2543, 985–1001 (2016)MathSciNetCrossRefMATH
17.
Zurück zum Zitat Liu, C., Zhang, C., Li, Z.: Behavior perception-based disruption models for berth allocation and quay crane assignment problems. Comput. Ind. Eng. 97, 258–275 (2016)CrossRef Liu, C., Zhang, C., Li, Z.: Behavior perception-based disruption models for berth allocation and quay crane assignment problems. Comput. Ind. Eng. 97, 258–275 (2016)CrossRef
18.
Zurück zum Zitat Ding, Y., Jia, S., Gu, T., et al.: SGICT builds an optimization-based system for daily berth planning. Interfaces 46(4), 281–296 (2016)CrossRef Ding, Y., Jia, S., Gu, T., et al.: SGICT builds an optimization-based system for daily berth planning. Interfaces 46(4), 281–296 (2016)CrossRef
19.
Zurück zum Zitat Li, F., Sheu, J., Gao, Z., et al.: Solving the continuous berth allocation and specific quay crane assignment problems with quay crane coverage range. Transp. Sci. 49(4), 968–989 (2015)CrossRef Li, F., Sheu, J., Gao, Z., et al.: Solving the continuous berth allocation and specific quay crane assignment problems with quay crane coverage range. Transp. Sci. 49(4), 968–989 (2015)CrossRef
20.
Zurück zum Zitat Türkoğulları, Y.B., et al.: Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. 2351, 88–101 (2014)MathSciNetCrossRefMATH Türkoğulları, Y.B., et al.: Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. 2351, 88–101 (2014)MathSciNetCrossRefMATH
21.
Zurück zum Zitat Pinedo, M.L.: Scheduling, Theory, Algorithms, and Systems, 4th edn. Springer, New York (2010) Pinedo, M.L.: Scheduling, Theory, Algorithms, and Systems, 4th edn. Springer, New York (2010)
Metadaten
Titel
Decision support based automatic container sequencing system using heuristic rules
verfasst von
Yi Ding
Xu-Jun Wei
Yang Yang
Tian-Yi Gu
Publikationsdatum
10.11.2016
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe 1/2017
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-016-0678-2

Weitere Artikel der Ausgabe 1/2017

Cluster Computing 1/2017 Zur Ausgabe

Premium Partner