|
Vol: 57(71) No: 3 / September 2012 Possible Extensions of Model for Forklift Inner Transportation Optimization I. Beker University of Novi Sad/Faculty of Technical Sciences, Novi Sad, Serbia, phone: (+381) 21 485-2148, e-mail: beker@uns.ac.rs V. Jevtic University of Novi Sad/Technical Faculty “Mihajlo Pupin”, Zrenjanin, Serbia, phone: (+381) 23 550-515, e-mail: vesna@tfzr.uns.ac.rs D. Dobrilovic University of Novi Sad/Technical Faculty “Mihajlo Pupin”, Zrenjanin, Serbia, e-mail: ddobrilo@tfzr.rs Z. Stojanov University of Novi Sad/Technical Faculty “Mihajlo Pupin”, Zrenjanin, Serbia, e-mail: zeljko.stojanov@tfzr.rs Keywords: inner transport optimization, warehouse graph model, forklift movement, shortest path algorithm Abstract Todays economy requires optimization and minimization of all possible costs. The inner transportation costs are recognized as one of them. The forklift inner transportation optimization in warehouses can be accomplished by using shortest path algorithms. This paper describes usage of the Dijkstra’s shortest-path algorithm for making a model for that purpose. The model integrates 2D graph of warehouse layout, its 3D extension, historical data, ABC analysis and business process model. The proposed model was good enough to calculate approximate path cost for every storage location in the warehouse. In order to make this model as much accurate as it is possible, the extension of the model with calculation of turning of forklift is added as well. References U. S. S. Dharmapriya, A. K. Kulatunga, “New Strategy forWarehouse Optimization – Lean warehousing”, Proceedings of 2011 International Conference on Industrial Engineering and Operations Management, Kuala Lumpur, Malaysia, 2011. [2] G. Đukić, V. Česnik and T. Opetuk, “Order-pickingMethods and Technologies for Greener Warehousing”, Strojarstvo, vol. 52, pp. 23-31, 2010. [3] E. W. Dijkstra’s, “A note on two problems in connexion withgraphs“, Numerische Mathematik, vol. 1, pp. 269–271, 1959. [4] M. Hentschel, D. Lecking, B. Wagner, “Deterministic path planning and navigation for an autonomousforklift truck”, Proceedings of IFAC 2007, 2007. [5] K. T. Vivaldini, J. P. M. Galdames, T. B. Pasqual, R. C. Araújo,R. M. Sobral, M. Becker, and G. A. P. Caurin, “Robotic Forkliftsfor Intelligent Warehouses: Routing, Path Planning, andAutolocalization”, Proceedings of IEEE International Conference on IndustrialTechnology, Viña del Mar – Valparaíso, Chile, Mar. 2010. [6] K. T. Vivaldini, J. P. M. Galdames, T. B. Pasqual, M. Becker, andG. A. P. Caurin, “Intelligent Warehouses: focus on the automaticrouting and path planning of robotic forklifts able to workautonomously”, Mechatronics Systems: Intelligent TransportationVehicles, 2010. [7] I. Beker, V. Jevtic and D. Dobrilovic, “Using shortest-pathalgorithms for forklift route planning and optimization”, Proceedings of XV International Scientific Conference on Industrial systems, pp. 285-290, Novi Sad, Serbia, 2011. [8] D. Dobrilovic, V. Jevtic and J. Stojanov, “Application of modifiedshortest path algorithm for project duration assessment“, Proceedings of 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI 2011), pp. 495-498, Timisoara, Romania, DOI: 10.1109/SACI.2011.5873054, 2011. [9] M. zur Muehlen and M. Indulska, “Modeling languages forbusiness processes and business rules: A representational analysis”, Information Systems, vol. 35, no. 4, 2010, pp. 379-390, DOI: 10.1016/j.is.2009.02.006. [10] R. Doomun and N. V. Jungum,“Business processmodelling, simulation and reengineering: call centres”, Business Process Management Journal, vol. 14, no. 6, 2008, pp. 838-848, DOI 10.1108/14637150810916017. [11] P. O. Luttighuis, M. Lankhorst, R. van de Wetering,R. Bal and H. van den Berg,“Visualising business processes“, Computer Languages, vol. 27, no. 1-3, 2001, pp. 39-59, DOI: 10.1016/S0096-0551(01)00015-7. [12] D. Dobrilovic, V. Jevtic, I. Beker, Z. Stojanov, „Shortest-path based model for warehouse inner transportation optimization“, Proceedings of 7th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI), pp 63-68, 24-26 May, Timisoara, Romania, 2012, DOI: 10.1109/SACI.2012.6249977. |