Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Optimizing Vehicle Routing for Simultaneous Pick-up and Delivery considering the Reusable Transporting Containers: Case of Convenient Stores

Version 1 : Received: 18 May 2020 / Approved: 19 May 2020 / Online: 19 May 2020 (09:27:52 CEST)

A peer-reviewed article of this Preprint also exists.

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

Journal reference: Appl. Sci. 2020, 10, 4162
DOI: 10.3390/app10124162

Abstract

A lot of previous research have proposed various frameworks and algorithms to optimize routes to reduce the total transportation cost, which accounts for over 70% of overall logistics cost. However, it is very hard to find the cases applied the mathematical models or algorithms to the practical business environment cases, especially daily operating logistics services like convenient stores. Most of previous research have considered the developing an optimal algorithm which can solve the mathematical problem within the practical time while satisfying all constraints such as the capacity of delivery and pick-up, and time windows. For the daily pick-up and delivery service like supporting several convenient stores, it is required to consider the unit transporting container as well as the demand, capacity of trucks, traveling distance and traffic congestion. Especially, the reusable transporting container, trays, should be regarded as the important asset of logistics center. However, if the mathematical model focuses on only satisfying constraints related 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 research, it has been proposed to build the mathematical model for optimizing pick-up and delivery plans by extending the general vehicle routing problem of simultaneous delivery and pickup with time windows while considering left-over cost. With the numerical experiments, it has been proved that the proposed model may reduce the total delivery cost. It may be possible to apply the proposed approach to the various logistics business which uses the reusable transporting container like shipping containers, refrigerating containers, trays, and pallets.

Subject Areas

Vehicle Routing Problem; Delivery and Pickup; Time Windows; Left-over Cost; Reusable Container

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.