Article ID: | iaor19951752 |
Country: | South Korea |
Volume: | 19 |
Issue: | 3 |
Start Page Number: | 63 |
End Page Number: | 79 |
Publication Date: | Dec 1994 |
Journal: | Journal of the Korean ORMS Society |
Authors: | Lee Young-Hae, Yang Byung-Hee |
Keywords: | heuristics, programming: multiple criteria, vehicle routing & scheduling |
Many vehicle fleet planning systems have been suggested to minimize the routing distances of vehicles or reduce the transportation cost. But the more considerations the method takes, the higher complexities are involved in a large number of practical situations. The purpose of this paper is to vehicle fleet planning system. This paper considers multi-objective optimization. The vehicle fleet planning system developed by this study involves such complicated and restricted conditions as one depot, multiple nodes (demand points), multiple vehicle types, multiple order items, and other many restrictions for operating vehicles. The proposed algorithm is compared with the nearest neighbor heuristic and the savings heuristic algorithm in terms of total logistic cost and driving time. This method constructs a route with a minimum number of vehicles for a given demand. This method can be useful to any companys’ vehicle fleet planning system under circumstances considered in this paper. [In Korean.]