A method, apparatus, medium, and device for determining a combined trip solution
Patent Information
- Application Number
- CN202611148376.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-07-30
- Publication Date
- 2026-10-27
AI Technical Summary
四轮共享出行服务(如网约车)具有中长距离承运能力强、舒适性高、适配恶劣天气等优点,但上述场景下,在最终送达阶段经常受限于禁停规则、核心区域拥堵等因素,难以将用户高效送达最终目的地
[0023]与现有技术相比,本发明提供了一种确定组合出行方案的方法、装置、介质及设备。其方法包括:A基于用户发布的出行需求,确定规划路线,若所述规划路线的路况状态满足第一预设条件,则将满足第二预设条件的所有共享两轮车停放点组成共享两轮车还车点集合,并针对所述共享两轮车还车点集合中的每个共享两轮车还车点,将满足第三预设条件的一个或多个共享两轮车停放点,作为所述共享两轮车还车点对应的一个或多个共享两轮车借车点,遍历所述共享两轮车还车点集合,生成共享两轮车还车点及借车点组合列表,并计算其中的每对组合的得分,根据每对组合的得分,确定得分最高的若干对组合组成第二行程的候选组合列表,其中,第二行程为共享两轮车行程;B针对所述候选组合列表中的每一个共享两轮车借车点,根据第四预设条件确定所述共享两轮车借车点对应的第一行程的一个或者多个候选下车点,并确定每个候选下车点与所述共享两轮车借车点的匹配度,遍历所述候选组合列表,确定匹配度最高的若干个候选下车点,组成第一行程的候选下车点集合,其中,第一行程为网约车行程;C基于所述第一行程的候选下车点集合和所述第二行程的候选组合列表,生成包括第一行程和第二行程的若干个组合出行方案。本发明可根据用户出行需求确定规划路线,如果规划路线满足预设条件,则高效地为用户规划满足其出行需求且可履约的网约车行程和共享两轮车行程的组合出行方案,先查询、确定第二行程的共享两轮车停放点,再反向约束第一行程的网约车下车点,可提高用户出行效率,提升用户体验。
Smart Images

Figure CN122989388A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of shared mobility service technology, and in particular to a technology for determining combined travel schemes. Background Technology
[0002] With the continuous development of urbanization, the number of urban hotspots and service clusters (such as scenic spots, transportation hubs, commercial districts, science and technology parks, and sports venues) is constantly increasing. The demand for shared mobility in these areas, especially during peak hours (such as sporting events, concerts, or rush hour), is becoming increasingly prominent. Four-wheeled shared mobility services (such as ride-hailing services) have advantages such as strong long-distance transport capacity, high comfort, and adaptability to inclement weather. However, in the aforementioned scenarios, they are often limited by parking restrictions and congestion in key areas during the final delivery stage, making it difficult to efficiently transport users to their final destination. In contrast, two-wheeled shared mobility services (such as shared bicycles) have significant advantages in flexible short-distance travel, rapid arrival at the last mile, and bypassing localized congestion.
[0003] However, existing shared mobility service platforms operate their four-wheeled and two-wheeled shared mobility services as two independent sub-platforms, each providing its own service entry point. If a combination of these services is needed to reach a destination, users often have to place a four-wheeled ride order (i.e., a ride-hailing order), arrive near the destination, end the four-wheeled ride, and then manually search for available two-wheeled shared bikes near the drop-off point before scanning a code to reach their final destination. This current combination of four-wheeled and two-wheeled shared mobility requires users to manually combine the services. Especially in clustered scenarios like the areas mentioned above, even if users realize that "taking a ride-hailing car to the vicinity of the destination and then riding a shared bike to the destination" is more feasible and efficient, they cannot obtain information from the shared mobility service platform when placing an order whether there are actually two-wheeled vehicle parking spots and available two-wheeled vehicles near the destination, nor can they know where to get off the ride-hailing car to efficiently connect with available two-wheeled vehicle parking spots. The existing solution suffers from fragmented decision-making, lengthy processes, uncertain resources, and unstable fulfillment experiences, resulting in a poor user experience.
[0004] Therefore, for users who need a combination of four-wheeled and two-wheeled shared mobility solutions, how to provide an efficient and reliable combined mobility solution with unified decision-making and simplified processes to improve user travel efficiency and enhance user experience is an urgent technical problem that needs to be solved. Summary of the Invention
[0005] In order to at least partially solve the above-mentioned technical problems, the object of the present invention is to provide a method, apparatus, medium and device for determining combined travel schemes.
[0006] According to one aspect of the present invention, a method for determining combined travel options is provided, wherein the method includes: Based on the user's published travel needs, a planned route is determined. If the road conditions of the planned route meet the first preset condition, all shared two-wheeled vehicle parking points that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in the shared two-wheeled vehicle return point set, one or more shared two-wheeled vehicle parking points that meet the third preset condition are used as one or more shared two-wheeled vehicle borrowing points corresponding to the shared two-wheeled vehicle return point. The shared two-wheeled vehicle return point set is traversed to generate a list of shared two-wheeled vehicle return point and borrowing point combinations, and the score of each pair of combinations is calculated. Based on the score of each pair of combinations, the highest-scoring pairs of combinations are determined to form a candidate combination list for the second trip, where the second trip is a shared two-wheeled vehicle trip. For each shared two-wheeled vehicle rental point in the candidate combination list, one or more candidate drop-off points for the first trip corresponding to the shared two-wheeled vehicle rental point are determined according to the fourth preset condition, and the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point is determined. The candidate combination list is traversed to determine several candidate drop-off points with the highest matching degree to form a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip. Based on the candidate drop-off point set of the first trip and the candidate combination list of the second trip, several combined travel plans including the first trip and the second trip are generated.
[0007] Optionally, the calculation of the score for each pair of combinations includes: Calculate the availability score, cycling route rationality score, and cycling distance score for each pair of combinations, and determine the score of the combination based on the availability score, cycling route rationality score, and cycling distance score for each pair of combinations.
[0008] Optionally, the calculation of the availability score for each pair of combinations includes: Determine the availability score for each parking spot in each pair of combinations, and based on the availability scores of each parking spot in the combination, determine the availability score for the combination. Optionally, the availability score for each parking spot includes: Determine scores for multiple dimensions related to the parking spot, and determine the availability score of the parking spot based on the scores of the multiple dimensions, wherein the multiple dimensions include at least: the number of vehicles available for borrowing at the parking spot, historical stability, the number of vehicles available for returning, proximity to the user's destination, and parking rule / area restriction penalty value.
[0009] Optionally, determining the availability score of the parking spot based on the scores of the multiple dimensions includes: Based on the scores from the multiple dimensions, the availability score of the parking spot is determined using the following formula:
[0010] Where S is the availability score of the parking spot; R1 is the normalized score corresponding to the number of vehicles available for borrowing at the parking spot, while the return point has a value of 0; H is the normalized score corresponding to the historical stability of the parking spot; R2 is the normalized score corresponding to the number of vehicles available for returning at the parking spot, while the borrowing point has a value of 0; D is the normalized score corresponding to the proximity of the parking spot to the target location; R3 is the normalized score corresponding to the parking rule / area restriction penalty value related to the parking spot; a1-a5 are the weight values of the corresponding dimensions.
[0011] Optionally, determining the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point includes: The scores of the candidate drop-off point and the shared two-wheeled vehicle rental point are determined according to multiple dimensions. Based on the scores of the multiple dimensions, the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point is determined. The multiple dimensions include: the ride-hailing accessibility of the candidate drop-off point and the acceptability of walking from the candidate drop-off point to the shared two-wheeled vehicle rental point.
[0012] Optionally, determining the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point based on the scores of the multiple dimensions includes: Based on the scores from the multiple dimensions, the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point is determined using the following formula:
[0013] Where MS is the matching degree between a candidate drop-off point and a shared two-wheeler rental point; C is the normalized score corresponding to the ride-hailing accessibility of the candidate drop-off point; W is the normalized score corresponding to the acceptability of walking from the candidate drop-off point to the shared two-wheeler rental point; d1-d2 are the weight values of the corresponding dimensions.
[0014] Optionally, the method for determining a combined travel plan further includes: The system determines scores for each combined travel option across multiple dimensions, and based on these scores, determines the overall score of the combined travel option. It then pushes one or more combined travel options to the user based on these scores. The multiple dimensions include at least: estimated total duration, estimated total cost, estimated connection success rate, and user acceptance.
[0015] Optionally, determining the score of the combined travel plan based on the scores of multiple dimensions of each combined travel plan includes: Based on the scores from the multiple dimensions, the score of the combined travel plan is determined using the following formula:
[0016] Where TS is the score of a combined travel plan; T is the normalized score corresponding to the estimated total duration; and F is the normalized score corresponding to the estimated total cost. The normalized score corresponds to the walking distance for connecting routes; U is the normalized score for user acceptance; c1-c4 are the weight values for the corresponding dimensions.
[0017] Optionally, the method for determining a combined travel plan further includes: Based on user feedback, determine the target combination of travel options and generate and publish the corresponding travel orders.
[0018] According to another aspect of the present invention, an apparatus for determining combined travel plans is provided, wherein the apparatus comprises: The first module is used to determine the planned route based on the user's published travel needs. If the road conditions of the planned route meet the first preset condition, then all shared two-wheeled vehicle parking points that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in the shared two-wheeled vehicle return point set, one or more shared two-wheeled vehicle parking points that meet the third preset condition are used as one or more shared two-wheeled vehicle borrowing points corresponding to the shared two-wheeled vehicle return point. The shared two-wheeled vehicle return point set is traversed to generate a list of shared two-wheeled vehicle return point and borrowing point combinations, and the score of each pair of combinations is calculated. Based on the score of each pair of combinations, the highest-scoring pairs of combinations are determined to form a candidate combination list for the second trip, where the second trip is a shared two-wheeled vehicle trip. The second module is used to determine one or more candidate drop-off points for the first trip corresponding to each shared two-wheeled vehicle rental point in the candidate combination list according to the fourth preset condition, and to determine the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point. The module then traverses the candidate combination list to determine several candidate drop-off points with the highest matching degree, forming a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip. The third module is used to generate several combined travel plans, including the first trip and the second trip, based on the set of candidate drop-off points of the first trip and the list of candidate combinations of the second trip.
[0019] Optionally, the apparatus for determining a combined travel plan further includes: The fourth module is used to determine the scores of each combined travel plan across multiple dimensions, and to determine the score of the combined travel plan based on the scores of each combined travel plan across multiple dimensions, and to push one or more combined travel plans to the user based on the scores, wherein the multiple dimensions include at least: estimated total time, estimated total cost, estimated connection success rate and user acceptance.
[0020] Optionally, the apparatus for determining a combined travel plan further includes: The fifth module is used to determine the target combination of travel plans based on user feedback and to generate and publish the corresponding travel orders.
[0021] According to another aspect of the present invention, a computer-readable medium is provided, wherein computer-readable instructions are stored on the medium, which are executed by a processor to implement part or all of any of the above methods.
[0022] According to another aspect of the present invention, an apparatus for determining combined travel plans is provided, wherein the apparatus comprises: One or more processors; and a memory storing computer-readable instructions that, when executed, cause the processor to perform some or all of the operations described above.
[0023] Compared with existing technologies, the present invention provides a method, apparatus, medium, and device for determining combined travel plans. The method includes: A) determining a planned route based on user-published travel needs; if the road conditions of the planned route meet a first preset condition, then forming a shared two-wheeled vehicle return point set by combining all shared two-wheeled vehicle parking points that meet a second preset condition; for each shared two-wheeled vehicle return point in the set, selecting one or more shared two-wheeled vehicle parking points that meet a third preset condition as one or more shared two-wheeled vehicle rental points corresponding to the return point; traversing the shared two-wheeled vehicle return point set to generate a list of shared two-wheeled vehicle return point and rental point combinations; calculating the score of each pair of combinations; and determining the highest-scoring combinations based on the scores of each pair of combinations. A) A candidate combination list for the second trip is generated, wherein the second trip is a shared two-wheeled vehicle trip; B) For each shared two-wheeled vehicle rental point in the candidate combination list, one or more candidate drop-off points for the first trip corresponding to the shared two-wheeled vehicle rental point are determined according to a fourth preset condition, and the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point is determined. The candidate combination list is traversed to determine several candidate drop-off points with the highest matching degree, forming a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip; C) Based on the set of candidate drop-off points for the first trip and the candidate combination list for the second trip, several combined travel schemes including the first trip and the second trip are generated. This invention can determine the planned route according to the user's travel needs. If the planned route meets the preset conditions, it can efficiently plan a combined travel scheme of ride-hailing and shared two-wheeled vehicle trips that meets the user's travel needs and is feasible. By first querying and determining the shared two-wheeled vehicle parking points for the second trip, and then constraining the ride-hailing drop-off points for the first trip, the user's travel efficiency and user experience can be improved. Attached Figure Description
[0024] Other features, objects, and technical effects of the present invention will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings: Figure 1 A schematic diagram of a method for determining a combined travel scheme according to one aspect of the present invention is shown; Figure 2 A schematic diagram of an apparatus for determining a combined travel scheme according to another aspect of the present invention is shown; The same or similar reference numerals in the accompanying drawings represent the same or similar parts. Detailed Implementation
[0025] The present invention will now be described in further detail with reference to the accompanying drawings.
[0026] In a typical configuration of various embodiments of the present invention, the method execution entity, trusted parties of the system, and / or modules of the device may include one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0027] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.
[0028] Computer-readable media include both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include non-transitory computer-readable media, such as modulated data signals and carrier waves.
[0029] Existing shared mobility service platforms operate their four-wheeled and two-wheeled shared mobility services as two independent sub-platforms, each providing its own service entry point. If a user has a combined travel need for four-wheeled shared mobility (or ride-hailing) and two-wheeled shared mobility (or bike-sharing, including shared bicycles and electric bicycles), and it's confirmed that the ride-hailing service cannot directly reach the destination, the user must manually break down their needs, first checking for nearby two-wheeled vehicle parking spots, and then determining the ride-hailing drop-off point. This lack of a platform-level integrated approach and automatic generation of combined travel solutions results in high barriers to entry and a lengthy decision-making process. Furthermore, after a user disembarks from the ride-hailing service and arrives at a two-wheeled vehicle parking spot, there may be situations where both parking spots are temporarily unavailable or no vehicles are available, causing a disconnect between the actual implementation of the combined travel plan and the platform's recommendations. Therefore, the existing combined travel solutions are inefficient, potentially leading to a disconnect in actual implementation and a poor user experience. On the other hand, existing shared mobility service platforms operate four-wheeled and two-wheeled shared mobility services as two separate sub-businesses. General navigation-style recommendations can usually only provide suggestions such as "you can take a taxi here and then ride a bike." They have not formed a unified order category and a unified fulfillment chain, and cannot directly generate a combined travel solution that is payable, dispatchable, executable, monitorable, and has a safety net. They cannot leverage cross-category synergy value and it is difficult to form a truly operable category capability.
[0030] This invention provides a technical solution for determining combined travel options based on a shared mobility service platform, so as to efficiently provide users with feasible combined travel options related to their travel needs and improve user experience.
[0031] To further illustrate the technical means adopted and the effects achieved by the present invention, the technical solution of the present invention will be clearly and completely described below in conjunction with the accompanying drawings and embodiments and / or optional embodiments.
[0032] It should be noted that the collection, storage, use, processing, transmission, provision, disclosure, and application of relevant information and / or data involved in this invention shall comply with relevant laws, regulations, and standards, shall not violate public order and good morals, shall not harm the public interest, and necessary confidentiality measures may be taken as needed.
[0033] Figure 1 The diagram illustrates a method for determining combined travel options according to one aspect of the present invention, wherein one embodiment of the method includes: S101 determines the planned route based on the user's published travel demand. If the road condition of the planned route meets the first preset condition, then all shared two-wheeled vehicle parking points that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in the shared two-wheeled vehicle return point set, one or more shared two-wheeled vehicle parking points that meet the third preset condition are used as one or more shared two-wheeled vehicle borrowing points corresponding to the shared two-wheeled vehicle return point. The shared two-wheeled vehicle return point set is traversed to generate a list of shared two-wheeled vehicle return point and borrowing point combinations, and the score of each pair of combinations is calculated. Based on the score of each pair of combinations, the highest-scoring pairs of combinations are determined to form a candidate combination list for the second trip, where the second trip is a shared two-wheeled vehicle trip. S102 For each shared two-wheeled vehicle rental point in the candidate combination list, determine one or more candidate drop-off points for the first trip corresponding to the shared two-wheeled vehicle rental point according to the fourth preset condition, and determine the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point. Traverse the candidate combination list to determine several candidate drop-off points with the highest matching degree to form a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip. S103 generates several combined travel plans including the first trip and the second trip based on the candidate drop-off point set of the first trip and the candidate combination list of the second trip.
[0034] This invention provides a method for determining combined travel plans based on a shared mobility service platform 10. The shared mobility service platform 10 may include a server 100, a user terminal (or client) 200, and a driver client 300. The server 100 includes one or more computer devices capable of data acquisition, processing, storage, and transmission. The user terminal 200 and driver client 300 both include smart terminal devices with an application (or app) corresponding to the shared mobility service platform installed. Users submit travel requests, including at least origin, destination, and travel time information, and perform related interactive operations to the server 100 through the app on the user terminal 200. Ride-hailing drivers receive orders issued by the server and perform related interactive operations through the app on the driver client 300. The computer devices include, but are not limited to, servers, network hosts, single network servers, or network server clusters. The smart terminal devices include, but are not limited to, smartphones, smart wearable devices, and tablets. The computer devices and smart terminal devices mentioned here are merely examples; other existing or future devices and / or resource platforms applicable to this invention should also be included within the scope of protection of this invention, and are hereby incorporated by reference.
[0035] In this embodiment, a user publishes a travel request through the user terminal 200. This travel request should at least include information such as origin information, destination information, and travel time. In step S101, the server 100 can process the received user travel request based on an integrated digital map and LBS (Location Based Services). Based on the relevant information (e.g., origin and destination information), it can determine the planned route from the origin to the destination. Combining travel time and historical data, it can determine whether the road conditions of the planned route meet a first preset condition. If they do, all shared two-wheeled vehicle parking spots that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in this set, one or more shared two-wheeled vehicle parking spots that meet the third preset condition are designated as one or more shared two-wheeled vehicle rental points corresponding to that return point. By traversing each shared two-wheeled vehicle return point in the set, a list of combinations of shared two-wheeled vehicle return points and pick-up points can be obtained. The score of each pair of combinations is calculated, and based on the scores of each pair, a candidate combination list for the second trip is determined, where the second trip is a shared two-wheeled vehicle trip. For example, the first preset condition may include: congestion on some sections of the planned route, and congestion or severe congestion on sections near the destination (e.g., including the last 5% of the route). The second preset condition may include: shared two-wheeled vehicle parking points outside the congested sections near the destination, but within a preset threshold (e.g., 500 meters) around the destination. The third preset condition may include: shared two-wheeled vehicle parking points outside the congested sections near the destination, but within a preset threshold (e.g., 2000 meters) centered on the shared two-wheeled vehicle return point.
[0036] Continuing in this embodiment, in step S102, the server 100 can, for each shared two-wheeled vehicle rental point in the candidate combination list of the second trip, determine one or more candidate drop-off points for the first trip corresponding to that shared two-wheeled vehicle rental point according to a fourth preset condition, and determine the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point. After traversing each shared two-wheeled vehicle rental point in the candidate combination list of the second trip, it determines several candidate drop-off points with the highest matching degree to form a set of candidate drop-off points for the first trip, where the first trip is a ride-hailing trip. For example, the fourth preset condition may include: being within a preset threshold (e.g., 200 meters) of the shared two-wheeled vehicle rental point and meeting the requirements of being accessible by ride-hailing vehicles and legally allowing temporary parking + being accessible on foot to the shared two-wheeled vehicle rental point.
[0037] Continuing in this embodiment, in step S103, the server 100 can generate several combined travel plans including the first trip and the second trip based on the candidate drop-off point set of the first trip (ride-hailing trip) determined in step S102 and the candidate combination list of the second trip (shared two-wheeler trip) determined in step S101. In each combined travel plan, after the user arrives at the drop-off point of the first trip by ride-hailing, the user walks to the shared two-wheeler rental point of the second trip, scans the code to pick up the vehicle, and begins the second trip.
[0038] Through the above embodiments, server 100 can efficiently determine a combination of ride-hailing and shared two-wheeler trips that meet user travel needs based on preset conditions. It first queries and determines the shared two-wheeler parking location for the second trip, and then uses this information to restrict the ride-hailing drop-off point for the first trip. The determined combination of trips can be pushed to user terminal 200 for user reference when placing an order, improving user travel efficiency and enhancing user experience.
[0039] Optionally, in step S101, calculating the score for each pair of combinations includes: Calculate the availability score, cycling route rationality score, and cycling distance score for each pair of combinations, and determine the score of the combination based on the availability score, cycling route rationality score, and cycling distance score for each pair of combinations.
[0040] In this optional embodiment, the server 100 can calculate the scores of each pair of shared two-wheeled vehicle return and rental points in multiple dimensions, such as availability, riding route rationality, and riding distance. Based on the availability score, riding route rationality score, and riding distance score of each pair of combinations, the server 100 can determine the score of the combination by means of arithmetic average or weighted summation.
[0041] Optionally, the calculation of the availability score for each pair of combinations includes: Determine the availability score for each parking spot in each pair of combinations, and determine the availability score for the combination based on the availability scores of each parking spot in the combination.
[0042] In this optional embodiment, the server 100 can determine the availability score of each parking point (i.e., the pick-up and drop-off points in each pair of combinations) and determine the availability score of the combination based on the availability scores of each parking point in the combination, using methods such as arithmetic average or weighted summation. For example, a weighted summation method can be used to determine the availability score of the combination. If a user ends their ride-hailing trip (i.e., the first trip) and walks from the drop-off point to a shared two-wheeler pick-up point but finds no bikes available, the subsequent shared two-wheeler trip (i.e., the second trip) cannot start in time, and may even prevent the user from reaching their destination on time, resulting in the greatest loss of user experience. The drop-off point primarily focuses on whether the bike can be returned on time, and shared two-wheelers typically have a higher tolerance for return errors; even slight fluctuations are unlikely to prevent the second trip from starting. Therefore, the weight of the pick-up point can be preset to be higher than that of the drop-off point.
[0043] Optionally, the availability score for each parking spot includes: Determine scores for multiple dimensions related to the parking spot, and determine the availability score of the parking spot based on the scores of the multiple dimensions, wherein the multiple dimensions include at least: the number of vehicles available for borrowing at the parking spot, historical stability, the number of vehicles available for returning, proximity to the user's destination, and parking rule / area restriction penalty value.
[0044] In this optional embodiment, the server 100 can determine multiple dimension scores related to the shared two-wheeled vehicle parking point, which may include at least the following dimensions: the number of vehicles available for borrowing at the shared two-wheeled vehicle parking point (this dimension is valid relative to the borrowing point), historical stability, the number of vehicles available for return (this dimension is valid relative to the return point), proximity to the user's destination, parking rules / area restriction penalty value, etc., and can determine the availability score of the shared two-wheeled vehicle parking point by means of arithmetic average or weighted summation based on the scores of these multiple dimensions.
[0045] Optionally, determining the availability score of the parking spot based on the scores of the multiple dimensions includes: Based on the scores from the multiple dimensions, the availability score of the parking spot is determined using the following formula:
[0046] Where S is the availability score of the parking spot; R1 is the normalized score corresponding to the number of vehicles available for borrowing at the parking spot, while the return point has a value of 0; H is the normalized score corresponding to the historical stability of the parking spot; R2 is the normalized score corresponding to the number of vehicles available for returning at the parking spot, while the borrowing point has a value of 0; D is the normalized score corresponding to the proximity of the parking spot to the target location; R3 is the normalized score corresponding to the parking rule / area restriction penalty value related to the parking spot; a1-a5 are the weight values of the corresponding dimensions.
[0047] In this optional embodiment, server 100 can determine the availability score of a shared two-wheeled vehicle parking spot according to the following formula (1): (1) Wherein, S is the availability score of the parking spot; R1 is the normalized score corresponding to the number of vehicles available for borrowing at the car rental spot, while the return point has a value of 0; H is the normalized score corresponding to the historical stability of the parking spot; R2 is the normalized score corresponding to the number of vehicles available for returning at the car rental spot, while the borrowing point has a value of 0; D is the normalized score corresponding to the proximity of the parking spot to the target location (i.e., the destination in the user's travel needs); R3 is the normalized score corresponding to the parking rule / area restriction penalty value related to the parking spot; a1-a5 are the weight values of the corresponding dimensions, and the sum of the weights is 1.
[0048] Where S is the availability score of the parking spot; R1 is min(shared two-wheeler available vehicle data / preset available vehicle number threshold, 1), if the number of available vehicles at the parking spot is the preset threshold, for example, 10 vehicles, then R1 is 1; R2 is min(shared two-wheeler returnable vehicle data / preset returnable vehicle number threshold, 1), if the number of returnable vehicles at the returnable spot is the preset threshold, for example, 5 vehicles, then R2 is 1; H is the historical rental (relative to the rental spot) or return (relative to the return spot) score of the parking spot. Number of successful attempts / Total number of historical queries; D is set to max(0, (1 - distance from parking point to target location / preset distance upper limit threshold)), where the distance from the pick-up point to the drop-off point of the ride-hailing trip or the distance from the return point to the user's destination is within the preset distance upper limit threshold, for example, 200 meters; R3 is set to the parking rules / area restriction penalty value related to the parking point. If there are no restrictions, R3 is set to 0. If parking is restricted in some areas / time periods, it can be set to 0.5. If the relevant area is closed and parking is prohibited at all times, it can be set to 1.
[0049] In the above embodiments and / or optional embodiments, the cycling route rationality score is related to the cycling route quality. For example, the cycling route rationality score can be determined according to the following formula (2): (2) in, The system scores the rationality of the cycling route; P1 is the detour coefficient, which takes into account the directness of the cycling route and is calculated as the length of the cycling route / the straight-line distance between two points (the bike rental point and the bike return point); P2 is the obstacle coefficient, which is calculated as the number of traffic lights and intersections along the route / a preset upper limit threshold; P3 is the climbing coefficient, which is calculated as (1 - cumulative climbing gradient / preset maximum gradient threshold); b1–b3 are the corresponding weight values, and the sum of each weight is 1.
[0050] In the above embodiments and / or optional embodiments, a shorter or longer riding distance is not necessarily better. If the riding distance is too short, there's no need to scan the code to ride a shared two-wheeler; it's better to walk directly from the ride-hailing drop-off point to the destination. If the riding distance is too long, it can easily lead to fatigue. Therefore, a riding distance score can be determined by combining a preset range of suitable riding distances. For example, a preset suitable riding distance range for shared two-wheelers can be used. (This can be adjusted according to the application scenario, for example,) Assuming the cycling distance from the rental point to the return point for a pair of bikes is L, the cycling distance score is... If L falls Within the range, the cycling distance score is calculated. The possible value is 1; if In other words, a shorter cycling distance results in a higher cycling distance score. It can be determined according to the following formula (3); if In other words, the longer the cycling distance, the higher the cycling distance score. It can be determined according to the following formula (4).
[0051] (3) (4) Optionally, in step S102, determining the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point includes: The scores of the candidate drop-off point and the shared two-wheeled vehicle rental point are determined according to multiple dimensions. Based on the scores of the multiple dimensions, the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point is determined. The multiple dimensions include: the ride-hailing accessibility of the candidate drop-off point and the acceptability of walking from the candidate drop-off point to the shared two-wheeled vehicle rental point.
[0052] For each shared two-wheeled vehicle rental point in the candidate combination list of the second trip, which includes several pairs of shared two-wheeled vehicle rental and return points determined in step S101, one or more candidate drop-off points for the first trip corresponding to the shared two-wheeled vehicle rental point can be determined according to the fourth preset condition. In this optional embodiment, the server 100 can determine the scores of a candidate drop-off point and the shared two-wheeled vehicle rental point in multiple dimensions, and determine the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point based on the obtained scores of multiple dimensions. The multiple dimensions include: the ride-hailing accessibility of the candidate drop-off point and the acceptability of walking from the candidate drop-off point to the shared two-wheeled vehicle rental point.
[0053] Optionally, determining the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point based on the scores of the multiple dimensions includes: Based on the scores from the multiple dimensions, the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point is determined using the following formula:
[0054] Where MS is the matching degree between a candidate drop-off point and a shared two-wheeler rental point; C is the normalized score corresponding to the ride-hailing accessibility of the candidate drop-off point; W is the normalized score corresponding to the acceptability of walking from the candidate drop-off point to the shared two-wheeler rental point; d1-d2 are the weight values of the corresponding dimensions.
[0055] In this optional embodiment, the server 100 may use the following formula (5) to determine the matching degree between a candidate drop-off point and the corresponding shared two-wheeled vehicle rental point: (5) Where MS is the matching degree between the candidate drop-off point and its corresponding shared two-wheeler rental point; C is the normalized score corresponding to the ride-hailing accessibility of the candidate drop-off point; W is the normalized score corresponding to the acceptability of walking from the candidate drop-off point to the corresponding shared two-wheeler rental point; d1-d2 are the weight values of the corresponding dimensions, and the sum of the weights is 1.
[0056] For example, C and W can be determined using the following formulas (6) and (7), respectively: (6) (7) in, This indicates the distance the ride-hailing service will travel between the candidate drop-off point and the recommended pick-up point for the ride-hailing trip. This represents the upper limit threshold for the ride-hailing distance between the candidate drop-off point and the recommended pick-up point for the ride-hailing trip. This indicates the walking distance from the candidate drop-off point to the shared two-wheeler rental point. To preset the upper limit threshold of the walking distance from the candidate drop-off point to the shared two-wheeler rental point, for example, 1500 meters.
[0057] Optionally, the method for determining a combined travel plan further includes: S104 determines the scores of each combined travel plan across multiple dimensions, and determines the score of the combined travel plan based on the scores of each combined travel plan across multiple dimensions, and pushes one or more combined travel plans to the user based on the scores, wherein the multiple dimensions include at least: estimated total time, estimated total cost, estimated connection success rate and user acceptance.
[0058] After determining several combined travel options corresponding to the user's travel needs in step S103, in this optional embodiment, in step S104, the server 100 can determine the scores of multiple dimensions of each combined travel option, and determine the score of each combined travel option based on the scores of multiple dimensions of each combined travel option, and push the one or multiple combined travel options with the highest relevance to the user's travel needs to the user terminal 200 based on the scores of each combined travel option. The multiple dimensions of the combined travel option include at least: estimated total time, estimated total cost, estimated connection success rate and user acceptance.
[0059] Optionally, determining the score of the combined travel plan based on the scores of multiple dimensions of each combined travel plan includes: Based on the scores from the multiple dimensions, the score of the combined travel plan is determined using the following formula:
[0060] Where TS is the score of a combined travel plan; T is the normalized score corresponding to the estimated total duration; and F is the normalized score corresponding to the estimated total cost. The normalized score corresponds to the walking distance for connecting routes; U is the normalized score for user acceptance; c1-c4 are the weight values for the corresponding dimensions.
[0061] In this optional embodiment, the server 100 can determine the score of the combined travel plan based on the scores of multiple dimensions of the determined combined travel plan using the following formula (8): (8) Where TS is the score of a combined travel plan; T is the normalized score corresponding to the estimated total duration; and F is the normalized score corresponding to the estimated total cost. The normalized score corresponds to the walking distance for connecting trips (i.e., the walking distance from the drop-off point of a ride-hailing trip to the pick-up point of a shared two-wheeler trip in a combined travel plan); U is the normalized score corresponding to user acceptance; c1-c4 are the weight values of the corresponding dimensions, and the sum of the weights is 1.
[0062] For example, T, F, The values of U can be determined by the following formulas (9)-(11). U can be set according to the user type. For example, if the user is a student whose age meets the requirements, U can be 0.3; if the user is a young or middle-aged person, U can be 1; and if the user is an elderly person, U can be 0.2.
[0063] (9) (10) (11) in, Indicates the maximum estimated total duration; Indicates the estimated total duration; This indicates the minimum estimated total duration; This indicates the maximum estimated total cost; This indicates the estimated total cost; Indicates the minimum estimated total cost; L represents the walking distance to the connecting point; This indicates the upper limit threshold for the walking distance for connecting routes, for example, 1500 meters.
[0064] Optionally, the method for determining a combined travel plan further includes: Based on user feedback, S105 determines the target combination travel plan and generates and publishes the corresponding travel order.
[0065] In step S104, the server 100 pushes one or more highly relevant travel options to the user's client 200, which are most relevant to the user's travel needs. The user can then select an option through the client 200 and send feedback to the server 100. In this optional embodiment, the server 100 can determine the target travel option corresponding to the user's selection feedback based on the received feedback, generate a corresponding travel order, and publish it to the client 200 and the ride-hailing driver client 300. Once the ride-hailing driver accepts the order, the order status is updated synchronously, and the order is executed.
[0066] The above embodiments and / or optional embodiments provide a method for determining combined travel plans. The server 100 of the shared mobility service platform 10 can determine planned routes based on user travel requests published through the user terminal 200. If the planned routes meet preset conditions, it efficiently plans a combined travel plan for the user that meets their travel needs and is feasible, consisting of a ride-hailing trip and a shared two-wheeler trip. First, it queries and determines the shared two-wheeler parking point for the second trip (shared two-wheeler trip), and then reversely constrains the ride-hailing drop-off point for the first trip (ride-hailing trip). This method is particularly suitable for crowded scenarios, improving user ordering efficiency and travel efficiency, and enhancing user experience. Furthermore, the server 100 also determines scores for each combined travel plan across multiple dimensions, thereby determining the score for each combined travel plan. Based on the scores of each combined travel plan, it selects the highest-scoring or several high-scoring combined travel plans and pushes them to the user terminal 200 for user selection. Furthermore, the server 100 also determines the target combined travel plan based on user feedback, generating and publishing the corresponding order. This improves user travel efficiency and further enhances user experience. On the other hand, by integrating ride-hailing and shared two-wheeler services, shared service platforms can significantly improve cross-business collaboration capabilities and bilateral resource utilization, thereby enhancing overall efficiency.
[0067] In an exemplary scenario, a user plans to visit a popular tourist attraction on the weekend. The area around the main entrance of this attraction is subject to flow control and temporary traffic restrictions, preventing ride-hailing services from directly reaching the vicinity of the main entrance. However, there are shared two-wheeled vehicle parking spots near the parking area close to the main entrance, which can be used for pick-up after the user drops off their ride-hailing vehicle. When the user publishes their travel request through the user terminal 200 of the shared mobility service platform 10, with the starting point being the user's residential area entrance S in the city and the destination being the main entrance of the popular tourist attraction, the server terminal 100 of the shared mobility service platform 10 receives the travel request. Based on the starting point and destination, it determines the planned route and, based on historical data, determines that the road sections near the destination of the planned route will be restricted on weekends. Therefore, it initiates a combined travel solution determination process: first, it identifies shared two-wheeled vehicle parking spots P1 and P2 near the destination that meet the conditions and can be used as return points; then, for P1 and P2 respectively, it identifies corresponding shared two-wheeled vehicle parking spots P3, P4, and P5 that meet the conditions and can be used as pick-up points. A candidate combination list {(P1, P3), (P1, P4), (P2, P5)} can be obtained. Then, it is identified that N1 and N2 at the north and south ends of the eastern temporary parking area near P3 can be used as ride-hailing drop-off points, N1 at the south end of the eastern temporary parking area near P4 can be used as a ride-hailing drop-off point, and N3 at the south end of the western temporary parking area near P5 can be used as a ride-hailing drop-off point. Then, the server 100 can generate combination travel scheme 1 (S→N1, P3→P1), combination travel scheme 2 (S→N2, P3→P1), combination travel scheme 3 (S→N1, P4→P1), and combination travel scheme 4 (S→N3, P5→P2). Furthermore, the server 100 can calculate scores for multiple dimensions of each combined travel plan, thereby determining the score of each combined travel plan. The server then pushes the combined travel plan with the highest score (let's say combined travel plan 1) or the two highest-scoring combined travel plans (let's say combined travel plans 1 and 4) to the user client 200 for the user to choose from. Further, based on the user's selection feedback, the server 100 determines the corresponding combined travel plan as the target travel plan. For example, for combined travel plan 1, it generates a combined order (S→N1, P3→P1) and publishes it to the user client 200 and the ride-hailing driver client 300.
[0068] Figure 2 An apparatus for determining a combined travel plan according to another aspect of the present invention is shown, wherein, in one embodiment, the apparatus includes: The first module 210 is used to determine the planned route based on the user's published travel demand. If the road condition of the planned route meets the first preset condition, then all shared two-wheeled vehicle parking points that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in the shared two-wheeled vehicle return point set, one or more shared two-wheeled vehicle parking points that meet the third preset condition are used as one or more shared two-wheeled vehicle borrowing points corresponding to the shared two-wheeled vehicle return point. The shared two-wheeled vehicle return point set is traversed to generate a list of shared two-wheeled vehicle return point and borrowing point combinations, and the score of each pair of combinations is calculated. Based on the score of each pair of combinations, the highest-scoring pairs of combinations are determined to form a candidate combination list for the second trip, where the second trip is a shared two-wheeled vehicle trip. The second module 220 is used to determine one or more candidate drop-off points for each shared two-wheeled vehicle rental point in the candidate combination list according to the fourth preset condition, and to determine the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point. The module traverses the candidate combination list to determine several candidate drop-off points with the highest matching degree to form a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip. The third module 230 is used to generate several combined travel plans including the first trip and the second trip based on the candidate drop-off point set of the first trip and the candidate combination list of the second trip.
[0069] In this embodiment of the device, the device is deployed on the server side of the shared mobility service platform, and its hardware and software environment is the same as that of the aforementioned server 100.
[0070] In this embodiment of the device, the first module 210 can process the received user travel requests based on the integrated digital map and LBS service. It can determine the planned route from the origin to the destination based on relevant information (e.g., origin and destination information), and, combined with travel time and historical data, determine whether the road conditions of the planned route meet a first preset condition. If they do, all shared two-wheeled vehicle parking points that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in this set, one or more shared two-wheeled vehicle parking points that meet the third preset condition are designated as one or more shared two-wheeled vehicle rental points corresponding to that return point. By traversing each shared two-wheeled vehicle return point in the set, a list of shared two-wheeled vehicle return point and rental point combinations can be obtained. The score of each pair of combinations is calculated, and based on the scores of each pair, the highest-scoring pairs are determined to form a candidate combination list for the second trip, where the second trip is a shared two-wheeled vehicle trip.
[0071] Continuing with this device embodiment, through the second module 220 of the device, for each shared two-wheeled vehicle rental point in the candidate combination list of the second trip, one or more candidate drop-off points corresponding to the shared two-wheeled vehicle rental point can be determined according to the fourth preset condition, and the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point can be determined. After traversing each shared two-wheeled vehicle rental point in the candidate combination list of the second trip, several candidate drop-off points with the highest matching degree are determined to form a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip.
[0072] Continuing with this device embodiment, the third module 230 of the device can generate several combined travel plans including the first trip and the second trip based on the candidate drop-off point set of the first trip (ride-hailing trip) determined by the second module 220 and the candidate combination list of the second trip (shared two-wheeled vehicle trip) determined by the first module 210. In each combined travel plan, after the user arrives at the drop-off point of the first trip by ride-hailing, the user walks to the shared two-wheeled vehicle rental point of the second trip, scans the code to pick up the vehicle, and begins the second trip.
[0073] Through the device described in the above embodiment, the server 100 can efficiently determine a combination of ride-hailing and shared two-wheeler trips that can be fulfilled based on user travel needs that meet preset conditions. It first queries and determines the shared two-wheeler parking point for the second trip, and then uses this information to restrict the ride-hailing drop-off point for the first trip. The determined combination of travel plans can be pushed to the user terminal 200 for the user to refer to and place an order, improving user travel efficiency and enhancing the user experience.
[0074] Optionally, the apparatus for determining a combined travel plan further includes: The fourth module 240 is used to determine the scores of each combined travel plan in multiple dimensions, and to determine the score of the combined travel plan based on the scores of each combined travel plan in multiple dimensions, and to push one or more combined travel plans to the user based on the scores, wherein the multiple dimensions include at least: estimated total time, estimated total cost, estimated connection success rate and user acceptance.
[0075] In this optional device embodiment, the fourth module 240 of the device can also determine the scores of multiple dimensions of each combined travel plan, and determine the score of each combined travel plan based on the scores of multiple dimensions of each combined travel plan, and push one or more combined travel plans with the highest relevance to the user's travel needs to the user terminal 200 based on the scores of each combined travel plan. The multiple dimensions of the combined travel plan include at least: estimated total time, estimated total cost, estimated connection success rate and user acceptance.
[0076] Optionally, the apparatus for determining a combined travel plan further includes: The fifth module, 250, is used to determine the target combination travel plan based on the user's selection feedback, and to generate and publish the corresponding travel order.
[0077] When the fourth module 240 pushes one or more highly relevant travel options to the user's client 200, the user can select one option and send feedback to the server 100. In this optional device embodiment, the fifth module 250 of the device can also determine the target combination travel option corresponding to the user's selection feedback based on the received user feedback, generate a corresponding travel order, and publish it to the user's client 200 and the ride-hailing driver's client 300. When the ride-hailing driver accepts the order, the order status is updated synchronously, and the order is executed.
[0078] Through the above-described device embodiments and / or optional embodiments, the server 100 can determine the planned route based on the user's travel needs published through the user terminal 200. If the planned route meets preset conditions, it efficiently plans a combined travel solution for the user that meets their travel needs and is feasible, consisting of a ride-hailing trip and a shared two-wheeler trip. It first queries and determines the shared two-wheeler parking point for the second trip (shared two-wheeler trip), and then reversely constrains the ride-hailing drop-off point for the first trip (ride-hailing trip). This is particularly suitable for crowded scenarios, improving user ordering efficiency and travel efficiency, and enhancing user experience. Furthermore, the server 100 also determines the scores of each combined travel solution across multiple dimensions, thereby determining the score for each combined travel solution. Based on the scores of each combined travel solution, it selects the highest-scoring or several high-scoring combined travel solutions and pushes them to the user terminal 200 for the user to choose from. Furthermore, the server 100 also determines the target combined travel solution based on the user's selection feedback, generating and publishing the corresponding order. This improves user travel efficiency and further enhances user experience. On the other hand, by integrating ride-hailing and shared two-wheeler services, shared service platforms can significantly improve cross-business collaboration capabilities and bilateral resource utilization, thereby enhancing overall efficiency.
[0079] In the above-described device embodiments and / or optional embodiments, the functions / roles that can be executed / realized by the various component modules / parts of the device are the same as those in the aforementioned related method embodiments and / or optional embodiments, and will not be repeated here.
[0080] According to another aspect of the present invention, a computer-readable medium is also provided, the computer-readable medium storing computer-readable instructions that can be executed by a processor to implement some or all of the foregoing method embodiments and / or optional embodiments.
[0081] It should be noted that the method embodiments and / or optional embodiments in this invention do not strictly limit the order of execution of each step, as long as the method embodiments and / or optional embodiments can solve the defects existing in the prior art, achieve the inventive purpose of this invention, and obtain beneficial effects. The method embodiments and / or optional embodiments in this invention can be implemented in software and / or combinations of software and hardware. The software program involved in this invention can be executed by a processor to implement the steps or functions of the above embodiments. Similarly, the software program of this invention (including related data structures) can be stored in a computer-readable recording medium.
[0082] Furthermore, part or all of the present invention can be applied as a computer program product, such as computer program instructions, which, when executed by a computer, can invoke or provide the methods and / or technical solutions according to the present invention through the operation of the computer. The program instructions invoking the methods of the present invention may be stored in a fixed or removable recording medium, and / or transmitted via a data stream in a broadcast or other signal carrying medium, and / or stored in the working memory of a computer device operating according to the program instructions.
[0083] According to another aspect of the present invention, an apparatus for determining a combined travel plan is also provided. The apparatus includes: a memory for storing computer program instructions and a processor for executing the program instructions, wherein when the computer program instructions are executed by the processor, the apparatus is triggered to run part or all of the methods and / or technical solutions of the foregoing embodiments.
[0084] It will be apparent to those skilled in the art that the present invention is not limited to the details of the exemplary embodiments described above, and that the invention can be implemented in other specific forms without departing from its spirit or essential characteristics. Therefore, the embodiments should be considered in all respects as exemplary and non-limiting, and the scope of the invention is defined by the appended claims rather than the foregoing description. Thus, all variations falling within the meaning and scope of equivalents of the claims are intended to be embraced within the present invention. No reference numerals in the claims should be construed as limiting the scope of the claims.
[0085] In this invention, when terms such as "upper," "lower," "left," "right," "front," "rear," "top," "bottom," "inner," "outer," "middle," "vertical," "horizontal," "lateral," and "longitudinal" are used, the indicated orientation and / or positional relationship is based on the orientation and / or positional relationship shown in the accompanying drawings. These terms are primarily for the purpose of better describing this invention and its embodiments, and are not intended to limit the indicated device, element, or component to having a specific orientation, or to be constructed and operated in a specific orientation. Furthermore, some of the above terms, in addition to indicating orientation or positional relationship, can also be used to indicate other meanings; for example, the term "upper" can also be used in some cases to indicate a certain dependency or connection relationship. Those skilled in the art can understand the specific meaning of these terms in this invention according to the specific circumstances.
[0086] Furthermore, the terms "installation," "setup," "equipped with," "connection," and "linked" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral structure; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection via an intermediate medium; and they can refer to an internal connection between two devices, elements, or components. Those skilled in the art can understand the specific meaning of these terms in this invention based on the specific circumstances.
[0087] Furthermore, the terms "first," "second," etc., are primarily used to distinguish different devices, units, modules, elements, circuits, or components (which may be the same or different in specific type and construction), and are not intended to indicate or imply the relative importance, order, and / or quantity of the indicated devices, units, modules, elements, circuits, or components. Unless otherwise stated, "a plurality of" means two or more.
[0088] Furthermore, it is clear that the word "comprising" does not exclude other units or steps, and the singular does not exclude the plural. Multiple units or devices recited in the device claims may also be implemented by a single unit or device through software and / or hardware.
Claims
1. A method for determining combined travel options, characterized in that, The method includes: Based on the user's published travel needs, a planned route is determined. If the road conditions of the planned route meet the first preset condition, all shared two-wheeled vehicle parking points that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in the shared two-wheeled vehicle return point set, one or more shared two-wheeled vehicle parking points that meet the third preset condition are used as one or more shared two-wheeled vehicle borrowing points corresponding to the shared two-wheeled vehicle return point. The shared two-wheeled vehicle return point set is traversed to generate a list of shared two-wheeled vehicle return point and borrowing point combinations, and the score of each pair of combinations is calculated. Based on the score of each pair of combinations, the highest-scoring pairs of combinations are determined to form a candidate combination list for the second trip, where the second trip is a shared two-wheeled vehicle trip. For each shared two-wheeled vehicle rental point in the candidate combination list, one or more candidate drop-off points for the first trip corresponding to the shared two-wheeled vehicle rental point are determined according to the fourth preset condition, and the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point is determined. The candidate combination list is traversed to determine several candidate drop-off points with the highest matching degree to form a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip. Based on the candidate drop-off point set of the first trip and the candidate combination list of the second trip, several combined travel plans including the first trip and the second trip are generated.
2. The method according to claim 1, characterized in that, The calculation of the score for each pair of combinations includes: Calculate the availability score, cycling route rationality score, and cycling distance score for each pair of combinations, and determine the score of the combination based on the availability score, cycling route rationality score, and cycling distance score for each pair of combinations.
3. The method according to claim 2, characterized in that, The calculation of the availability score for each pair of combinations includes: Determine the availability score for each parking spot in each pair of combinations, and determine the availability score for the combination based on the availability scores of each parking spot in the combination.
4. The method according to claim 3, characterized in that, The availability score for each parking spot includes: Determine scores for multiple dimensions related to the parking spot, and determine the availability score of the parking spot based on the scores of the multiple dimensions, wherein the multiple dimensions include at least: the number of vehicles available for borrowing at the parking spot, historical stability, the number of vehicles available for returning, proximity to the user's destination, and parking rule / area restriction penalty value.
5. The method according to claim 4, characterized in that, The process of determining the availability score of the parking spot based on the scores of the multiple dimensions includes: Based on the scores from the multiple dimensions, the availability score of the parking spot is determined using the following formula: Where S is the availability score of the parking spot; R1 is the normalized score corresponding to the number of vehicles available for borrowing at the parking spot, while the return point has a value of 0; H is the normalized score corresponding to the historical stability of the parking spot; R2 is the normalized score corresponding to the number of vehicles available for returning at the parking spot, while the borrowing point has a value of 0; D is the normalized score corresponding to the proximity of the parking spot to the target location; R3 is the normalized score corresponding to the parking rule / area restriction penalty value related to the parking spot; a1-a5 are the weight values of the corresponding dimensions.
6. The method according to claim 1, characterized in that, Determining the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point includes: The scores of the candidate drop-off point and the shared two-wheeled vehicle rental point are determined according to multiple dimensions. Based on the scores of the multiple dimensions, the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point is determined. The multiple dimensions include: the ride-hailing accessibility of the candidate drop-off point and the acceptability of walking from the candidate drop-off point to the shared two-wheeled vehicle rental point.
7. The method according to claim 6, characterized in that, The step of determining the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point based on the scores of the multiple dimensions includes: Based on the scores from the multiple dimensions, the matching degree between the candidate drop-off point and the shared two-wheeled vehicle rental point is determined using the following formula: Where MS is the matching degree between a candidate drop-off point and a shared two-wheeler rental point; C is the normalized score corresponding to the ride-hailing accessibility of the candidate drop-off point; W is the normalized score corresponding to the acceptability of walking from the candidate drop-off point to the shared two-wheeler rental point; d1-d2 are the weight values of the corresponding dimensions.
8. The method according to claim 1, characterized in that, The method further includes: The system determines scores for each combined travel option across multiple dimensions, and based on these scores, determines the overall score of the combined travel option. It then pushes one or more combined travel options to the user based on these scores. The multiple dimensions include at least: estimated total duration, estimated total cost, estimated connection success rate, and user acceptance.
9. The method according to claim 8, characterized in that, The process of determining the score of each combined travel option based on scores across multiple dimensions includes: Based on the scores from the multiple dimensions, the score of the combined travel plan is determined using the following formula: Where TS is the score of a combined travel plan; T is the normalized score corresponding to the estimated total duration; and F is the normalized score corresponding to the estimated total cost. The normalized score corresponds to the walking distance for connecting routes; U is the normalized score for user acceptance; c1-c4 are the weight values for the corresponding dimensions.
10. The method according to claim 8, characterized in that, The method further includes: Based on user feedback, determine the target combination of travel options and generate and publish the corresponding travel orders.
11. An apparatus for determining a combined travel plan, characterized in that, The device includes: The first module is used to determine the planned route based on the user's published travel needs. If the road conditions of the planned route meet the first preset condition, then all shared two-wheeled vehicle parking points that meet the second preset condition are combined into a shared two-wheeled vehicle return point set. For each shared two-wheeled vehicle return point in the shared two-wheeled vehicle return point set, one or more shared two-wheeled vehicle parking points that meet the third preset condition are used as one or more shared two-wheeled vehicle borrowing points corresponding to the shared two-wheeled vehicle return point. The shared two-wheeled vehicle return point set is traversed to generate a list of shared two-wheeled vehicle return point and borrowing point combinations, and the score of each pair of combinations is calculated. Based on the score of each pair of combinations, the highest-scoring pairs of combinations are determined to form a candidate combination list for the second trip, where the second trip is a shared two-wheeled vehicle trip. The second module is used to determine one or more candidate drop-off points for the first trip corresponding to each shared two-wheeled vehicle rental point in the candidate combination list according to the fourth preset condition, and to determine the matching degree between each candidate drop-off point and the shared two-wheeled vehicle rental point. The module then traverses the candidate combination list to determine several candidate drop-off points with the highest matching degree, forming a set of candidate drop-off points for the first trip, wherein the first trip is a ride-hailing trip. The third module is used to generate several combined travel plans, including the first trip and the second trip, based on the set of candidate drop-off points of the first trip and the list of candidate combinations of the second trip.
12. The apparatus according to claim 11, characterized in that, The device further includes: The fourth module is used to determine the scores of each combined travel plan across multiple dimensions, and to determine the score of the combined travel plan based on the scores of each combined travel plan across multiple dimensions, and to push one or more combined travel plans to the user based on the scores, wherein the multiple dimensions include at least: estimated total time, estimated total cost, estimated connection success rate and user acceptance.
13. The apparatus according to claim 12, characterized in that, The device further includes: The fifth module is used to determine the target combination of travel plans based on user feedback and to generate and publish the corresponding travel orders.
14. A computer-readable medium, characterized in that, It stores computer-readable instructions that are executed by a processor to implement the method as described in any one of claims 1 to 10.
15. A device for determining a combined travel plan, characterized in that, The device includes: One or more processors; and A memory storing computer-readable instructions, which, when executed, cause the processor to perform the method as described in any one of claims 1 to 10.