IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

The Application of Hanoi Towers Game in Logistics Management

The Application of Hanoi Towers Game in Logistics Management
View Sample PDF
Author(s): José Alberto Hernández Aguilar (Autonomous University of Morelos State, Mexico), Augusto Renato Pérez Mayo (Autonomous University of Morelos State, Mexico), Santiago Yip Ortuño (Autonomous University of Morelos State, Mexico), Alberto Ochoa-Zezzatti (Autonomous University of Juarez City, Mexico)and Julio César Ponce Gallegos (Autonomous University of Aguascalientes, Mexico)
Copyright: 2016
Pages: 12
Source title: Handbook of Research on Military, Aeronautical, and Maritime Logistics and Operations
Source Author(s)/Editor(s): Alberto Ochoa-Zezzatti (Juarez City University, Mexico), Jöns Sánchez (Consejo Nacional De Ciencie Y Tecnologia (CONACYT), Mexico), Miguel Gastón Cedillo-Campos (Transportation Systems and Logistics National Laboratory, Mexican Institute of Transportation, Mexico)and Margain de Lourdes (Polytechnic University of Aguascalientes, Mexico)
DOI: 10.4018/978-1-4666-9779-9.ch022

Purchase

View The Application of Hanoi Towers Game in Logistics Management on the publisher's website for pricing and purchasing information.

Abstract

In this chapter we discussed the application of Towers of Hanoi in logistics management applications, for this purpose. Firstly, we discussed how pile problems applications impact in logistics, later we discussed the Hanoi Towers application in Logistics Management, its mathematical model and common solutions applying different paradigms (iterative, recursive, and heuristics), we present an in depth analysis in genetic algorithms, later we present the analysis of a genetic algorithm applied to solve basic Hanoi Tower game (three pegs three discs) implemented in C language, and later we discuss its generalization from three to four discs. Finally, we discussed preliminary results and present our conclusions. Main contribution of this chapter is demonstrate game theory, specifically Towers of Hanoi, can be applied to solve logistics problems, and an approach for the generalization of basic Hanoi Tower form, three discs to four discs, by means of genetic algorithms implemented in C language.

Related Content

Sonal Linda. © 2024. 24 pages.
Yasmin Yousaf Mossa, Peter Smith, Kathleen Ann Bland. © 2024. 40 pages.
Ugochukwu Okwudili Matthew, Jazuli Sanusi Kazaure, Charles Chukwuebuka Ndukwu, Godwin Nse Ebong, Andrew Chinonso Nwanakwaugwu, Ubochi Chibueze Nwamouh. © 2024. 29 pages.
Shruti Jose, Priyakrushna Mohanty. © 2024. 20 pages.
Richa Srishti. © 2024. 15 pages.
Aleksei Alipichev, Liudmila Nazarova, Yana Chistova. © 2024. 21 pages.
Mustafa Öztürk Akcaoğlu, Burcu Karabulut Coşkun. © 2024. 18 pages.
Body Bottom