| With the acceleration of urbanization,the contradiction between supply and demand in transportation becomes more and more prominent,and public transportation,with its advantages of high capacity and low cost,makes it an important means to alleviate the contradiction between supply and demand in transportation.As a special service area shaped demand-responsive connector,the fan ring service area demand-responsive connector has the characteristics of being available for passenger reservation and transportation between the reservation location and the feeder station,alleviating the problem of low convenience for residents to reach the surrounding metro stations and meeting their diversified and differentiated needs of residents.This paper investigates the determination of the fan ring service area and the planning of the driving path based on the demand-responsive connector in the fan ring service area,and enriches the theoretical research on the operation of demand-responsive connector in the fan ring service area to promote the development of demand-responsive connector.The specific research contents are as follows.(1)Analyze the characteristics of the demand-responsive connector in the fan ring service area.Taking the concept and composition of the fan-ring demand-responsive connector system as the starting point,analyzing the applicability of demand-responsive connector in fan ring service area,pointing out that they are suitable for deployment in areas with low demand for residential trips,low bus coverage,and relatively large passenger flow collection and dispersal stations.And clarifying the factors affecting the route planning of demand-responsive connector in fan ring service areas.(2)Explore the process of determining the service area of the fan ring and the layout method of the demand response station.The process of determining the service area of the fan ring is as follows: First,the Entropy-weighting TOPSIS method is used to evaluate the evaluation index system based on bus accessibility,and the traffic area with the lowest bus accessibility obtained from the evaluation is used as the demand response area.Second,select the subway station in the applicable area,study the passenger flow attraction scope of the subway station based on the agglomeration effect,and obtain the direct and indirect attraction radiu of the subway station.Finally,consider the surrounding road network,the current public transportation and whether there is a service blank area,etc.,define the center angle of the sector facing the passenger flow in a certain direction,and determine the scope of the fan ring service area.In addition,this paper is based on POI data within the fan ring service area,and uses the DBSCAN algorithm and the K-means algorithm to obtain the cluster centers without noise point interference with the help of Python.(3)Build a demand-responsive connector route planning model under the fan ring service area and design an algorithm to solve it.Aiming at the lowest fixed cost,variable cost and passenger time penalty cost,under the constraints of available passengers,vehicle capacity,passenger reservation time window,line length,fleet size,etc.,a path planning model is established,and an adaptive inertia weight is used to improve the particle swarm algorithm to solve the model.(4)Case analysis.Based on the determination of the applicable area for demand-responsive connector in Jiangning District,Nanjing,the evaluation results show that Lukou Street has the lowest bus accessibility among the traffic zones with subway stations,and is a suitable area for demand-responsive connector.Tongshan Subway Station in Lukou Street is selected as the feeder station,and the passenger flow attraction radius of the subway station is calculated based on the questionnaire data,and the scope of the fan ring service area is defined,and then the demand response station layout and path planning are carried out under the fan ring service area.The optimal running route scheme of the vehicle is obtained,and the validity of the model and the solution algorithm is verified. |