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

05.02.2018

Research on coordinated scheduling of multiple systems and single jobs based on improved particle swarm optimization

verfasst von: Dingyou Lei, Peng Zhang, Yinggui Zhang, Yangkun Xia, Shuo Zhao

Erschienen in: Cluster Computing | Sonderheft 1/2019

Einloggen

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

search-config
loading …

Abstract

Railway container yard is an important node in container transportation system, plays a very important role in the global logistics integration, improve the railway container freight yard handling equipment operation scheduling level, speed up the internal connection efficiency, reasonable co-ordination of container truck railway container freight yard handling equipment resources configuration can significantly improve the overall efficiency of railway container freight yard, reduce comprehensive operation cost. This article has carried on the research from the different aspect and the application angle separately: firstly, multi system for unloading the single operation coordination scheduling problem, in order to improve the efficiency of container handling equipment, reduce the waiting time of the container class column, the key equipment of different types (yard crane, container truck, internal to the hair line Longmen crane) work plan and consider the coordination of scheduling, considering the control the mutual influence between different handling equipment, build a multi system operation coordination scheduling model, the optimization results obtained through calculation by using the improved particle swarm algorithm; secondly, the dual task coordinated scheduling problem of multi system for unloading and loading operations, in the work cycle range, considering the hair line gantry crane and yard crane loading and unloading order, internal container truck transport order, we constructed a multi system coordination operation The mathematical model of scheduling is used to realize the optimization of multiple systems. The improved particle swarm algorithm is used to obtain the optimization results through an example, and the relevant conclusions are obtained by analysis.

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 Bish, E.K., Leong, T.Y.: Analysis of a new vehicle scheduling and location problem. Naval Res. Logist. 48(5), 1003–1024 (2011)MathSciNet Bish, E.K., Leong, T.Y.: Analysis of a new vehicle scheduling and location problem. Naval Res. Logist. 48(5), 1003–1024 (2011)MathSciNet
2.
Zurück zum Zitat Chen, L., Bostel, N.: A tuba search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur. J. Oper. Res. 181(3), 41–58 (2017) Chen, L., Bostel, N.: A tuba search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur. J. Oper. Res. 181(3), 41–58 (2017)
3.
Zurück zum Zitat Li, C.L., Vairaktarakis, G.L.: Loading and unloading operations in container terminals. IIE Trans. 36(8), 287–298 (2014) Li, C.L., Vairaktarakis, G.L.: Loading and unloading operations in container terminals. IIE Trans. 36(8), 287–298 (2014)
4.
Zurück zum Zitat Thomas, D.J., Griffin, P.M.: Coordinated supply chain management. Eur. J. Oper. Res. 94(4), 1–15 (2016)MATH Thomas, D.J., Griffin, P.M.: Coordinated supply chain management. Eur. J. Oper. Res. 94(4), 1–15 (2016)MATH
5.
Zurück zum Zitat Hall, N.G., Potts, C.N.: Supply chain scheduling batching and delivery. Oper. Res. 51(4), 556–584 (2013)MathSciNet Hall, N.G., Potts, C.N.: Supply chain scheduling batching and delivery. Oper. Res. 51(4), 556–584 (2013)MathSciNet
6.
Zurück zum Zitat Agnetis, A., Zhou, J.: Supply chain scheduling: sequence coordination. Discret. Appl. Math. 15(4), 201–206 (2016) Agnetis, A., Zhou, J.: Supply chain scheduling: sequence coordination. Discret. Appl. Math. 15(4), 201–206 (2016)
7.
Zurück zum Zitat Chen, Z.L., Hall, N.G.: Supply chain scheduling conflict and cooperation in assembly systems. Oper. Res. 55(6), 72–89 (2017)MathSciNet Chen, Z.L., Hall, N.G.: Supply chain scheduling conflict and cooperation in assembly systems. Oper. Res. 55(6), 72–89 (2017)MathSciNet
8.
Zurück zum Zitat Sarkar, B.: A production inventory model with probabilistic deterioration in two echelon supply chain management. Appl. Math. Model 3(7), 138–151 (2013)MathSciNetMATH Sarkar, B.: A production inventory model with probabilistic deterioration in two echelon supply chain management. Appl. Math. Model 3(7), 138–151 (2013)MathSciNetMATH
10.
Zurück zum Zitat Averbakh, I., Xue, Z.: Online supply chain scheduling problems with preemption. Eur. J. Oper. Res. 18(1), 50–54 (2017) Averbakh, I., Xue, Z.: Online supply chain scheduling problems with preemption. Eur. J. Oper. Res. 18(1), 50–54 (2017)
11.
Zurück zum Zitat Chen, Z.L., Vairaktarakis, G.L.: Integrated scheduling of production and distribution operations. Manag. Sci. 55(4), 614–628 (2015)MATHCrossRef Chen, Z.L., Vairaktarakis, G.L.: Integrated scheduling of production and distribution operations. Manag. Sci. 55(4), 614–628 (2015)MATHCrossRef
12.
Zurück zum Zitat Aliev, R.A., Guirimov, B.G.: Fuzzy genetic approach to aggregate production distribution planning in supply chain management. Inf. Sci. 17(7), 41–55 (2017) Aliev, R.A., Guirimov, B.G.: Fuzzy genetic approach to aggregate production distribution planning in supply chain management. Inf. Sci. 17(7), 41–55 (2017)
13.
Zurück zum Zitat Hall, N.G., Liu, Z.: Capacity allocation and scheduling in supply chains. Oper. Res. 58(6), 11–25 (2015)MathSciNet Hall, N.G., Liu, Z.: Capacity allocation and scheduling in supply chains. Oper. Res. 58(6), 11–25 (2015)MathSciNet
14.
Zurück zum Zitat Sana, S.S.: A production inventory model of imperfect quality products in a three layer supply chain. Decis. Support Syst. 50(1), 39–47 (2011) Sana, S.S.: A production inventory model of imperfect quality products in a three layer supply chain. Decis. Support Syst. 50(1), 39–47 (2011)
15.
Zurück zum Zitat Mousavi, S.M.: A hybrid simulated annealing algorithm for location and routing scheduling problems with cross docking in the supply chain. J. Manuf. Syst 33(2), 35–47 (2013) Mousavi, S.M.: A hybrid simulated annealing algorithm for location and routing scheduling problems with cross docking in the supply chain. J. Manuf. Syst 33(2), 35–47 (2013)
16.
Zurück zum Zitat Chang, D., Jiang, Z.: Integrating berth allocation and quay crane assignments. Transp. Res. Part E 46(6), 975–991 (2014)CrossRef Chang, D., Jiang, Z.: Integrating berth allocation and quay crane assignments. Transp. Res. Part E 46(6), 975–991 (2014)CrossRef
17.
Zurück zum Zitat Zhang, C., Zheng, L.: The allocation of berths and quay cranes by using a sub-gradient optimization technique. Comput. Ind. Eng. 58(2), 41–51 (2015)MathSciNet Zhang, C., Zheng, L.: The allocation of berths and quay cranes by using a sub-gradient optimization technique. Comput. Ind. Eng. 58(2), 41–51 (2015)MathSciNet
18.
Zurück zum Zitat Guo, J., Yang, Y.: Objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. J. Intell. Manuf. 22(38), 471–481 (2011) Guo, J., Yang, Y.: Objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. J. Intell. Manuf. 22(38), 471–481 (2011)
19.
Zurück zum Zitat Wang, N., Zhao, B.: A berth scheduling problem under sailing schedule disruption. Comput. Ind. Eng. 13(9), 33–37 (2010) Wang, N., Zhao, B.: A berth scheduling problem under sailing schedule disruption. Comput. Ind. Eng. 13(9), 33–37 (2010)
20.
Zurück zum Zitat Meisel, F., Bierwirth, C.: A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp. Sci. 47(2), 131–147 (2013)CrossRef Meisel, F., Bierwirth, C.: A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp. Sci. 47(2), 131–147 (2013)CrossRef
21.
Zurück zum Zitat Song, L., Cherrett, T., Guan, W.: Study on berth planning problem in a container seaport using an integrated programming approach. Comput. Ind. Eng. 62(1), 119–128 (2014)CrossRef Song, L., Cherrett, T., Guan, W.: Study on berth planning problem in a container seaport using an integrated programming approach. Comput. Ind. Eng. 62(1), 119–128 (2014)CrossRef
Metadaten
Titel
Research on coordinated scheduling of multiple systems and single jobs based on improved particle swarm optimization
verfasst von
Dingyou Lei
Peng Zhang
Yinggui Zhang
Yangkun Xia
Shuo Zhao
Publikationsdatum
05.02.2018
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe Sonderheft 1/2019
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-1768-0

Weitere Artikel der Sonderheft 1/2019

Cluster Computing 1/2019 Zur Ausgabe