Next Article in Journal
Application of Thermoeconomics in HVAC Systems
Previous Article in Journal
A Flexible FPGA-Based Channel Emulator for Non-Stationary MIMO Fading Channels
Article

Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores

1
Graduate School of Logistics, Incheon National University, 22012 Incheon, Korea
2
Han Express, 317, Hyoryeong-ro, Secho-gu, 06643 Seoul, Korea
3
CJ Logistics, 53, Sejong-daero 9-gil, Jung-gu, 04513 Seoul, Korea
*
Author to whom correspondence should be addressed.
Appl. Sci. 2020, 10(12), 4162; https://doi.org/10.3390/app10124162
Received: 18 May 2020 / Revised: 8 June 2020 / Accepted: 15 June 2020 / Published: 17 June 2020
(This article belongs to the Section Applied Industrial Technologies)
Previous studies have proposed various frameworks and algorithms to optimize routes to reduce total transportation cost, which accounts for over 29.4% of overall logistics costs. However, it is very hard to find cases in which mathematical models or algorithms are applied to practical business environment cases which require reusable packaging, especially daily operating logistics services like convenience store support systems. Most previous studies have considered developing an optimal algorithm which can solve the mathematical problem within a practical amount of time while satisfying all constraints, such as the capacity of delivery and pick-up, and hard or soft time windows. For daily delivery and pick-up services, like those supporting several convenience stores, it is required to consider the unit transporting the container, as well as the demand, capacity of trucks, travel distance, and traffic congestion. In particular, reusable transport containers and trays should be regarded as important assets of logistics centers. However, if the mathematical model focuses on only satisfying constraints related to delivery and not considering the cost of trays, it is often to leave the empty trays on the pick-up points when there is not enough space in the track. In this study, we propose a mathematical model for optimizing delivery and pick-up plans by extending the general vehicle routing problem of simultaneous delivery and pick-up with time windows, while considering left-over cost. With numerical experiments it has been proved that the proposed model may reduce the total delivery cost. Also, it seems possible to apply the proposed approach to the various logistics businesses which require reusable transport containers like shipping containers, refrigerating containers, trays, and pallets. View Full-Text
Keywords: vehicle routing problem; delivery and pick-up; time windows; left-over cost; reusable container vehicle routing problem; delivery and pick-up; time windows; left-over cost; reusable container
Show Figures

Figure 1

MDPI and ACS Style

Gong, I.; Lee, K.; Kim, J.; Min, Y.; Shin, K. Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores. Appl. Sci. 2020, 10, 4162. https://doi.org/10.3390/app10124162

AMA Style

Gong I, Lee K, Kim J, Min Y, Shin K. Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores. Applied Sciences. 2020; 10(12):4162. https://doi.org/10.3390/app10124162

Chicago/Turabian Style

Gong, Intaek, Kyungho Lee, Jaewon Kim, Yunhong Min, and KwangSup Shin. 2020. "Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores" Applied Sciences 10, no. 12: 4162. https://doi.org/10.3390/app10124162

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop