Passenger route planning method, device and equipment and storage medium

Abstract

The application discloses a passenger route planning method and device, equipment and a storage medium, and relates to the technical field of passenger transportation. The method comprises the following steps: determining virtual transportation line information under different transportation modes from a virtual starting point to a virtual arrival point, and constructing transportation layers under different transportation modes according to the virtual transportation line information; determining virtual stations on the transportation layers, wherein the virtual stations are transferable stations on the virtual transportation line; generating virtual transferable line information based on the virtual stations at the same position of different transportation layers; generating a virtual transportation network according to the virtual transportation line information and the virtual transferable line information; and determining a virtual passenger route under the virtual transportation network based on a planning selection model. The application can improve the efficiency of passenger route planning.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of passenger transportation technology, and particularly relates to a passenger route planning method and device, equipment and a storage medium. BACKGROUND

[0002] With the continuous improvement of the intelligent degree of the logistics industry, the planning convenience of passenger travel and passenger transportation has been largely solved. Especially in passenger planning, route planning can be carried out by planning personnel based on work experience and traffic route maps, but this planning method based on the work habits of planning personnel is very inefficient, so it is difficult to plan the most suitable passenger planning route in a short time according to the changes of the transportation network.

[0003] The above content is only used to assist in understanding the technical solutions of the present application and does not represent the acknowledgement of the above content as prior art. SUMMARY

[0004] The main purpose of the present application is to provide a passenger route planning method, device, equipment and storage medium, which aims to solve the technical problem of low efficiency of planning personnel in passenger route planning based on work habits.

[0005] To achieve the above purpose, the present application provides a passenger route planning method, which comprises:

[0006] determining virtual transportation line information under different traffic modes from a virtual starting point to a virtual arrival point, and constructing traffic layers under different traffic modes according to the virtual transportation line information;

[0007] determining a virtual station on the traffic layer, wherein the virtual station is a transferable station on the virtual transportation line;

[0008] generating virtual transferable line information based on the virtual stations of different traffic layers at the same position;

[0009] generating a virtual transportation network according to the virtual transportation line information and the virtual transferable line information;

[0010] determining a virtual passenger route under the virtual transportation network based on a planning selection model.

[0011] In an embodiment, the step of determining virtual transportation line information under different traffic modes from a virtual starting point to a virtual arrival point comprises:

[0012] generating a passenger database according to the position information of the rail transit line network, wherein the position information includes station position, line direction, transfer node position and coverage area;

[0013] determine virtual transportation route information from a virtual departure point to a virtual arrival point under different transportation modes based on the passenger database.

[0014] In an embodiment, the determining the virtual passenger route under the virtual transportation network based on the planning selection model comprises:

[0015] determine a first transportation mode and a transportation change of a passenger on a transportation arc route based on the virtual transportation network, wherein the transportation arc route is a route from a target point in a preset area of a first service node to a second service node in the virtual transportation network;

[0016] determine a transportation distance of the transportation arc route under the first transportation mode;

[0017] determine a unit transportation cost of the first transportation mode, an occupied transportation space of the passenger, and a single transfer fee of the passenger;

[0018] determine a direct transportation fare calculation relationship based on the first transportation mode, the unit transportation cost, the transportation distance, and the occupied transportation space;

[0019] determine a transfer transportation fare calculation relationship according to the transportation change and the single transfer fee;

[0020] determine the virtual passenger route under the virtual transportation network based on the direct transportation fare calculation relationship and the transfer transportation fare calculation relationship.

[0021] In an embodiment, the determining the virtual passenger route under the virtual transportation network based on the direct transportation fare calculation relationship and the transfer transportation fare calculation relationship comprises:

[0022] generate a transportation cost equation based on the direct transportation fare calculation relationship and the transfer transportation fare calculation relationship;

[0023] determine a constraint condition of the transportation cost equation;

[0024] determine a lowest transportation cost passenger route in the virtual transportation network based on the transportation cost equation and decision analysis under the constraint condition, and determine the lowest transportation cost passenger route as the virtual passenger route.

[0025] In an embodiment, the constraint condition comprises a transportation path constraint; wherein the determining the constraint condition of the transportation cost equation comprises:

[0026] determine a second transportation mode of a passenger on a virtual transportation arc route, wherein the virtual transportation arc route is a route from a first service node to a second service node in the virtual transportation network;

[0027] determining a passenger batch, a passenger transportation demand set, a service network transportation and transfer arc route set, a service network virtual transportation arc route set, a service network transportation arc route set, and a service node transportation arc route set;

[0028] determining a transportation path constraint of the transportation cost equation based on the first transportation mode, the transportation change condition, the second transportation mode, the passenger batch, the passenger transportation demand set, the service network transportation and transfer arc route set, the service network virtual transportation arc route set, the service network transportation arc route set, and the service node transportation arc route set.

[0029] In an embodiment, the constraint condition includes a transportation capacity constraint; wherein the step of determining the constraint condition of the transportation cost equation comprises:

[0030] determining a transportation capacity of the passenger in the transportation arc route under the first transportation mode;

[0031] determining a transportation capacity constraint of the transportation cost equation based on the first transportation mode, the transportation capacity, and the occupied transportation space.

[0032] In an embodiment, the constraint condition includes a transportation time constraint; wherein the step of determining the constraint condition of the transportation cost equation comprises:

[0033] determining a transportation time of the passenger in the transportation arc route under the first transportation mode;

[0034] determining an earliest transportation preparation completion time, a latest transportation process completion time, and a single transfer time of the passenger;

[0035] determining a transportation time constraint of the transportation cost equation based on the first transportation mode, the transportation time, the earliest transportation preparation completion time, the latest transportation process completion time, and the single transfer time.

[0036] In addition, to achieve the above object, the application further provides a passenger route planning device, which comprises:

[0037] a determining module, configured to determine virtual transportation line information under different transportation modes from a virtual departure point to a virtual arrival point, and to construct a transportation layer under different transportation modes according to the virtual transportation line information;

[0038] The determining module is further configured to determine a virtual station on the transportation layer, wherein the virtual station is a transferable station on the virtual transportation line.

[0039] generate virtual transferable route information based on the virtual stations of different traffic layers at the same location;

[0040] The generation module is further configured to generate a virtual transportation network according to the virtual transportation route information and the virtual transferable route information.

[0041] The determination module is further configured to determine a virtual passenger route under the virtual transportation network based on a planning selection model.

[0042] In addition, to achieve the above object, the present application further provides a passenger route planning device, which comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, and the computer program is configured to implement the steps of the passenger route planning method.

[0043] In addition, to achieve the above object, the present application further provides a storage medium, which is a computer readable storage medium, and the storage medium stores a computer program, and the computer program is executed by a processor to implement the steps of the passenger route planning method.

[0044] In addition, to achieve the above object, the present application further provides a computer program product, which comprises a computer program, and the computer program is executed by a processor to implement the steps of the passenger route planning method.

[0045] The one or more technical solutions provided by the present application have at least the following technical effects:

[0046] The passenger route planning method, device, equipment and storage medium provided by the present application determine virtual transportation route information from a virtual starting point to a virtual arrival point under different traffic modes, and construct traffic layers under different traffic modes according to the virtual transportation route information; determine virtual stations on the traffic layers, wherein the virtual stations are transferable stations on the virtual transportation route; generate virtual transferable route information based on the virtual stations of different traffic layers at the same location; generate a virtual transportation network according to the virtual transportation route information and the virtual transferable route information; and determine a virtual passenger route under the virtual transportation network based on a planning selection model. The technical problem of low efficiency of passenger route planning by planners based on work inertia is solved, and compared with the prior art, the present application can generate a more suitable passenger route scheme according to the changes of the transportation network in time, without relying on the inertial planning of planners, which not only improves the planning efficiency of passenger routes, but also plans a more optimal passenger route scheme. BRIEF DESCRIPTION OF DRAWINGS

[0047] The accompanying drawings, which are incorporated herein and constitute part of the specification, illustrate embodiments consistent with the application and, together with the description, further serve to explain the principles of the application.

[0048] In order to more clearly illustrate the technical solutions of the embodiments of the present application or the prior art, the accompanying drawings required by the embodiments or prior art description will be briefly introduced as follows. Obviously, for those of ordinary skill in the art, the other drawings can also be obtained based on these drawings without any creative effort.

[0049] Figure 1 A flowchart provided by the passenger route planning method embodiment one of the present application;

[0050] Figure 2 A traffic network diagram provided by the passenger route planning method embodiment one of the present application;

[0051] Figure 3 A flowchart provided by the passenger route planning method embodiment two of the present application;

[0052] Figure 4 A decomposition diagram of the multi-level rail transit network three-dimensional transportation service model provided by the passenger route planning method embodiment two of the present application;

[0053] Figure 5 A module structure diagram of the passenger route planning device of the embodiment of the present application;

[0054] Figure 6 A device structure diagram of the hardware running environment involved in the passenger route planning method in the embodiment of the present application.

[0055] The purpose implementation, functional characteristics and advantages of the present application will be further explained with reference to the accompanying drawings combined with the embodiments. DETAILED DESCRIPTION

[0056] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application, and are not used to limit the present application.

[0057] In order to better understand the technical solutions of the present application, the following will be described in detail in combination with the drawings in the specification and specific embodiments.

[0058] The main solution of the embodiment of the present application is: determining virtual transportation line information from a virtual departure point to a virtual arrival point under different traffic modes, and constructing traffic layers under different traffic modes according to the virtual transportation line information; determining a virtual station on the traffic layer, wherein the virtual station is a transferable station on the virtual transportation line; generating virtual transferable line information based on the virtual stations of different traffic layers at the same position; generating a virtual transportation network according to the virtual transportation line information and the virtual transferable line information; and determining a virtual passenger route under the virtual transportation network based on a planning selection model.

[0059] In the embodiment, for convenience of description, the following describes an identification passenger route planning device as an execution subject.

[0060] The existing technology planning personnel has low efficiency when planning a passenger route based on work inertia.

[0061] The present application provides a solution that can generate a more suitable passenger route scheme in a timely manner according to changes in the transportation network, without relying on the inertia planning of planning personnel, thereby improving the planning efficiency of the passenger route and planning a more optimal passenger route scheme.

[0062] From the above embodiment, it can be seen that the present application determines virtual transportation line information from a virtual departure point to a virtual arrival point under different traffic modes, and constructs traffic layers under different traffic modes according to the virtual transportation line information; determines a virtual station on the traffic layer, wherein the virtual station is a transferable station on the virtual transportation line; generates virtual transferable line information based on the virtual stations of different traffic layers at the same position; generates a virtual transportation network according to the virtual transportation line information and the virtual transferable line information; and determines a virtual passenger route under the virtual transportation network based on a planning selection model. The technical problem of low efficiency of planning personnel when planning a passenger route based on work inertia is solved. Compared with the prior art, the present application can generate a more suitable passenger route scheme in a timely manner according to changes in the transportation network, without relying on the inertia planning of planning personnel, thereby improving the planning efficiency of the passenger route and planning a more optimal passenger route scheme.

[0063] It should be noted that the execution subject of the embodiment can be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device, a passenger route planning device, etc. that can realize the above functions. The following describes the embodiment and each of the following embodiments by taking the passenger route planning device as an example.

[0064] Based on this, the embodiment of the present application provides a passenger route planning method, which refers to Figure 1 ,Figure 1 This is a flowchart illustrating the first embodiment of the passenger route planning method of this application.

[0065] In this embodiment, the passenger route planning method includes steps S10 to S40:

[0066] Step S10: Determine the virtual transportation route information from the virtual departure point to the virtual arrival point under different modes of transportation, and construct a traffic layer under different modes of transportation based on the virtual transportation route information;

[0067] It should be noted that the virtual starting point is the point in the topological road network (i.e., traffic network diagram) corresponding to the target starting point, and the virtual arrival point is the point in the topological road network corresponding to the target arrival point.

[0068] It should be noted that virtual transportation route information includes the originating line, the route, and the destination line. The originating line refers to the transportation route from the virtual departure point to the nearest virtual station (which is a station where the mode of transportation can be changed). The route refers to the virtual transportation route from one virtual station to another using any mode of transportation. The destination line refers to the transportation route from the virtual arrival point to the nearest virtual station.

[0069] It should be noted that the modes of transportation can include air transport, water transport, road transport, and rail transport. The transportation layer can intuitively reflect the virtual transportation route information from the virtual departure point to the virtual arrival point.

[0070] In specific implementations, such as Figure 2 As shown, traffic layers based on different modes of transportation can form a traffic network diagram, with each service node (i.e., Figure 2 In the transportation service network, stations (airports, waterways, highways, and railways, etc.) represent passengers or their activities at station i during their journey. A route (i,j) in the network represents a transportation service from station i to station j. Each passenger and each service network has a virtual departure point n. 发 With virtual arrival point n 到 In the service network, there exists a transportation originating arc from a virtual origin point to a service node. (used to represent the passenger's originating operation), and the transportation termination arc from the service node to the virtual arrival point. (Used to represent passengers and their final destinations), and at the same time, there are also transfer arcs between different modes of transportation, representing passengers transferring between different modes of transportation. The virtual passenger route is a path from the virtual departure point to the virtual arrival point in the service network, and if the path passes through a service node, it means that the in-transit operation will occur at the corresponding service node, i.e., the passenger is active near the service node and will pass through the service node.

[0071] In an implementable embodiment, the step of determining the virtual transportation route information from the virtual departure point to the virtual arrival point under different transportation modes includes: generating a passenger database according to the position information of the rail transit line network, wherein the position information includes station position, line orientation, transfer node position, and coverage area; and determining the virtual transportation route information from the virtual departure point to the virtual arrival point under different transportation modes based on the passenger database.

[0072] In a specific implementation, taking regional passenger transport as an example, first, the residential land, public management and public service land, commercial service facility land, industrial land, road and transportation facility land, and green land and square land within the influence range (R=900m) of the candidate node are statistically analyzed according to the standards for urban land use classification in the “Urban Land Classification and Planning Construction Land Standards” (GB50137-2011), the station position, line orientation, transfer node position, coverage area, and other indicators of the rail transit line network are researched and analyzed based on the screened candidate node, and a passenger database is generated.

[0073] It can be understood that after the passenger database is generated, the virtual transportation route information under different transportation routes can be determined according to the information of the virtual departure point and the virtual arrival point.

[0074] Step S20, determining a virtual station on the traffic layer, wherein the virtual station is a transferable station on the virtual transportation route;

[0075] It should be noted that the virtual station refers to a station on the virtual transportation route where the transportation mode can be changed.

[0076] Step S30, generating virtual transferable route information based on the virtual stations of different traffic layers at the same position;

[0077] It should be noted that when the virtual stations under different transportation modes are located at the same position, the transportation mode can be changed from one to another, for example, when the A virtual station of air transportation and the B virtual station of waterway transportation are located at the same position, the transportation mode can be changed from air transportation to waterway transportation when the passenger is at the A virtual station of air transportation.

[0078] It should be noted that the virtual transferable route information includes a plurality of transfer lines, and the transfer line refers to a transfer route from a virtual station of any transportation mode to a virtual station of another transportation mode at the same position.

[0079] In step S40, a virtual transportation network is generated according to the virtual transportation line information and the virtual changeable line information.

[0080] It should be noted that the virtual transportation network from the virtual departure point to the virtual arrival point can be generated based on the virtual transportation line information and the virtual changeable line information.

[0081] In step S50, a virtual passenger route in the virtual transportation network is determined based on a planning selection model.

[0082] It should be noted that the planning selection model can include transportation cost analysis, transportation path constraint, transportation capacity constraint, transportation time constraint, and decision analysis.

[0083] It can be understood that the virtual transportation network includes a plurality of passenger routes from the virtual departure point to the virtual arrival point, and the virtual passenger route refers to one of the passenger routes determined from the plurality of passenger routes according to the planning selection model. For example, when the planning selection model includes transportation cost analysis, transportation path constraint, transportation capacity constraint, transportation time constraint, and decision analysis, the virtual passenger route is determined from the plurality of passenger routes based on the transportation cost analysis and the decision analysis under the conditions of satisfying the transportation path constraint, the transportation capacity constraint, and the transportation time constraint.

[0084] The embodiment provides a passenger route planning method, device, equipment and storage medium. The virtual transportation line information under different traffic modes from a virtual departure point to a virtual arrival point is determined, and a traffic layer under different traffic modes is constructed according to the virtual transportation line information. A virtual station on the traffic layer is determined, wherein the virtual station is a transferable station on the virtual transportation line. Virtual changeable line information is generated based on the virtual stations of different traffic layers at the same position. A virtual transportation network is generated according to the virtual transportation line information and the virtual changeable line information. A virtual passenger route in the virtual transportation network is determined based on a planning selection model. The technical problem of low efficiency of passenger route planning by planners based on work inertia is solved. Compared with the prior art, the application can generate a more suitable passenger route scheme according to the changes of the transportation network in time, without relying on the inertial planning of planners. The planning efficiency of the passenger route can be improved, and a more optimal passenger route scheme can be planned.

[0085] Based on the first embodiment of the application, in the second embodiment of the application, the same or similar contents as the above-mentioned first embodiment can be referred to the above introduction, and will not be described in detail. On this basis, please refer to Figure 3 Step S50 includes steps S501-S506:

[0086] In step S501, a first traffic mode and a traffic change condition of a passenger in a transport arc route are determined based on the virtual transport network, wherein the transport arc route is a line from a target point in a preset area of a first service node to a second service node in the virtual transport network.

[0087] It should be noted that the first service node refers to any service node in the traffic network diagram, the second service node refers to any service node other than the first service node in the traffic network diagram, the preset area refers to an area near the service node, the target point refers to an actual position of the passenger in the preset area, and the transport arc route refers to a line from the actual position to the first service node and then from the first service node to the second service node. For example, the first service node is Guangzhou Station, the target point is a clothing store near Guangzhou Station, and the second service node is Shenzhen North Station. Then, the transport arc route is a line from the clothing store to Guangzhou Station and then from Guangzhou Station to Shenzhen North Station.

[0088] It should be noted that the first traffic mode refers to a traffic mode selected by the passenger in the transport arc route, and the traffic change condition refers to a change condition of the passenger from one traffic mode to another traffic mode at the start point of the transport arc route.

[0089] In step S502, a transport distance of the transport section under the first traffic mode is determined.

[0090] In step S503, a unit transport cost of the first traffic mode, an occupied transport space of the passenger, and a single transfer fee of the passenger are determined.

[0091] In step S504, a direct freight calculation relationship is determined based on the first traffic mode, the unit transport cost, the transport distance, and the occupied transport space.

[0092] It should be noted that the direct freight calculation relationship is as follows:

[0093]

[0094] In the formula, is a 0-1 variable, indicating whether the passenger h selects traffic mode k for transport in the transport arc route (i, j) (i.e., whether the first traffic mode is traffic mode k). When the passenger h selects traffic mode k for transport in the transport arc route (i, j), is 1, when the passenger h does not select traffic mode k for transport in the transport arc route (i, j), is 0; v h represents the occupied transport space of the passenger h. represents the transport distance of node i and node j using traffic mode k.

[0095] Step S505, determining a transfer fare calculation relationship according to the traffic change condition and the single transfer fee;

[0096] It should be noted that the transfer fare calculation relationship is as follows:

[0097]

[0098] In the formula, is a 0-1 variable, indicating whether the transportation mode of passenger h is changed from traffic mode k to traffic mode l at i station, when the transportation mode of passenger h is changed from traffic mode k to traffic mode l at i station, is 1, when the transportation mode of passenger h is not changed from traffic mode k to traffic mode l at i station, is 0; c * represents the single transfer fee.

[0099] Step S506, determining a virtual passenger transport route in the virtual transport network based on the direct fare calculation relationship and the transfer fare calculation relationship.

[0100] In a specific implementation, a transport cost equation can be determined based on the direct fare calculation relationship and the transfer fare calculation relationship, and then the virtual passenger transport route in the virtual transport network is determined based on the transport cost equation.

[0101] In a feasible implementation, the step of determining a virtual passenger transport route in the virtual transport network based on the direct fare calculation relationship and the transfer fare calculation relationship includes: generating a transport cost equation based on the direct fare calculation relationship and the transfer fare calculation relationship; determining a constraint condition of the transport cost equation; and determining a lowest transport cost passenger transport route in the virtual transport network based on the transport cost equation and decision analysis under the condition that the constraint condition is met, and determining the lowest transport cost passenger transport route as the virtual passenger transport route.

[0102] It should be noted that the constraint condition can include a transport path constraint, a transport capacity constraint, and a transport time constraint.

[0103] It should be noted that the transport cost equation can be determined according to the direct fare calculation relationship and the transfer fare calculation relationship, and the specific calculation relationship is as follows:

[0104]

[0105] It should be noted that the decision analysis performs value analysis on the transport cost equation by the following method.

[0106] ​

[0107] wherein, i * denotes the station i * is the origin station of the passenger h, and denotes that the passenger does not make a transfer at his / her origin station, is a 0-1 variable, and denotes whether the passenger h chooses the traffic mode k for transportation in the transportation arc route (i, j) (i.e., whether the first traffic mode is the traffic mode k), when the passenger h chooses the traffic mode k for transportation in the transportation arc route (i, j), takes 1, when the passenger h does not choose the traffic mode k for transportation in the transportation arc route (i, j), takes 0; is a 0-1 variable, and denotes whether the passenger h chooses the traffic mode k in the virtual transportation arc route (i, j), when the passenger h chooses the traffic mode k for transportation in the virtual transportation arc route (i, j), takes 1, when the passenger h does not choose the traffic mode k for transportation in the virtual transportation arc route (i, j), takes 0, and the transportation graph layer corresponding to the node j is the initial selected transportation mode of the passenger h; is a 0-1 variable, and denotes whether the transportation mode of the passenger h is converted from the traffic mode k to the traffic mode l at the station i, when the transportation mode of the passenger h is converted from the traffic mode k to the traffic mode l at the station i, takes 1, when the transportation mode of the passenger h is not converted from the traffic mode k to the traffic mode l at the station i, takes 0.

[0108] In an implementable embodiment, the constraint condition comprises a transportation path constraint; wherein the step of determining the constraint condition of the transportation cost equation comprises: determining a second traffic mode of a passenger in a virtual transportation arc route, wherein the virtual transportation arc route is a line from a first service node to a second service node in the virtual transportation network; determining a passenger batch, a passenger transportation demand set, a service network transportation and transfer arc route set, a service network virtual transportation arc route set, a service network transportation arc route set, and a service node transportation arc route set; and determining a transportation path constraint of the transportation cost equation based on the first traffic mode, a traffic mode conversion condition, the second traffic mode, the passenger batch, the passenger transportation demand set, the service network transportation and transfer arc route set, the service network virtual transportation arc route set, the service network transportation arc route set, and the service node transportation arc route set.

[0109] It should be noted that when the first service node is the Guangzhou station, the actual location of the passenger is a clothing store near the Guangzhou station, and the second service node is the Shenzhen North station, then the virtual transportation arc route is the passenger from the Guangzhou station to the Shenzhen North station.

[0110] It should be noted that the transport time constraint is constrained by the following calculation relationship:

[0111]

[0112] In the formula, is a 0-1 variable, indicating whether passenger h selects traffic mode k for transport in transport arc path (i, j) (that is, whether the first traffic mode is traffic mode k), when passenger h selects traffic mode k for transport in transport arc path (i, j), 1, when passenger h does not select traffic mode k for transport in transport arc path (i, j), 0; is a 0-1 variable, indicating whether passenger h selects traffic mode k in virtual transport arc path (i, j), when passenger h selects traffic mode k for transport in virtual transport arc path (i, j), 1, when passenger h does not select traffic mode k for transport in virtual transport arc path (i, j), 0, the transport graph layer corresponding to node j is the initial transport mode selected by passenger h; is a 0-1 variable, indicating whether the transport mode of passenger h is converted from traffic mode k to traffic mode l at i station, when the transport mode of passenger h is converted from traffic mode k to traffic mode l at i station, 1, when the transport mode of passenger h is not converted from traffic mode k to traffic mode l at i station, 0; H is a set of passenger transport demands, h is a passenger batch, h∈H; A is a set of service network transport and transfer arcs (i.e. a set of service network transport and transfer arcs); A 0 is a set of service network virtual transport arcs, A 0 ∈A; A 1 is a set of service network transport arcs, A 1 ∈A; A ij is a set of transport arcs from a transport service node in city i to a transport service node in city j (i.e. a set of service node transport arcs).

[0113] It should be noted that the transport path constraint can ensure that passenger h enters the traffic network from the virtual starting point, performs transport transfer in the traffic network, and finally leaves the traffic network after reaching the virtual arrival point, while limiting the passenger to select at most one transport mode for transport between two virtual stations, the passenger to select at most one transport mode for entering the virtual transport network, and the passenger to occur at most once in the virtual station.

[0114] In an implementation, the constraint includes a transport capacity constraint; wherein the step of determining the constraint of the transport cost equation includes determining a transport capacity of the passenger in the transport arc under the first transportation mode; and determining a transport capacity constraint of the transport cost equation based on the first transportation mode, the transport capacity and the occupied transport space.

[0115] It should be noted that the transport capacity constraint module uses the following calculation relationship for constraint:

[0116]

[0117] wherein, is a 0-1 variable, indicating whether the passenger h chooses the transportation mode k for transport in the transport arc (i, j) (i.e., determining whether the first transportation mode is the transportation mode k); when the passenger h chooses the transportation mode k for transport in the transport arc (i, j), is 1 when the passenger h does not choose the transportation mode k for transport in the transport arc (i, j), is 0; v h represents the occupied transport space of the passenger h (i.e., the occupied transport space); represents the transport capacity of the transportation mode k in the transport arc (i, j).

[0118] It should be noted that the transport capacity constraint makes the total space occupied by the passengers transported on any virtual line segment in the virtual transport network not exceed the maximum transport capacity of the segment.

[0119] In an implementation, the constraint includes a transport time constraint; wherein the step of determining the constraint of the transport cost equation includes determining a transport time of the passenger in the transport arc under the first transportation mode; determining an earliest completion of transport preparation time, a latest completion of transport process time and a single transfer time of the passenger; and determining a transport time constraint of the transport cost equation based on the first transportation mode, the transport time, the earliest completion of transport preparation time, the latest completion of transport process time and the single transfer time.

[0120] It should be noted that the transport time constraint module uses the following calculation relationship for constraint:

[0121]

[0122] wherein, represents the earliest completion of transport preparation time of the passenger h; represents the latest completion of transport process time of the passenger h; This is a 0-1 variable, representing whether passenger h selects mode k for transportation in transportation arc (i,j) (i.e., whether the first mode of transportation is k). When passenger h selects mode k for transportation in transportation arc (i,j), Set to 1, when passenger h does not select mode of transportation k in the transportation arc (i,j). Set to 0; c represents the transportation time (i.e., transportation time) taken using mode k within the transportation arc (i,j); t This represents the time a passenger spends on a single transfer (i.e., single transfer time).

[0123] It should be noted that the transportation time constraint means that for any passenger, after completing transportation and transfer operations in the transportation network, the time of leaving the transportation network must be earlier than the transportation time limit.

[0124] In specific implementations, such as Figure 4 As shown, Figure 4 This is a schematic diagram of the decomposition of a multi-level rail transit network three-dimensional transportation service model. The diagram shows different transportation routes from node a to node h, both those requiring transfers and those not requiring transfers. Where n 发 and n 到 For virtual sending point and virtual arrival point, This is the starting line for transportation to point a. Let h be the terminal line for the transport. For passenger transfer transportation arc, Let k be the transportation distance between node i and node j using transportation mode k. Let k be the unit transportation cost of transportation mode.

[0125] In the specific implementation, the planning and selection model is constructed as follows:

[0126]

[0127] In practical implementation, the virtual passenger routes determined based on the planning and selection model are as follows:

[0128]

[0129] It should be noted that the above planning and choice model can be solved using commercial solvers such as Gurobi and Cplex. Based on the demand characteristics of passenger transport and the supply characteristics of corridor transport, the final passenger transport choice scheme (i.e., virtual passenger transport planning route) is obtained.

[0130] The embodiment makes full use of the existing three-dimensional traffic transportation network, forms a traffic transportation route planning of linkage of multiple transportation modes by taking the replaceable station as a transportation mode replacement point in an intelligent planning manner, sets specific constraints in the planning process, so that the passenger route satisfies the uniqueness of the route, and at the same time satisfies the basic requirements of space and time of passenger transportation, so that the planned route has good realizability. Meanwhile, the transportation capacity constraint can make the transportation capacity of each transportation line fully utilized, so as to effectively balance the carrying capacity of various traffic transportation modes in the traffic transportation network, and fully exert the potential of the three-dimensional traffic transportation network.

[0131] It should be noted that the above examples are only used for understanding the present application and do not constitute a limitation on the passenger route planning method of the present application. More forms of simple transformation based on the technical concept are within the protection scope of the present application.

[0132] The present application also provides a passenger route planning device, please refer to Figure 5 , the passenger route planning device comprises:

[0133] The determination module 10 is configured to determine virtual transportation line information under different traffic modes from a virtual starting point to a virtual arrival point, and construct traffic layers under different traffic modes according to the virtual transportation line information;

[0134] The determination module 10 is also configured to determine virtual stations on the traffic layers, wherein the virtual stations are replaceable stations on the virtual transportation lines;

[0135] The generation module 20 is configured to generate virtual replaceable line information based on the virtual stations at the same position of different traffic layers;

[0136] The generation module 20 is also configured to generate a virtual transportation network according to the virtual transportation line information and the virtual replaceable line information;

[0137] The determination module 10 is also configured to determine a virtual passenger route under the virtual transportation network based on a planning selection model.

[0138] The passenger route planning device provided by the present application adopts the passenger route planning method in the above embodiment, which can solve the technical problem of low efficiency when the planning personnel plans the passenger route based on work inertia. Compared with the prior art, the beneficial effects of the passenger route planning device provided by the present application are the same as those of the passenger route planning method provided by the above embodiment, and the other technical features in the passenger route planning device are the same as those disclosed in the above embodiment method, which will not be repeated here.

[0139] The application provides a passenger route planning device, which comprises at least one processor and a memory connected with the at least one processor; the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the passenger route planning method in the above embodiments.

[0140] Reference will be made to the following description Figure 6 which shows a structural diagram of a passenger route planning device suitable for implementing the embodiments of the application. The passenger route planning device in the embodiments of the application can include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (for example, vehicle-mounted navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like. Figure 6 The passenger route planning device shown is only an example, and should not bring any limitation to the functions and use range of the embodiments of the application.

[0141] As Figure 5As shown, the passenger route planning device can include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.) that can perform various appropriate actions and processes according to programs stored in a read-only memory (ROM) 1002 or programs loaded from a storage device 1003 into a random access memory (RAM) 1004. In the RAM 1004, various programs and data required for operation of the xxx device are also stored. The processing device 1001, the ROM 1002, and the RAM 1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; the storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the passenger route planning device to communicate wirelessly or wired with other devices to exchange data. Although the passenger route planning device with various systems is shown in the figure, it should be understood that all the shown systems are not required to be implemented or possessed. More or less systems can be alternatively implemented or possessed.

[0142] In particular, according to the embodiments disclosed in the present application, the processes described above with reference to the flowcharts can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product comprising a computer program carried on a computer readable medium, the computer program containing program codes for executing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network through the communication device, or installed from the storage device 1003, or installed from the ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the methods of the embodiments disclosed in the present application are performed.

[0143] The passenger route planning device provided in the present application adopts the passenger route planning method in the above-mentioned embodiments, and can solve the technical problem of low efficiency when the planning personnel plans the passenger route based on work inertia. Compared with the prior art, the beneficial effects of the passenger route planning device provided in the present application are the same as those of the passenger route planning method provided in the above-mentioned embodiments, and other technical features in the passenger route planning device are the same as those disclosed in the previous embodiment method, which will not be repeated here.

[0144] It should be understood that various parts of the present application can be realized with hardware, software, firmware, or a combination thereof. In the above description of embodiments, specific functional configurations, structures, materials or characteristics can be combined in any appropriate manner in one or more embodiments or examples.

[0145] The above description is merely a specific implementation of the present application, but the scope of protection of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed in the present application, and all such changes or replacements should be covered within the scope of protection of the present application. Therefore, the scope of protection of the present application should be subject to the scope of protection of the claims.

[0146] The present application provides a computer readable storage medium having stored thereon computer readable program instructions (i.e., a computer program) for performing the passenger route planning method in the above-described embodiments.

[0147] The computer readable storage medium provided by the present application may, for example, be a U disk, but is not limited to an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, system, or device, or any combination thereof. More specific examples of the computer readable storage medium can include, but are not limited to, an electrical connection having one or more conductive wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any appropriate combination thereof. In the present embodiment, the computer readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system, or device. The program code contained on the computer readable storage medium can be transmitted in any appropriate medium, including but not limited to an electrical wire, an optical cable, an RF (Radio Frequency), etc., or any appropriate combination thereof.

[0148] The above computer readable storage medium can be contained in the passenger route planning device; or can exist separately without being assembled into the passenger route planning device.

[0149] The computer readable storage medium described above carries one or more programs, when the one or more programs are executed by the passenger route planning device, cause the passenger route planning device to: determine virtual transportation line information from a virtual departure point to a virtual arrival point under different transportation modes, and construct transportation layers under different transportation modes according to the virtual transportation line information; determine virtual stations on the transportation layers, wherein the virtual stations are transferable stations on the virtual transportation line; generate virtual transferable line information based on the virtual stations at the same position of different transportation layers; generate a virtual transportation network according to the virtual transportation line information and the virtual transferable line information; and determine a virtual passenger route under the virtual transportation network based on a planning selection model.

[0150] Computer program code for carrying out operations of the present application can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0151] The computer readable storage medium described above carries one or more programs, when the one or more programs are executed by the passenger route planning device, cause the passenger route planning device to: determine virtual transportation line information from a virtual departure point to a virtual arrival point under different transportation modes, and construct transportation layers under different transportation modes according to the virtual transportation line information; determine virtual stations on the transportation layers, wherein the virtual stations are transferable stations on the virtual transportation line; generate virtual transferable line information based on the virtual stations at the same position of different transportation layers; generate a virtual transportation network according to the virtual transportation line information and the virtual transferable line information; and determine a virtual passenger route under the virtual transportation network based on a planning selection model.

[0152] The modules described in the embodiments of the present application can be implemented in the form of software or in the form of hardware. In some cases, the name of the module does not constitute a limitation on the module itself.

[0153] The readable storage medium provided by the present application is a computer readable storage medium, which stores computer readable program instructions (i.e. computer programs) for executing the above-mentioned passenger route planning method, and can solve the technical problem of low efficiency when the planning personnel plans the passenger route based on work inertia. Compared with the prior art, the beneficial effects of the computer readable storage medium provided by the present application are the same as those of the passenger route planning method provided by the above-mentioned embodiments, and are not described here.

[0154] The above only describes some embodiments of the present application, and does not limit the patent scope of the present application. Any equivalent structural transformation, direct / indirect application in other related technical fields based on the technical concept of the present application, and the contents of the specification and drawings are included in the patent protection scope of the present application.

Claims

1. A method of passenger route planning, characterized by, The method comprises: determining virtual transportation line information under different traffic modes from a virtual departure point to a virtual arrival point, and constructing traffic layers under different traffic modes according to the virtual transportation line information; determining a virtual station on the traffic layer, wherein the virtual station is a transferable station on the virtual transportation line; generating virtual transferable line information based on the virtual stations of different traffic layers at the same position; generating a virtual transportation network according to the virtual transportation line information and the virtual transferable line information; determining a virtual passenger route under the virtual transportation network based on a planning selection model; The step of determining a virtual passenger route under the virtual transportation network based on a planning selection model comprises: determining a first traffic mode and a traffic change of a passenger on a transportation arc route based on the virtual transportation network, wherein the transportation arc route is a line from a target point in a preset area of a first service node to a second service node in the virtual transportation network; determining a transportation distance of the transportation arc route under the first traffic mode; determining a unit transportation cost of the first traffic mode, an occupied transportation space of the passenger, and a single transfer fee of the passenger; determining a direct transportation fare calculation relationship based on the first traffic mode, the unit transportation cost, the transportation distance, and the occupied transportation space; determining a transfer transportation fare calculation relationship according to the traffic change and the single transfer fee; determining a virtual passenger route under the virtual transportation network based on the direct transportation fare calculation relationship and the transfer transportation fare calculation relationship; The step of determining a virtual passenger route under the virtual transportation network based on the direct transportation fare calculation relationship and the transfer transportation fare calculation relationship comprises: generating a transportation cost equation based on the direct transportation fare calculation relationship and the transfer transportation fare calculation relationship; determining a constraint condition of the transportation cost equation, wherein the constraint condition comprises a transportation path constraint, a transportation capacity constraint, and a transportation time constraint; determining a lowest transportation cost passenger route in the virtual transportation network based on the transportation cost equation and decision analysis under the condition that the constraint condition is met, and determining the lowest transportation cost passenger route as a virtual passenger route.

2. The method of claim 1, wherein, The step of determining virtual transportation line information under different traffic modes from a virtual departure point to a virtual arrival point comprises: generating a passenger database according to position information of a rail transit line network, wherein the position information comprises station positions, line directions, transfer node positions, and coverage areas; determining virtual transportation line information under different traffic modes from a virtual departure point to a virtual arrival point based on the passenger database.

3. The method of claim 1, wherein, The constraint condition comprises a transportation path constraint; wherein the step of determining a constraint condition of the transportation cost equation comprises: determining a second traffic mode of a passenger on a virtual transportation arc route, wherein the virtual transportation arc route is a line from a first service node to a second service node in the virtual transportation network; determine a passenger batch, a passenger transportation demand set, a service network transportation and transfer arc path set, a service network virtual transportation arc path set, a service network transportation arc path set, and a service node transportation arc path set; determine a transportation path constraint of the transportation cost equation based on the first transportation mode, a transportation change condition, a second transportation mode, the passenger batch, the passenger transportation demand set, the service network transportation and transfer arc path set, the service network virtual transportation arc path set, the service network transportation arc path set, and the service node transportation arc path set.

4. The method of claim 1, wherein, The constraint condition includes a transportation capacity constraint; wherein the step of determining the constraint condition of the transportation cost equation includes: determine a transportation capacity of the passenger in the transportation arc path under the first transportation mode; determine a transportation capacity constraint of the transportation cost equation based on the first transportation mode, the transportation capacity, and the occupied transportation space.

5. The method of claim 1, wherein, The constraint condition includes a transportation time constraint; wherein the step of determining the constraint condition of the transportation cost equation includes: determine a transportation time of the passenger in the transportation arc path under the first transportation mode; determine an earliest transportation preparation completion time, a latest transportation process completion time, and a single transfer time of the passenger; determine a transportation time constraint of the transportation cost equation based on the first transportation mode, the transportation time, the earliest transportation preparation completion time, the latest transportation process completion time, and the single transfer time.

6. A passenger route planning device characterized by comprising: The device includes: a determination module configured to determine virtual transportation line information under different transportation modes from a virtual departure point to a virtual arrival point, and to construct a transportation layer under different transportation modes according to the virtual transportation line information; The determination module is further configured to determine a virtual station on the transportation layer, wherein the virtual station is a transferable station on the virtual transportation line; a generation module configured to generate virtual transferable line information based on the virtual stations at the same position of different transportation layers; The generation module is further configured to generate a virtual transportation network according to the virtual transportation line information and the virtual transferable line information; The determination module is further configured to determine a virtual passenger transportation route under the virtual transportation network based on a planning selection model; The determination module is further configured to: determine a first transportation mode and a transportation change condition of a passenger in a transportation arc path based on the virtual transportation network, wherein the transportation arc path is a line from a target point in a preset area of a first service node to a second service node in the virtual transportation network; determine a transportation distance of the transportation arc path under the first transportation mode; determine a unit transportation cost of the first transportation mode, an occupied transportation space of the passenger, and a single transfer fee of the passenger; determine a direct transportation fee calculation relationship based on the first transportation mode, the unit transportation cost, the transportation distance, and the occupied transportation space; determine a transfer transportation fee calculation relationship based on the transportation change condition and the single transfer fee; determine a virtual passenger transport route under the virtual transport network based on the direct transport fare calculation relationship and the transit transport fare calculation relationship; the determining module is further configured to: generate a transport cost equation based on the direct transport fare calculation relationship and the transit transport fare calculation relationship; determine a constraint condition of the transport cost equation, wherein the constraint condition comprises a transport path constraint, a transport capacity constraint, and a transport time constraint; determine a lowest transport cost passenger transport route in the virtual transport network based on the transport cost equation and decision analysis under the condition that the constraint condition is satisfied, and determine the lowest transport cost passenger transport route as the virtual passenger transport route.

7. A passenger route planning device characterized by comprising: The device comprises a memory, a processor, and a computer program stored on the memory and executable on the processor, and the computer program is configured to implement the steps of the passenger transport route planning method according to any one of claims 1 to 5.

8. A storage medium, characterized by The storage medium is a computer readable storage medium, and the storage medium stores a computer program, and the computer program is executed by the processor to implement the steps of the passenger transport route planning method according to any one of claims 1 to 5.

Images