Vehicle Routing Problem with Parcel Lockers
| Autor: | Tsai-Wei Ho, 何采維 |
|---|---|
| Rok vydání: | 2018 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 106 Due to the booming of e-commerce, city logistics faces new challenges. Consumers use the e-commerce platform to order goods, and receive goods by home delivery or convenience store pick-up, thus extending the last mile delivery problem. The last mile delivery problem refers to the delivery process of delivering goods from the supplier to the consumer. This process is the bottleneck of the e-commerce supply chain. The logistics industry often needs to bear the secondary distribution cost caused by customers’ no-show. The parcel lockers system is one of the solutions to this problem. The parcel lockers system is a 24-hour service unmanned facility. The user only needs to enter the password on the screen to open the parcel locker and pick up the goods. The two main parcel lockers systems in Taiwan are the palmbox of Palm Box, Inc., and the i mail box of Chunghwa Post. Because the emergence of the parcel lockers system, the traditional home delivery mode that delivers goods to customer's home is about to change. Therefore, this research extends the vehicle routing problem with time windows (VRPTW) to consider parcel lockers and proposes the vehicle routing problem with parcel lockers (VRPPL). This research formulates a mathematical model, and proposes a simulated annealing (SA) algorithm for solving VRPPL. The goal of VRPPL is to minimize the total traveling cost. A new set of VRPPL instances modified from Solomon's VRPTW instances and tested. This study solves the VRPPL instances with Gurobi and SA. The result shows that the proposed SA outperforms Gurobi in solving VRPPL. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|