Routing for an on-demand logistics service. (June 2019)

• Record Type: Journal Article
• Authors: Hong, Jinseok; Lee, Minyoung; Cheong, Taesu; Lee, Hong Chul
• Is Part Of: Transportation research. Volume 103(2019)
• Page Start: 328
• Page End: 351
• Publication Date: 2019-06
• Subjects: Traveling salesman problem -- On-demand -- Routing -- Logistics; Transportation -- Periodicals; Transportation -- Technological innovations -- Periodicals; 388.011
• DOI: 10.1016/j.trc.2018.12.010
• Languages: English
• ISSNs: 0968-090X

Abstract

Highlights: We introduce an optimization model for on-demand delivery service which is an extension of TSPTW. A mathematical model suitable for on-demand delivery services is proposed. A heuristic algorithm based on ant colony optimization is proposed. Several sensitivity analyses are performed to gain managerial insights for on-demand delivery service. Abstract: In this paper, we examine an optimization problem for a shipping company that provides an on-demand delivery service in which its customers visit a specified location called a delivery center (e.g., a convenience store or Amazon locker) to pick up their items themselves, rather than delivering the products purchased online to the customers directly. In this problem, we select delivery centers that are accessible for all customers and determine the optimal delivery route that minimizes the costs proportional to the distance traveled by the delivery vehicle, the delivery time, and costs. This is an extension of the traveling salesman problem with a time window constraint, which simultaneously determines the locations of the delivery centers for customer pickup and the delivery route. To solve this problem and to improve managerial practice, we propose a mathematical programming model and an efficient two-phase solution algorithm based on an ant colony heuristic that is better suited to reality. By addressing on-demand delivery optimization problems, shipping companies can guarantee customer satisfaction while reducing shipping costs.