Abstract

Urban terminal logistics and distribution enterprises face the problems of duplicated network layouts, high costs, and inefficient urban environments. Recently, collaborative distribution using unmanned aerial vehicles (UAVs) and ground vehicles has been considered as a means of reducing costs and enhancing efficiency, thus overcoming the issues created by the high-density layout of enterprises’ relatively independent networks. This essentially involves constructing an air–ground collaborative common distribution network. To optimize the economic cost and distribution time of network operations, we established a site selection planning model for air–ground cooperative urban co-distribution centers and designed a solution method based on gray wolf optimization with K-means clustering. Taking the Wangsheren area of Jinan City, China, as an example, 15 UAV co-distribution centers and 13 vehicle co-distribution centers were identified. Although the average distribution cost of the network rose by 35–50% compared to traditional terminal distribution, the time saving was 80–85%, greatly improving the high-value-added service capacity. The end-distribution efficiency and customer satisfaction were also enhanced, which fully verifies the feasibility, validity, and applicability of the proposed model. Our approach can be applied to landing sites and the planning and optimization of large-scale commercial operations using logistics UAVs in urban areas.

Full Text
Paper version not known

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 call

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