Search Results (2)

Public bicycle systems (PBSs) serve as the ‘last mile’ of public transportation for urban residents, yet the problem of the difficulty in borrowing and returning bicycles during peak hours remains a major bottleneck restricting the intelligent and efficient operation of public bicycles. Previous studies have proposed reasonable models and efficient algorithms for optimizing public bicycle scheduling, but there is still a lack of consideration for actual road network distances between stations and the temporal characteristics of demand at rental points in the model construction process. Therefore, this paper aims to construct a public bicycle dispatch framework based on the spatiotemporal characteristics of borrowing and returning demands. Firstly, the spatiotemporal distribution characteristics of borrowing and returning demands for public bicycles are explored, the origin–destination (OD) correlation coefficients are defined, and the intensity of connections between rental point areas is analyzed. Secondly, based on the temporal characteristics of rental point demands, a random forest prediction model is constructed with weather factors, time characteristics, and rental point locations as feature variables, and station bicycle-borrowing and -returning demands as the target variable. Finally, bicycle dispatch regions are delineated based on actual path distances between stations and OD correlation coefficients, and a public bicycle regional dispatch optimization method is established. Taking the PBS in Ningbo City as an example, the balancing optimization framework proposed in this paper is validated. The results show that the regional dispatch optimization method proposed in this paper can achieve optimized dispatch of public bicycles during peak hours. Additionally, compared with the Taboo search algorithm (TSA), the genetic algorithm (GA) exhibits a 11.1% reduction in rebalancing time and a 40.4% reduction in trip cost. Full article

Passive distribution networks are being converted into active ones by incorporating distributed means of energy generation, consumption, and storage, and the formation of so-called microgrids (MGs). As the next generation of MGs, reconfigurable microgrids (RMGs) are still in early phase studies, and require further research. RMGs facilitate the integration of distributed generators (DGs) into distribution systems and enable a reconfigurable network topology by the help of remote-controlled switches (RCSs). This paper proposes a day-ahead operational scheduling framework for RMGs by simultaneously making an optimal reconfiguration plan and dispatching controllable distributed generation units (DGUs) considering power loss minimization as an objective. A hybrid approach combining conventional particle swarm optimization (PSO) and selective PSO (SPSO) methods (PSO&SPSO) is suggested for solving this combinatorial, non-linear, and NP-hard complex optimization problem. PSO-based methods are primarily considered here for our optimization problem, since they are efficient for power system optimization problems, easy to code, have a faster convergence rate, and have a substructure that is suitable for parallel calculation rather than other optimization methods. In order to evaluate the suggested method’s performance, it is applied to an IEEE 33-bus radial distribution system that is considered as an RMG. One-hour resolution of the simultaneous network reconfiguration (NR) and the optimal dispatch (OD) of distributed DGs are carried out prior to this main study in order to validate the effectiveness and superiority of the proposed approach by comparing relevant recent studies in the literature. Full article