Silvino Fernández
ABSTRACT
Metaheuristics include a wide range of optimization algorithms. Some of them are very well known and with proven value, as they solve successfully many examples of combinatorial NP-hard problems. Some examples of Metaheuristics are Genetic Algorithms (GA), Simulated Annealing (SA) or Ant Colony Optimization (ACO). Our company is devoted to making steel and is the biggest steelmaker in the world. Combining several industrial processes to produce 84.6 million tones (public official data of 2015) involves huge effort. Metaheuristics are applied to different scenarios inside our operations to optimize different areas: logistics, production scheduling or resource assignment, saving costs and helping to reach operational excellence, critical for our survival in a globalized world. Rather than obtaining the global optimal solution, the main interest of an industrial company is to have "good solutions", close to the optimal, but within a very short response time, and this latter requirement is the main difference with respect to the traditional research approach from the academic world. Production is continuous and it cannot be stopped or wait for calculations, in addition, reducing production speed implies decreasing productivity and making the facilities less competitive. Disruptions are common events, making rescheduling imperative while foremen wait for new instructions to operate. This position paper explains the problem of the time response in our industrial environment, the solutions we have investigated and some results already achieved.
- Cáceres, L. Pérez, M. López-Ibánez, and T. Stützle. 2014. "Ant Colony Optimization on a Budget of 1000." http://iridia.ulb.ac.be/IridiaTrSeries/rev/IridiaTr2014-009r00pdf.Google Scholar
- Díaz, Diego, Pablo Valledor, Paula Areces, Jorge Rodil, and Montserrat Suárez. 2014. "An ACO Algorithm to Solve an Extended Cutting Stock Problem for Scrap Minimization in a Bar Mill." In Swarm Intelligence, edited by Marco Dorigo, Mauro Birattari, Simon Garnier, Heiko Hamann, Marco Montes de Oca, Christine Solnon, and Thomas Stützle, 13--24. Lecture Notes in Computer Science 8667. Springer International Publishing. http://link.springer.com/chapter/10.1007/978-3-319-09952-1_2.Google Scholar
- Dorigo, Marco. 1992. "Optimization, Learning and Natural Algorithms." Ph. D. Thesis, Politecnico Di Milano, Italy. http://ci.nii.ac.jp/naid/10016599043/.Google Scholar
- Fernández Alzueta, S., S. Álvarez, E. Malatsetxebarria, P. Valledor, and D. Díaz. 2015. "Performance Comparison of Ant Colony Algorithms for the Scheduling of Steel Production Lines." In Genetic and Evolutionary Computation Conference, 1387--88. ACM. http://dl.acm.org/citation.cfm?id=2764658. Google ScholarDigital Library
- Fernández Alzueta, Silvino, Diego Díaz Fidalgo, Tatiana Manso Nuño, and Montserrat Suarez Rodríguez. 2006. "Optimization Techniques to Improve the Management of a Distribution Fleet in the Steel Industry."Google Scholar
- Fernandez, Silvino, Segundo Alvarez, Diego Díaz, Miguel Iglesias, and Borja Ena. 2014. "Scheduling a Galvanizing Line by Ant Colony Optimization." In Swarm Intelligence, 146--57. Brussels: Springer. http://link.springer.com/chapter/10.1007/978-3-319-09952-1_13.Google Scholar
- Janson, Stefan, Daniel Merkle, and Martin Middendorf. 2005. "Parallel Ant Colony Algorithms." Parallel Metaheuristics: A New Class of Algorithms 47: 171.Google ScholarCross Ref
- López-Ibánez, Manuel, Jérémie Dubois-Lacoste, Thomas Stützle, and Mauro Birattari. 2011. "The Irace Package, Iterated Race for Automatic Algorithm Configuration." IRIDIA, Université Libre de Bruxelles, Belgium, Tech. Rep. TR/IRIDIA/2011-004.Google Scholar
Index Terms
- Criticality of Response Time in the usage of Metaheuristics in Industry
Recommendations
Performance Comparison of Ant Colony Algorithms for the Scheduling of Steel Production Lines
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary ComputationSwarm Intelligence metaheuristics, and among them Ant Colony Optimization (ACO), have been successfully applied worldwide to solve multiple examples of combinatorial NP-hard problems, giving good solutions in a reasonable period of time (an essential ...
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
<P>We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple constraints directly without increasing computational complexity. An ...
A Hybrid Particle Swarm Optimization for Solving Vehicle Routing Problem with Time Windows
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary ComputationThis paper presents a hybrid Particle Swarm Optimization (PSO) for solving Vehicle Routing Problem with Time Windows (VRPTW). Three versions of the algorithm were implemented. The first version is a traditional PSO. In this case, the initialization is ...
Comments