Study on the Optimization Models of Urban Logistics Considering Parcel Box for the Last Mile Delivery and Pick-Up

Global urban logistics is facing new challenges due to the rapid development of e-commerce. The last road problem of logistics industry distribution has become an important issue. With the changes of the times and the advancement of science and technology, the way of picking up goods is more and more diversified. In addition to the traditional way of home delivery and the convenience store pick-up in Taiwan, a new pick-up facility, the parcel locker system, has been introduced in recent years. The popularity of parcel locker systems will help to improve the secondary distribution costs, traffic congestion and environmental pollution in the face of urban logistics. At present, there are only a few researches on the route planning of parcel locker systems in urban logistics. The project proposes vehicle routing problems with home delivery and parcel lockers and establishes its mathematical model and develops the efficient algorithms. These questions refer to the existing operating model, and incorporate the operational modes that will be applied in practice, and have designed different types of customer collection and delivery modes and corresponding problems. This project has considerable importance and innovation in practical application and academic research. The innovative model of this project can not only improve the distribution efficiency of the last road, reduce its cost and its impact on the environment and traffic. The project aims to develop the freight distribution optimization models and algorithms through the combination of home delivery and multi-parcel lockers. The duration of the project is three years. It is expected to be six effective and efficient mathematical models and two algorithms. The plan is to complete the following matters in order to improve the transportation industry's better route planning for distribution issues. (1) Clearly define the vehicle routing problems with home delivery and parcel lockers and establish the mathematical models, including followings. Vehicle Routing Problem with Home Delivery and Multiple Parcel Lockers (VRPHMPL) Pickup and Delivery Vehicle Routing Problem with Home Delivery and Multiple Parcel Lockers (PDVRPHMPL) Electric Vehicle Routing Problem with Home Delivery and Multiple Parcel Lockers(EVRPHMPL) Pickup and Delivery Electric Vehicle Routing Problem with Home Delivery and Multiple Parcel Lockers (PDEVRPHMPL) Two-Echelon Vehicle Routing Problem with Home Delivery and Multiple Parcel Lockers (2E- VRPHMPL) Two-Echelon Electric Vehicle Routing Problem with Home Delivery and Multiple Parcel Lockers (2E- EVRPHMPL)(2) Because the related vehicle routing problems with home delivery and parcel lockers are all NP-hard problems, how to find an (approximate) optimal solution in a limited time is an important issue. The project plans to develop an improved simulated annealing algorithm and an improved the adaptive large neighborhood search to solve six kind of vehicle routing problem with home delivery and multiple parcel lockers within reasonable time. Therefore, different solution coding, decoding, neighborhood solutions, the calculation of probability of accepting worse solution for different problems are needed.(3) If the improved simulated annealing algorithm and the improved adaptive large neighborhood search can solve the vehicle routing problem with home delivery and multiple parcel lockers successfully, theoretically they can be used to solve others combinatorial problems.

Project ID:PB10907-2428
External Project ID:MOST109-2410-H182-009-MY3