A customized public transportation system and dispatching method between urban areas

By launching customized bus systems between urban areas and using technologies such as Beidou/GPS and 5G/4G communication, we can achieve bus scheduling and passenger information matching, solving the problems of long commuting time and unstable carpooling, and providing efficient and green commuting Solution.

CN114444923BActive Publication Date: 2024-11-08JIANGSU NANDA SOFITEL INTELLIGENT TRANSPORTATION TECH CO LTD
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202210086214.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-01-25
Publication Date
2024-11-08
Estimated Expiration
2042-01-25

AI Technical Summary

Technical Problem

When commuting between urban areas, buses require multiple transfers and long walking distances, resulting in a long commute time, and the carpooling method is unstable and expensive, which is unbearable.

Method used

A customized bus system between urban areas has been designed, including bus operators, mobile APP modules, backend scheduling modules, map software API processing modules and charging modules. Through Beidou/GPS positioning, 5G/4G communication and facial recognition technologies, it can be realized. Passenger information matching and bus dispatching provide customized bus services close to carpooling services.

Benefits of technology

Significantly reduce commuting time, reduce carbon emissions, provide stable pick-up and drop-off services, and reasonable fare strategy to avoid investment losses and balance passenger experiences with bus company performance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114444923B_ABST
    Figure CN114444923B_ABST
Patent Text Reader

Abstract

The present invention discloses a customized bus system and dispatching method between urban areas. The system includes a bus operator, a bus, a mobile phone APP module, a background dispatching module, a background database module, a map grabbing module, a map software API processing module, and a charging module. The bus and passenger matching method of the present invention adopts a spatiotemporal clustering method, which is based on the bus types owned by the bus company. The method has universal applicability and can classify passengers based on bus type, passenger departure area, destination area, departure time, and expected arrival time, and assign them to corresponding buses, laying a foundation for subsequent bus route selection. The determined fare strategy can effectively determine the area where customized buses can be implemented, and accordingly formulate a reasonable fare, so as to achieve a balance between passenger experience and bus company performance. The bus passenger pick-up route selection method reduces the algorithm complexity to O(n 2 ), supports fast response on the server side.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of road traffic, and in particular to an inter-city area customized public transportation system and a dispatching method. Background Art

[0002] Commuting between urban areas usually involves bus, subway transfers or carpooling. In some areas where the subway cannot reach directly, buses need to take detours and have many stops. Some areas even require multiple transfers, and people need to walk a long distance after getting off the bus. As a result, in some large and medium-sized cities, commuting time of several hours is normal. If 3-4 people carpool, it is not easy to find stable carpoolers, and the cost is high, which is difficult to bear for long-term use.

[0003] In this case, bus companies have launched customized bus systems between urban areas, which can provide services close to carpooling at prices based on bus transfers. This can avoid transfers and significantly reduce commuting time, while also reducing carbon emissions. It is an important supplement to building green cities and green transportation. Summary of the invention

[0004] Purpose of the invention: The first purpose of the present invention is to provide a customized bus system between urban areas. The second purpose of the present invention is to provide a corresponding customized bus scheduling method between urban areas based on this system, so as to realize customized bus pick-up and drop-off services between different areas during the rush hour of the city.

[0005] Technical solution: The customized inter-city area public transportation system of the present invention includes a public transportation operator, a bus, a mobile phone APP module, a background scheduling module, a background database module, a map capture module, a map software API processing module, and a charging module; the public transportation operator is responsible for executing bus scheduling according to the scheduling information of the background scheduling module; the bus supports Beidou / GPS satellite positioning and navigation, 5G / 4G communication, and mobile phone code scanning identity recognition; the background database module saves passenger basic information data, passenger riding information data, static map data, and bus operation data; the map capture module is responsible for regularly capturing the city static map to update the static map data in the background database module; the map software API processing module is responsible for obtaining the estimated travel time, road conditions and real-time navigation data based on the map software API; the charging module is responsible for connecting the payment interface and completing the charging of passengers according to the customized public transportation charging method; the background scheduling module is responsible for connecting all modules to complete the scheduling between modules and the scheduling of bus operation routes.

[0006] Furthermore, the map software includes Baidu Maps, Amap and Tencent Maps.

[0007] Furthermore, the payment interface includes UnionPay payment, Cloud QuickPass, WeChat payment and Alipay payment.

[0008] The present invention also discloses a method for dispatching a customized public transportation system between urban areas, comprising the following steps:

[0009] Step 1: Passengers register for the customized bus mobile APP, submit basic passenger information, including name, gender, ID number, and mobile phone number, and complete real-name authentication; select and bind the identity recognition method;

[0010] Step 2: The passenger logs in to the customized bus mobile app, submits the travel date, selects the travel starting point and end point, enters the travel starting point and end point, and selects the travel purpose = {going to work|getting off work}. If going to work is selected, the latest arrival time must be selected = {Td_1|...|Td_M}. If getting off work is selected, the earliest departure time must be selected = {To_1|...|To_N}; Td_1~Td_M and To_1~To_N are preset times; all travel information submissions must be before the deadline, which is generally set to 0:00 on the travel date;

[0011] Step 3: The mobile APP module completes the passenger charges through the charging module according to the customized bus charging method;

[0012] Step 4: After the deadline for submitting the travel information of the day, the backend scheduling module will divide the passengers into the corresponding buses according to the earliest boarding time, latest getting off time, starting point, destination, and work / off-get off work information of the passengers on the day through a customized bus and passenger matching method;

[0013] Step 5: The backend dispatching module determines the order of picking up and dropping off passengers on each bus according to the customized bus passenger pick-up and drop-off route selection method, and determines the passenger waiting time, waiting location, estimated arrival time and alighting location, sends the passenger waiting time, waiting location, estimated arrival time and alighting location to the passengers, and dispatches the bus accordingly;

[0014] Step 6. The background dispatch module keeps in real-time contact with the bus and passengers before picking up or dropping off passengers. The bus picks up passengers in turn according to the dispatch arrangement of the background dispatch module, verifies the identity of the passengers, and then sends the passengers to their destinations.

[0015] Furthermore, in step one, the identity recognition method selected and bound uses a recent bareheaded photo for facial recognition, which is used for payment or binding a payment interface.

[0016] Furthermore, in step three, the customized public transportation charging method is specifically:

[0017] 1. According to the passenger's starting point to the end point, calculate the following three reference prices:

[0018] (1) Bus operating cost C1 = C0 × L / (S × σ)), where C0 is the unit mileage operating cost of the selected bus, L is the mileage from the passenger's starting point to the destination, S is the number of seats on the bus, σ is the standard passenger load factor of the bus, and σ is a preset constant with a value range of σ∈[0.6, 1.0];

[0019] (2) The bus and subway mixed travel price C2 represents the cost when passengers travel from the starting point to the end point by using a combination of bus and subway;

[0020] (3) Carpooling price C3, which represents the cost of a passenger traveling from the starting point to the destination by carpooling;

[0021] Second, multiply the above three prices by a coefficient respectively, and take the minimum value as the charging price: that is, the charging price C = min(λ1×C0, λ2×C1, λ3×C2), where λ1 is the cost coefficient, λ2 is the mixed travel coefficient, and λ3 is the carpooling coefficient. The value range of each coefficient is: λ1∈[1.2, 1.5], λ2∈[0.9, 1.2], λ3∈[0.3, 0.6];

[0022] 3. If C≤C1, it means that it is not feasible to open customized buses on this route;

[0023] 4. The actual fare is the fare multiplied by the discount rate: that is, the actual fare Cost = λ×C, λ is the fare discount rate, and the value range is: λ∈[0.8, 1.0], which can be adjusted by the bus company based on factors such as passenger identity and company activities.

[0024] Furthermore, since this patent is mainly aimed at customized public transportation commuting between urban areas, passengers usually travel back and forth on the same day, and the arrival time in the morning is a constraint condition, and the departure time can have a certain flexibility. The departure time in the afternoon is subject to the off-get off work time, which is a constraint condition, and the arrival time can have a certain flexibility. Since the working and off-get off work times are usually on the hour, time clustering based on the working and off-get off work times is simple and effective; and since the working and off-get off work times are constraints, in terms of spatial clustering, clustering can be performed based on the morning arrival area and the afternoon departure area, and then the occupants can be adjusted according to the vehicle model. The specific method is as follows:

[0025] 1. According to the customized information submitted by passengers on the APP, for all passengers who submit customized travel information on the day and have the same starting and ending areas, a two-dimensional travel information table is established for each time based on the latest arrival time for work and the earliest departure time for off-work. Each travel information table contains all passengers with the same latest arrival time or the same earliest departure time. The travel information table entries include the passenger's name, mobile phone number, earliest boarding time, latest getting off time, starting point, end point, work / off-get off work, where the starting point and end point are saved at the nearest bus stop to the location submitted by the passenger in the APP;

[0026] 2. Classify each travel information table. If the travel information table is for going to work, classify it based on the destination. If the travel information table is for going off work, classify it based on the starting point.

[0027] 3. When commuting to work, list the set of all destinations in the travel information table, and build an OD matrix based on all the destinations to form a strongly connected graph G = (V, E), where V is the set of all destinations in the travel information table, V = {v1, ..., v i ,...v n}, where v1~v n are all destinations in the travel information table, v i ·num is in v i is the number of passengers at the destination, E is the set of edges connecting any two points in V, E={e ij}, i∈V, j∈V, e ij ·value is the value of the shortest road distance from i to j in the OD matrix. Unless otherwise specified, the distance in the following text refers to the shortest road distance, which can be obtained from static maps or based on the API provided by Baidu and Amap;

[0028] 4. The bus set that the bus operator can provide is B = {b1, ..., b i , ..., b m}, where b i is the bus number, b i ·seat for bus b i Number of seats;

[0029] 5. Create a collection Take Distance0 = 0, Seat0 = 0, find the destination with the largest number of passengers in set V, that is, max(V.num), and replace the v corresponding to max(V.num) with i , add to set B0, and v i The number of passengers is added to Seat0, that is, Seat0 = Seat0 + v i .num, v i Remove from V;

[0030] 6. Find the minimum value of the edge connecting set B0 and set V in E, that is, min(e ij ·alue), i∈B1, j∈V, j is the node v in the set V k ; If Distance0+e ij value≤MaxDistance and Seat0+v k num≤max(B.seat), where MaxDistance is the maximum allowed distance of the destination area when the bus picks up passengers to work, and max(B.seat) is the number of seats in the bus with the largest number of seats in the bus set that the bus operator can provide. k Add to set B0, and add v k Delete from V and replace e ij ·value is added to Distance0, i.e. Distance0 = Distance0 + e ij ·value, change v k The number of passengers is added to Seat0, that is, Seat0 = Seat0 + v k num, repeat this step; if Distance0+e ij value≤MaxDistance and Seat0+v k num≤max(B.seat) is not satisfied, go to the next step;

[0031] 7. If Seat0<MinSeat, MinSeat is the minimum passenger capacity constant of the bus; determine the total number of available seats in the bus if it has been allocated n is the number of allocated buses, i is the number of allocated buses, and all nodes in set B0 are inserted into the bus set closest to the node with more remaining seats than the number of passengers at the node. Using the method in step 6, continue to select nodes from set V and add them to set B0 until Seat0 ≥ MinSeat is satisfied or set V is an empty set;

[0032] 8. Find the most economical vehicle b with more seats than Seat0 in the bus set B that can be provided by the bus operator i , take B i =B0, Seat i =Seat0, Distance i =Distance0; get vehicle b i The set of destinations of the picked-up passengers is B i , vehicle b i The number of passengers picked up is Seati Vehicle b i The weight of the distance traveled by the passenger in the terminal area is Distance i , bus b i Delete from set B, based on the travel information table and set B i , build bus b i All destinations in the travel information table are in set B i the relationship of the passenger to whom you are assigned;

[0033] 9. Repeat steps 5, 6, 7, and 8 until The corresponding relationship between all passengers traveling to work and the assigned pick-up buses during this time period can be obtained;

[0034] 10. If the travel information table for a certain period of time is for off-get off work travel, it is classified based on the starting point; the travel to work in steps three, four, five, six, seven, eight, and nine is changed to off-get off work travel, and the end point is changed to the starting point; executing steps three, four, five, six, seven, eight, and nine, the corresponding relationship between all off-get off work passengers and the assigned pick-up buses in this time period can be obtained.

[0035] Furthermore, in step 5, the method for selecting the customized bus passenger pick-up route is:

[0036] 1. Let the starting point of the bus be v0, and the starting points of all passengers assigned to this bus be added to the set Vo, that is, Vo = {v1, v2, ..., v n}, n is the starting number of passengers on this bus, v1~v n is the starting point of k passengers, n≤k, and the destinations of all passengers on this bus are added to the set Vd, that is, Vd={v n+1 , v n+2 , ..., v n+m},v n+1 ~v n+m is the destination of k passengers, m≤k, and Vo and Vd are combined into a set of stops V = Vo ∪ Vd = {v1, v2, ..., v n , v n+1 , v n+2 , ..., v n+m};

[0037] 2. Based on the static map data, list the OD matrix D of Vo→Vd (Vo→Vd) =(d ij ) n×m , where i∈Vo, j∈Vd, d ij is the bus travel distance from the starting point i to the end point j; find the minimum travel distance from any point in the set Vo to any point in the set Vd, that is, min(D (Vo→Vd) ), if at this time dij =min(D (Vo→Vd) , i∈Vo, j∈Vd, if i=v p , j = v q , then v p As the last node in the starting area, v q As the first node of the terminal area;

[0038] 3. Take V1 = {v0}∪Vo, and based on the static map data, list the OD matrix D of V1→V1 (V1→V1) =(d ij ) (n+1)×(n+1) , where i∈V1, j∈V1, d ij For the bus travel distance from the starting point i to the end point j, establish an ordered set Yo = {v0, v p}, and change v p Delete from the set Vo;

[0039] 4. Sequentially take out the starting point v from the set Vo i Insert the ordered set Yo, according to the OD matrix D (V1→V1) The value of v i Finally, the total distance of the ordered set Yo is the minimum value among all possible insertions, and then v in the set Vo is deleted. i ;

[0040] 5. Repeat step 4 until Vo is an empty set. At this time, the order of traversing all passenger starting points from the bus starting point is the ordered set Yo;

[0041] 6. Based on the static map data, list the OD matrix D of Vd→Vd (Vd→Vd) =(d ij ) m×m , where i∈Vd, j∈Vd, d ij is the distance traveled by the bus from the starting point i to the end point j;

[0042] 7. If the number of elements in set Vd |Vd|≤C0, use the full permutation method to find the optimal traversal of set Vd, and save the result to the ordered set Yd, where C0 is a preset constant. In general, C0=10; If the number of elements in set Vd |Vd|>C0, first obtain the basic traversal plan based on the greedy algorithm, and then complete the traversal plan based on v based on the ant colony algorithm. q Traverse the set Vd starting from the starting point and save the result to the ordered set Yd;

[0043] 8. Connect the ordered sets Yo and Yd to obtain the ordered set Y = Yo ∪ Yd. The ordered set Y is the order of the bus stops for picking up and dropping off passengers.

[0044] Beneficial effects: Compared with the prior art, the present invention has the following significant advantages:

[0045] (1) The present invention makes full use of the functions of existing maps and navigation software, and obtains static maps and real-time traffic and navigation information by calling the API of existing software, which greatly reduces the difficulty of implementation, system development cost and later operation cost;

[0046] (2) Since the optimal path selection belongs to the full permutation problem, when the number of passengers is n, the calculation amount of the optimal solution is (2n+1)!. The present invention adopts a segmented processing method to divide the nodes into the starting area and the end area, and the calculation amount of the optimal solution is reduced to (n!). 2 , and then after n comparisons to determine the end point of the starting area and the starting point of the end point area, the amount of calculation for the optimal solution is reduced to 2(n-1)! , then the insertion method is used for the starting area, and the greedy algorithm + ant colony algorithm is used for the end point area, so that the time complexity of the final calculation is only O(n 2 ), the server can quickly complete the calculation and support rapid response to user customization requirements;

[0047] (3) The fare strategy determined by the present invention can effectively determine the areas where customized public transportation can be implemented, avoid investment losses, and formulate reasonable fares accordingly to achieve a balance between passenger experience and public transportation company performance;

[0048] (4) The bus and passenger matching method of the present invention adopts a spatiotemporal clustering method, which is based on the types of buses owned by the bus company. The method is universal and can classify passengers based on bus type, passenger departure area, passenger destination area, passenger departure time, and passenger expected arrival time, and assign them to corresponding buses, laying the foundation for subsequent bus route selection. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Figure 1 It is a flow chart of the present invention. DETAILED DESCRIPTION

[0050] The technical solution of the present invention is further described below in conjunction with the accompanying drawings.

[0051] 1. If passenger A wants to receive customized bus service, he / she should first register for the customized bus mobile app and submit basic passenger information, including name, gender, ID number, and mobile phone number, to complete real-name authentication; select and bind an identity recognition method, which can be a recent bareheaded photo for facial recognition, or WeChat, Alipay, or UnionPay for code scanning; bind online payment, such as online banking, WeChat, Alipay, or UnionPay;

[0052] 2. Passenger A logs in to the customized bus mobile app, selects the travel date, first selects the purpose of travel as going to work, selects the starting area and the end area of ​​the trip to work according to the optional customized bus service areas provided by the app, then selects the starting and end areas on the map or enters the starting and end points, and selects the latest arrival time; then selects the purpose of travel as getting off work, selects the starting and end points of the trip after work, and selects the earliest departure time;

[0053] 3. The backend dispatch module calculates the operating cost of the customized bus from the starting point to the end point submitted by Passenger A as C0=10 yuan, the price of mixed travel by bus and subway as C1=9 yuan, and the price of carpooling as C2=25 yuan. At this time, the cost coefficient λ1=1.3, the mixed travel coefficient λ2=1.5, and the carpooling coefficient λ3=0.6, then the charging price C=min(λ1×C0, λ2×C1, λ3×C2)=min(10×1.3, 9×1.5, 25×0.6)=13 yuan. The charging price at the end of get off work is calculated in the same way as 13 yuan, and the backend dispatch module charges Passenger A a customized bus fee of 26 yuan through the mobile phone APP;

[0054] 4. At zero o'clock on the day of customized bus travel, the background scheduling module will group all passengers who have submitted customized travel information on the day and have the same starting and ending areas according to the customized information submitted by the passengers on the APP, and then assign the passengers to the bus; if the customized bus is for going to work, the latest arrival time is divided into four files: 8:00, 8:30, 9:00, and 9:30; if the travel purpose is to get off work, the earliest departure time is divided into four files: 16:30, 17:00, 17:30, and 18:00. Based on these 8 times, 8 travel information tables are established, and all passengers are added to the table according to the travel purpose and the corresponding time. The travel information table entries include the passenger's name, mobile phone number, earliest boarding time, latest getting off time, starting point, end point, going to work / getting off work;

[0055] 5. Taking the table where the purpose of travel is to go to work and the latest arrival time is 8 o'clock as an example, the following travel information table is obtained:

[0056]

[0057]

[0058] As shown in the table above, the purpose of the trip submitted by the passenger is to go to work, so there is no need to fill in the earliest boarding time. The nearest bus station for passenger Name1 and passenger Name5 is the same, so the starting point shown in the table is O1. The nearest bus station for passenger Name2, Name3, and Name4 is the same, so the destination shown in the table is D2.

[0059] 6. According to the above travel information table, since it is a work trip, the bus is assigned according to the destination, and the set of all destinations and each destination are listed:

[0060] V <![CDATA[v1]]> <![CDATA[v2]]> <![CDATA[v3]]> <![CDATA[v4]]> <![CDATA[v5]]> <![CDATA[v6]]> <![CDATA[v7]]> <![CDATA[v8]]> <![CDATA[v9]]> ...... end D1 D2 D3 D4 D5 D6 D7 D8 D9 ...... <![CDATA[Number of passengers v i .num]]> 1 4 7 2 8 5 9 3 4 ......

[0061] Based on the static map, the road distances between the endpoints in the above table are obtained to generate an OD matrix. The weights in the OD matrix are road distances in kilometers:

[0062] O\D <![CDATA[v1]]> <![CDATA[v2]]> <![CDATA[v3]]> <![CDATA[v4]]> <![CDATA[v5]]> <![CDATA[v6]]> <![CDATA[v7]]> <![CDATA[v8]]> <![CDATA[v9]]> ...... <![CDATA[v1]]> 0 20 25 8 19 17 25 11 22 ...... <![CDATA[v2]]> 20 0 22 25 30 35 19 26 5 ...... <![CDATA[v3]]> 25 22 0 31 15 29 3 20 21 ...... <![CDATA[v4]]> 8 25 31 0 25 17 32 16 29 ...... <![CDATA[v5]]> 19 30 15 25 0 16 19 9 30 ...... <![CDATA[v6]]> 17 35 29 17 16 0 33 10 37 ...... <![CDATA[v7]]> 25 19 3 32 19 33 0 23 16 ...... <![CDATA[v8]]> 11 26 20 16 9 10 23 0 28 ...... <![CDATA[v9]]> 22 5 21 29 30 37 16 28 0 ...... ...... ...... ...... ...... ...... ...... ...... ...... ...... ...... 0

[0063] E is the set of edges connecting any two points in V, E = {e ij}, i∈V, j∈V, e ij ·value is the distance from i to j in the OD matrix, which is not listed here. Subsequent cases will directly refer to the value of the OD matrix;

[0064] 7. If the bus operator can provide five types of buses with 50, 40, 30, 20, and 10 seats, with 5 buses in each type, then the bus set that the bus operator can provide is B = {b1, ..., b i , ..., b 25}, where b1~b5 are 50 seats, and so on, b 21 ~b 25 There are 10 seats;

[0065] 8. Create a collection Take Distance0 = 0, Seat0 = 0, find the destination with the largest number of passengers in set V, if max(V.num) = 9, add v7 corresponding to max(V.num) to set B0, add the number of passengers of v7 to Seat0, that is, Seat0 = Seat0 + v7 num = 9, delete v7 from V, and now B0 = {v7};

[0066] 9. Find the minimum value of the edge connecting set B0 and set V in the OD matrix. At this time, set B0 has only one element v7, and set V contains all endpoints except v7. If min(e ij ·value)=3,i∈B1,j∈V,get i=v7,j=v3,take MaxDistance=10,that is, the maximum allowed driving distance of the terminal area when the bus picks up passengers to work is 10 kilometers, at this time max(B.seat)=50, judge: Distance0+e ij·value=0+3=3<MaxDistance, and Seat0+v3·num=9+7=16<max(B.seat) is true, add v3 to set B0, delete v3 from V, Distance0=Distance0+e ij ·value=3,Seat0=Seat0+v3·num=16,repeat this step until Distance0+e ij value≤MaxDistance and Seat0+v i num≤max(B.seat) is not satisfied;

[0067] 10. If we get B0 = {v7, v3, v 12 , v 23 , v 37 , v 45}, Distance0=9, Seat0=28, then the most economical bus b that can accommodate 28 seats is selected 11 , take B 11 =B0={v7, v3, v 12 , v 23 , v 37 , v 45}, Seat 11 =Seat0=28,Distance 11 = Distance0 = 9; then find the destination B according to the travel information table 11 passengers, build bus b 11 The pick-up and drop-off passenger table is as follows:

[0068]

[0069] 11. Repeat steps 8, 9, and 10 until The corresponding relationship between all the passengers going to work and the assigned pick-up buses can be obtained during this time period;

[0070] 12. The backend dispatching module determines the order of picking up and dropping off passengers for each bus according to the customized bus passenger pick-up and drop-off route selection method, and determines the waiting time, waiting location, estimated arrival time and alighting location for passengers, and sends the waiting time, waiting location, estimated arrival time and alighting location to passengers. 11 Take picking up passengers as an example;

[0071] 13. Let the starting point of the bus be v0, and the starting points of all passengers assigned to this bus are added to the set Vo, that is, Vo = {v1, v2, ..., v n}, n is the starting number of passengers on this bus, v1~v nis the starting point of k passengers, n≤k, and the destinations of all passengers on this bus are added to the set Vd, that is, Vd={v n+1 , v n+2 , ..., v n+m},v n+1 ~v n+m is the destination of k passengers, m≤k, and Vo and Vd are combined into a set of stops V = Vo ∪ Vd = {v1, v2, ..., v n , v n+1 , v n+2 , ..., v n+m ), bus b 11 The number of passengers is 28, the number of starting points is 20, and the number of destinations is 6, then k = 28, n = 20, m = 6, that is, Vo = {v1, v2, ..., v 20},Vd={v 21 , v 22 , ..., v 26}, and get Vo, Vd and b at the same time 11 The correspondence table between the starting point and the end point in the passenger pick-up and drop-off information table;

[0072] Vo, Vd <![CDATA[v1]]> ...... <![CDATA[v 20 ]]> <![CDATA[v 21 ]]> ...... <![CDATA[v 26 ]]> Starting point and end point O40 ...... O1 D7 ...... D3

[0073] 14. Based on the static map data, list the OD matrix D of Vo→Vd (Vo→Vd) =(d ij ) n×m , where i∈Vo, j∈Vd, d ij is the distance traveled by the bus from the starting point i to the end point j, in kilometers;

[0074] Vo\Vd <![CDATA[v 21 ]]> <![CDATA[v 22 ]]> <![CDATA[v 23 ]]> <![CDATA[v 24 ]]> <![CDATA[v 25 ]]> <![CDATA[v 26 ]]> <![CDATA[v1]]> 45 48 47 46 45 47 ...... ...... ...... ...... ...... ...... ...... <![CDATA[v 12 ]]> 44 47 46 45 41 43 ...... ...... ...... ...... ...... ...... ...... <![CDATA[v 20 ]]> 49 47 46 48 46 44

[0075] Find the minimum driving distance from any point in the set Vo to any point in the set Vd, that is, min(D (Vo→Vd) ), if at this time d ij =min(D (Vo→Vd) ), i∈Vo, j∈Vd, if i=v 12 , j = v 25 , then v 12 As the last node in the starting area, v 25 As the first node of the terminal area;

[0076] 15. Take V1 = {v0} ∪ Vo, and based on the static map data, list the OD matrix D of V1 → V1 (V1→V1) =(d ij ) 21×21 , where i∈V1, j∈V1, d ijFor the bus travel distance from the starting point i to the end point j, establish an ordered set Yo = {v0, v 12}, and change v 12 Delete from the set Vo;

[0077] 16. Sequentially take out the starting point v from the set Vo i Insert the ordered set Yo, according to the OD matrix D (V1→V1) The value of v i Finally, the total distance of the ordered set Yo is the minimum value among all possible insertions, and then v in the set Vo is deleted. i ;

[0078] 17. Repeat step 16 until Vo is an empty set. At this time, the order of traversing all the passengers' starting points from the bus starting point is the ordered set Yo;

[0079] 18. Based on the static map data, list the OD matrix D of Vd→Vd (Vd→Vd) =(d ij ) 6×6 , where i∈Vd, j∈Vd, d ij is the distance traveled by the bus from the starting point i to the end point j;

[0080] 19. Take C0=10. Since |Vd|=6<C0, use the full permutation method to find the optimal traversal of the set Vd, save the result to the ordered set Yd, connect the ordered sets Yo and Yd, and get the ordered set Y=Yo∪Yd. The ordered set Y is the stop sequence of the bus to pick up and drop off passengers.

[0081] 20. The backend scheduling module estimates the stop time of each node based on the driving order and the latest get-off time of the ordered set Y, based on static map data or the API provided by map software such as Baidu and Amap. 11 The information of passengers in the passenger pick-up information table is sent to the passengers, and the estimated boarding time and boarding location are sent to the passengers, and then the order of picking up passengers and the stop location are sent to b 11 The driver of the bus;

[0082] 21. Before picking up or dropping off passengers, the backend dispatch module maintains real-time contact with the bus and passengers. The bus picks up passengers in turn according to the dispatch arrangement of the backend dispatch module, verifies the identity of the passengers, and then sends the passengers to their destinations.

Claims

1. A customized public transportation system between urban areas, characterized in that: It includes bus operators, buses, mobile APP modules, background scheduling modules, background database modules, map capture modules, map software API processing modules, and charging modules; the bus operator is responsible for executing bus scheduling according to the scheduling information of the background scheduling module; the bus supports Beidou / GPS satellite positioning and navigation, 5G / 4G communication, and mobile phone code scanning identity recognition; the background database module saves passenger basic information data, passenger riding information data, static map data, and bus operation data; the map capture module is responsible for regularly capturing the city static map to update the static map data in the background database module; the map software API processing module is responsible for obtaining the estimated travel time, road conditions and real-time navigation data based on the map software API; the charging module is responsible for connecting the payment interface and completing the charging of passengers according to the customized bus charging method; the background scheduling module is responsible for connecting all modules to complete the scheduling between modules and the scheduling of bus operation routes; In the background scheduling module, scheduling information is generated according to the customized bus passenger pick-up and drop-off route selection method, and the customized bus passenger pick-up and drop-off route selection method includes:

1. Record the bus departure point as , the starting points of all passengers assigned to this bus are added to the set ,Right now , is the starting number of passengers of this bus, ~ for The starting point for passengers, , add the destinations of all passengers on this bus to the set ,Right now , ~ for The destination of passengers, ,Will and Merge into a stop point collection ; 2. Based on static map data, list OD Matrix ,in , From the starting point To the end The bus travel distance; find the set Any point to the set The minimum driving distance of any point in , if at this time , , ,like , then As the last node in the starting area, As the first node of the terminal area; 3. Take , based on static map data, lists OD Matrix ,in , From the starting point To the end The bus travel distance, establish an ordered set ,Will From the collection Delete from; 4. From the collection Take out the starting point in order Inserting into a sorted set , according to the OD matrix The value of Afterwards, from Start traversing the sorted set in order The total distance is the minimum value among all possible insertions, and then the set is deleted. In ; 5. Repeat step 4 until is an empty set. At this time, the order of traversing all the passengers' starting points from the bus starting point is an ordered set. ; 6. Based on static map data, list OD Matrix ,in , From the starting point To the end The distance travelled by buses; 7. If the collection The number of elements , use the full permutation method to find the set Optimal traversal of the result, saving it to an ordered set ,in is a preset constant. In general, ; If the collection The number of elements First, the basic traversal scheme is obtained based on the greedy algorithm, and then the ant colony algorithm is used to complete the following A collection of starting points Traverse and save the results to an ordered set ; 8. Connecting Ordered Sets and , get an ordered set , the ordered set This is the order in which the bus stops to pick up or drop off passengers.

2. The customized inter-regional public transportation system according to claim 1 is characterized in that: The map software includes Baidu Map, Amap and Tencent Map.

3. The inter-city customized public transportation system according to claim 1, characterized in that: The payment interfaces include UnionPay, Cloud QuickPass, WeChat Pay and Alipay.

4. A method for dispatching a customized public transportation system between urban areas according to claim 1, characterized in that: The steps include: Step 1: Passengers register for the customized bus mobile APP, submit basic passenger information, including name, gender, ID number, and mobile phone number, and complete real-name authentication; select and bind the identity recognition method; Step 2: Passengers log in to the customized bus mobile app, submit the travel date, select the travel starting point and end point, enter the travel starting point and end point, and select the travel purpose = {going to work|getting off work}. If you choose going to work, you must select the latest arrival time = {Td_1|…| Td_M}. If you choose getting off work, you must select the earliest departure time = {To_1|…| To_N}; Td_1~Td_M and To_1~ To_N are preset times; all travel information submissions must be before the deadline, set to 0:00 on the travel date; Step 3: The mobile APP module completes the passenger charges through the charging module according to the customized bus charging method; Step 4: After the deadline for submitting the travel information of the day, the backend scheduling module will divide the passengers into the corresponding buses according to the earliest boarding time, latest getting off time, starting point, destination, and work / off-get off work information of the passengers on the day through a customized bus and passenger matching method; Step 5: The backend dispatching module determines the order of picking up and dropping off passengers on each bus according to the customized bus passenger pick-up and drop-off route selection method, and determines the passenger waiting time, waiting location, estimated arrival time and alighting location, sends the passenger waiting time, waiting location, estimated arrival time and alighting location to the passengers, and dispatches the bus accordingly; Step 6: Before the backstage dispatch module arrives to pick up passengers, it keeps in real time contact with the bus and passengers. The bus picks up passengers in turn according to the dispatch arrangement of the backstage dispatch module, verifies the identity of the passengers, and then sends the passengers to their destinations respectively; In step 5, the method for selecting the customized bus passenger pick-up route is:

1. Record the bus departure point as , the starting points of all passengers assigned to this bus are added to the set ,Right now , is the starting number of passengers of this bus, ~ for The starting point for passengers, , add the destinations of all passengers on this bus to the set ,Right now , ~ for The destination of passengers, ,Will and Merge into a stop point collection ; 2. Based on static map data, list OD Matrix ,in , From the starting point To the end The bus travel distance; find the set Any point to the set The minimum driving distance of any point in , if at this time , , ,like , then As the last node in the starting area, As the first node of the terminal area; 3. Take , based on static map data, lists OD Matrix ,in , From the starting point To the end The bus travel distance, establish an ordered set ,Will From the collection Delete from; 4. From the collection Take out the starting point in order Inserting into a sorted set , according to the OD matrix The value of Afterwards, from Start traversing the sorted set in order The total distance is the minimum value among all possible insertions, and then the set is deleted. In ; 5. Repeat step 4 until is an empty set. At this time, the order of traversing all the passengers' starting points from the bus starting point is an ordered set. ; 6. Based on static map data, list OD Matrix ,in , From the starting point To the end The distance travelled by buses; 7. If the collection The number of elements , use the full permutation method to find the set Optimal traversal of the result, saving it to an ordered set ,in is a preset constant. In general, ; If the collection The number of elements First, the basic traversal scheme is obtained based on the greedy algorithm, and then the ant colony algorithm is used to complete the following A collection of starting points Traverse and save the results to an ordered set ; 8. Connecting Ordered Sets and , get an ordered set , the ordered set This is the order in which the bus stops to pick up or drop off passengers.

5. The method for dispatching a customized public transportation system between urban areas according to claim 4, characterized in that: In step 1, the method for selecting and binding an identity recognition method is to use a recent bareheaded photo for facial recognition, which is used for payment or binding a payment interface.

6. The method for dispatching a customized public transportation system between urban areas according to claim 4, characterized in that: In step 3, the customized bus charging method is specifically as follows:

1. According to the passenger's starting point to the end point, calculate the following three reference prices: (1) Bus operating costs ),in is the unit mileage operating cost of the selected bus, is the mileage from the passenger's starting point to the destination. is the number of seats in the bus, is the standard passenger load factor of buses, is a preset constant, with a value range of ; (2) Bus and subway mixed travel prices , which represents the cost when passengers travel from the starting point to the destination by taking a combination of buses and subways; (3) Carpooling prices , represents the cost of a passenger sharing a car from the starting point to the destination; Second, multiply the above three reference prices by a coefficient and take the minimum value as the charging price: ,in is the cost coefficient, is the mixed travel coefficient, is the carpooling coefficient, and the value range of each coefficient is: , , ; 3. If , indicating that it is not feasible to open customized buses on this route; 4. The actual charging price is the charging price multiplied by the discount rate: that is, the actual charging price , is the fee discount rate, the value range is: , which is adjusted by the bus company based on passenger status and company activity factors.

7. The method for dispatching a customized public transportation system between urban areas according to claim 4, characterized in that: In step 4, the method for matching the customized bus with the passenger is:

1. According to the customized information submitted by passengers on the APP, for all passengers who submit customized travel information on the day and have the same starting and ending areas, a two-dimensional travel information table is established for each time based on the latest arrival time for work and the earliest departure time for off-work. Each travel information table contains all passengers with the same latest arrival time or the same earliest departure time. The travel information table entries include the passenger's name, mobile phone number, earliest boarding time, latest getting off time, starting point, end point, work / off-get off work, where the starting point and end point are saved at the nearest bus stop to the location submitted by the passenger in the APP; 2. Classify each travel information table. If the travel information table is for going to work, classify it based on the destination. If the travel information table is for going off work, classify it based on the starting point.

3. When commuting to work, list the set of all destinations in the travel information table, and build an OD matrix based on all destinations to form a strongly connected graph ,in is the set of all destinations in the travel information table, ,in For all destinations in the travel information table, For is the number of passengers at the destination, For connection The set of edges between any two points in , , From the OD matrix arrive The value of the shortest road distance. Unless otherwise specified, the distance in the following text refers to the shortest road distance, which is obtained from static maps or based on the API provided by Baidu and Amap.

4. The bus collection provided by the bus operator is ,in Number the bus. For buses Number of seats; 5. Create a collection ,Pick , , find the set The destination with the most passengers is ,Will Corresponding , join the collection ,Will Number of passengers added ,Right now ,Will from Delete from; 6. Found the collection With Collection The minimum value among the connected edges, that is , For collection Nodes in ;like and ,in The maximum allowed driving distance of the terminal area when the bus picks up passengers for work. The number of seats in the bus with the largest number of seats in the bus set provided to the bus operator will be Add to collection ,Will from Delete it from join in In ,Will Number of passengers added ,Right now , repeat this step; if and If not satisfied, go to the next step; 7. If , is the minimum passenger capacity constant of the bus; determine the total number of available seats if the bus has been allocated , is the number of assigned buses, Assign bus numbers to the collection All nodes in the list are inserted into the bus set closest to the node with more remaining seats than the number of passengers at the node. , continue from the collection using the method in step 6 Select nodes from the collection and add them to it until satisfied or a collection is an empty set; 8. Meet on buses provided by bus operators More than 100 seats found in The most economical vehicle ,Pick , , ; Get vehicle The set of destinations of the picked-up passengers is ,vehicle The number of passengers picked up is ;vehicle The weight of the distance traveled by the passenger in the terminal area is , the bus Delete from set B, based on the travel information table and set , build bus All destinations in the travel information table are in the set the relationship of the passenger to whom you are assigned; 9. Repeat steps 5, 6, 7, and 8 until , we can get the correspondence between all the passengers going to work and the assigned pick-up buses in this time period; 10. If the travel information table for a certain period of time is for off-get off work travel, it is classified based on the starting point; the travel to work in steps three, four, five, six, seven, eight, and nine is changed to off-get off work travel, and the end point is changed to the starting point; executing steps three, four, five, six, seven, eight, and nine, the corresponding relationship between all off-get off work passengers and the assigned pick-up buses in this time period can be obtained.

Citation Information

Cited By

  • Passenger pick-up and pick-up scheduling method for customized public transportation system among urban areas

    CN115099587A

  • A passenger pick-up and drop-off scheduling method for customized bus systems between urban areas

    CN115099587B