Abstract
Global competition has forced industries to be in a constant search of technology; however, any technology that involves an advantage is temporary. Nowadays, a computer is seen in every enterprise mostly with the objective of being an advantage and as a tool to facilitate tasks (besides entertaining). Thus, a question arises, is it the most modern and expensive computer a significant advantage by default? I guess not today. The development of computers has arguably been the most radical achievement in the history of science and technology. The first computer scientists were motivated in large part by visions of creating computers programs with intelligence, mainly focusing to modeling the brain, imitating human behavior, and simulating biological evolution. This matter had its takeoff in the early 1980s, mostly by the advances in computational power; with evolutionary computation as one of the first ones, where “genetic algorithm” is the most prominent example (Mitchell 1998). Therefore, the “best” technologies are not limited to the acquisition of modern equipment or expensive machinery, but also include the progress and implementation of intelligent computational approaches such as the Genetic Algorithm. Therefore, the aim of this chapter is to show some applications of Genetic algorithm in the manufacturing sector in order to obtain a lean environment. This chapter begins with a brief definition of what a Genetic Algorithm is, its basic elements, and some numerical examples in order to facilitate its application. Next, two cases taken from the manufacturing industry of Juarez, Mexico are illustrated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alvarado-Iniesta, A., García-Alcaraz, J. L., Rodríguez, M., & Maldonado, A. (2013). Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm. Expert Systems with Applications, 40, 4785–4790.
Bertsimas, D., & Tsitsiklis J. N. (1997). Introduction to linear optimization. Belmont: Athena Scientific.
Davis, L. (1991). Handbook of genetic algorithms. New York: Van Nostrand Reinhold.
Erwin, D (2008). In S. N. Durlauf & L. E. Blume (Eds.) Cost functions, the new palgrave dictionary of economics. (2nd ed.). London: Palgrave Macmillan.
Gen, M., & Cheng, R. (2000). Genetic Algorithms and engineering optimization. New York, NY: Wiley.
Goldberg, D. (1989). Genetic algorithms in search, optimization, and machine learning. Boston, MA: Addison-Wesley.
Gwiazda, T. D. (2006). Genetic Algorithms Reference: Crossover for single-objective numerical optimization problems. Polongne: Tomas Gwiazda.
Haupt, R.L. & Haupt, S.E. (2004). Practical genetic algorithms. (2nd ed.). New York: Wiley.
Holland, J. (1992). Adaptation in natural and artificial systems. Cambridge, MA: MIT Press.
Meyers, F. E., & Stewart, J. R. (2001). Motion and Time study for lean manufacturing (3rd ed.). New Jersey: Prentice Hall.
Mitchell, M. (1998). An introduction to genetic algorthms. Cambridge, MA: MIT Press.
Oliver, I. M., Smith, D. J., Holland J.H. (1987). A study of permutation crossover operators on the travelling salesman problem, In Proceedings of the Third International Conference on Genetic Algorithms, London, Lawrence Eribaum Associates, 1987.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Alvarado-Iniesta, A., García-Alcaraz, J.L., Pérez-Domínguez, L. (2014). Alternatives Methodologies for Lean Manufacturing: Genetic Algorithm. In: García-Alcaraz, J., Maldonado-Macías, A., Cortes-Robles, G. (eds) Lean Manufacturing in the Developing World. Springer, Cham. https://doi.org/10.1007/978-3-319-04951-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-04951-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04950-2
Online ISBN: 978-3-319-04951-9
eBook Packages: EngineeringEngineering (R0)