Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores
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 envir...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-06-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/10/12/4162 |
| _version_ | 1827714905805946880 |
|---|---|
| author | Intaek Gong Kyungho Lee Jaewon Kim Yunhong Min KwangSup Shin |
| author_facet | Intaek Gong Kyungho Lee Jaewon Kim Yunhong Min KwangSup Shin |
| author_sort | Intaek Gong |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-10T19:06:59Z |
| format | Article |
| id | doaj.art-4dc773faa2f34e2cb9cc9a54c219783a |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T19:06:59Z |
| publishDate | 2020-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-4dc773faa2f34e2cb9cc9a54c219783a2023-11-20T04:06:16ZengMDPI AGApplied Sciences2076-34172020-06-011012416210.3390/app10124162Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience StoresIntaek Gong0Kyungho Lee1Jaewon Kim2Yunhong Min3KwangSup Shin4Graduate School of Logistics, Incheon National University, 22012 Incheon, KoreaHan Express, 317, Hyoryeong-ro, Secho-gu, 06643 Seoul, KoreaCJ Logistics, 53, Sejong-daero 9-gil, Jung-gu, 04513 Seoul, KoreaGraduate School of Logistics, Incheon National University, 22012 Incheon, KoreaGraduate School of Logistics, Incheon National University, 22012 Incheon, KoreaPrevious 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.https://www.mdpi.com/2076-3417/10/12/4162vehicle routing problemdelivery and pick-uptime windowsleft-over costreusable container |
| spellingShingle | Intaek Gong Kyungho Lee Jaewon Kim Yunhong Min KwangSup Shin Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores Applied Sciences vehicle routing problem delivery and pick-up time windows left-over cost reusable container |
| title | Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores |
| title_full | Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores |
| title_fullStr | Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores |
| title_full_unstemmed | Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores |
| title_short | Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores |
| title_sort | optimizing vehicle routing for simultaneous delivery and pick up considering reusable transporting containers case of convenience stores |
| topic | vehicle routing problem delivery and pick-up time windows left-over cost reusable container |
| url | https://www.mdpi.com/2076-3417/10/12/4162 |
| work_keys_str_mv | AT intaekgong optimizingvehicleroutingforsimultaneousdeliveryandpickupconsideringreusabletransportingcontainerscaseofconveniencestores AT kyungholee optimizingvehicleroutingforsimultaneousdeliveryandpickupconsideringreusabletransportingcontainerscaseofconveniencestores AT jaewonkim optimizingvehicleroutingforsimultaneousdeliveryandpickupconsideringreusabletransportingcontainerscaseofconveniencestores AT yunhongmin optimizingvehicleroutingforsimultaneousdeliveryandpickupconsideringreusabletransportingcontainerscaseofconveniencestores AT kwangsupshin optimizingvehicleroutingforsimultaneousdeliveryandpickupconsideringreusabletransportingcontainerscaseofconveniencestores |