Flexible Delivery Routing for Elastic Logistics: A Model and an Algorithm
- Authors
- Lee, M.; Hong, J.; Cheong, T.; Lee, H.
- Issue Date
- 7월-2022
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Companies; Elastic logistics; Heuristic algorithms; Logistics; Mathematical model; Memetics; Optimization; Routing; logistics; memetic algorithm.; on-demand; traveling salesman problem
- Citation
- IEEE Transactions on Intelligent Transportation Systems, v.23, no.7, pp.6864 - 6882
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE Transactions on Intelligent Transportation Systems
- Volume
- 23
- Number
- 7
- Start Page
- 6864
- End Page
- 6882
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/139605
- DOI
- 10.1109/TITS.2021.3063195
- ISSN
- 1524-9050
- Abstract
- In this study, we present a flexible delivery routing problem faced by logistics service providers in which some customers may receive their packages indirectly. Customers are supposed to get their packages directly from a delivery service provider or be delivered to indirectly using a nearby station drop and a subsequent separate last-mile delivery service provider that finally delivers their goods. We address the problem of determining whether deliveries to customers should be fulfilled directly or indirectly in this situation. We present the mathematical programming model and propose a near-optimal heuristic approach based on a memetic algorithm. In addition, we evaluate the numerical performance of the proposed algorithm and perform various parametric analyses to gain managerial insights from the model. IEEE
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.