Published 2012-03-30
abstract views: 92 // FULL TEXT ARTICLE (PDF): 0
Keywords
- logistics costs,
- forklift route,
- optimization,
- Dijkstra algorithm
How to Cite
Copyright (c) 2023 International Journal of Industrial Engineering and Management
This work is licensed under a Creative Commons Attribution 4.0 International License.
Abstract
This paper deals with business processes and productivity improvement in order to reduce costs of any kind, especially by eliminating of the wastes. Therefore, automation of logistic processes is very important, and in this case is the source of reducing one of the biggest wastes of all: inner transportation. There are several models of routes selecting in practice and, the main focus of this paper is to investigate the implementation of one of them - the shortest path algorithms for forklifts routing optimization. By calculating the optimal route for forklifts, transportation routes are shortened and work in the warehouses is reduced. These algorithms can be applied for the other types of vehicles and for the other type of storage facilities as well. Preview of the optimization methods is used for identification of the most suitable method.
Article history: Received (15 December 2011); Revised (24 January 2012); Accepted (08 February 2012)
