Finding the Best Location for Logistics Hub Based on Actual Parcel Delivery Data
- Authors
- Song, Hayoon; H.Y.; Han, Insoo; I.
- Issue Date
- 2019
- Publisher
- SPRINGER INTERNATIONAL PUBLISHING AG
- Keywords
- Parcel service; Optimum logistics hub location; Longest Common Route Subsequence algorithm; Big data analytics
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.11619 LNCS, pp.603 - 615
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 11619 LNCS
- Start Page
- 603
- End Page
- 615
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/12736
- DOI
- 10.1007/978-3-030-24289-3_45
- ISSN
- 0302-9743
- Abstract
- So many national and international packets are traveling around in this time. The parcel delivery service is a major part of nationwide logistics. It is reported that wrong routes for logistic causes economical disadvantage both in time and in cost. It is possible to collect actual delivery data from logistics company or Internet of Things devices. Based on actual route of packet delivery, we collected 100,000 delivery data over Republic of Korea and analyzed for optimal hub candidate locations in terms of minimum distance and minimum time. From the raw delivery data set, actual delivery paths were calculated in terms of big data analytics Using Longest Common Route Subsequence algorithm, the most common paths can be identified. From the economic aspect, regarding minimum distance and time, optimal hub location candidates were voted and identified. With several hub locations, optimal distance and time can be calculated from the location of optimal hub candidates.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/12736)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.