Routing for an on-demand logistics service

Jinseok Hong, Minyoung Lee, Tae Su Cheong, Hong Chul Lee

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)328-351
Number of pages24
JournalTransportation Research Part C: Emerging Technologies
Volume103
DOIs
Publication statusPublished - 2019 Jun 1

Fingerprint

Freight transportation
Logistics
customer
logistics
shipping
demand
Costs
Traveling salesman problem
Customer satisfaction
Pickups
Mathematical programming
costs
Industry
salesman
guarantee
heuristics
programming
time

Keywords

  • Logistics
  • On-demand
  • Routing
  • Traveling salesman problem

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Automotive Engineering
  • Transportation
  • Computer Science Applications

Cite this

Routing for an on-demand logistics service. / Hong, Jinseok; Lee, Minyoung; Cheong, Tae Su; Lee, Hong Chul.

In: Transportation Research Part C: Emerging Technologies, Vol. 103, 01.06.2019, p. 328-351.

Research output: Contribution to journalArticle

@article{be316c093fd346b7b228a02c484b39d8,
title = "Routing for an on-demand logistics 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.",
keywords = "Logistics, On-demand, Routing, Traveling salesman problem",
author = "Jinseok Hong and Minyoung Lee and Cheong, {Tae Su} and Lee, {Hong Chul}",
year = "2019",
month = "6",
day = "1",
doi = "10.1016/j.trc.2018.12.010",
language = "English",
volume = "103",
pages = "328--351",
journal = "Transportation Research Part C: Emerging Technologies",
issn = "0968-090X",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Routing for an on-demand logistics service

AU - Hong, Jinseok

AU - Lee, Minyoung

AU - Cheong, Tae Su

AU - Lee, Hong Chul

PY - 2019/6/1

Y1 - 2019/6/1

N2 - 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.

AB - 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.

KW - Logistics

KW - On-demand

KW - Routing

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=85061451120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85061451120&partnerID=8YFLogxK

U2 - 10.1016/j.trc.2018.12.010

DO - 10.1016/j.trc.2018.12.010

M3 - Article

AN - SCOPUS:85061451120

VL - 103

SP - 328

EP - 351

JO - Transportation Research Part C: Emerging Technologies

JF - Transportation Research Part C: Emerging Technologies

SN - 0968-090X

ER -