Flexible Delivery Routing for Elastic Logistics: A Model and an Algorithm

Minyoung Lee; Jinseok Hong; Taesu Cheong; Hongchul Lee

doi:10.1109/TITS.2021.3063195

Flexible Delivery Routing for Elastic Logistics: A Model and an Algorithm

Minyoung Lee, Jinseok Hong, Taesu Cheong, Hongchul Lee

School of Industrial Management Engineering

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

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.

Original language	English
Pages (from-to)	6864-6882
Number of pages	19
Journal	IEEE Transactions on Intelligent Transportation Systems
Volume	23
Issue number	7
DOIs	https://doi.org/10.1109/TITS.2021.3063195
Publication status	Published - 2022 Jul 1

Keywords

Elastic logistics
logistics
memetic algorithm
on-demand
traveling salesman problem

ASJC Scopus subject areas

Automotive Engineering
Mechanical Engineering
Computer Science Applications

Access to Document

10.1109/TITS.2021.3063195

Cite this

@article{cbad65cbba5f4ffba7029321ad2f8740,

title = "Flexible Delivery Routing for Elastic Logistics: A Model and an Algorithm",

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.",

keywords = "Elastic logistics, logistics, memetic algorithm, on-demand, traveling salesman problem",

author = "Minyoung Lee and Jinseok Hong and Taesu Cheong and Hongchul Lee",

note = "Funding Information: This work was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education under Grant NRF-2018R1D1A1B07047651, in part by the Korea Evaluation Institute of Industrial Technology (KEIT) Grant funded by the Korea Government (MOTIE) under Grant 20001490, and in part by the Korea Institute for Advancement of Technology (KIAT) grant funded by the Korea Government (MOTIE) (The Competency Development Program for Industry Specialist) under Grant P0008691. Publisher Copyright: {\textcopyright} 2000-2011 IEEE.",

year = "2022",

month = jul,

day = "1",

doi = "10.1109/TITS.2021.3063195",

language = "English",

volume = "23",

pages = "6864--6882",

journal = "IEEE Transactions on Intelligent Transportation Systems",

issn = "1524-9050",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Flexible Delivery Routing for Elastic Logistics

T2 - A Model and an Algorithm

AU - Lee, Minyoung

AU - Hong, Jinseok

AU - Cheong, Taesu

AU - Lee, Hongchul

N1 - Funding Information: This work was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education under Grant NRF-2018R1D1A1B07047651, in part by the Korea Evaluation Institute of Industrial Technology (KEIT) Grant funded by the Korea Government (MOTIE) under Grant 20001490, and in part by the Korea Institute for Advancement of Technology (KIAT) grant funded by the Korea Government (MOTIE) (The Competency Development Program for Industry Specialist) under Grant P0008691. Publisher Copyright: © 2000-2011 IEEE.

PY - 2022/7/1

Y1 - 2022/7/1

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

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

KW - Elastic logistics

KW - logistics

KW - memetic algorithm

KW - on-demand

KW - traveling salesman problem

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

U2 - 10.1109/TITS.2021.3063195

DO - 10.1109/TITS.2021.3063195

M3 - Article

AN - SCOPUS:85103200004

SN - 1524-9050

VL - 23

SP - 6864

EP - 6882

JO - IEEE Transactions on Intelligent Transportation Systems

JF - IEEE Transactions on Intelligent Transportation Systems

IS - 7

ER -

Flexible Delivery Routing for Elastic Logistics: A Model and an Algorithm

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this