A study of vehicle allocation using a transportation freight-based algorithm
- Authors
- Kang, H.-Y.; Kang, Y.-K.; Shin, Y.-T.; Kim, J.-B.
- Issue Date
- 2014
- Publisher
- International Information Institute Ltd.
- Keywords
- Income; Logistics; Scheduling; Transportation freight-based; Vehicle allocation algorithm
- Citation
- Information (Japan), v.17, no.11B, pp.5677 - 5682
- Journal Title
- Information (Japan)
- Volume
- 17
- Number
- 11B
- Start Page
- 5677
- End Page
- 5682
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/11048
- ISSN
- 1343-4500
- Abstract
- With the activation of internet use and the increased amount of online business increase in recent years, the volume of transportation, distribution and logistics is dramatically expanding. As a result, it is getting harder to maintain vehicles and ensure vehicle suppliers' availability. One of the most important tasks of logistics companies is to manage transportation and its process more efficiently. As such, there have been a number of studies dealing with the Vehicle Routing Problem and the Vehicle Scheduling Problem for efficient vehicle allocation planning. But it is difficult to reflect the daily changes in the traffic situation and detailed geographic conditions, and as the number of depots increases it requires a large scale of database and huge consumption of time for calculations, which can make things very inefficient. To solve the vehicle allocation planning problems of Third Party Logistics(3PLs) firms that are faced with various constraints due to transportation cost, this paper proposes an algorithm-based transportation freight/income and new vehicle allocation information system. © 2014 International Information Institute.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School of Software > Major in Software > 1. Journal Articles
- College of Information Technology > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.