A Bi-level programming for union battery swapping stations location-routing problem under joint distribution and cost allocation

In logistics field, considering high cost of self-built battery swapping stations and limited public battery swap-ping, some investors start to establish union battery swapping stations for logistics companies, which has received positive response. In this case, station location and logistics distribution routes are key decisions, which determine investors' and logistics companies' interests. But meanwhile, the mutual influence between location and routes brings difficulty to decision. However, there is no specific research on this issue. Therefore, based on Bi-level programming, this paper firstly proposes a location-routing decision scheme that considers the mutual influence, and genetic algorithm and linear technology are combined to solve it. Moreover, to ensure each lo-gistics company's interest, this paper proposes to introduce joint distribution among logistics companies and use Shapley value to allocate total cost. And by the comparison of three different scenarios, the study finds, Bi-level programming can solve location-routing problem, and make logistics companies spend less cost than self-built method. Further, when logistics group carry out joint distribution, the total distribution cost can fall by 4%, and correspondingly, allocation strategy can reduce each logistics company' cost. Meanwhile, the benefits of the investor of the union battery swapping station will also increase by 4%.