Reducción del costo de transportación en las Series Nacionales de Béisbol de Cuba empleando metaheurísticas

• Autores: Alejandro Rosete Suárez , David Paredes Miranda, Eduardo Sánchez Ansola
• Localización: Ingeniería Mecánica, ISSN-e 1815-5944, Vol. 16, Nº. 3, 2013, págs. 257-270
• Idioma: español
• Títulos paralelos:
  • Metaheuristics for the reduction of transportation cost in Baseball National Series
• Enlaces
  • Texto completo
• Resumen
  • español

    El costo de transportación de las Series Nacionales de Beísbol en Cuba incluye los movimientos de los equipos entre las distintas provincias. La distancia total recorrida depende del calendario de la competencia que define el orden de los juegos. Hasta el año 2012, estos calendarios fueron construidos manualmente. El objetivo de este trabajo fue demostrar como puede reducirse la distancia total recorrida, mediante el uso de metaheurísticas. Fue necesario plantear todos los aspectos que definen el problema de optimización correspondiente. Luego, se compararon varias metaheurísticas en este problema y se demostró que los mejores resultados eran obtenidos por las metaheurísticas Record-to-Record Travel (RRT) y Escalador de Colinas. Los calendarios obtenidos ahorran entre un 13 y un 29 % de la distancia y se obtienen en menos del 1 % del tiempo, en comparación con la solución manual.

  • English

    The transportation cost of Baseball National Series includes the displacements of the team form one province to other. The total amount of traveled distance depends on the shedulle that defines the order of the games. Until 2012, theses schedules were constructed manually. The main goal of this paper is to demonstate how it can be reduced the total distance traveled by the teams by using metaheuristics. It was necessary to define the different aspects of the corresponding optimization problem. Then, several metaheuristics were compared in order to demonstrate that the best results were obtained by Record-to-Record Travel (RRT) and Hill Climbing. The schedules obtained by these metaheuristics allow to save between 13 and 29% of the overall distance travelled by teams and they are obtained in about 1 % of the time, in comparison to the official schedules designed by human experts.

• Referencias bibliográficas
  • Doerner, K. F., Gendreau, M., Greistorfer, P.. (2007). Operations Research/Computer Science Interfaces Series. Springer Science and Business...
  • Talbi, E.. (2009). Metaheuristics:: From Design to Implementation. John Wiley & Sons. New Jersey. 1-79
  • Wolpert, D. H., Macready, W. G.. (1997). No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation. 1. 67-82
  • Easton, K., Nemhauser, G., Trick, M.. (2001). The Traveling Tournament Problem Description and Benchmarks. Principles and Practice of Constraint...
  • Ribeiro, C. C., Urrutia, S.. (2007). Heuristics for the Mirrored Traveling Tournament Problem. European Journal of Operational Research. 179....
  • Kendall, G., McCollum, B., Cruz, F.. (2010). 8th International Conference on Practice and Theory of Automated Timetabling, PATAT. Queen's...
  • Imahori, S., Matsui, T., Miyashiro, R.. (2010). 8th International Conference on Practice and Theory of Automated Timetabling. Queen's...
  • Bar-Noy, A., Moody, D.. (2006). 6th International Conference on Practice and Theory of Automated Timetabling. Faculty of Informatics, Masaryk...
  • Bonomo, F., Burzyn, A., Cardemil, A.. (2012). An application of the traveling tournament problem:: The Argentine volleyball league. Interfaces....
  • Costa, F. N., Urrutia, S., Ribeiro, C. C.. (2012). An ILS heuristic for the traveling tournament problem with predefined venues. Annals of...
  • Ribeiro, C. C., Urrutia, S.. (2006). 6th International Conference on Practice and Theory of Automated Timetabling PATAT. Faculty of Informatics,...
  • Choubey, N. S.. (2010). A Novel Encoding Scheme for Traveling Tournament Problem using Genetic Algorithm. IJCA Special Issue on Evolutionary...
  • Suzuka, A., Miyashiro, R., Yoshise, A.. (2005). Algorithmic Applications in Management.: Lecture Notes in Computer Science. Springer Berlin...
  • Kendall, G., McCollum, B., Cruz, F. R.. (2013). Hybrid Metaheuristics. Springer Berlin Heidelberg. Berlin. 369-385
  • Schonberger, J., Mattfeld, D. C., Kopfer, H.. (2000). Automated Timetable Generation for Rounds of a Table-Tennis League. Evolutionary Computation....