WO2019056875A1

WO2019056875A1 - Ridesharing route planning method, client, server and system

Info

Publication number: WO2019056875A1
Application number: PCT/CN2018/098642
Authority: WO
Inventors: 夏一平; 尹大飞; 杨毓杰; 朱家辉
Original assignee: 北京摩拜科技有限公司
Priority date: 2017-09-20
Filing date: 2018-08-03
Publication date: 2019-03-28
Also published as: CN107679652A; CN107679652B

Abstract

A ridesharing route planning method, a client, a server and a system. The method comprises: obtaining traffic geographic information and travel parameters of each ridesharing passenger (S2100); selecting corresponding candidate start points according to departure locations of the plurality of ridesharing passengers, and obtaining a candidate start point set comprising the plurality of candidate start points (S2200); constructing a plurality of candidate ridesharing routes according to the traffic geographic information, the travel parameters of the ridesharing passengers and the candidate start point set, and calculating a travel cost of each candidate ridesharing route (S2300); selecting the candidate ridesharing route having the lowest travel cost as a ridesharing route, providing the corresponding ridesharing route to the plurality of ridesharing passengers, and triggering each ridesharing passenger to participate in ridesharing travel via a ridesharing communication device (S2400). The present invention minimises the travel costs for all the ridesharing passengers, and increases the ridesharing travel efficiency.

Description

Planning method, client, server and system for shared route

Technical field

The present invention relates to the field of traffic planning technology, and more particularly to a method, device and system for planning a shared route.

Background technique

With the development of Internet technology, people's travel modes are increasing. For example, through related vehicle service applications, real-time calls or reservations for vehicles can be made through the Internet, such as calling a private car, express train, taxi, minibus, and the like.

However, when people travel by car, express train, etc., they usually choose to pick up the car at their current location and wait for the vehicle to pick up. However, due to the randomness of the user's pick-up point, in the area with poor road conditions or during the peak traffic period, in order to reach the user's boarding point, the vehicle is easily caught in a congested state due to a turn or a U-turn, and it takes a long time to arrive. On the train, the user waits for a longer time, which greatly affects the user experience. At the same time, the driver's order is also less efficient.

Therefore, the inventors believe that it is necessary to improve the problems existing in the above prior art.

Summary of the invention

It is an object of the present invention to provide a new technical solution for planning a shared route.

According to a first aspect of the present invention, a method for planning a shared route is provided for planning a shared route for a plurality of commutators traveling through a shared transportation device, including:

Obtaining traffic geographic information and travel parameters of each of the commutators

The traffic geographic information includes at least a traffic map, and the travel parameters include at least a shared identity, a departure place, and a destination of the shared passenger;

Selecting a corresponding candidate starting point according to the departure place of the plurality of co-occupants, and obtaining a candidate starting point set including a plurality of the candidate starting points,

Wherein the candidate starting point is a candidate location where some or all of the co-occupant personnel gather into the shared transportation device;

Determining a plurality of candidate co-multiplication routes according to the traffic geographic information, the travel parameters of the co-occupant, and the candidate starting point set, and calculating a travel cost for acquiring each of the candidate co-multiplied routes,

Wherein the candidate sharing route includes a common starting point, a destination, and a sharing mode of each of the common passengers, and the sharing starting point is one of the sharing starting points in the candidate starting point set, the total The multiplication mode includes at least a mode of travel of the co-occupant from the corresponding departure place to the common start point; the travel mode includes at least the ride of the shared transportation device, bicycle riding, and walking; the travel cost includes at least One of travel distance, travel time, and travel expenses;

Selecting the candidate shared route with the lowest travel cost as a common route, and providing the shared route to the plurality of riders, triggering each of the riders to share by the shared transport device Travel.

Optionally, the step of selecting a corresponding candidate starting point according to the departure place of the multiple occupants includes:

Centering on the departure place of each commune person, the corresponding candidate starting point area is obtained by a predetermined geographical radius;

In each of the candidate starting point regions, at least one location that allows the shared transportation device to be docked is selected as a candidate starting point, and a plurality of the candidate starting points are obtained to generate the candidate starting point set.

Optionally, the step of constructing multiple candidate sharing routes includes:

Constructing, for each of the candidate starting points, a plurality of candidate path sequences having different path orders according to destinations of the plurality of co-occupant personnel and other candidate starting points in the candidate starting point set;

For each of the candidate path sequences, the corresponding candidate sharing route is obtained according to the traffic geographic information.

Optionally, the step of calculating the travel cost of each of the candidate shared route includes:

Calculating, according to the corresponding travel parameters and the traffic geographic information, a minimum travel cost under the candidate shared route and the corresponding sharing mode for each of the co-occupant personnel;

The travel cost of the candidate shared route is calculated according to the minimum travel cost of all the passengers under the candidate shared route.

Optionally, in the method,

Before the step of constructing the candidate sharing route, the method further includes:

Generating a corresponding candidate endpoint set according to the destinations of the plurality of co-occupants

Wherein the candidate end point is a candidate location where at least one co-occupant person leaves the shared transportation device;

The step of constructing the candidate common-share route to calculate the travel cost of each of the candidate shared route includes:

Determining a plurality of candidate co-multiplying routes according to the traffic geographic information, the travel parameters of the co-occupant, the candidate starting point set, and the candidate end point set, and calculating a travel cost for obtaining each of the candidate co-multiplied routes ;

Wherein the candidate sharing route includes a common starting point, a common end point, and a sharing mode of each of the common passengers, and the sharing mode further includes that the common passenger arrives from the corresponding sharing terminal The way the destination travels.

Optionally, the step of generating a candidate endpoint set includes:

Centering on the destination of each commune person, the corresponding candidate end point area is obtained by a predetermined geographic radius;

Selecting at least one location in the candidate end point region that allows the shared traffic device to be docked as a candidate endpoint, and obtaining a plurality of the candidate endpoints to generate the candidate endpoint set.

Constructing, for each of the candidate starting points, a plurality of candidate path sequences having different path orders according to the other candidate starting points in the candidate set and the candidate end point set;

For each of the candidate path sequences, the corresponding candidate sharing route is obtained according to the traffic map.

Optionally, the step of calculating the travel cost of each of the candidate shared route routes comprises:

Calculating, according to the corresponding travel parameters and the traffic geographic information, a minimum travel cost under the candidate shared route and the corresponding sharing mode, respectively, for each of the co-occupant personnel,

Optionally,

The traffic geographic information also includes a geographical distribution of shared bicycles, the geographic distribution of the shared bicycles including stops and available numbers of the shared bicycles;

and / or

When the co-occupant is triggered to reach the common riding starting point from the corresponding starting place by bicycle riding, or triggered to reach the corresponding destination from the sharing end point by bicycle riding, The shared passengers provide a shared bicycle reservation service.

Optionally,

The traffic geographic information further includes historical traffic data, and the historical traffic data includes one of historical congestion data and historical shared hotspot data;

and / or

The travel parameters of the co-occupant personnel further include historical travel information of the co-occupant, and the historical travel information includes at least one of historical share-sharing mode and historical time-speed information.

According to a second aspect of the present invention, a method for planning a common route is provided for planning a shared route for a plurality of commutators traveling through a shared transportation device, including:

Providing a travel parameter input interface for the user to perform an input operation to obtain the corresponding travel parameter,

The travel parameter includes at least a shared identity, a departure place, and a destination of the user;

Provide a shared route display interface for the user to obtain the corresponding shared route through the interface display.

Wherein the common multiplication route is obtained according to the method according to any one of the first aspects of the present invention, wherein the common route includes at least a corresponding sharing start point and a common multiplication mode, and at least the common multiplication mode The method includes the travel mode from the corresponding travel destination to the common start point; the travel mode includes at least the ride of the shared transportation device, bicycle riding, and walking; the travel cost includes at least a travel distance, a travel time, and a travel fee. one of them.

According to a third aspect of the present invention, a server is provided for planning a shared route for a plurality of occupants traveling through a shared transportation device, including:

a memory for storing executable instructions;

a processor for operating the server to perform a method of a common route planning according to any one of the first aspects of the present invention, in accordance with control of the instructions.

According to a fourth aspect of the present invention, a client is provided for planning a shared route for a plurality of accommodating persons traveling through a shared transportation device, including:

a memory for storing executable instructions;

And a processor, configured to execute the shared-party route planning method according to the second aspect of the present invention according to the control of the instruction.

According to a fifth aspect of the present invention, a planning system for a shared route is provided for planning a shared route for a plurality of occupants traveling through a shared transportation device, including:

At least one server as in the third aspect of the invention;

A plurality of clients as in the fourth aspect of the invention.

According to an embodiment of the present invention, the commuting route with the smallest travel cost can be provided to the co-occupant, so that the co-occupant can start the communal travel by the corresponding travel mode to the common start point corresponding to the common route, and realize the travel cost. Minimal, improve the efficiency of shared travel.

Other features and advantages of the present invention will become apparent from the Detailed Description of the <RTIgt;

DRAWINGS

The accompanying drawings, which are incorporated in FIG

1 is a block diagram showing an example of a hardware configuration of a system that can be used to implement an embodiment of the present invention.

Fig. 2 is a flow chart showing a method of planning a common route according to the first embodiment of the present invention.

Fig. 3 is a flow chart showing the acquisition of a candidate starting point set in the first embodiment of the present invention.

Fig. 4 is a flow chart showing the construction of a candidate sharing route in the first embodiment of the present invention.

FIG. 5 is a flow chart showing the calculation of the travel cost of each of the candidate common-sharing routes in the first embodiment of the present invention.

Fig. 6 is still another flow chart showing the method of planning the common route according to the first embodiment of the present invention.

Fig. 7 is a schematic diagram showing an example of a method of planning a common route according to the first embodiment of the present invention.

Figure 8 is a schematic block diagram of a server in accordance with a first embodiment of the present invention.

Figure 9 is a flow chart showing a method of planning a common route according to a second embodiment of the present invention.

Figure 10 is a schematic block diagram of a client of a second embodiment of the present invention.

Figure 11 is a schematic block diagram of a planning system of a shared route according to a third embodiment of the present invention.

Detailed ways

Various exemplary embodiments of the present invention will now be described in detail with reference to the drawings. It should be noted that the relative arrangement of the components and steps, numerical expressions and numerical values set forth in the embodiments are not intended to limit the scope of the invention unless otherwise specified.

The following description of the at least one exemplary embodiment is merely illustrative and is in no way

Techniques, methods and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail, but the techniques, methods and apparatus should be considered as part of the specification, where appropriate.

In all of the examples shown and discussed herein, any specific values are to be construed as illustrative only and not as a limitation. Thus, other examples of the exemplary embodiments may have different values.

It should be noted that similar reference numerals and letters indicate similar items in the following figures, and therefore, once an item is defined in one figure, it is not required to be further discussed in the subsequent figures.

As shown in FIG. 1, system 1000 includes a server 1100, a client 1200, and a network 1300.

The server 1100 is a service point that provides processing, database, and communication facilities, and may be an integral server or a distributed server that spans multiple computers or computer data centers. The type may be limited to a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interactive server, a database server, or a proxy server. In some embodiments, each server may comprise hardware, software, or an embedded logic component or a combination of two or more such components for performing the appropriate functions supported or implemented by the server. For example, a server such as a blade server, a cloud server, or the like, or may be a server group composed of a plurality of servers, may include one or more of the above types of servers, and the like.

In one example, server 1100 can be a computer. In another example, the server 1100 can include a processor 1110, a memory 1120, an interface device 1130, a communication device 1140, a display device 1150, and an input device 1160, as shown in FIG. Although the server may also include a speaker, a microphone, etc., these components are not relevant to the present invention and are therefore omitted herein.

The processor 1110 may be, for example, a central processing unit CPU, a microprocessor MCU, or the like. The memory 1120 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1130 includes, for example, a USB interface, a serial interface, and the like. The communication device 1140 can perform, for example, wired or wireless communication. The display device 1150 is, for example, a liquid crystal display. Input device 1160 can include, for example, a touch screen, a keyboard, and the like.

The client 1200 is an electronic device having a communication function and a service processing function. The client 1200 can be a mobile terminal such as a cell phone, a laptop, a tablet, a palmtop, and the like. In one example, the client 1200 is installed with an application (APP) that provides a transportation device sharing service, and can support a user having a shared travel demand to obtain a shared route that meets the demand, and according to the indication of the shared route, If you are walking, cycling, driving, or riding a shared transportation device, you can start a commuter trip. The shared transportation equipment is a transportation device that can provide multiple users to travel together, such as providing a private car service, an express service, or a shuttle service. Motor vehicles, private motor vehicles, motor vehicles that drive and travel on time, motor vehicles that provide operational services, etc., which may be two or more small cars, minibuses, buses, coaches, and the like.

As shown in FIG. 1, client 1200 can include processor 1210, memory 1220, interface device 1230, communication device 1240, display device 1250, input device 1260, speaker 1270, microphone 1280, and the like. The processor 1210 may be a central processing unit CPU, a microprocessor MCU, or the like. The memory 1220 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1230 includes, for example, a USB interface, a headphone jack, and the like. The communication device 1240 can, for example, perform wired or wireless communication. The display device 1250 is, for example, a liquid crystal display, a touch display, or the like. Input device 1260 can include, for example, a touch screen, a keyboard, and the like. The user can input/output voice information through the speaker 1270 and the microphone 1280.

The communication network 1300 can be a wireless network or a network, and can be a local area network or a wide area network. In the system 1000 shown in FIG. 1, clients 1200-1, 1200-2, 1200-3, 1200-4, and web server 1100 can communicate over communication network 1300.

The system 1000 illustrated in Figure 1 is merely illustrative and is in no way intended to limit the invention, its application or use.

In an embodiment of the present invention, the memory 1120 of the server 1100 is configured to store executable instructions, and the processor 1110 is configured to run the server 1100 according to the control of the instructions to perform an embodiment of the present invention. Planning method for any of the shared routes provided.

The memory 1220 of the client 1200 is configured to store executable instructions, and the processor 1210 is configured to run the client 1200 according to the control of the instruction to perform any one of the sharing provided by the embodiment of the present invention. The planning method of the route.

It should be understood by those skilled in the art that although a plurality of devices are shown for both the server 1100 and the client 1200 in FIG. 1, the present invention may only cover some of the devices, for example, the server 1100 only relates to the processor 1110 and the memory. 1120, or client 1200 only relates to processor 1210 and memory 1220, and the like. A technician can design instructions in accordance with the disclosed aspects of the present invention. How the instructions control the processor for operation is well known in the art and will not be described in detail herein.

In the present embodiment, a method for planning a common route is provided for planning a shared route for a plurality of commutators traveling through a shared transportation device.

A shared transportation device is a transportation device that can provide multiple users to travel together. For example, it may be a motor vehicle that provides a car service, an express service or a shuttle service, a private motor vehicle, a motor vehicle that travels in a time-sharing manner, an agitation vehicle that provides an operation service, etc., and the motor vehicle may be a small car of two or more. , minibuses, buses, coaches, etc.

Co-occupants include drivers who drive shared transportation equipment and passengers who take public transportation equipment.

The planning method of the shared route, as shown in FIG. 2, includes: steps S2100-S2400.

Step S2100: Obtain traffic geographic information and travel parameters of each of the common passengers,

The traffic geographic information includes at least a traffic map, and the travel parameters include at least a shared identity, a departure place, and a destination of the shared passenger.

The traffic map includes a map that covers the corresponding travel area, and may be pre-stored in the local storage of the device that implements the embodiment, or may be invoked through an interface provided by an existing map application to obtain a correspondingly provided map, and may also acquire different The route combination and real-time road condition information under the travel mode include public transportation, bicycle riding, walking, self-driving travel, etc.

The traffic geographic information may further include historical traffic data including one of historical congestion data and historical shared hotspot data. The historical congestion data is data of a congestion state of each time period of a traffic route that can be traveled on the traffic map according to historical data; the historical shared hotspot data is a shared starting point or a total of statistics according to historical data. By taking the data of the geographic location of the shared hotspot at the end point, the shared hotspot may be a subway station, a parking lot, a bus stop, a bicycle stop, a taxi waiting point, an intersection of a convenient car, etc., the historical shared hotspot. The data may include unique name information, geographic coordinate data, or geographic identification, etc. of the shared hotspot.

In one example, the traffic geographic information further includes a geographic distribution of shared bicycles, the geographic distribution of the shared bicycles including stops and available numbers of the shared bicycles.

The shared bicycle is a bicycle that can provide a time-sharing rental service, including a human bicycle, a power bicycle, an electric bicycle, and the like.

The travel parameter is related parameter information of a corresponding commutator in traveling through the shared transportation device.

The shared identity of the co-occupant includes a driver driving a shared transportation device and a passenger riding a shared transportation device.

The origin and destination may be unique name information, unique identifiers or geographical location coordinate data of the corresponding geographical location.

In an example, the travel parameter may further include historical travel information of the corresponding engineering personnel, and the historical travel information includes at least one of historical sharing mode and historical speed information, and the historical sharing method is that the commuting personnel are in the past The sharing method selected during the sharing, including the passengers' historical sharing, arrives at the sharing start point by walking or bicycle riding; the historical speed information is the speed information of the commuting passengers in the past, which may be the driver driving sharing The historical average speed of traffic equipment and the historical average speed of passengers walking or cycling.

In this embodiment, the human-machine interaction interface may be provided by the client facing the co-occupant, and the user may input the co-multiplying parameter corresponding to the co-occupant, thereby obtaining the multi-shared parameter.

Step S2200: Select a candidate starting point according to a departure place of the plurality of co-occupants, and obtain a candidate starting point set including a plurality of the candidate starting points.

The candidate starting point is a candidate location where some or all of the co-occupant personnel gather into the shared transportation device.

Specifically, the step S2200 can be as shown in FIG. 3, and includes:

Step S2201: centering on the departure place of each commune person, and dividing the corresponding candidate starting point area by a predetermined geographic radius.

The preset geographic radius may be set according to a specific application scenario or engineering experience. The candidate starting point area obtained by the division is composed of a location within the preset geographical radius of the corresponding starting point.

In an example, an inappropriate candidate starting point area may also be filtered out in the divided candidate starting area according to the traffic geographic information, for example, a crowded area that is not suitable for the traffic sharing device, or is not suitable for the total An area where the person arrives by bicycle riding, walking, or the like; or, in the divided candidate starting area, according to the traffic geographic information, only the candidate starting area related to the historical shared hotspot data is retained, for example, including the subway station Candidates, parking lots, bus stops, bicycle stops, taxi waiting points, candidate starting areas for easy intersections.

Step S2202: In each of the candidate starting point regions, selecting at least one location that allows the shared transportation device to stop as a candidate starting point, and obtaining a plurality of the candidate starting points to generate the candidate starting point set.

Specifically, the shared hotspot in the candidate starting area may be selected as a candidate starting point according to historical shared hotspot data included in the traffic geographic information, for example, a subway station, a parking lot, a bus stop, a bicycle stop, Taxi waiting point, easy intersection, etc. Alternatively, the application may be selected according to an application scenario. For example, the available number of shared bicycles in the candidate starting area may be greater than a preset number of bicycle stops, and the location of the shared transportation device may be docked. Demand settings.

In practical applications, the distribution of the departure place of each commutator is arbitrary, and there may be partial geographic overlap between different candidate starting areas, and the candidate starting point is selected in different candidate starting areas. There may be duplicates. The repetition may be that the geographic locations of the multiple candidate locations are identical, or the distances of the candidate locations may be relatively close, for example, the distance is within a preset smaller distance range. It should be understood that obtaining a plurality of the candidate starting points included in the candidate starting point set is a candidate starting point for filtering out repetitions, and is a candidate starting point having different geographical positions.

After obtaining the candidate starting point set, the candidate starting point in the candidate starting point set may be used as the common starting point of the common riding route, and the corresponding candidate sharing route may be constructed, and the common traveling route with the smallest travel cost of the entire commune passenger may be selected, so that part or all Co-occupants use the corresponding travel mode to arrive at the commuting starting point of the shared route to start the multi-ride trip, reducing the time cost of the high-collecting crew due to traffic congestion or poor road conditions (such as driver detours, traffic jams waiting) Time, passenger waiting time, etc., to achieve the minimum travel costs, improve the efficiency of shared travel.

Step S2300, constructing a plurality of candidate sharing routes according to the traffic geographic information, the travel parameters of the common passenger, and the candidate starting point set, and calculating and obtaining the travel cost of each of the candidate shared route.

Wherein the candidate sharing route includes a common starting point, a destination, and a sharing mode of each of the common passengers, and the sharing starting point is one of the sharing starting points in the candidate starting point set, the total The multiplication mode includes at least a mode of travel of the co-occupant from the corresponding departure place to the common start point; the travel mode includes at least the ride of the shared transportation device, bicycle riding, and walking; the travel cost includes at least One of travel distance, travel time, and travel expenses.

Specifically, the step of constructing multiple candidate sharing routes may be as shown in FIG. 4, including:

Step S2311, for each of the candidate starting points, constructing a plurality of candidate path sequences having different path sequences according to destinations of the plurality of co-occupant personnel and other candidate starting points in the candidate starting point set;

Step S2312: Acquire, for each of the candidate path sequences, the corresponding candidate sharing route according to the traffic geographic information.

For example, suppose the traffic sharing device is a vehicle that can provide K+1 passengers to share the vehicle, including the driver D and the K passenger U _k (k∈{1, 2, 3,..., K}). Know the driver's departure point D_s, the passenger's initial departure point U _k _s(k∈{1,2,3,...,K}) and the passenger's final destination U _k _e(k∈{1,2,3, ..., K}), the obtained candidate starting point set includes P candidate starting points: Ps _p (p ∈ {1, 2, 3, ..., P}), and candidate path sequences with different path order can be obtained:

{Ps ₁ , U ₁ _e, U ₂ _e,..., U _K _e}

{Ps ₁ , Ps ₂ , U ₁ _e, U ₂ _e,..., U _K _e}

{Ps ₁ , Ps ₂ , Ps ₃ , U ₁ _e, U ₂ _e,..., U _K _e}

{Ps ₁ ,...,Ps _P ,U ₁ _e,U ₂ _e,...,U _K _e}

{Ps ₁ ,...,Ps _P ,U ₂ _e,U ₁ _e,...,U _K _e}

......

{Ps ₁ ,...,Ps _P ,U _K _e,U _K-1 _e,...,U ₁ _e}

{Ps ₂ , U ₁ _e, U ₂ _e,..., U _K _e}

{Ps ₂ , Ps ₁ , U ₁ _e, U ₂ _e,..., U _K _e}

......

{Ps _P ,...,Ps ₁ ,U _K _e,U ₂ _e,...,U ₁ _e}

From the candidate path sequence obtained from the above construction, it can be known that a candidate path sequence may include a plurality of candidate starting points, which can traverse the coverage of the actual application, and a vehicle will stay at a plurality of sharing starting points to allow the passengers to be far away from the starting point. The situation of getting on the train separately.

After constructing a plurality of candidate path sequences, the corresponding candidate sharing route may be obtained according to the traffic geographic information.

For example, according to the traffic map included in the traffic geographic information, each candidate path sequence can be directly obtained according to the traffic map, and the shortest path is selected for each of the two nodes in the traffic map. The path distance between the nodes is planned, and the corresponding candidate sharing route is obtained.

Taking the candidate path sequence {Ps ₁ , U ₁ _e, U ₂ _e, ..., U _K _e} as an example, it is possible to obtain between Ps ₁ and U ₁ _e, U ₁ _e and U ₂ _e, according to the traffic map. The shortest path between U _K-1 _e and U _K _e (the path distance between the two nodes is obtained at the same time), and the connection obtains the corresponding candidate sharing route.

It should be understood that when the traffic geographic information includes a plurality of types of information, the distance of the reachable path between any two nodes may be weighted according to various information to select the shortest path. For example, when the traffic map and the historical traffic data are included, the plurality of reachable paths between any two nodes in the candidate path sequence may be weighted by the weighting coefficient according to the corresponding historical traffic data respectively (for example, the congestion degree is high, the weighting system) Large, making the path distance larger) to select the shortest path obtained by integrating the actual path distance and historical traffic data.

After acquiring the plurality of candidate sharing routes, the step of obtaining the travel cost of each of the candidate sharing routes may be as shown in FIG. 5, including:

Step S2321: Calculate, according to the corresponding travel parameters and the traffic geographic information, a minimum travel cost under the candidate shared route and the corresponding sharing mode for each of the co-occupants;

Step S2322: Calculate the travel cost of the candidate shared route according to the minimum travel cost of all the common passengers under the candidate shared route.

The candidate sharing route corresponding to the above candidate path sequence {Ps ₁ , U ₁ _e, U ₂ _e, ..., U _K _e} is exemplified. The candidate shared-shared path sequence includes n=1+K nodes, and the distance between all the two nodes before and after the candidate-shared route has been obtained by the method shown in FIG. 4:

For the driver D, the candidate common-sampling route corresponding to the candidate path sequence {Ps ₁ , U ₁ _e, U ₂ _e, ..., U _K _e} is shared with other co-occupant personnel by driving the vehicle, and the candidate is shared by the candidate. The method of sharing by the route is to take the vehicle, according to its distance from the departure point D_s to Ps ₁ .

And the distance between all the two nodes before and after the candidate is shared

Calculated total travel distance of the candidate shared route

Assuming that the travel cost is calculated as the travel distance, the minimum travel cost of driver D under the candidate shared route is SumL _D ; if the travel cost is calculated as the travel time, it can be based on the historical speed information of the driver driving the vehicle or the pre-acquired average speed information. To calculate the travel time of the travel distance; assume that the travel cost is calculated based on the travel cost, and the fuel consumption can be calculated based on the travel distance, etc.;

For passenger U ₁ , it is possible to reach Ps ₁ from the departure point U ₁ _s by walking, cycling or other public transportation, and by taking the shared traffic equipment in the candidate route sequence {Ps ₁ , U ₁ _e, U ₂ _e,..., U _K _e} performs a common multiplication on the candidate common multiplication route, and gets off at the corresponding destination U ₁ _e;

The distance from the departure point U ₁ _s to Ps ₁ can be based on the passenger U ₁

Select passengers U ₁ U ₁ _s a departure point Ps ₁ reaches such a small travel costs travel mode, for example, the travel cost is the travel time,

More than 1 km, you can choose a bicycle ride for passenger U ₁ .

Less than 1 km, you can choose to walk for passenger U ₁ , you can also choose according to the historical sharing method of passenger U ₁ , and so on;

Assume that the distance between all the two nodes before and after the candidate common multiplication route is obtained.

Calculate the total travel distance of passenger U ₁ in the candidate shared route

Assuming that the travel cost is calculated as the travel distance, the minimum travel cost of passenger U ₁ under the candidate shared route is

Assuming that the travel cost is calculated based on the travel time, the passenger U ₁ is shared by the bicycle ride + ride-sharing traffic equipment, based on the historical speed information of the passenger U ₁ and the driver D or the pre-stored parallel speed information.

The next passenger takes the time of cycling and the driver D drives

The time of the distance is summed to obtain the corresponding travel time; if the travel cost is calculated based on the travel cost, it can be calculated according to the bicycle riding cost of the passenger U ₁ at the travel distance and the mileage cost of riding the transportation sharing device, and the like;

For other passengers U _k (k=2,...,K), the calculation of the travel cost is similar to that of the passenger U ₁ and will not be described here.

After obtaining the minimum travel planbook of each of the commune personnel under the candidate share-sharing route, the travel cost of the candidate communal route can be obtained by accumulating, for example, if the travel cost is calculated by the travel distance, The travel cost of the candidate shared route is:

It should be understood that in some application scenarios, the travel cost calculation is more complicated in order to better fit the needs of the commuters. For example, the travel cost needs to comprehensively consider the travel distance, travel time, and travel expenses. The travel distance, the travel time, and the travel cost are set to different weights to realize the comprehensive calculation of the travel cost. However, after the example of calculating the travel cost of the candidate shared route is disclosed in the embodiment, those skilled in the art may not need any creativity. Improvements are made to apply to scenarios where cost needs to take into account travel distance, travel time, travel costs or more.

In addition, for the common passengers having different priorities, after the example of calculating the travel cost of the candidate sharing route is disclosed in the embodiment, those skilled in the art can improve without any creativity, and it is easy to think that the accumulation is obtained. When the travel cost of the candidate shared route is set, different priority weights are set for the different priority sharers to calculate the travel cost under each shared route.

By constructing a plurality of shared-shared route candidate sharing routes and calculating corresponding travel costs, a common-sharing route with the lowest travel cost of all the commune passengers can be selected, so that some or all of the co-occupant personnel arrive at the common multiplication by the corresponding travel mode. The commuting start point of the route starts to share the travel, reducing the time cost of the high-collected commuters due to traffic congestion or poor road conditions (such as the driver detour, the waiting time of the traffic jam, the waiting time of the passengers, etc.) The travel cost of the passenger is the smallest, and the efficiency of the shared travel is improved.

In practical applications, the destinations of some of the co-occupants may be closer, and the successive stops may cause the overall commuting travel time or travel distance to become longer, or the destination of some co-occupants may not be suitable for docking. For example, the destination needs to turn around in the direction of travel of the shared route, or the destination is relatively time-consuming to travel, which will affect the travel cost and reduce the efficiency of the shared travel.

Therefore, in this embodiment, a method for planning a common route is also provided, as shown in FIG. 6, including:

Step S2200-1, generating a corresponding candidate endpoint set according to the destinations of the plurality of co-occupants

The step S2300 of constructing the candidate common-share route to calculate the travel cost of each of the candidate shared route includes:

Wherein the candidate sharing route includes a common starting point, a sharing end point, and a sharing mode of each of the common passengers, and the sharing end point is one of the candidate end points in the candidate end point set, the total The multiply mode also includes the manner in which the co-occupant travels from the corresponding co-multiple end point to the destination.

Specifically, the step of generating a candidate endpoint set includes:

The step of generating the candidate end point set described above is compared with the step of generating the candidate start point set as shown in FIG. 3, except that the divided candidate end point area is the destination of each commutator, and the like, The steps shown in FIG. 3 are implemented, and details are not described herein again.

Specifically, in the method shown in FIG. 6, the step of constructing a plurality of candidate sharing routes may include:

For example, suppose the traffic sharing device is a vehicle that can provide K+1 passengers to share the vehicle, including the driver D and the K passenger U _k (k∈{1, 2, 3,..., K}). Know the driver's departure point D_s, the passenger's initial departure point U _k _s(k∈{1,2,3,...,K}) and the passenger's final destination U _k _e(k∈{1,2,3, ..., K}), the obtained candidate starting point set includes P candidate starting points: Ps _p (p ∈ {1, 2, 3, ..., P}), and the obtained candidate end point set includes Q candidates. Starting point: Pe _q (q∈{1,2,3,...,Q}),

Can obtain candidate path sequences with different path order:

{Ps ₁ ,Pe ₁ }

{Ps ₁ , Ps ₂ , Pe ₁ }

{Ps ₁ , Ps ₂ , Ps ₃ , Pe ₁ }

{Ps ₁ ,...,Ps _P ,Pe ₁ }

{Ps ₁ ,...,Ps _P ,Pe ₁ ,Pe ₂ }

{Ps ₁ ,...,Ps _P ,Pe ₂ ,Pe ₁ }

......

{Ps ₁ ,...,Ps _P ,Pe _Q ,...,Pe ₁ }

{Ps ₂ ,Pe ₁ }

......

{Ps ₂ ,...,Ps _P ,Pe _Q ,...,Pe ₁ }

......

{Ps _P ,...,Ps ₁ ,Pe _Q ,...,Pe ₁ }

From the subsequent path sequence obtained from the above construction, it can be known that a candidate path sequence may include multiple candidate starting points and multiple candidate ending points, which can be traversed to cover the actual application, and a vehicle will stay at multiple sharing starting points to make the departure distance longer. The far-off passengers boarded the car separately, and the passengers who stayed at the multi-shared destinations to make the destination far away were respectively disembarked.

After constructing a plurality of candidate path sequences, the corresponding candidate sharing route may be obtained according to the traffic geographic information. The step of obtaining the shared route is the same as the step S2312 shown in FIG. 4 which has been described in detail above, and details are not described herein again.

After acquiring a plurality of candidate routes, in the method shown in FIG. 6, the step of calculating the travel cost of each of the candidate shared routes may include:

For example, for the candidate common multiplication route corresponding to the candidate path sequence {Ps ₁ , Pe ₁ } in the above example, it is assumed that the distance between all the two nodes before and after the candidate common multiplication route is obtained:

For the driver D, the candidate shared route corresponding to the candidate path sequence {Ps ₁ , Pe ₁ } is shared by the driving vehicle and the other common passengers are shared, and the sharing method under the candidate sharing route is to ride the vehicle. According to its distance from the departure point D_s to Ps ₁

Calculated total travel distance of the candidate shared route

For passenger U ₁ , it is possible to reach Ps ₁ from the departure place U ₁ _s by walking, cycling or other public transportation, and by taking the shared traffic equipment in the candidate path sequence {Ps ₁ , Pe ₁ } carpool embodiment carpool candidate on the route, and the end point Pe ₁ carpool off, can be U ₁ _e by foot, by bike riding public transport or take other way to reach the end point Pe ₁ carpool from destination;

More than 1 km, you can choose a bicycle ride for passenger U ₁ .

Less than 1 km, you can choose to walk for passenger U ₁ , and you can also choose according to the historical sharing method of passenger U ₁ _s;

Similarly, the distance from the common end point Pe ₁ to the destination U ₁ _e can also be used.

Alternatively, according to the historical sharing method of the passenger U ₁ _s, the travel mode in which the passenger U ₁ is made to travel from the common destination end point Pe ₁ to the destination Pe _{1 to} make the travel cost small is selected.

Is assumed to travel cost calculated travel time may be based on historical information speed passenger and driver D U ₁ or speed parallel information stored in advance, to calculate passenger cycling U ₁

Time and driver D driving

It should be understood that in some application scenarios, the travel cost calculation is more complicated in order to better fit the needs of the commuters. For example, the travel cost needs to comprehensively consider the travel distance, travel time, and travel expenses. The traveling distance, the travel time, and the travel setting are different weights to realize the comprehensive calculation of the travel cost, and after the example of calculating the travel cost of the candidate sharing route is disclosed in the embodiment, those skilled in the art can perform without any creativity. Improvements to suit the cost of a scenario that takes into account travel distance, travel time, and travel costs or more.

In addition, for the common passengers having different priorities, after the example of calculating the travel cost of the candidate sharing route is disclosed in the embodiment, those skilled in the art can improve without any creativity, and it is easy to think that the accumulation is obtained. When the travel cost of the candidate shared route is set, different priority weights are set for the different priority commutators, and the corresponding travel costs are respectively multiplied to calculate the travel cost under the shared route.

By generating the candidate endpoint set, the candidate common starting point with the candidate starting point in the candidate starting point set as the sharing starting point and the candidate ending point in the candidate end point set as the common multiplication end point is constructed, and the common multiplication route with the smallest row cost is selected to achieve the sharing. Allowing some or all of the co-occupants to leave the traffic-sharing equipment at the corresponding commuting destination and reach their respective destinations in the corresponding travel mode, which can reduce the arrival of the high-sorted passengers due to traffic congestion or poor road conditions. The time cost of the destination (such as the driver's detour, the time of traffic jam, the time of the passengers who are close to each other but not waiting for the trip, etc.), to achieve the minimum travel cost of all the commuters and improve the efficiency of the communal travel.

Step S2400, selecting the candidate shared route with the lowest travel cost as the shared route, and providing the shared route to the plurality of riders, triggering each of the riders to pass the shared traffic The device shares the trip.

The candidate shared route with the lowest travel cost is selected as the shared route, and the shared route with the least travel cost of all the commuters can be provided to improve the efficiency of the shared travel.

In this embodiment, the shared route can be provided to the co-occupant through the human-computer interaction interface of the client, for example, for each co-occupant, the common-share starting point and the common-end destination of the shared route are respectively displayed through the interface. The method of sharing, in particular, for the driver, can show the starting point of the commuting from the driver's starting point, the commuting destination, the estimated travel time, etc.; for the passenger, it can be shown which way to get from the departure point to the sharing starting point, The traffic sharing equipment is expected to arrive at the sharing start point, the shared end point, the travel mode from the shared end point to the destination, and the like.

The planning method of the shared route provided in this embodiment may further include:

Providing a shared bicycle reservation service for the passengers can enable the commuter to realize a “seamless” transfer of the bicycle to the shared transportation equipment, to carry out the communal travel, and improve the efficiency of the shared travel.

The planning method of the shared route provided in the present embodiment will be further described below with reference to the example shown in FIG.

In the example shown in FIG. 7, the transport device is a four carpool vehicle, by the driver and the passenger D U _1, U _2, U ₃ carpool travel. The method includes:

Step S701, obtaining the travel parameters of the driver D and the passengers U ₁ , U ₂ , and U ₃ , and obtaining the departure place of the driver D is D_s, the departure place U ₁ _s of the passenger U ₁ , the destination U ₁ _e, and the departure of the passenger U ₂ Ground U ₂ _s, destination U ₂ _e, departure point U ₃ _s of passenger U ₃ , destination U ₃ _e;

Step S702, by providing the step of generating a candidate starting point set in the foregoing embodiment, obtaining a candidate starting point set including three candidate starting points: Ps ₁ , Ps ₂ , Ps ₃ , and providing the generated candidate end point set in the foregoing embodiment. The step of obtaining a candidate endpoint set includes three candidate starting points: Pe ₁ , Pe ₂ , Pe ₃ ;

Step S703, constructing a plurality of candidate sharing routes according to the candidate starting point set and the candidate ending point set, each candidate sharing route includes a sharing start point, a sharing end point, and a sharing mode, and the sharing mode includes each of the commuting personnel The way in which the respective destinations arrive at the starting point of the sharing, and the way in which each of the commuters passes from their respective sharing destinations to the destination.

As shown in FIG. 7, the candidate common multiplication route in this example is a plurality of routes constructed by traversing the candidate starting points Ps ₁ , Ps ₂ , Ps ₃ and the candidate end points Pe ₁ , Pe ₂ , and Pe ₃ , and each route includes Obtain the travel mode of the driver D and the passengers U ₁ , U ₂ , U ₃ from the respective departure points to the corresponding sharing start point, and the travel mode from the corresponding communal destination to the respective destinations.

It should be understood that there are connections in the same candidate starting point or candidate ending point in FIG. 7 in order to more easily illustrate the construction of the candidate sharing path, the same candidate starting point or the same candidate ending point when implementing the construction candidate candidate multiplication route. The path distance between the two is 0, and the connection of the same candidate starting point or candidate ending point can be filtered out.

In addition, as shown in FIG. 7 , the candidate candidate sharing route may include multiple sharing starting points or multiple sharing destinations, which may support different distances between the commuting personnel and the destination distance. Scenes.

In step S704, the travel cost under each candidate sharing route is calculated separately.

The specific steps of calculating the travel cost have been described in detail in the foregoing description of the steps in the embodiment, and are not described herein again.

In step S705, the candidate shared route with the smallest travel cost is selected as the shared route, and is provided to the corresponding commutator.

It should be understood that although different riders take the same traffic sharing device, the corresponding departure place and destination are different, and different riders can be respectively displayed in different ways, for example, For the driver D, it is possible to display the driving route from the departure point of the car, the commuting destination on each of the commuting routes, and the starting point of the commuting. For the passenger, it is possible to show the ride from the starting place to the corresponding riding start point. The route, the ride route from the shared start point to the corresponding communal destination, and the ride for the shared ride to the corresponding destination ride.

When the present example is applied to a plurality of passengers whose departure distances are close to each other, the passengers can select a commuter starting point that can be respectively reached by the bicycle and can be conveniently docked, and the collection is waiting for the driver to pick up the vehicle. It is also possible to select the same easy-to-stop shared destination for a plurality of passengers whose destinations are located close to each other, so that the passengers can get to the corresponding destination by bicycle riding after getting off at the shared terminal, so that the driver can be convenient. The passengers at the docking point pick up and drop off passengers, and do not have to pick up the passengers one by one, and reduce the time cost caused by traffic congestion or poor road conditions. Accordingly, the passengers’ time and expenses are reduced, and the passengers and passengers are all realized. Co-occupants have the lowest travel costs and improve the efficiency of shared travel.

In this embodiment, a server 200 is further provided for implementing the planning method of the common route provided in this embodiment. As shown in FIG. 8, the memory 210 and the processor 220 are included:

a memory 210, configured to store executable instructions;

The processor 220 is configured to run the server to perform the planning method of the common route provided in the embodiment according to the control of the instruction.

In this embodiment, the server 200 may have various physical forms, for example, may be a blade server, a cloud server, or the like, or may be a server group composed of a plurality of servers. In one example, server 200 can be server 1100 as shown in FIG.

Those skilled in the art will appreciate that server 200 can be implemented in a variety of ways. For example, server 200 can be implemented by an instruction configuration processor. For example, the instructions can be stored in the ROM, and when the device is booted, the instructions are read from the ROM into the programmable device to implement the server 200. For example, server 200 can be cured into a dedicated device (eg, an ASIC). The server 200 can be divided into mutually independent units, or they can be implemented together. The server 200 may be implemented by one of the various implementations described above, or may be implemented by a combination of two or more of the various implementations described above.

The planning method and server for the common route provided in this embodiment have been described above with reference to the accompanying drawings and examples. According to the embodiment, the sharing route with the lowest travel cost of all the commuters can be provided, so that the common passengers can correspond. The travel mode arrives at the common start point corresponding to the common route to start the shared travel, which realizes the minimum travel cost and improves the efficiency of the shared travel.

In this embodiment, a method for planning a common route is provided, which is used for planning a shared route for a plurality of commutators traveling through a shared transportation device, as shown in FIG. 9, including:

Step S3100: Providing a travel parameter input interface for the user to perform an input operation to obtain the corresponding travel parameter, wherein the travel parameter includes at least the shared identity, the departure place, and the destination of the user.

Specifically, the travel parameters have been described in detail in the first embodiment, and details are not described herein again.

The travel parameter input interface is a human-machine interaction interface that can be used by a user to perform a click operation, a text or a voice input operation, and can obtain a corresponding user-entered travel parameter in response to a user input operation, so as to cooperate with the implementation of the first embodiment. The planning method of taking the route.

In step S3200, a common route display interface is provided, and the user obtains a corresponding shared route through the interface display.

The common route is obtained by the planning method of the common route provided in the first embodiment, and details are not described herein again. The sharing route includes at least a corresponding sharing starting point and a sharing mode; the sharing mode includes at least a travel mode from the corresponding travel destination to the shared start point; and the travel mode includes at least the ride Take transportation equipment, bicycle riding, and walking; the travel cost includes at least one of travel distance, travel time, and travel expenses.

The shared route display interface is a human-machine interaction interface that can be used by the user to perform a click operation and a zoom operation, and can display a corresponding shared route to the user in response to the related operation of the user, to provide implementation of the first embodiment. The shared route obtained after the route planning method.

The shared route may further include a shared end point, and the shared mode may further include a travel mode from the shared start point to the share end point and a travel mode from the share end point to the destination.

In this embodiment, a client 300 is further provided for implementing the planning method of the common route provided in this embodiment. As shown in FIG. 10, the memory 310 and the processor 320 are included:

a memory 310, configured to store executable instructions;

The processor 320 is configured to run the server to perform the planning method of the common route provided in the embodiment according to the control of the instruction.

In this embodiment, the client 300 can have various physical forms, for example, a mobile phone, a palmtop computer, a tablet computer, a desktop computer, or the like. In one example, client 300 can be server 1200 as shown in FIG.

Those skilled in the art will appreciate that the client 300 can be implemented in a variety of ways. For example, client 300 can be implemented by an instruction configuration processor. For example, the instructions can be stored in the ROM, and when the device is booted, the instructions are read from the ROM into the programmable device to implement the client 300. For example, client 300 can be cured into a dedicated device (eg, an ASIC). The client 300 can be divided into mutually independent units, or they can be combined and implemented. The client 300 may be implemented by one of the various implementations described above, or may be implemented by a combination of two or more of the various implementations described above.

The planning method and the client for the common route provided in this embodiment have been described above with reference to the accompanying drawings. According to the embodiment, the shared route with the lowest travel cost can be provided to the common passengers, so that the common passengers can correspond. The travel mode arrives at the common start point corresponding to the common route to start the shared travel, which realizes the minimum travel cost and improves the efficiency of the shared travel.

In this embodiment, a planning system 400 for a shared route is provided for planning a shared route for a plurality of commutators traveling through the shared transportation device, as shown in FIG. 11, including:

At least one server 200 provided in the first embodiment;

A plurality of clients 300 as provided in the second embodiment.

Through the planning system 400 of the shared route provided in this embodiment, the driver and the passenger riding the shared transportation device as the passengers can input their own departure place, destination, and the travel parameter input interface provided by the client 300. Identity

The client 300 obtains the corresponding travel parameters in response to the user's operation, and then sends the corresponding travel parameters to the server 200. The server 200 plans the common travel route with the least travel cost for the common passenger according to the planning method of the shared route provided in the first embodiment. And respectively sent to the corresponding client 300, so that the client 300 can provide the shared route to the co-occupant of the corresponding use client 300 through the shared route display interface.

In the present embodiment, the planning system 400 of the shared route may have multiple physical forms. In a specific example, the planning system 400 of the shared route may be the system 1000 shown in FIG.

The planning system of the shared route provided by the embodiment has been described above with reference to the accompanying drawings, and the shared route with the lowest travel cost of all the commuters can be provided, so that the commutator can reach the common multiplication by the corresponding travel mode. The starting point starts to share the travel, which achieves the minimum travel cost and improves the efficiency of the shared travel.

It is well known to those skilled in the art that with the development of electronic information technology such as large scale integrated circuit technology and the trend of software hardware, it has become difficult to clearly define the software and hardware boundaries of computer systems. Because any operation can be implemented in software, it can also be implemented by hardware. Execution of any instruction can be done by hardware, as well as by software. Whether a hardware implementation or a software implementation is used for a certain machine function depends on non-technical factors such as price, speed, reliability, storage capacity, and change cycle. Thus, one of ordinary skill in the art of electronic information technology, a more direct and clear way of describing a technical solution is to describe the various operations in the solution. Those skilled in the art can directly design the desired product based on consideration of the non-technical factors, knowing the operation to be performed.

The invention can be a system, method and/or computer program product. The computer program product can comprise a computer readable storage medium having computer readable program instructions embodied thereon for causing a processor to implement various aspects of the present invention.

The computer readable storage medium can be a tangible device that can hold and store the instructions used by the instruction execution device. The computer readable storage medium can be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (non-exhaustive list) of computer readable storage media include: portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM) Or flash memory), static random access memory (SRAM), portable compact disk read only memory (CD-ROM), digital versatile disk (DVD), memory stick, floppy disk, mechanical encoding device, for example, with instructions stored thereon A raised structure in the hole card or groove, and any suitable combination of the above. A computer readable storage medium as used herein is not to be interpreted as a transient signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (eg, a light pulse through a fiber optic cable), or through a wire The electrical signal transmitted.

The computer readable program instructions described herein can be downloaded from a computer readable storage medium to various computing/processing devices or downloaded to an external computer or external storage device over a network, such as the Internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium in each computing/processing device .

Computer program instructions for performing the operations of the present invention may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine related instructions, microcode, firmware instructions, state setting data, or in one or more programming languages. Source code or object code written in any combination, including object oriented programming languages such as Smalltalk, C++, etc., as well as conventional procedural programming languages such as the "C" language or similar programming languages. The computer readable program instructions 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, partly on the remote computer, or entirely on the remote computer or server. carried out. In the case of a remote computer, the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or wide area network (WAN), or can be connected to an external computer (eg, using an Internet service provider to access the Internet) connection). In some embodiments, the customized electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), can be customized by utilizing state information of computer readable program instructions. Computer readable program instructions are executed to implement various aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus, and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowcharts and/or block diagrams can be implemented by computer readable program instructions.

The computer readable program instructions can be provided to a general purpose computer, a special purpose computer, or a processor of other programmable data processing apparatus to produce a machine such that when executed by a processor of a computer or other programmable data processing apparatus Means for implementing the functions/acts specified in one or more of the blocks of the flowcharts and/or block diagrams. The computer readable program instructions can also be stored in a computer readable storage medium that causes the computer, programmable data processing device, and/or other device to operate in a particular manner, such that the computer readable medium storing the instructions includes An article of manufacture that includes instructions for implementing various aspects of the functions/acts recited in one or more of the flowcharts.

The computer readable program instructions can also be loaded onto a computer, other programmable data processing device, or other device to perform a series of operational steps on a computer, other programmable data processing device or other device to produce a computer-implemented process. Thus, instructions executed on a computer, other programmable data processing apparatus, or other device implement the functions/acts recited in one or more of the flowcharts and/or block diagrams.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality and operation of possible implementations of systems, methods and computer program products according to various embodiments of the invention. In this regard, each block in the flowchart or block diagram can represent a module, a program segment, or a portion of an instruction that includes one or more components for implementing the specified logical functions. Executable instructions. In some alternative implementations, the functions noted in the blocks may also occur in a different order than those illustrated in the drawings. For example, two consecutive blocks may be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending upon the functionality involved. It is also noted that each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts, can be implemented in a dedicated hardware-based system that performs the specified function or action. Or it can be implemented by a combination of dedicated hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, implementation by software, and implementation by a combination of software and hardware are equivalent.

The embodiments of the present invention have been described above, and the foregoing description is illustrative, not limiting, and not limited to the disclosed embodiments. Numerous modifications and changes will be apparent to those skilled in the art without departing from the scope of the invention. The choice of terms used herein is intended to best explain the principles, practical applications, or technical improvements in the various embodiments of the embodiments, or to enable those of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.

Claims

A method of planning a shared route for planning a shared route for multiple commuters who travel through a shared transportation device, including:

Obtaining traffic geographic information and travel parameters of each of the commutators

The traffic geographic information includes at least a traffic map, and the travel parameters include at least a shared identity, a departure place, and a destination of the shared passenger;

Selecting a candidate starting point according to the departure place of the plurality of co-occupants, and obtaining a candidate starting point set including a plurality of the candidate starting points,

Wherein the candidate starting point is a candidate location where some or all of the co-occupant personnel gather into the shared transportation device;

Determining a plurality of candidate co-multiplication routes according to the traffic geographic information, the travel parameters of the co-occupant, and the candidate starting point set, and calculating a travel cost for acquiring each of the candidate co-multiplied routes,

Wherein the candidate sharing route includes a common starting point, a destination, and a sharing mode of each of the common passengers, and the sharing starting point is one of the sharing starting points in the candidate starting point set, the total The multiplication mode includes at least a mode of travel of the co-occupant from the corresponding departure place to the common start point; the travel mode includes at least the ride of the shared transportation device, bicycle riding, and walking; the travel cost includes at least One of travel distance, travel time, and travel expenses;

Selecting the candidate shared route with the lowest travel cost as a common route, and providing the shared route to the plurality of riders, triggering each of the riders to share by the shared transport device Travel.
The method according to claim 1, wherein the step of selecting a corresponding candidate starting point according to the departure place of the plurality of co-occupants includes:

Centering on the departure place of each commune person, the corresponding candidate starting point area is obtained by a predetermined geographical radius;

In each of the candidate starting point regions, at least one location that allows the shared transportation device to be docked is selected as a candidate starting point, and a plurality of the candidate starting points are obtained to generate the candidate starting point set.
The method according to claim 1 or 2, wherein the step of constructing a plurality of candidate commuting routes comprises:

Constructing, for each of the candidate starting points, a plurality of candidate path sequences having different path orders according to destinations of the plurality of co-occupant personnel and other candidate starting points in the candidate starting point set;

For each of the candidate path sequences, the corresponding candidate sharing route is obtained according to the traffic geographic information.
The method according to any one of claims 1-3, wherein the calculating the step of obtaining the travel cost of each of the candidate shared routes comprises:

Calculating, according to the corresponding travel parameters and the traffic geographic information, a minimum travel cost under the candidate shared route and the corresponding sharing mode for each of the co-occupant personnel;

The travel cost of the candidate shared route is calculated according to the minimum travel cost of all the passengers under the candidate shared route.
A method according to any one of claims 1 to 4, characterized in that

Before the step of constructing the candidate sharing route, the method further includes:

Generating a corresponding candidate endpoint set according to the destinations of the plurality of co-occupants

Wherein the candidate end point is a candidate location where at least one co-occupant person leaves the shared transportation device;

The step of constructing the candidate common-share route to calculate the travel cost of each of the candidate shared route includes:

Determining a plurality of candidate co-multiplying routes according to the traffic geographic information, the travel parameters of the co-occupant, the candidate starting point set, and the candidate end point set, and calculating a travel cost for obtaining each of the candidate co-multiplied routes ;

Wherein the candidate sharing route includes a common starting point, a common end point, and a sharing mode of each of the common passengers, and the sharing mode further includes that the common passenger arrives from the corresponding sharing terminal The way the destination travels.
The method of any of claims 1-5, wherein the step of generating a candidate endpoint set comprises:

Centering on the destination of each commune person, the corresponding candidate end point area is obtained by a predetermined geographic radius;

Selecting at least one location in the candidate end point region that allows the shared traffic device to be docked as a candidate endpoint, and obtaining a plurality of the candidate endpoints to generate the candidate endpoint set.
The method according to any one of claims 1 to 6, wherein the step of constructing a plurality of candidate sharing routes comprises:

Constructing, for each of the candidate starting points, a plurality of candidate path sequences having different path orders according to the other candidate starting points in the candidate set and the candidate end point set;

For each of the candidate path sequences, the corresponding candidate sharing route is obtained according to the traffic map.
The method according to any one of claims 1 to 7, wherein the calculating the acquisition of the travel cost of each of the candidate shared routes comprises:

Calculating, according to the corresponding travel parameters and the traffic geographic information, a minimum travel cost under the candidate shared route and the corresponding sharing mode, respectively, for each of the co-occupant personnel,

The travel cost of the candidate shared route is calculated according to the minimum travel cost of all the passengers under the candidate shared route.
A method according to any one of claims 1-8, characterized in that

The traffic geographic information also includes a geographical distribution of shared bicycles, the geographic distribution of the shared bicycles including stops and available numbers of the shared bicycles;

and / or

When the co-occupant is triggered to reach the common riding starting point from the corresponding starting place by bicycle riding, or triggered to reach the corresponding destination from the sharing end point by bicycle riding, The shared passengers provide a shared bicycle reservation service.
A method according to any one of claims 1-9, characterized in that

The traffic geographic information further includes historical traffic data, and the historical traffic data includes one of historical congestion data and historical shared hotspot data;

and / or

The travel parameters of the co-occupant personnel further include historical travel information of the co-occupant, and the historical travel information includes at least one of historical share-sharing mode and historical time-speed information.
A method of planning a shared route for planning a shared route for multiple commuters who travel through a shared transportation device, including:

Providing a travel parameter input interface for the user to perform an input operation to obtain the corresponding travel parameter,

The travel parameter includes at least a shared identity, a departure place, and a destination of the user;

Provide a shared route display interface for the user to obtain the corresponding shared route through the interface display.

Wherein the common multiplication route is obtained according to the method of any one of claims 1-10, the common multiplication route at least includes a corresponding sharing start point and a common multiplication mode, and the common multiplication mode includes at least a corresponding correspondence Traveling to the commuting starting point; the travel mode includes at least riding the shared transportation equipment, bicycle riding, walking; the travel cost includes at least one of travel distance, travel time, travel cost .
A server for planning a shared route for multiple commuters who travel through a shared transportation device, including:

a memory for storing executable instructions;

a processor for operating the server to perform the method of a common route planning according to any one of claims 1-10 in accordance with control of the instructions.
A client that is used to plan a shared route for multiple commuters who travel through a shared transportation device, including:

a memory for storing executable instructions;

And a processor, configured to run the client to perform the common route planning method according to claim 11 according to the control of the instruction.
A planning system for a shared route for planning a shared route for multiple commuters who travel through a shared transportation device, including:

At least one server according to claim 12;

A plurality of clients as claimed in claim 13.