Skip to main content

2019 | OriginalPaper | Buchkapitel

6. Storage Yard Management: Modelling and Solving

verfasst von : Gustavo Campos Menezes, Geraldo Robson Mateus, Martín Gómez Ravetti

Erschienen in: Bioinspired Heuristics for Optimization

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

The volume of cargo transported and stored around the world grows every year. To ensure competitiveness, productivity and cost savings, companies continually invest in process improvement and the development of IT tools. This chapter discusses various optimization problems existing in the process of storing and transporting loads. In this work, an integrated problem of planning and scheduling is defined, a mathematical programming model is investigated, and solutions are obtained through the use of heuristics and a commercial optimization package. The computational experiments (based in real cases) showed that the method is more efficient in producing a feasible solution than the solver.

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 Angelelli, E., Kalinowski, T., Kapoor, R., & Savelsbergh, M. W. (2016). A reclaimer scheduling problem arising in coal stockyard management. Journal of Scheduling, 19(5), 563–582.MathSciNetCrossRef Angelelli, E., Kalinowski, T., Kapoor, R., & Savelsbergh, M. W. (2016). A reclaimer scheduling problem arising in coal stockyard management. Journal of Scheduling, 19(5), 563–582.MathSciNetCrossRef
2.
Zurück zum Zitat Barros, V. H., Costa, T. S., Oliveira, A. C. M., & Lorena, L. A. N. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering, 60, 606–613.CrossRef Barros, V. H., Costa, T. S., Oliveira, A. C. M., & Lorena, L. A. N. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering, 60, 606–613.CrossRef
3.
Zurück zum Zitat Bendraouche, M., & Boudhar, M. (2012). Scheduling jobs on identical machines with agreement graph. Computers & Operations Research, 39(2), 382–390.MathSciNetCrossRef Bendraouche, M., & Boudhar, M. (2012). Scheduling jobs on identical machines with agreement graph. Computers & Operations Research, 39(2), 382–390.MathSciNetCrossRef
4.
Zurück zum Zitat Bilgen, B., & Ozkarahan, I. (2007). A mixed-integer linear programming model for bulk grain blending and shipping. International Journal of Production Economics, 107(2), 555–571.CrossRef Bilgen, B., & Ozkarahan, I. (2007). A mixed-integer linear programming model for bulk grain blending and shipping. International Journal of Production Economics, 107(2), 555–571.CrossRef
5.
Zurück zum Zitat Blchliger, I., & Zufferey, N. (2013). Multi-coloring and job-scheduling with assignment and incompatibility costs. Annals of Operations Research, 211(1), 83–101.MathSciNetCrossRef Blchliger, I., & Zufferey, N. (2013). Multi-coloring and job-scheduling with assignment and incompatibility costs. Annals of Operations Research, 211(1), 83–101.MathSciNetCrossRef
6.
Zurück zum Zitat Bodlaender, H. L., Jansen, K., & Woeginger, G. J. (1994). Scheduling with incompatible jobs. Discrete Applied Mathematics, 55(3), 219–232.MathSciNetCrossRef Bodlaender, H. L., Jansen, K., & Woeginger, G. J. (1994). Scheduling with incompatible jobs. Discrete Applied Mathematics, 55(3), 219–232.MathSciNetCrossRef
7.
Zurück zum Zitat Boland, N., Gulezynski, D., & Savelsbergh, M. (2012). A stockyard planning problem. EURO Journal on Transportation and Logistics, 1(3), 197–236.CrossRef Boland, N., Gulezynski, D., & Savelsbergh, M. (2012). A stockyard planning problem. EURO Journal on Transportation and Logistics, 1(3), 197–236.CrossRef
8.
Zurück zum Zitat Conradie, D., Morison, L. E., & Joubert, J. W. (2008). Scheduling at coal handling facilities using simulated annealing. Mathematical Methods of Operations Research, 68(2), 277–293.MathSciNetCrossRef Conradie, D., Morison, L. E., & Joubert, J. W. (2008). Scheduling at coal handling facilities using simulated annealing. Mathematical Methods of Operations Research, 68(2), 277–293.MathSciNetCrossRef
9.
Zurück zum Zitat Feo, T. A., & Resende, M. G. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2), 67–71.MathSciNetCrossRef Feo, T. A., & Resende, M. G. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2), 67–71.MathSciNetCrossRef
10.
Zurück zum Zitat Goodfellow, R., & Dimitrakopoulos, R. (2017). Simultaneous stochastic optimization of mining complexes and mineral value chains. Mathematical Geosciences, 49(3), 341–360.CrossRef Goodfellow, R., & Dimitrakopoulos, R. (2017). Simultaneous stochastic optimization of mining complexes and mineral value chains. Mathematical Geosciences, 49(3), 341–360.CrossRef
11.
Zurück zum Zitat Hu, D., & Yao, Z. (2010). Stacker-reclaimer scheduling for raw material yard operation. In Third International Workshop on Advanced Computational Intelligence, pp. 432–436. Hu, D., & Yao, Z. (2010). Stacker-reclaimer scheduling for raw material yard operation. In Third International Workshop on Advanced Computational Intelligence, pp. 432–436.
12.
Zurück zum Zitat Kaveshgar, N., & Huynh, N. (2015). Integrated quay crane and yard truck scheduling for unloading inbound containers. International Journal of Production Economics, 159, 168–177.CrossRef Kaveshgar, N., & Huynh, N. (2015). Integrated quay crane and yard truck scheduling for unloading inbound containers. International Journal of Production Economics, 159, 168–177.CrossRef
13.
Zurück zum Zitat Lee, D. H., Cao, J. X., Shi, Q., & Chen, J. H. (2009). A heuristic algorithm for yard truck scheduling and storage allocation problems. Transportation Research Part E: Logistics and Transportation Review, 45(5), 810–820.CrossRef Lee, D. H., Cao, J. X., Shi, Q., & Chen, J. H. (2009). A heuristic algorithm for yard truck scheduling and storage allocation problems. Transportation Research Part E: Logistics and Transportation Review, 45(5), 810–820.CrossRef
14.
Zurück zum Zitat Matamoros, M. E. V., & Dimitrakopoulos, R. (2016). Stochastic short-term mine production schedule accounting for fleet allocation, operational considerations and blending restrictions. European Journal of Operational Research, 255(3), 911–921.MathSciNetCrossRef Matamoros, M. E. V., & Dimitrakopoulos, R. (2016). Stochastic short-term mine production schedule accounting for fleet allocation, operational considerations and blending restrictions. European Journal of Operational Research, 255(3), 911–921.MathSciNetCrossRef
15.
Zurück zum Zitat Menezes, G. C., Mateus, G. R., & Ravetti, M. G. (2015). Scheduling with incompatible jobs: model and algorithms. In Proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA), 25–28 Aug, Prague, Czech Republic, (pp. 776–781). Menezes, G. C., Mateus, G. R., & Ravetti, M. G. (2015). Scheduling with incompatible jobs: model and algorithms. In Proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA), 25–28 Aug, Prague, Czech Republic, (pp. 776–781).
16.
Zurück zum Zitat Menezes, G. C., Mateus, G. R., & Ravetti, M. G. (2016). A hierarchical approach to solve a production planning and scheduling problem in bulk cargo terminal. Computers & Industrial Engineering, 97, 1–14.CrossRef Menezes, G. C., Mateus, G. R., & Ravetti, M. G. (2016). A hierarchical approach to solve a production planning and scheduling problem in bulk cargo terminal. Computers & Industrial Engineering, 97, 1–14.CrossRef
17.
Zurück zum Zitat Menezes, G. C., Mateus, G. R., & Ravetti, M. G. (2017). A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports. European Journal of Operational Research, 258(3), 926–937.MathSciNetCrossRef Menezes, G. C., Mateus, G. R., & Ravetti, M. G. (2017). A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports. European Journal of Operational Research, 258(3), 926–937.MathSciNetCrossRef
18.
Zurück zum Zitat Montiel, L., & Dimitrakopoulos, R. (2015). Optimizing mining complexes with multiple processing and transportation alternatives: An uncertainty-based approach. European Journal of Operational Research, 247(1), 166–178.CrossRef Montiel, L., & Dimitrakopoulos, R. (2015). Optimizing mining complexes with multiple processing and transportation alternatives: An uncertainty-based approach. European Journal of Operational Research, 247(1), 166–178.CrossRef
19.
Zurück zum Zitat Newman, A. M., Rubio, R., Caro, R., Weintraub, A., & Eurek, K. (2010). A review of operations research in mine planning. Interfaces, 40(3), 222–245.CrossRef Newman, A. M., Rubio, R., Caro, R., Weintraub, A., & Eurek, K. (2010). A review of operations research in mine planning. Interfaces, 40(3), 222–245.CrossRef
20.
Zurück zum Zitat Niu, B., Xie, T., Tan, L., Bi, Y., & Wang, Z. (2016). Swarm intelligence algorithms for yard truck scheduling and storage allocation problems. Neurocomputing 188, 284–293 (2016): In Advanced Intelligent Computing Methodologies and Applications Selected papers from the Tenth International Conference on Intelligent Computing (ICIC 2014). Niu, B., Xie, T., Tan, L., Bi, Y., & Wang, Z. (2016). Swarm intelligence algorithms for yard truck scheduling and storage allocation problems. Neurocomputing 188, 284–293 (2016): In Advanced Intelligent Computing Methodologies and Applications Selected papers from the Tenth International Conference on Intelligent Computing (ICIC 2014).
21.
Zurück zum Zitat Pimentel, B. S., Mateus, G. R., & Almeida, F. A. (2013). Stochastic capacity planning and dynamic network design. International Journal of Production Economics, 145(1), 139–149.CrossRef Pimentel, B. S., Mateus, G. R., & Almeida, F. A. (2013). Stochastic capacity planning and dynamic network design. International Journal of Production Economics, 145(1), 139–149.CrossRef
22.
Zurück zum Zitat Ribeiro, G. M., Mauri, G. R., de Castro Beluco, S., & Antonio, L. (2016). Berth allocation in an ore terminal with demurrage, despatch and maintenance. Computers & Industrial Engineering, 96, 8–15.CrossRef Ribeiro, G. M., Mauri, G. R., de Castro Beluco, S., & Antonio, L. (2016). Berth allocation in an ore terminal with demurrage, despatch and maintenance. Computers & Industrial Engineering, 96, 8–15.CrossRef
23.
Zurück zum Zitat Robenek, T., Umang, N., & Bierlaire, M. (2014). A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. European Journal of Operational Research, 235(2), 399–411.MathSciNetCrossRef Robenek, T., Umang, N., & Bierlaire, M. (2014). A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. European Journal of Operational Research, 235(2), 399–411.MathSciNetCrossRef
24.
Zurück zum Zitat Savelsbergh, M. (2015). Cargo assembly planning. EURO Journal on Transportation and Logistics, 4(3), 321–354.CrossRef Savelsbergh, M. (2015). Cargo assembly planning. EURO Journal on Transportation and Logistics, 4(3), 321–354.CrossRef
25.
Zurück zum Zitat Singh, G., Sier, D., Ernst, A. T., Gavriliouk, O., Oyston, R., Giles, T., et al. (2012). A mixed integer programming model for long term capacity expansion planning: A case study from the hunter valley coal chain. European Journal of Operational Research, 220(1), 210–224.MathSciNetCrossRef Singh, G., Sier, D., Ernst, A. T., Gavriliouk, O., Oyston, R., Giles, T., et al. (2012). A mixed integer programming model for long term capacity expansion planning: A case study from the hunter valley coal chain. European Journal of Operational Research, 220(1), 210–224.MathSciNetCrossRef
26.
Zurück zum Zitat Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148–161.CrossRef Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148–161.CrossRef
Metadaten
Titel
Storage Yard Management: Modelling and Solving
verfasst von
Gustavo Campos Menezes
Geraldo Robson Mateus
Martín Gómez Ravetti
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-319-95104-1_6