Some examples are mentioned in (Hempel and Schmiedel, 2006): imagine a port where there are several containers and is necessary to load or to unload loading from the containerships, or suppose large concrete parts for a modern bridge or construction of buildings, or the shunt of trains in a marshaling yard, or patient plays. Pile Problems Applications in Logistics Management 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.ġ.1. Finally, we discussed preliminary results and present our conclusions.
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. AbstractIn this chapter we discussed the application of Towers of Hanoi in logistics management applications, for this purpose.
0 kommentar(er)
