Abstract
This paper considers a special vehicle routing problem, the two-echelon vehicle routing problem with simultaneous delivery and pickup demands (2E-VRPSDP). The 2EVRPSDP differs from classic transportation and vehicle routing problems in two ways. First, freight delivery from the depot to the customers is managed by shipping the freight through intermediate satellites. Second, each customer in the 2E-VRPSDP may have simultaneous delivery and pickup demands. The 2E-VRPSDP is an extension of the two-echelon vehicle routing problem (2E-VRP) and the vehicle routing problem with simultaneous delivery and pickup (VRPSDP). A variable neighborhood search algorithm is designed to solve the 2E-VRPSDP in which both feasible and infeasible solutions can be explored. Numerical results show that the proposed algorithm is effective and that the algorithm can provide reasonable solutions within an acceptable computational time.
Highlights
In the past decade, the two-echelon vehicle routing problem (2E-VRP) has become a new interest in the vehicle routing problems (VRPs) research field
According to the health care (HHC) company investigations, it is not easy for the company’s manager and planner. This is because this routing optimization problem is rather complex, which can be seen as a combination of two challenging problems, i.e., the two-echelon vehicle routing problem (2E-VRP) and the vehicle routing problem with simultaneous delivery and pickup (VRPSDP), because the problem has a two-echelon network structure and the customers have both delivery and pickup demands simultaneously
Since both the VRPSDP and the 2E-VRP are NP-hard, the problem stated above is NP-hard and even more complex and harder than these two problems. We focus on this special logistical problem, which is named the two-echelon vehicle routing problem with simultaneous delivery and pickup (2E-VRPSDP)
Summary
The two-echelon vehicle routing problem (2E-VRP) has become a new interest in the vehicle routing problems (VRPs) research field. After all the pickup goods are collected in subcompanies, the vehicles at the HHC company pick up such goods from subcompanies to return to the HHC company and complete one day’s operations This is a special two-echelon transportation network in which the first echelon consists of the HHC company and subcompanies, and the second echelon contains subcompanies and customers. According to the HHC company investigations, it is not easy for the company’s manager and planner This is because this routing optimization problem is rather complex, which can be seen as a combination of two challenging problems, i.e., the two-echelon vehicle routing problem (2E-VRP) and the vehicle routing problem with simultaneous delivery and pickup (VRPSDP), because the problem has a two-echelon network structure and the customers have both delivery and pickup demands simultaneously.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
