The rise of new energy technologies has accelerated progress towards sustainable development, and many companies are beginning to invest in renewable resource-related facilities. Electric bicycles have always been an important mode of green transportation; however, they also have problems such as slow charging, difficult charging, and that burning and short circuiting may occur during charging. Electric bicycle battery exchange cabinets effectively solve these problems by exchanging low batteries with full batteries instead of charging. However, current battery exchange cabinets face the problems of insufficient construction and unreasonable site selection. Therefore, this paper proposes a location selection model for electric bicycle battery exchange cabinets based on point demand theory, aiming to maximize rider satisfaction and the service capacity of exchange cabinets. The immune algorithm is introduced to solve the location model; however, the traditional immune algorithm has some problems such as poor stability and slow convergence. In this paper, the mutation process of the traditional immune algorithm is improved by introducing multi-point mutation, guided mutation, and local search. Finally, based on the data of electric bicycle riders in Shanghai, we verify that the location model based on point demand theory performs well on two objective functions of rider satisfaction and battery exchange cabinet service capability. We also expand the application of point demand theory to location models. Then, by conducting experiments with different parameter groups, through sensitivity analysis and convergence analysis, we verified that the improved immune algorithm performs better than the traditional immune algorithm in its accuracy, search accuracy, stability, and convergence.
With the proliferation of electric bicycle battery swapping models, spatial supply demand imbalances of battery resources across swapping stations have become increasingly prominent. Existing studies predominantly focus on location optimization but struggle to address dynamic operational challenges in battery allocation efficiency. This paper proposes an integer programming (IP)-based dynamic scheduling optimization method for shared batteries, aiming to minimize transportation costs and balance battery distribution under multi-constraint conditions. A resource allocation model is constructed and solved via an interior-point method (IPM) combined with a branch-and-bound (B&B) strategy, optimizing the dispatch paths and quantities of fully charged batteries among stations. This study contributes to urban sustainability by enhancing resource utilization efficiency, reducing redundant production, and supporting low-carbon mobility infrastructure. Using the operational data from 729 battery swapping stations in Shanghai, the spatiotemporal heterogeneity of rider demand is analyzed to validate the model’s effectiveness. Results reveal that daily swapping demand in core commercial areas is 3–10 times higher than in peripheral regions. The optimal scheduling network exhibits a ‘centralized radial’ structure, with nearly 50% of batteries dispatched from low-demand peripheral stations to high-demand central zones, significantly reducing transportation costs and resource redundancy. This study shows that the proposed model effectively mitigates battery supply demand mismatches and enhances scheduling efficiency. Future research may incorporate real-time traffic data to refine cost functions and introduce temporal factors to improve model adaptability.