Travel reservation method, electronic equipment, storage medium and computer program product

Abstract

The invention provides a travel reservation method, electronic equipment, a storage medium and a computer program product, and relates to the technical field of travel reservation. According to the travel reservation method disclosed by the invention, the space-time network about the reservation period is constructed according to the entity road network of the target area, the entity road network is used for describing the position information of each space node in the target area and the association relationship among the space nodes, and the space-time network is a set of space-time arcs. The space-time arc is a space-time resource which can be used for moving or staying; according to the space-time network and the reservation information set, a plurality of candidate travel schemes are iterated, and the candidate travel schemes are a set of candidate travel tables of travelers; and taking the candidate travel scheme corresponding to the minimum total travel cost as a target travel scheme, the total travel cost being used for measuring the comprehensive cost of the group time cost and the group time deviation cost of each traveler. The technical scheme disclosed by the invention can be suitable for a complex city scene with a large-scale road network.

Description

Technical Field

[0001] The present disclosure relates to the technical field of reserved travel, and particularly to a reserved travel method, an electronic device, a storage medium, and a computer program product. Background Art

[0002] Reserved travel is an important means to alleviate urban traffic congestion. This method realizes precise regulation of traffic flow through coordinated allocation of spatio-temporal resources, can transform disordered travel into ordered travel, effectively improve the traffic efficiency of road networks, shorten the waiting time of travelers, and provide technical support for building a sustainable traffic system.

[0003] However, the existing reserved travel methods have significant limitations: on the one hand, the existing methods mostly focus on scenarios such as rail transit and highways, and are not applicable to the group of urban private cars that need to travel in coordination with traffic lights; on the other hand, the existing models are limited by algorithm efficiency and data carrying capacity, and it is difficult to meet the real needs of urban-level complex road networks. Summary of the Invention

[0004] The present disclosure provides a reserved travel method, an electronic device, a storage medium, and a computer program product.

[0005] According to one aspect of the present disclosure, a reserved travel method is provided, including: constructing a spatio-temporal network regarding a reservation period according to the physical road network of a target area, where the physical road network is used to describe the position information of each spatial node in the target area and the association relationship between each spatial node, the spatio-temporal network is a set of spatio-temporal arcs, and the spatio-temporal arc is a spatio-temporal resource that can be used for movement or stay; iterating multiple candidate travel plans according to the spatio-temporal network and a set of reservation information, where the candidate travel plan is a set of candidate travel schedules of each traveler; and using the candidate travel plan corresponding to the minimum total travel cost as the target travel plan, where the total travel cost is used to measure the comprehensive cost of the group time cost and the group time deviation cost of each traveler.

[0006] In some embodiments, constructing a spatio-temporal network according to the physical road network of a target area includes: determining the running spatio-temporal arcs in the reservation period according to the connection relationship and pointing relationship between each spatial node in the physical road network, where the running spatio-temporal arc is a spatio-temporal resource that can be used for movement; determining the waiting spatio-temporal arcs in the reservation period according to the signal phase information of each spatial node in the physical road network, where the waiting spatio-temporal arc is a spatio-temporal resource that can be used for stay; and integrating the running spatio-temporal arcs and the waiting spatio-temporal arcs to obtain the spatio-temporal network.

[0007] In some embodiments, determining the running spatio-temporal arc in the reservation period includes: determining the road segment units between adjacent two of the spatial nodes according to the connection relationship and the pointing relationship between the spatial nodes in the entity road network; calculating the passing duration spent from the starting node to the ending node of the road segment unit at the agreed speed according to the length of the road segment unit; and determining the running spatio-temporal arc including the three-dimensional spatial coordinates of the starting node, the three-dimensional spatial coordinates of the ending node, the triggering moment, and the corresponding arrival moment, with the starting moment of the reservation period as the first triggering moment of the starting node and the sum of the first triggering moment and the passing duration as the first arrival moment of the ending node.

[0008] In some embodiments, determining the waiting spatio-temporal arc in the reservation period includes: determining the waiting duration at the spatial node according to the signal phase information corresponding to each of the spatial nodes; and determining the waiting spatio-temporal arc including the three-dimensional spatial coordinates of the spatial node, the waiting occurrence moment, and the corresponding waiting end moment, with the starting moment of the reservation period as the first waiting occurrence moment of the spatial node and the sum of the first waiting occurrence moment and the waiting duration as the first waiting end moment of the spatial node.

[0009] In some embodiments, after obtaining the spatio-temporal network, it further includes: determining the accommodation capacity of each of the spatial nodes according to the passing capacity parameters of each of the spatial nodes, where the accommodation capacity represents the maximum number of standard vehicles that can be carried at any moment; and determining the reservable quantity of the running spatio-temporal arc and the reservable quantity of the waiting spatio-temporal arc according to the accommodation capacity.

[0010] In some embodiments, according to the spatio-temporal network and the reservation information set, multiple candidate travel plans are iteratively generated, including: according to the departure locations, destination locations, departure time windows, and arrival time windows of the reservation information of each traveler in the reservation information set, in the spatio-temporal network, candidate schedules are assigned to each traveler to form the candidate travel plans, where the candidate schedule includes multiple spatio-temporal arcs involved in driving from the departure location to the destination location at any moment within the arrival time window at any moment within the departure time window; based on the traffic flow distribution model, according to the reservable quantities of each operating spatio-temporal arc, the reservable quantity of the waiting spatio-temporal arc, and the candidate travel plan, the traffic state of the target area during the reservation period is simulated; according to the traffic state, congested spatio-temporal arcs with assigned quantities exceeding the reservable quantity are determined, and abnormal candidate schedules where the usage order of any spatio-temporal arc does not meet the first constraint condition are determined; according to the reservation information set, the candidate schedules associated with the congested spatio-temporal arcs and the abnormal candidate schedules are adjusted to iteratively generate a new candidate travel plan including new candidate schedules; and in the case where the number of iterations exceeds the iteration threshold, multiple candidate travel plans are determined; or, if the difference in the total travel costs of the two candidate travel plans obtained in the last two iterations is less than the difference threshold, the multiple candidate travel plans are determined.

[0011] In some embodiments, before taking the candidate travel plan corresponding to the minimum total travel cost as the target travel plan, it further includes: determining the total travel cost of each candidate travel plan.

[0012] In some embodiments, determining the total travel cost of each candidate travel plan includes: calculating the group time cost of all the travelers according to the candidate travel plan; calculating the group time deviation cost of all the travelers according to the candidate travel plan; and performing a weighted sum of the group time cost and the group time deviation cost to obtain the total travel cost corresponding to the candidate travel plan.

[0013] In some embodiments, after taking the candidate travel plan corresponding to the minimum total travel cost as the target travel plan, it includes: assigning each target schedule in the target travel plan to the corresponding traveler; and comparing the difference part between the actual itinerary of the traveler and the target schedule, and marking the compliance status of the traveler according to the difference part.

[0014] According to another aspect of the present disclosure, an electronic device is provided, including: a memory that stores execution instructions; and a processor that executes the execution instructions stored in the memory, so that the processor executes the reservation travel method of any embodiment of the present disclosure.

[0015] According to another aspect of the present disclosure, there is provided a readable storage medium storing execution instructions, which when executed by a processor are used to implement the reservation travel method according to any embodiment of the present disclosure.

[0016] According to yet another aspect of the present disclosure, there is provided a computer program product including a computer program, which when executed by a processor implements the reservation travel method according to any embodiment of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] The drawings illustrate exemplary embodiments of the present disclosure and, together with the description thereof, are used to explain the principles of the present disclosure. These drawings are included to provide a further understanding of the present disclosure and are included in this specification and form a part of this specification.

[0018] Figure 1 It is a schematic diagram of an application scenario of the reservation travel method according to an embodiment of the present disclosure.

[0019] Figure 2 It is a flowchart of the reservation travel method according to an embodiment of the present disclosure.

[0020] Figure 3 It is a flowchart of the process for determining the target travel plan according to an embodiment of the present disclosure.

[0021] Figure 4 It is a schematic diagram of an intersection node according to an embodiment of the present disclosure.

[0022] Figure 5 is Figure 4 a phase schematic diagram of the intersection node in

[0023] Figure 6 It is a schematic block diagram of the structure of the reservation travel device according to an embodiment of the present disclosure.

[0024] Figure 7 It is a schematic block diagram of the structure of an electronic device according to an embodiment of the present disclosure. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0025] The present disclosure will be further described in detail below with reference to the drawings and examples. It can be understood that the specific examples described herein are only for explaining the relevant content and are not intended to limit the present disclosure. Additionally, it should be noted that for the sake of description, only parts related to the present disclosure are shown in the drawings.

[0026] It should be noted that, without conflict, the embodiments in the present disclosure and the features in the embodiments may be combined with each other. The technical solutions of the present disclosure will be described in detail below with reference to the drawings and in conjunction with the embodiments.

[0027] With the rapid growth of the number of cars in cities, traffic problems caused by motor vehicles, such as congestion, have become increasingly prominent. Especially during the morning and evening rush hours, the overly concentrated commuting demand will bring huge pressure to the road network. For example, in big cities like Beijing and Shanghai, once congestion occurs on the road, the traffic efficiency of the entire road network will be greatly reduced. To alleviate this urban traffic congestion, traditional methods mainly focus on increasing traffic infrastructure from the supply side, such as widening roads or building more highways.

[0028] As a new type of traffic organization model, reservation-based travel realizes the coordination of information and resources through reservation, transforms disorderly travel into orderly travel, effectively improves the traffic efficiency of the road network, shortens the queuing waiting time of travelers, and provides technical support for building a sustainable traffic system. However, there are significant limitations in existing reservation-based travel methods: on the one hand, existing research and applications mostly focus on scenarios such as rail transit and highways, and do not fully consider the needs of the urban private car group; on the other hand, existing models are limited by algorithm efficiency and data carrying capacity, and it is difficult to meet the real needs of urban-level complex road networks.

[0029] Therefore, the present disclosure proposes a reservation-based travel method.

[0030] Figure 1 It is a schematic diagram of the application scenario of the reservation-based travel method according to an embodiment of the present disclosure. As Figure 1 shown, in this application scenario, it may include a server 100 and a terminal device 200. The server 100 and the terminal device 200 can be connected through a network for data interaction. The server 100 can be a cloud server or a physical server, and the terminal device 200 can be an intelligent device such as a computer, a mobile phone, or a tablet. The server 100 can accept requests from the terminal device 200. For example, in this application, it can receive reservation information from travelers and run the reservation-based travel method of the present disclosure. In addition, the server 100 can provide reservation-related information to the terminal device 200.

[0031] Figure 2 It is a flowchart of the reservation-based travel method according to an embodiment of the present disclosure.

[0032] Refer to Figure 2, the present disclosure proposes a reservation travel method M200. By steps S210 to S230, the method M200 can simulate candidate travel plans by matching the spatio-temporal network with the reservation information set, so as to intuitively understand the traffic conditions that may be encountered when traveling according to these plans. Based on the simulation results, the candidate travel plans can be iteratively optimized until the final target travel plan is determined. Compared with the prior art, the target travel plan obtained by the present disclosure has high implementability and is applicable to complex urban scenarios with large-scale road networks. In addition, for private car users, the present disclosure takes into account fairness while ensuring travel efficiency, ensuring that various needs can be met.

[0033] Step S210, construct a spatio-temporal network regarding the reservation period according to the physical road network of the target area.

[0034] The target area can be a geographical area with significant reservation needs and a complex and large physical road network, such as an urban area. The target area usually has a high population density and a complex traffic network, such as main roads, secondary streets, public transportation lines, and various transportation hubs (such as subway stations, bus stops, railway stations, etc.). Within the target area, the traffic flow is highly concentrated, especially during the morning and evening rush hours, when various travel needs such as commuting, going to school, and business activities are intertwined, easily causing traffic congestion. Therefore, for the target area, it is particularly important to implement a reservation travel plan.

[0035] The physical road network is used to describe the position information of each spatial node in the target area and the association relationship between each spatial node. In the physical road network, the spatial node represents a position where the traffic flow can change, such as intersections, T-junctions, roundabouts, and transportation hubs. These nodes are not only turning points or intersections in the vehicle driving path but also important locations for traffic flow regulation.

[0036] The association relationship between each spatial node not only includes the physical connection relationship and pointing relationship but also covers traffic control information, such as signal phase information (i.e., the change cycle of traffic lights). The connection relationship refers to the actual connectivity of the roads between different nodes, while the pointing relationship defines the possible driving directions of vehicles at intersections. In addition, the signal phase information is crucial for understanding which directions of vehicle flows have the right of way at a specific time point, which directly affects the distribution and efficiency of traffic flow.

[0037] An intersection is the meeting point of two or more roads, usually equipped with traffic lights to manage and optimize the traffic flow in all directions. A T-junction is the junction of a main road and another smaller road, and its management method may be similar to that of an intersection. However, considering the different traffic flow directions, the signal phases are also different. A roundabout provides a continuous traffic environment, reducing the waiting time for parking, but reasonable entrance and exit controls are also required to avoid internal congestion.

[0038] The reservation period refers to a time span set when managing traffic reservations for a target area, which is used to plan and organize the time frame of all travel activities within this area. This period can be set flexibly, but usually, for the convenience of management and operation, a natural day is selected as the standard reservation period. For example, from 0:00 on the current day to 0:00 on the next day is regarded as a complete reservation period.

[0039] The spatio-temporal network is the result of combining the reservation period and the physical road network. It not only covers the nodes and paths in the physical space but also introduces the time dimension, enabling the full manifestation of the dynamic characteristics of traffic flow. The spatio-temporal network includes two types of spatio-temporal arcs: running spatio-temporal arcs and waiting spatio-temporal arcs.

[0040] A running spatio-temporal arc describes the spatio-temporal resources that can be used for movement. A running spatio-temporal arc can be represented as (i, j, t1, t2), where i is the three-dimensional spatial coordinates of the starting node in this running spatio-temporal arc, j is the three-dimensional spatial coordinates of the ending node, t1 represents the triggering moment of the starting node, and t2 represents the arrival moment at the ending node. The arrival moment should be the result of pushing the triggering moment forward by the passing duration, and the passing duration is the time length spent from the starting node to the ending node at the agreed speed.

[0041] A waiting spatio-temporal arc describes the spatio-temporal resources that can be used for staying. A waiting spatio-temporal arc can be represented as (i, i, t3, t4), where i is the three-dimensional spatial coordinates of the spatial node used for staying in this waiting spatio-temporal arc, t3 is the waiting start moment, and t4 is the waiting end moment. The waiting end moment is the result of pushing the waiting start moment forward by the waiting duration. It should be noted that for the same spatial node i, different types of spatio-temporal arcs can be formed at different times. For example, it is a running spatio-temporal arc from t1 to t2 and a waiting spatio-temporal arc from t3 to t4, which is mainly related to the position of the spatial node, the signal phase information involved, etc.

[0042] These spatio-temporal arcs are calculated starting from the first moment of the reservation period, i.e., the starting point of the reservation period (e.g., 0:00 am). In this way, the entire reservation period is subdivided into multiple specific spatio-temporal arcs, each corresponding to a specific time period and spatial location. This discretization method of time and space not only facilitates system management and optimized scheduling but also enables more accurate matching of travel demands and transportation resources. Specifically, for any spatial node, the first moment of the reservation period is used as its first trigger moment and / or the first waiting occurrence moment.

[0043] For each traveler, their itinerary consists of a series of spatio-temporal arcs that are continuous in time and space. This means that each departure (running spatio-temporal arc) and stay (waiting spatio-temporal arc) are closely connected and seamlessly docked. Such a design ensures that each traveler's itinerary plan not only conforms to the actual traffic conditions but also maximally utilizes the limited road resources, reducing unnecessary waiting and congestion.

[0044] Step S220, based on the spatio-temporal network and the reservation information set, iteratively generate multiple candidate travel plans.

[0045] The reservation information set is the set of all reservation information in the target area. Before the start of the reservation period, a reservation time period is set. During the reservation time period, travelers are allowed to submit reservation requests and provide reservation information. The reservation information includes at least the traveler's departure location, destination, departure time window, and arrival time window. The departure time window contains the time period during which the traveler can accept leaving the departure location, and the arrival time window contains the time period during which the traveler can accept arriving at the destination.

[0046] The candidate travel plan includes a candidate itinerary schedule assigned to each traveler. The candidate itinerary schedule includes multiple spatio-temporal arcs involved in traveling from the departure location to the destination at any moment within the arrival time window at any moment within the departure time window.

[0047] Based on the total time spent by all travelers from the departure location to the destination, and the total time deviation between the assigned travel duration and the shortest travel duration for each traveler, the total travel cost of the candidate travel plan can be determined. The total travel cost takes into account the group efficiency and fairness of reservation-based travel.

[0048] Of course, when determining the travel plan, there should also be some constraints. For example: through reservation, there should be no or reduced congestion points; the traveler who first uses a spatio-temporal arc should also be the first to finish using it (i.e., first in, first out); the assigned travel plan should conform to the reservation information of each traveler, etc. Additionally, the constraints are not limited to the foregoing and all fall within the protection scope of this disclosure.

[0049] Therefore, in the minimization of the total travel cost and the limitation of the constraint conditions, multiple candidate travel plans are gradually iterated. Theoretically, the total travel cost of the latest iterated candidate travel plan is the lowest and gradually meets the aforementioned constraint conditions.

[0050] When the difference in the total travel costs of the latest two candidate travel plans is less than the difference threshold, the iteration of the candidate travel plans is terminated; or, when the number of iterations exceeds the number threshold, the iteration of the candidate travel plans is terminated.

[0051] Step S230: Use the candidate travel plan corresponding to the minimum total travel cost as the target travel plan.

[0052] In the present disclosure, the total travel cost of the candidate travel plan is the result of the weighted summation of the group time cost and the group time deviation cost. Therefore, using the candidate travel plan corresponding to the minimum total travel cost as the target travel plan is the optimal plan that takes into account both group efficiency and group fairness.

[0053] Specifically, while iterating the candidate travel plans, the total travel cost of the candidate travel plans should be calculated in real time. Further, compare the total travel costs of the latest candidate travel plan and the existing candidate travel plans in real time, and mark the candidate travel plan corresponding to the minimum total travel cost.

[0054] As the candidate travel plans are iterated, observe the change in the total travel cost. If, after a certain number of iterations, the total travel cost of the new candidate travel plan gradually increases, use the candidate travel plan corresponding to the currently marked minimum total travel cost as the target travel plan. If the total travel cost of the new candidate travel plan gradually decreases, use the latest candidate travel plan as the target travel plan.

[0055] Figure 3 It is a flowchart of the target travel plan determination process according to the embodiment of the present disclosure. The following combines Figure 3 to illustrate the entire reservation process.

[0056] In step S301, a spatio-temporal network is constructed.

[0057] Road information of the target area can be obtained through map data sources such as OSM (OpenStreetMap, open street map), including the positions of spatial nodes in the road, and traffic capacity parameters such as road length and width. First, clean the irrelevant data in map data sources such as OSM, and extract spatial node and section data. The spatial nodes include three-dimensional position coordinates and node identifiers; the section data represents the pointing and connection relationships between spatial nodes, and the section data includes information such as the identifier of the starting spatial node and the identifier of the ending spatial node of the section, section type, and traffic capacity parameters.

[0058] An entity network is formed based on spatial node and road segment data. For the spatial nodes with signal lights in the entity network, the present disclosure derives multiple signal nodes according to the phase signal information of the signal lights, and each signal node corresponds to a unique spatial node respectively. According to the signal lights, when the signal node corresponding to a certain phase has the right of way, vehicles can pass between the spatial nodes bound by the signal node.

[0059] Figure 4 It is a schematic diagram of an intersection node according to an embodiment of the present disclosure. As Figure 4 shown, it shows the relationship between the spatial nodes and signal nodes of the "crossroads" with signal lights, and the pointing relationship of each spatial node under the action of the signal nodes.

[0060] It can be seen that the "crossroads" includes spatial nodes m1, m2, i1, i2, n1, n2, j1, and j2, and the aforementioned spatial nodes are the physical nodes of the crossroads. The signal nodes of the "crossroads" include: signal node k1 corresponding to spatial node m1, signal node k2 corresponding to spatial node m2, signal node k3 corresponding to spatial node i2, signal node k4 corresponding to spatial node i1, signal node k5 corresponding to spatial node n2, signal node k6 corresponding to spatial node n1, signal node k7 corresponding to spatial node j2, and signal node k8 corresponding to spatial node j1.

[0061] The aforementioned spatial nodes are physically connected to each other. In principle, they can respectively form an operating space-time arc to support movement. However, the urban area is different from the highway network, and most intersections have signal lights. These signal lights control the traffic flow of the intersection through different phases to ensure that vehicles in all directions can pass in an orderly manner according to the established rules. The dotted lines in the figure are the directions and routes that can be traveled from each spatial node according to traffic rules. For example, when the phase from spatial node i2 to spatial node j1 is indicated green by the signal light, travelers can go straight from spatial node i2 to spatial node j1. However, no matter what phase, it is not allowed to drive from spatial node i2 to j2 to ensure the one-way traffic principle of different lanes.

[0062] The signal phase information includes the traffic flow directions allowed during the same period and the duration of each flow direction. A phase refers to the period during which the signal indicator maintains the same display state (such as green) for a certain time, and one or more traffic flow directions (such as straight and left turns) are allowed during this period. Multiple phases constitute the change cycle of the signal indicator. During the change cycle, the signal indicator cyclically switches different colors (such as red, yellow, and green) according to a predetermined time sequence, and vehicle flows in different directions will obtain the right of way in turn. Usually, after a phase ends, there is a short transition period (such as a flashing yellow light), during which road users can obtain the upcoming traffic instructions and then enter the next phase. This orderly phase conversion ensures the safety and efficiency of intersection traffic.

[0063] Different intersections have different numbers of signal indicators and corresponding signal phase information. For example, in some intersections, going straight and turning left are grouped into one phase, while in other intersections, going straight and turning left are separate phases. Moreover, the durations of different phases at different intersections are also different. Therefore, when determining the operating space-time arcs and waiting space-time arcs, the signal phase information of different spatial nodes needs to be considered.

[0064] Figure 5 is Figure 4 The schematic diagram of the phases of the intersection node in

[0065] In Figure 5 In Figure a of , according to the signal phase information, during the periods when the signal node k4 has the right of way to the signal nodes k7 and k2 respectively, and when the signal node k3 has the right of way to the signal nodes k6 and k8 respectively, vehicles can go straight from the spatial node j2 to the spatial node i1 or turn left to the spatial node m2; at the same time, vehicles can go straight from the spatial node i2 to the spatial node j1 or turn left to the spatial node n1.

[0066] In Figure 5 In Figure b of , according to the signal phase information, during the periods when the signal node k3 has the right of way to the signal node k2 and when the signal node k8 has the right of way to the signal node k6, vehicles can turn right from the spatial node i2 to the spatial node m2, and vehicles can turn right from the spatial node j1 to the spatial node n1.

[0067] In Figure 5 In Figure c of , according to the signal phase information, during the periods when the signal node k1 has the right of way to the signal node k6 and when the signal node k5 has the right of way to the signal node k2, vehicles can go straight from the spatial node m1 to the spatial node n1, and vehicles can go straight from the spatial node n2 to the spatial node m2.

[0068] In Figure 5In d, according to the signal phase information, during the time period when the vehicle has the right of way from signal node k5 to signal node k4, and during the time period when the vehicle has the right of way from signal node k1 to signal node k8, the vehicle can turn left from space node n2 to space node i1, and the vehicle can turn left from space node m1 to space node j1.

[0069] In addition, the capacity Ci of the space node = C0 × α1, where C0 is the theoretical traffic capacity parameter of the space node, and α1 represents the width loss coefficient of the space node.

[0070] Based on the capacity of the space node, for the space node with a signal indicator light, its capacity should be the maximum number of vehicles driving towards this space node per unit time during the effective green light, that is, the saturation flow rate Si. Si = S0 × α2, S0 is the theoretical traffic capacity parameter of the space node with a signal indicator light, and α2 represents the width loss coefficient of this space node.

[0071] In other words, according to the traffic capacity parameters of each space node, determine the capacity of each space node. The capacity represents the maximum number of standard vehicles that can be carried at any moment. Further, according to the capacity, determine the reservable quantity of the operating space arc and the reservable quantity of the waiting space arc.

[0072] The waiting space arc includes a starting point waiting space arc, a signal node waiting space arc, a road section node waiting space arc, and an end point waiting space arc according to the waiting type.

[0073] The capacity of the waiting space arc is the queuing capacity of the road section space associated with the space node, that is , where is the capacity of the waiting space arc (I, j, t, t + △t), is the length from space node i to space node j, is the body length of the standard vehicle, and h is the minimum headway between adjacent vehicles.

[0074] In step S302, obtain the reservation information set. The reservation information set includes information such as the departure place, destination, departure time window, arrival time window, etc. of the reservation information of each traveler.

[0075] In step S303, determine the candidate travel plan.

[0076] The first candidate travel plan can be the result of randomly matching the reservation information set with the spatio-temporal network. The candidate travel plan includes the candidate itinerary tables of each traveler. Each candidate itinerary table is a plurality of space-time arcs that can leave the departure place at any moment within the reserved departure time window and reach the destination at any moment within the arrival time window, including waiting space arcs and operating space arcs.

[0077] Further, in step S304, the candidate travel plans are simulated according to the traffic flow distribution model to determine the traffic status of the target area during the reservation period.

[0078] The simulation of the candidate travel plans is essentially to analyze whether the current candidate travel plans can meet various constraint conditions and the total travel cost of the plans.

[0079] The first constraint condition can be that the traveler who first uses a spatio-temporal arc should finish using it first. That is, at any moment, the vehicle waiting in line for a spatio-temporal arc will leave the spatial node first, or the vehicle that first enters the starting node of a running spatio-temporal arc will leave the corresponding ending node first.

[0080] The way to determine whether the candidate travel plan meets the first constraint condition is to judge whether the vehicles that use the spatio-temporal arc after the triggering moment or the waiting start moment of the current vehicle for a certain spatio-temporal arc all finish using the spatio-temporal arc after the arrival moment or the waiting end moment of the current vehicle. Traverse the candidate schedules of all travelers and screen out the abnormal candidate schedules whose usage order of any spatio-temporal arc does not meet the first constraint condition.

[0081] The second constraint condition can be: when generating the candidate travel plans, it should be ensured that the vehicle allocation quantity of each spatio-temporal arc is less than or equal to the reservable quantity allowed by the spatio-temporal arc. If the allocation quantity exceeds the reservable quantity, it means that when passing according to the candidate travel plan, the number of passing vehicles exceeds the accommodation capacity of the spatial node of the corresponding spatio-temporal arc, which will cause congestion problems.

[0082] The way to determine whether each candidate schedule in the candidate travel plan meets the second constraint condition is: count the allocation quantity of each spatio-temporal arc in the candidate travel plan, and compare the allocation quantity with the reservable quantity; when the allocation quantity is less than or equal to the reservable quantity, it means that there will be no congestion at this spatio-temporal arc; on the contrary, if the allocation quantity is greater than the reservable quantity, it means that there will be congestion at this spatio-temporal arc, and this spatio-temporal arc is a congested spatio-temporal arc. At this time, the candidate schedule corresponding to this congested spatio-temporal arc does not meet the second constraint condition.

[0083] The third constraint condition can be: for each candidate schedule of the candidate travel plan, it should be able to meet the continuity in the time dimension and the continuity in the space dimension.

[0084] The fourth constraint condition can be: for each candidate schedule of the candidate travel plan, the waiting start moment or the triggering moment for the spatial node (the spatial node for waiting or the starting node) with the departure place as the spatio-temporal arc in the candidate schedule should be any moment within the departure time window.

[0085] The way to determine whether the fourth constraint condition is satisfied can be: to determine whether the waiting start time or the triggering time of the spatial node with the departure place as the spatio-temporal arc falls within the departure time window of the traveler.

[0086] The total travel cost of determining a candidate travel plan can be: according to the candidate travel plan, calculate the group time cost of all travelers; according to the candidate travel plan, calculate the group time deviation cost of all travelers; and perform a weighted sum of the group time cost and the group time deviation cost to obtain the total travel cost corresponding to the candidate travel plan.

[0087] Group time cost 。

[0088] Among them, (i, j, t, s) represents a moving spatio-temporal arc, that is, starting from spatial node i at time t and arriving at spatial node j at time t. E is the spatio-temporal network; represents the identifier of the traveler, and A is the set of identifiers of all travelers in the reservation information set. represents the traveler 's spatio-temporal arc decision variable, which is the occupancy mapping of the traveler to the operating spatio-temporal arc. If the spatio-temporal arc (i, j, t, s) exists in the path selected by the traveler , the value is 1, otherwise it is 0. represents the traveler 's time cost of occupying the spatio-temporal arc (i, j, t, s).

[0089] Group time deviation cost: 。

[0090] Among them, represents the traveler 's decision variable for choosing the departure time t and the travel path p. When the traveler uses t as the departure time and p as the travel path , it is 1, otherwise it is 0. is the time-varying path cost for the traveler to choose the departure time t and the travel path p, represents the traveler 's travel plan with the minimum travel cost in the feasible travel plan, represents the traveler 's set of paths that can be selected from the departure place to the destination.

[0091] To balance the group deviation cost and the group time cost, the total travel cost: Z = γ +Ω 。Among them, γ is the group time cost The weight, where Ω is the group time deviation cost The weight.

[0092] In step S305, determine the congested spatio-temporal arcs and the abnormal candidate travel schedules.

[0093] Specifically, based on the traffic flow assignment model, according to the reservable volume of each operating spatio-temporal arc, the reservable volume of the waiting spatio-temporal arc, and the candidate travel plans, simulate the traffic state of the target area during the reservation period. The traffic state includes the satisfaction of the above various constraint conditions by the candidate travel plans. Then, according to the traffic state, determine the congested spatio-temporal arcs where the assigned volume exceeds the reservable volume, and the abnormal candidate travel schedules where the usage order of any spatio-temporal arc does not conform to the first constraint condition.

[0094] Furthermore, execute step S306 to iterate on the candidate travel schedules corresponding to the congested spatio-temporal arcs and the abnormal candidate travel schedules to obtain a new candidate travel plan.

[0095] This process aims to relieve traffic pressure and avoid potential congestion points by adjusting the departure time of travelers, spatio-temporal arcs, or a combination of both. Specifically, for each candidate travel plan involving congested spatio-temporal arcs, the traffic flow assignment model will evaluate based on real-time traffic data and historical patterns and generate new alternative spatio-temporal arcs to reduce the impact of congestion. At the same time, any candidate travel schedules marked as abnormal will also undergo similar iterative optimization to ensure that each traveler can follow the first-in, first-out principle, guarantee the travel order, and avoid queue-jumping.

[0096] Of course, when the traffic flow assignment model generates candidate travel plans, it should iterate based on the principle of minimizing the total time cost.

[0097] In step S307, determine whether the difference in the total travel costs of the latest two candidate travel plans is less than the difference threshold. If the difference in the total travel costs of the latest two candidate travel plans is infinitesimal, even less than the difference threshold, it means that there is little need to iterate on the new candidate travel plans. The iteration can be ended, and step S309 can be executed to use the candidate travel plan with the minimum total travel cost as the target travel plan.

[0098] Conversely, execute step S308 to determine whether the number of iterations exceeds the iteration threshold. If the number of iterations is large enough, even exceeding the iteration threshold, the iteration can be stopped to avoid wasting resources caused by unlimited iteration. Furthermore, execute step S309.

[0099] Otherwise, continuously execute steps S306 to S308 until the iteration ends.

[0100] Further, step S310 is executed to allocate the target travel plan to each traveler, and then the performance verification of each traveler is performed, that is, the difference between the actual itinerary of the traveler and the target itinerary is compared, and the performance status of the traveler is marked according to the difference part.

[0101] It can be to increase the reservation priority of travelers with high-precision performance, or to decrease the reservation priority of travelers who do not perform or partially perform. Of course, there can also be other ways of marking the performance status and rewards and punishments, which are not limited here.

[0102] The method of the present disclosure alleviates the problem of traffic congestion through reservation. Moreover, considering the complex road conditions with signal lights in the urban scenario, the waiting space-time arc is proposed, making the reservation travel feasible in the complex road network of the city.

[0103] Figure 6 It is a structural schematic block diagram of a reservation travel device according to an embodiment of the present disclosure. As Figure 6 shown, a reservation travel device 600 is proposed, including: a construction module 610 for constructing a space-time network regarding a reservation period according to the physical road network of the target area, where the physical road network is used to describe the position information of each spatial node in the target area and the association relationship between each spatial node, the space-time network is a set of space-time arcs, and the space-time arc is a space-time resource that can be used for movement or stay; a simulation module 620 for iteratively generating a variety of candidate travel plans according to the space-time network and the reservation information set, where the candidate travel plan is a set of candidate itinerary tables of each traveler; and a plan determination module 630 for using the candidate travel plan corresponding to the minimum total travel cost as the target travel plan, where the total travel cost is used to measure the comprehensive cost of the group time cost and the group time deviation cost of each traveler.

[0104] The reservation travel device 600 of the present disclosure can be in the form of computer software, and each module of the reservation travel device 600 can be in the form of a computer software module.

[0105] Each module of the reservation travel device 600 of the present disclosure is set to implement each step of the reservation travel method, and its execution principle and steps can be referred to the foregoing, and will not be elaborated here.

[0106] Figure 7 It is a structural schematic block diagram of an electronic device according to an embodiment of the present disclosure. As Figure 7 shown, the present disclosure also provides an electronic device 1000, including: a processor 1200 and a memory 1300, where the memory 1300 stores execution instructions; the processor 1200 executes the execution instructions stored in the memory 1300, so that the processor 1200 executes the reservation travel method.

[0107] The hardware structure of the electronic device 1000 can be implemented using a bus architecture. The bus architecture can include any number of interconnecting buses and bridges, depending on the specific application of the hardware and overall design constraints. The bus 1100 connects various circuits including one or more processors 1200, a memory 1300, and / or hardware modules together. The bus 1100 can also connect various other circuits 1400 such as peripheral devices, voltage regulators, power management circuits, external antennas, etc.

[0108] The bus 1100 can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Component (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one connecting line is shown in this figure, but it does not mean that there is only one bus or one type of bus.

[0109] The present disclosure also provides a readable storage medium. A computer program is stored in the readable storage medium, and when the computer program is executed by a processor, it is used to implement the above-mentioned method. The "readable storage medium" can be any device that can contain, store, communicate, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. More specific examples of the readable storage medium include the following: an electrical connection part (electronic device) having one or more wirings, a portable computer disk cartridge (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable read-only memory (CDROM), etc.

[0110] The present disclosure also provides a computer program product. The method of the present disclosure can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed, the processes or functions of the present disclosure are executed in whole or in part.

[0111] Computer programs or instructions can be stored in a readable storage medium or transmitted from one readable storage medium to another. For example, the computer programs or instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center in a wired or wireless manner. The readable storage medium can be any available medium that can be accessed or a data storage device such as a server or data center integrating one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be a volatile or non-volatile storage medium, or can include both volatile and non-volatile types of storage media.

[0112] Those skilled in the art should understand that the embodiments of the present disclosure can be provided as a method, an electronic device, a readable storage medium, or a computer program product. Therefore, the present disclosure can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present disclosure can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0113] The present disclosure is described with reference to the flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to the present disclosure. It should be understood that each flow and / or block in the flowchart and / or block diagram, and the combination of flows and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, such that the instructions executed by the processor of the computer or other programmable data processing devices generate a device for implementing the functions specified in Figure 1 one or more flows Figure 1 or multiple flows and / or blocks.

[0114] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, such that the instructions stored in the computer-readable memory generate a manufactured article including an instruction device that implements the functions specified in Figure 1 one or more flows Figure 1 or multiple flows and / or blocks.

[0115] These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operation steps are executed on the computer or other programmable device to generate a computer-implemented process, and thus the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one process Figure 1 one process or multiple processes and / or blocks Figure 1 steps of the functions specified in one block or multiple blocks.

[0116] In the description of this specification, the descriptions referring to terms such as "one embodiment / way", "some embodiments / ways", "example", "specific example", or "some examples", etc. mean that the specific features, structures, or characteristics described in connection with the embodiment / way or example are included in at least one embodiment / way or example of the present disclosure. In this specification, the schematic expressions of the above terms do not necessarily refer to the same embodiment / way or example. Moreover, the specific features, structures, or characteristics described can be combined in a suitable manner in any one or more embodiments / ways or examples. In addition, without contradiction, those skilled in the art can combine and combine the different embodiments / ways or examples described in this specification and the features of different embodiments / ways or examples.

[0117] In addition, the terms "first" and "second" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" can explicitly or implicitly include at least one of these features. In the description of the present disclosure, the meaning of "a plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0118] Those skilled in the art should understand that the above embodiments are only for clearly explaining the present disclosure and are not intended to limit the scope of the present disclosure. For those skilled in the art, other changes or modifications can be made on the basis of the above disclosure, and these changes or modifications are still within the scope of the present disclosure.

[0119] It can be understood that before using the technical solutions disclosed in the various embodiments of the present disclosure, the types, usage scopes, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0120] For example, when responding to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested by the user will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application program, server, or storage medium that executes the operations of the technical solutions of the present disclosure according to the prompt message.

[0121] As an optional but non-limiting implementation manner, in response to receiving an active request from a user, the manner of sending a prompt message to the user may be, for example, in the form of a pop-up window, and the prompt message may be presented in text in the pop-up window. In addition, the pop-up window may also carry a selection control for the user to select "agree" or "disagree" to provide personal information to the electronic device.

[0122] It can be understood that the above notification and the process of obtaining user authorization are only illustrative and do not constitute a limitation on the implementation manner of the present disclosure. Other manners that comply with relevant laws and regulations can also be applied to the implementation manner of the present disclosure.

[0123] Meanwhile, it can be understood that the data involved in the technical solution of the present disclosure (including but not limited to the data itself, the acquisition or use of the data) should comply with the requirements of the corresponding laws, regulations and related provisions.

Claims

1. A method for reserved travel, characterized in that, Including: Construct a spatio-temporal network regarding the reservation period according to the physical road network of the target area, where the physical road network is used to describe the position information of each spatial node in the target area and the association relationship between each spatial node, the spatio-temporal network is a set of spatio-temporal arcs, and the spatio-temporal arc is a spatio-temporal resource that can be used for movement or stay; Iterate multiple candidate travel plans according to the spatio-temporal network and the reservation information set, where the candidate travel plan is a set of candidate schedules of each traveler; And Take the candidate travel plan corresponding to the minimum total travel cost as the target travel plan, where the total travel cost is used to measure the comprehensive cost of the group time cost and the group time deviation cost of each traveler.

2. The reservation travel method according to claim 1, wherein Construct a spatio-temporal network according to the physical road network of the target area, including: Determine the running spatio-temporal arcs in the reservation period according to the connection relationship and pointing relationship between each spatial node in the physical road network, where the running spatio-temporal arc is a spatio-temporal resource that can be used for movement; Determine the waiting spatio-temporal arcs in the reservation period according to the signal phase information of each spatial node, where the waiting spatio-temporal arc is a spatio-temporal resource that can be used for stay; and Integrate the running spatio-temporal arcs and the waiting spatio-temporal arcs to obtain the spatio-temporal network.

3. The reservation travel method according to claim 2, wherein Determine the running spatio-temporal arcs in the reservation period, including: Determine the road segment units between two adjacent spatial nodes according to the connection relationship and pointing relationship between each spatial node in the physical road network; Calculate the passing duration spent from the starting node to the ending node of the road segment unit at the agreed speed according to the length of the road segment unit; and Taking the starting moment of the reservation period as the first trigger moment of the starting node, and taking the sum of the first trigger moment and the passing duration as the first arrival moment of the ending node, determine the running spatio-temporal arc including the three-dimensional spatial coordinates of the starting node, the three-dimensional spatial coordinates of the ending node, the trigger moment, and the corresponding arrival moment.

4. The appointment travel method according to claim 2, wherein Determine the waiting spatio-temporal arcs in the reservation period, including: Determine the waiting duration at the spatial node according to the signal phase information corresponding to each spatial node; and Taking the starting moment of the reservation period as the first waiting occurrence moment of the spatial node, and taking the sum of the first waiting occurrence moment and the waiting duration as the first waiting end moment, determine the waiting spatio-temporal arc including the three-dimensional spatial coordinates of the spatial node, the waiting occurrence moment, and the corresponding waiting end moment.

5. The reservation travel method according to claim 2, wherein After obtaining the spatio-temporal network, it further includes: Determine the accommodation capacity of each spatial node according to the passing capacity parameter of each spatial node, where the accommodation capacity represents the maximum carrying quantity of standard vehicles at any moment; and Determine the reservable quantity of the running spatio-temporal arc and the reservable quantity of the waiting spatio-temporal arc according to the accommodation capacity.

6. The reservation travel method according to claim 2, wherein Iterate multiple candidate travel plans according to the spatio-temporal network and the reservation information set, including: According to the departure locations, destination locations, departure time windows, and arrival time windows of the reservation information of each traveler in the reservation information set, in the spatio-temporal network, allocate a candidate itinerary for each traveler to form the candidate travel plan. The candidate itinerary includes multiple spatio-temporal arcs involved in driving from the departure location to the destination location at any moment within the arrival time window at any moment within the departure time window. Based on the traffic flow allocation model, simulate the traffic state of the target area during the reservation period according to the reservable quantity of each operating spatio-temporal arc, the reservable quantity of the waiting spatio-temporal arc, and the candidate travel plan. According to the traffic state, determine the congested spatio-temporal arcs where the allocated quantity exceeds the reservable quantity, and the abnormal candidate itineraries where the usage order of any spatio-temporal arc does not conform to the first constraint condition. According to the reservation information set, adjust the candidate itineraries associated with the congested spatio-temporal arcs and the abnormal candidate itineraries, and iterate to obtain a new candidate travel plan including new candidate itineraries; and In the case where the number of iterations exceeds the iteration threshold, determine multiple candidate travel plans; or, if the difference in the total travel costs of the two candidate travel plans obtained in the last two iterations is less than the difference threshold, determine the multiple candidate travel plans.

7. The appointment travel method according to claim 1, wherein Before taking the candidate travel plan corresponding to the minimum total travel cost as the target travel plan, it further includes: determining the total travel cost of each candidate travel plan.

8. The appointment travel method according to claim 7, wherein Determining the total travel cost of each candidate travel plan includes: Calculating the group time cost of all travelers according to the candidate travel plan; Calculating the group time deviation cost of all travelers according to the candidate travel plan; and Performing a weighted sum of the group time cost and the group time deviation cost to obtain the total travel cost corresponding to the candidate travel plan.

9. The appointment travel method according to claim 1, wherein After taking the candidate travel plan corresponding to the minimum total travel cost as the target travel plan, it includes: Allocating each target itinerary in the target travel plan to the corresponding traveler; and Comparing the difference between the actual itinerary of the traveler and the target itinerary, and marking the compliance status of the traveler according to the difference.

10. An electronic device, characterized in that, It includes: A memory that stores execution instructions; And A processor that executes the execution instructions stored in the memory, such that the processor executes the reservation travel method according to any one of claims 1 to 9.

11. A readable storage medium, characterized in that, The readable storage medium stores execution instructions, and when the execution instructions are executed by a processor, they are used to implement the reservation travel method according to any one of claims 1 to 9.

12. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the reservation travel method according to any one of claims 1 to 9.

Images