WO2019056875A1 - Procédé de planification d'itinéraire de covoiturage, client, serveur et système - Google Patents

Procédé de planification d'itinéraire de covoiturage, client, serveur et système Download PDF

Info

Publication number
WO2019056875A1
WO2019056875A1 PCT/CN2018/098642 CN2018098642W WO2019056875A1 WO 2019056875 A1 WO2019056875 A1 WO 2019056875A1 CN 2018098642 W CN2018098642 W CN 2018098642W WO 2019056875 A1 WO2019056875 A1 WO 2019056875A1
Authority
WO
WIPO (PCT)
Prior art keywords
candidate
travel
shared
route
sharing
Prior art date
Application number
PCT/CN2018/098642
Other languages
English (en)
Chinese (zh)
Inventor
夏一平
尹大飞
杨毓杰
朱家辉
Original Assignee
北京摩拜科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京摩拜科技有限公司 filed Critical 北京摩拜科技有限公司
Publication of WO2019056875A1 publication Critical patent/WO2019056875A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles

Definitions

  • 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.
  • a method for planning a shared route for planning a shared route for a plurality of commutators traveling through a shared transportation device, including:
  • 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 candidate starting point is a candidate location where some or all of the co-occupant personnel gather into the shared transportation device
  • 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;
  • the step of selecting a corresponding candidate starting point according to the departure place of the multiple occupants includes:
  • the corresponding candidate starting point area is obtained by a predetermined geographical radius
  • 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 step of constructing multiple candidate sharing routes includes:
  • the corresponding candidate sharing route is obtained according to the traffic geographic information.
  • the step of calculating the travel cost of each of the candidate shared route includes:
  • 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.
  • the method further includes:
  • 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:
  • 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 step of generating a candidate endpoint set includes:
  • the corresponding candidate end point area is obtained by a predetermined geographic radius
  • the step of constructing multiple candidate sharing routes includes:
  • the corresponding candidate sharing route is obtained according to the traffic map.
  • the step of calculating the travel cost of each of the candidate shared route routes comprises:
  • 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.
  • 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;
  • the shared passengers provide a shared bicycle reservation service.
  • 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;
  • 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 for planning a common route for planning a shared route for a plurality of commutators traveling through a shared transportation device, including:
  • the travel parameter includes at least a shared identity, a departure place, and a destination of the user;
  • 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.
  • a server 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.
  • a client for planning a shared route for a plurality of accommodating persons traveling through a shared transportation device, including:
  • a memory for storing executable instructions
  • 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.
  • a planning system for a shared route 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 are identical to the fourth aspect of the 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • server 1100 can be a computer.
  • 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.
  • 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.
  • 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.
  • 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.
  • clients 1200-1, 1200-2, 1200-3, 1200-4, and web server 1100 can communicate over communication network 1300.
  • the memory 1120 of the server 1100 is configured to store executable instructions
  • 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 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.
  • 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.
  • 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.
  • 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.
  • 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 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.
  • 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.
  • 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.
  • 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 historical speed information is the speed information of the commuting passengers in the past, which may be the driver driving sharing
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • traffic congestion or poor road conditions such as driver detours, traffic jams waiting
  • 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.
  • 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.
  • 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.
  • 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 ⁇ ).
  • 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:
  • 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.
  • the corresponding candidate sharing route may be obtained according to 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.
  • the distance of the reachable path between any two nodes may be weighted according to various information to select the shortest path.
  • 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.
  • 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 1 , U 1 _e, U 2 _e, ..., U K _e ⁇ is exemplified.
  • the candidate common-sampling route corresponding to the candidate path sequence ⁇ Ps 1 , U 1 _e, U 2 _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 1 . And the distance between all the two nodes before and after the candidate is shared Calculated total travel distance of the candidate shared route
  • the travel cost is calculated as the travel distance
  • the minimum travel cost of driver D under the candidate shared route is SumL D ;
  • 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.
  • the travel cost is calculated based on the travel cost, and the fuel consumption can be calculated based on the travel distance, etc.;
  • the distance from the departure point U 1 _s to Ps 1 can be based on the passenger U 1 Select passengers U 1 U 1 _s a departure point Ps 1 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 1 . Less than 1 km, you can choose to walk for passenger U 1 , you can also choose according to the historical sharing method of passenger U 1 , and so on;
  • the minimum travel cost of passenger U 1 under the candidate shared route is Assuming that the travel cost is calculated based on the travel time, the passenger U 1 is shared by the bicycle ride + ride-sharing traffic equipment, based on the historical speed information of the passenger U 1 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 1 at the travel distance and the mileage cost of riding the transportation sharing device, and the like;
  • 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:
  • the travel cost calculation is more complicated in order to better fit the needs of the commuters.
  • 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.
  • improvements are made to apply to scenarios where cost needs to take into account travel distance, travel time, travel costs or more.
  • 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.
  • 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.
  • 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.
  • a method for planning a common route is also provided, as shown in FIG. 6, including:
  • the method further includes:
  • Step S2200-1 generating a corresponding candidate endpoint set according to the destinations of the plurality of co-occupants
  • the candidate end point is a candidate location where at least one co-occupant person leaves the shared transportation device
  • the step S2300 of constructing the candidate common-share route to calculate the travel cost of each of the candidate shared route includes:
  • 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.
  • the step of generating a candidate endpoint set includes:
  • the corresponding candidate end point area is obtained by a predetermined geographic radius
  • 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.
  • the step of constructing a plurality of candidate sharing routes may include:
  • the corresponding candidate sharing route is obtained according to the traffic map.
  • 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 ⁇ ).
  • 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 ⁇ )
  • the obtained candidate end point set includes Q candidates.
  • 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 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.
  • the step of calculating the travel cost of each of the candidate shared routes may include:
  • 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.
  • the candidate shared route corresponding to the candidate path sequence ⁇ Ps 1 , Pe 1 ⁇ 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 1 And the distance between all the two nodes before and after the candidate is shared Calculated total travel distance of the candidate shared route
  • the travel cost is calculated as the travel distance
  • the minimum travel cost of driver D under the candidate shared route is SumL D ;
  • 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.
  • the travel cost is calculated based on the travel cost, and the fuel consumption can be calculated based on the travel distance, etc.;
  • the distance from the departure point U 1 _s to Ps 1 can be based on the passenger U 1 Select passengers U 1 U 1 _s a departure point Ps 1 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 1 . Less than 1 km, you can choose to walk for passenger U 1 , and you can also choose according to the historical sharing method of passenger U 1 _s;
  • the distance from the common end point Pe 1 to the destination U 1 _e can also be used.
  • the travel mode in which the passenger U 1 is made to travel from the common destination end point Pe 1 to the destination Pe 1 to make the travel cost small is selected.
  • the minimum travel cost of passenger U 1 under the candidate shared route is Is assumed to travel cost calculated travel time may be based on historical information speed passenger and driver D U 1 or speed parallel information stored in advance, to calculate passenger cycling U 1 Time and driver D driving 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 1 at the travel distance and the mileage cost of riding the transportation sharing device, and the like;
  • 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:
  • the travel cost calculation is more complicated in order to better fit the needs of the commuters.
  • 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.
  • 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.
  • 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 shared passengers provide a shared bicycle reservation service.
  • 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 transport device is a four carpool vehicle, by the driver and the passenger D U 1, U 2, U 3 carpool travel.
  • the method includes:
  • Step S701 obtaining the travel parameters of the driver D and the passengers U 1 , U 2 , and U 3 , and obtaining the departure place of the driver D is D_s, the departure place U 1 _s of the passenger U 1 , the destination U 1 _e, and the departure of the passenger U 2 Ground U 2 _s, destination U 2 _e, departure point U 3 _s of passenger U 3 , destination U 3 _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 1 , Ps 2 , Ps 3 , 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 1 , Pe 2 , Pe 3 ;
  • 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.
  • the candidate common multiplication route in this example is a plurality of routes constructed by traversing the candidate starting points Ps 1 , Ps 2 , Ps 3 and the candidate end points Pe 1 , Pe 2 , and Pe 3 , and each route includes Obtain the travel mode of the driver D and the passengers U 1 , U 2 , U 3 from the respective departure points to the corresponding sharing start point, and the travel mode from the corresponding communal destination to the respective destinations.
  • 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.
  • step S704 the travel cost under each candidate sharing route is calculated separately.
  • step S705 the candidate shared route with the smallest travel cost is selected as the shared route, and is provided to the corresponding commutator.
  • 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.
  • 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.
  • a server 200 is further provided for implementing the planning method of the common route provided in this embodiment.
  • 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.
  • 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.
  • server 200 can be server 1100 as shown in FIG.
  • server 200 can be implemented in a variety of ways.
  • server 200 can be implemented by an instruction configuration processor.
  • 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.
  • 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 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.
  • 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.
  • 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 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 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.
  • 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
  • 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.
  • a client 300 is further provided for implementing the planning method of the common route provided in this embodiment.
  • 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.
  • 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.
  • client 300 can be server 1200 as shown in FIG.
  • client 300 can be implemented in a variety of ways.
  • client 300 can be implemented by an instruction configuration processor.
  • 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.
  • 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 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.
  • 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 At least one server 200 provided in the first embodiment
  • a plurality of clients 300 as provided in the second embodiment is provided.
  • 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.
  • 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.
  • the planning system 400 of the shared route may have multiple physical forms.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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).
  • 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.
  • 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.
  • 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.
  • 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 can 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.
  • 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.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

La présente invention concerne un procédé de planification d'itinéraire de covoiturage, un client, un serveur et un système. Le procédé consiste à : obtenir des informations géographiques de trafic et des paramètres de déplacement de chaque passager de covoiturage (S2100) ; sélectionner des points de départ candidats correspondants en fonction des emplacements de départ de la pluralité de passagers de covoiturage, et obtenir un ensemble de points de départ candidats comprenant la pluralité de points de départ candidats (S2200) ; construire une pluralité d'itinéraires de covoiturage candidats en fonction des informations géographiques de trafic, des paramètres de déplacement des passagers de covoiturage et de l'ensemble de points de départ candidats, et calculer un coût de déplacement de chaque itinéraire de covoiturage candidat (S2300) ; sélectionner l'itinéraire de covoiturage candidat ayant le coût de déplacement le plus bas en tant qu'itinéraire de covoiturage, fournir l'itinéraire de covoiturage correspondant à la pluralité de passagers de covoiturage, et inviter chaque passager de covoiturage à participer à un déplacement de covoiturage par l'intermédiaire d'un dispositif de communication de covoiturage (S2400). La présente invention permet de réduire au minimum les coûts de déplacement pour tous les passagers de covoiturage, et d'augmenter l'efficacité de déplacement en covoiturage.
PCT/CN2018/098642 2017-09-20 2018-08-03 Procédé de planification d'itinéraire de covoiturage, client, serveur et système WO2019056875A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710855190.9A CN107679652B (zh) 2017-09-20 2017-09-20 共乘路线的规划方法、客户端、服务器及系统
CN201710855190.9 2017-09-20

Publications (1)

Publication Number Publication Date
WO2019056875A1 true WO2019056875A1 (fr) 2019-03-28

Family

ID=61137446

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/098642 WO2019056875A1 (fr) 2017-09-20 2018-08-03 Procédé de planification d'itinéraire de covoiturage, client, serveur et système

Country Status (2)

Country Link
CN (1) CN107679652B (fr)
WO (1) WO2019056875A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190360826A1 (en) * 2018-05-24 2019-11-28 International Business Machines Corporation Context based ride offer search
CN113159882A (zh) * 2021-03-23 2021-07-23 广州宸祺出行科技有限公司 一种基于拥堵路况的乘客中转方法及系统

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107679652B (zh) * 2017-09-20 2021-01-05 汉海信息技术(上海)有限公司 共乘路线的规划方法、客户端、服务器及系统
CN108955709A (zh) * 2018-07-16 2018-12-07 深圳市元征科技股份有限公司 一种班车路线规划方法、系统、设备及计算机存储介质
CN108934415B (zh) * 2018-07-20 2021-03-26 陈添发 一种共享桩
CN111125179B (zh) * 2018-10-30 2023-10-20 百度在线网络技术（北京）有限公司 出行方式确定方法、装置、设备及存储介质
CN109670671B (zh) * 2018-11-14 2023-08-04 创新先进技术有限公司 公交线网评价方法及装置
CN110619438A (zh) * 2019-09-20 2019-12-27 北京首汽智行科技有限公司 一种基于二分图的最优路径规划方法
CN113298443A (zh) * 2019-11-14 2021-08-24 广东科学技术职业学院 一种路线规划方法
CN112329961A (zh) * 2020-10-28 2021-02-05 北京嘀嘀无限科技发展有限公司 路线信息交互方法、装置、电子设备和可读存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106096749A (zh) * 2015-04-29 2016-11-09 福特全球技术公司 共乘范围轮廓
CN106101165A (zh) * 2015-04-29 2016-11-09 福特全球技术公司 共乘的长期共乘群
CN106096744A (zh) * 2015-04-29 2016-11-09 福特全球技术公司 利用情境限制的共乘路线规划
CN107679652A (zh) * 2017-09-20 2018-02-09 北京摩拜科技有限公司 共乘路线的规划方法、客户端、服务器及系统

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040158483A1 (en) * 2003-02-10 2004-08-12 Lecouturier Jacques M. Business and technological method for a flexible automobile sharing transit on demand
CN105243836B (zh) * 2015-10-14 2019-03-12 青岛众至创捷网络科技有限公司 一种拼车方法和设备
CN105678412A (zh) * 2015-12-31 2016-06-15 百度在线网络技术（北京）有限公司 面向多人乘车的路线规划方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106096749A (zh) * 2015-04-29 2016-11-09 福特全球技术公司 共乘范围轮廓
CN106101165A (zh) * 2015-04-29 2016-11-09 福特全球技术公司 共乘的长期共乘群
CN106096744A (zh) * 2015-04-29 2016-11-09 福特全球技术公司 利用情境限制的共乘路线规划
CN107679652A (zh) * 2017-09-20 2018-02-09 北京摩拜科技有限公司 共乘路线的规划方法、客户端、服务器及系统

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190360826A1 (en) * 2018-05-24 2019-11-28 International Business Machines Corporation Context based ride offer search
CN113159882A (zh) * 2021-03-23 2021-07-23 广州宸祺出行科技有限公司 一种基于拥堵路况的乘客中转方法及系统
CN113159882B (zh) * 2021-03-23 2024-05-31 广州宸祺出行科技有限公司 一种基于拥堵路况的乘客中转方法及系统

Also Published As

Publication number Publication date
CN107679652A (zh) 2018-02-09
CN107679652B (zh) 2021-01-05

Similar Documents

Publication Publication Date Title
CN107682419B (zh) 拼车路线的提供方法、客户端、服务器及拼车系统
WO2019056875A1 (fr) Procédé de planification d'itinéraire de covoiturage, client, serveur et système
US9689693B2 (en) Systems and methods for learning and displaying customized geographical navigational options
CN113029177B (zh) 基于频率的通行行程表征
US20200041291A1 (en) Multi-modal method of transportation routing
CN108151754B (zh) 出行服务的提供方法、服务器、客户端及系统
JP7275295B2 (ja) アーリーライダー及びレイトライダーをスケジューリングするシステム及び方法
US20170191849A1 (en) Parking availability system
US20210020038A1 (en) Predictive route congestion management
US20180060778A1 (en) Driver location prediction for a transportation service
US20170092130A1 (en) Automatic selection of parking spaces based on parking space attributes, driver preferences, and vehicle information
CN108062865B (zh) 停车方向提示方法及装置
JP2019527389A (ja) 過去の輸送ネットワークデータに基づいて複数の地理的地域の将来の移動量を予測するための方法、装置、デバイス、及びシステム
US20140372904A1 (en) System and method for communicating transportation events
CN108154253B (zh) 出行方式推荐方法及装置
KR102026913B1 (ko) 주문형 교통 서비스를 위한 정류장 선택 방법 및 시스템
US11584241B2 (en) Routing and charging of electric powertrain vehicle
WO2020009835A1 (fr) Systèmes et procédés de transport basés sur un transfert dynamique
JP2023087058A (ja) 情報処理システム、情報処理プログラムおよび情報処理方法
JP6439251B2 (ja) 車両管理システム及び車両管理方法
WO2018138884A1 (fr) Système de guidage de trafic, procédé de guidage de trafic, système de gestion de parc de stationnement, procédé de gestion de parc de stationnement, et support d'enregistrement
JP2016212056A (ja) 通知システム、サーバ装置、通信端末装置、プログラム及び通知方法
Peng et al. Searching parking spaces in urban environments based on non-stationary Poisson process analysis
CN113139138B (zh) 信息推荐方法和装置、电子设备、存储介质
Soni et al. Survey on vehicular cloud computing and big data

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18858486

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 10/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18858486

Country of ref document: EP

Kind code of ref document: A1