CN110619403A - Car pooling method and device, electronic equipment and storage medium - Google Patents

Car pooling method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN110619403A
CN110619403A CN201910762616.5A CN201910762616A CN110619403A CN 110619403 A CN110619403 A CN 110619403A CN 201910762616 A CN201910762616 A CN 201910762616A CN 110619403 A CN110619403 A CN 110619403A
Authority
CN
China
Prior art keywords
car sharing
route
grid
car
users
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN201910762616.5A
Other languages
Chinese (zh)
Inventor
卢学远
石宽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Feibao Technology Co Ltd
Hangzhou Fabu Technology Co Ltd
Original Assignee
Hangzhou Feibao Technology Co Ltd
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 Hangzhou Feibao Technology Co Ltd filed Critical Hangzhou Feibao Technology Co Ltd
Priority to CN201910762616.5A priority Critical patent/CN110619403A/en
Publication of CN110619403A publication Critical patent/CN110619403A/en
Pending legal-status Critical Current

Links

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/02—Reservations, e.g. for tickets, services or events
    • G06Q10/025—Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0605—Supply or demand aggregation
    • 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

Landscapes

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

Abstract

The invention provides a car pooling method and device, electronic equipment and a storage medium. The method comprises the following steps: responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request, acquiring car sharing routes of at least two other users, projecting the first car sharing route and the car sharing routes of the other users onto a global discrete network system, calculating the matching degree between the projection of the first car sharing route on the global network system and the projections of the car sharing routes of the other users, determining a route with the highest matching degree between the projection of the first car sharing route on the global network system and the projection of the first car sharing route in the car sharing routes of the other users as a second car sharing route, distributing vehicles for the users according to the first car sharing route and the second car sharing route and generating car sharing information, pushing the car sharing information to the user terminal, fully considering the spatial characteristics and the directional characteristics of the car sharing routes, and enabling the accuracy of the determined second car sharing route to be higher, the success rate of car sharing is improved.

Description

Car pooling method and device, electronic equipment and storage medium
Technical Field
The invention relates to the technical field of vehicle resource sharing, in particular to a car sharing method and device, electronic equipment and a storage medium.
Background
With the development and wide application of internet technology, the technology of vehicle resource sharing has been developed and broken through.
In the prior art, a car sharing platform may determine a car sharing partner sharing a car with a user a based on a car sharing request of the user a, and allocate a vehicle to the user a, and the like, which may be specifically implemented by the following method: the method comprises the steps of selecting points on at least two car sharing routes according to preset distances respectively (one car sharing route is a car sharing route corresponding to a user A), calculating the number of the same points of the at least two car sharing routes, determining the matching degree based on the ratio of the number of the same points to the total number of the selected points, taking a user with the matching degree larger than a threshold value as a car sharing user, distributing vehicles for the user A and the car sharing user, and the like.
In the process of implementing the present disclosure, the inventor finds that car sharing achieved by the prior art has at least the following problems: the accuracy of determining the car sharing partner is not high, and the car sharing success rate is reduced.
Disclosure of Invention
The invention provides a car pooling method and device, electronic equipment and a storage medium, which are used for solving the problems of low accuracy and low car pooling success rate of determining car pooling partners in the prior art.
In one aspect, the invention provides a carpooling method, comprising: responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request, and acquiring car sharing routes of at least two other users;
projecting the first car sharing route and the car sharing routes of the other users onto a global discrete network system, and calculating the matching degree between the projection of the first car sharing route on the global discrete network system and the projections of the car sharing routes of the other users;
determining a route with the highest projection matching degree between the projection on the global network system and the projection of the first carpooling route in the carpooling routes of the other users as a second carpooling route;
allocating vehicles for the user according to the first car sharing route and the second car sharing route and generating car sharing information;
and pushing the car sharing information to the user terminal.
In some embodiments, the projecting the first car-sharing route and the car-sharing routes of the other users onto a global discrete network system, the calculating the degree of match between the projection of the first car-sharing route on the global discrete network system and the projection of the car-sharing routes of the other users comprises:
determining a first grid sequence of the first ride share route projected onto the global discrete grid system;
determining a second grid sequence of the other user's car pool routes projected onto the global discrete grid system;
and calculating the matching degree of the first grid sequence and the second grid sequence of the other users.
In some embodiments, the calculating the degree of matching of the first grid sequence with the second grid sequence of the other user comprises:
acquiring an identifier of each first grid in the first grid sequence;
acquiring the identifier of each second grid in the second grid sequences of the other users;
and determining the matching degree according to the identification of each first grid and the identification of each second grid of the other users.
In some embodiments, said determining said degree of match from said identity of each first grid and said identity of each second grid of said other users comprises:
splicing the identification of each first grid to obtain a first character string;
splicing the identification of each second grid of other users to obtain a second character string;
and calculating the similarity of the first character string and the second character strings of the other users, and determining the similarity as the matching degree.
In some embodiments, generating the ride share information from the first ride share route and the second ride share route comprises:
determining the information of the user corresponding to the second car sharing route as car sharing partner information;
determining vehicle information according to the first car sharing route and the second car sharing route;
the car sharing information comprises the vehicle information and information of the car sharing partner.
On the other hand, this disclosed embodiment still provides a car pooling device, the device includes:
the system comprises an acquisition module, a display module and a control module, wherein the acquisition module is used for responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request and acquiring car sharing routes of at least two other users;
the projection module is used for projecting the first car sharing route and the car sharing routes of other users onto a global discrete network system;
the calculation module is used for calculating the matching degree between the projection of the first car sharing route on the global network system and the projections of the car sharing routes of the other users;
the determining module is used for determining that a route with the highest projection matching degree between the projection on the global network system and the first carpooling route in the carpooling routes of the other users is a second carpooling route;
the generating module is used for distributing vehicles for the user according to the first car sharing route and the second car sharing route and generating car sharing information;
and the pushing module is used for pushing the car sharing information to the user terminal.
In some embodiments, the projection module is specifically configured to determine that the first car pool route is projected to a first grid sequence of the global discrete grid system, and determine that the car pool routes of the other users are projected to a second grid sequence of the global discrete grid system;
the calculation module is specifically configured to calculate a matching degree between the first grid sequence and the second grid sequence of the other user.
In some embodiments, the calculation module is specifically configured to obtain an identifier of each first grid in the first grid sequence, obtain an identifier of each second grid in the second grid sequences of the other users, and determine the matching degree according to the identifier of each first grid and the identifier of each second grid of the other users.
In some embodiments, the calculation module is specifically configured to splice the identifiers of each first grid to obtain a first character string, splice the identifiers of each second grid of the other users to obtain a second character string, calculate a similarity between the first character string and the second character string of the other users, and determine the similarity as the matching degree.
In some embodiments, the generation module is specifically configured to determine information of a user corresponding to the second car sharing route as car sharing partner information, and determine vehicle information according to the first car sharing route and the second car sharing route, where the car sharing information includes the vehicle information and information of the car sharing partner.
On the other hand, the embodiment of the present disclosure further provides an electronic device, including: a memory, a processor;
a memory for storing the processor-executable instructions;
wherein the processor, when executing the instructions in the memory, is configured to implement a method as in any of the embodiments above.
In another aspect, this disclosed embodiment also provides a computer-readable storage medium, in which computer-executable instructions are stored, and when executed by a processor, the computer-executable instructions are used to implement the method according to any one of the above embodiments.
The invention provides a method for responding to a first car sharing request sent by a user through a user terminal, obtaining a first car sharing route corresponding to the first car sharing request, obtaining car sharing routes of at least two other users, projecting the first car sharing route and the car sharing routes of the other users onto a global discrete network system, calculating the matching degree between the projection of the first car sharing route on the global network system and the projection of the car sharing routes of the other users, determining the route with the highest matching degree between the projection of the global network system and the projection of the first car sharing route in the car sharing routes of the other users as a second car sharing route, distributing vehicles for the users according to the first car sharing route and the second car sharing route and generating car sharing information, pushing the car sharing information to the user terminal, projecting the first car sharing route and the car sharing routes of the other users onto the global discrete network system, the matching degree between the projection of the first car sharing route on the global network system and the projections of the car sharing routes of other users is calculated, the spatial characteristics and the direction characteristics of the car sharing routes are fully considered, the calculated matching degree is more accurate, the accuracy of the determined second car sharing route is higher, high reliability of car sharing information pushed by the users is further achieved, and the technical effect of improving the car sharing success rate is achieved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
Fig. 1 is a schematic view of an application scenario of a car pooling method according to an embodiment of the present disclosure;
fig. 2 is a schematic diagram of a user terminal displaying carpooling information according to an embodiment of the disclosure;
FIG. 3 is a schematic diagram of a terminal displaying information of a user and information of a car pool partner according to an embodiment of the disclosure;
FIG. 4 is a schematic flow chart diagram of a carpooling method according to an embodiment of the disclosure;
FIG. 5 is a diagram illustrating a user terminal displaying a prompt in accordance with an embodiment of the present disclosure;
FIG. 6 is a schematic diagram of a user terminal displaying the highest matching degree and/or a second carpool route, an inquiry request according to an embodiment of the disclosure;
fig. 7 is a flowchart illustrating a method for projecting a first car sharing route and car sharing routes of other users onto a global discrete network system and calculating a matching degree between the projection of the first car sharing route on the global discrete network system and the projections of the car sharing routes of the other users according to an embodiment of the disclosure;
fig. 8 is a flowchart illustrating a method for calculating a matching degree between a first grid sequence and a second grid sequence of another user according to an embodiment of the disclosure;
fig. 9 is a flowchart illustrating a method for determining a matching degree according to an identifier of each first grid and an identifier of each second grid of other users according to an embodiment of the present disclosure;
FIG. 10 is a schematic diagram of a flow method for generating carpool information according to a first carpool route and a second carpool route according to an embodiment of the disclosure;
FIG. 11 is a block schematic diagram of a ride share device according to an embodiment of the disclosure;
fig. 12 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure;
reference numerals: 10. the system comprises a user, 20, a user terminal, 30, a car sharing platform, 40, a car sharing partner, 50, a terminal of the car sharing partner, 60, a driver, 70, a terminal of the driver, 1, an acquisition module, 2, a projection module, 3, a calculation module, 4, a determination module, 5, a generation module, 6 and a pushing module.
With the foregoing drawings in mind, certain embodiments of the disclosure have been shown and described in more detail below. These drawings and written description are not intended to limit the scope of the disclosed concepts in any way, but rather to illustrate the concepts of the disclosure to those skilled in the art by reference to specific embodiments.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
The carpooling method provided by the embodiment of the disclosure can be applied to a carpooling scene shown in fig. 1.
In the application scenario shown in fig. 1, the user 10 may download the APP corresponding to the car pooling platform 30 through the user terminal 20, and after the downloading is completed, an icon of the APP corresponding to the car pooling platform 30 may be displayed on the user terminal 20.
When the user 10 has a car sharing demand, the user 10 may trigger a car sharing request by clicking an icon of the APP on the user terminal 20.
If the user 10 uses the APP for the first time, corresponding information (i.e. a process of entering basic information of the user 10, the basic information including but not limited to name, age, sex, resident address, occupation, etc.) can be input or selected through the user terminal 20. The ride share platform 30 stores basic information of the user 10.
As shown in fig. 1, when the car sharing method according to the embodiment of the present disclosure is applied, the user 10 may click an APP icon on the user terminal 20, so that the user terminal 20 pushes a car sharing request to the car sharing platform 30.
The car pooling platform 30 may determine a car pooling route matching the car pooling route of the user 10 by performing the car pooling method of the embodiment of the present disclosure, allocate a vehicle to the user 10, generate corresponding push information, and push the push information to the user terminal 20.
The user terminal 20 displays the car-pooling information as shown in fig. 2. The user 10 may determine whether to share a car based on the sharing information.
It should be noted that the car pool information displayed by the user terminal 20 in fig. 2 is only an exemplary illustration, and is not to be construed as a limitation to the car pool information. The car sharing information includes car sharing partner information and vehicle information as shown in fig. 2, and may further include driver information and road condition information, etc.
As shown in fig. 1, in some embodiments, the ride share platform 30 may determine the ride share partner information by performing the ride share method of the disclosed embodiments, and determine the ride share 40 and the terminal 50 of the ride share 40 according to the ride share partner information, so as to push the information of the user 10 to the terminal 50, or may push the ride share information and the information of the user 10 to the terminal 50. The terminal 50 can also display the information pushed by the carpooling platform 30.
As shown in fig. 1, in some embodiments, the ride share platform 30 may determine vehicle information by performing the ride share method of the disclosed embodiments, determine a driver 60 driving the vehicle according to the vehicle information, and determine a terminal 70 of the driver 60, so as to push information of the user 10 and information of the ride share partner 40 to the terminal 70. The terminal 70 displays the information of the user 10 and the information of the carpool partner 40 as shown in fig. 3.
The following describes the technical solutions of the present disclosure and how to solve the above technical problems with specific embodiments in combination with the above application scenarios. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present disclosure will be described below with reference to the accompanying drawings.
In one aspect, the embodiment of the disclosure provides a car pooling method applicable to the above scenario.
Referring to fig. 4, fig. 4 is a schematic flow chart of a carpooling method according to an embodiment of the disclosure.
As shown in fig. 4, the method includes:
s1: responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request, and acquiring car sharing routes of at least two other users.
In some embodiments, a main body performing the car sharing method of the present disclosure may be a car sharing device, which may specifically be a car sharing platform (as shown in fig. 1), a server, or the like.
In the implementation of the present disclosure, the user 10 may download the APP corresponding to the car sharing platform through the user terminal 20, and when the user 10 has a car sharing requirement, the APP may be clicked to send a car sharing request to the car sharing platform 30.
In some embodiments, the ride share request may carry an entry location (i.e., an initial location) and an exit location (i.e., a destination location) for the user 10. The boarding location may be the current location of the user 10, or may be a location selected by the user 10 through the user terminal 20 as a starting point of carpooling. The user terminal 20 includes, but is not limited to, a cell phone, an iPad, and a smart band.
Exemplarily, if the departure position is carried in the carpool request, the carpool platform 30 acquires the position of the user terminal 20, and determines the acquired position as the departure position. And, the carpooling platform 30 determines a first carpooling route according to the getting-on position and the getting-off position.
If the boarding location (which may be the location selected by the user 10 or the location of the user terminal 20) and the alighting location are carried in the carpool request, the carpool platform 30 determines a first carpool route according to the boarding location and the alighting location.
In other embodiments, the APP is turned on by the user 10, the user terminal 20 initiates a first car sharing request to the car sharing platform 30, and the car sharing platform 30 pushes prompt information to the user terminal 20 to prompt the user 10 to input prompt information of the getting-on position and the getting-off position. The user terminal 20 displays the prompt information as shown in fig. 5.
The user 10 may input the getting-on position and the getting-off position through the user terminal 20, may determine a first ride share route according to the getting-on position and the getting-off position by the user terminal 20, and may transmit the first ride share route to the ride share platform 30 by the user terminal 20. The getting-on position and the getting-off position can also be sent to the carpooling platform 30 by the user terminal 20, and the first carpooling route is generated by the carpooling platform 30.
S2: the first car sharing route and the car sharing routes of other users are projected onto the global discrete network system, and the matching degree between the projection of the first car sharing route on the global discrete network system and the projections of the car sharing routes of the other users is calculated.
Exemplarily, if the number of the other users is 2 and is a and B, respectively, projecting the first car-sharing route to the global discrete network system and projecting the car-sharing route of a to the global discrete network system and projecting the car-sharing route of B to the global discrete network system, calculating a degree of matching a1 between the projection of the first car-sharing route and the projection of the car-sharing route of a, and calculating a degree of matching B1 between the projection of the first car-sharing route and the projection of the car-sharing route of B.
S3: and determining a route with the highest projection matching degree with the first carpool route on the global network system as a second carpool route in the carpool routes of other users.
Based on the above example, the matching degree a1 is compared with the matching degree B1, and if the matching degree a1 is greater than the matching degree B1, the carpool route of a is determined as the second carpool route; and if the matching degree B1 is greater than the matching degree A1, determining the carpool route with the matching degree B as a second carpool route.
In conjunction with the application scenario shown in fig. 1, in some embodiments, when determining the highest matching degree and the second carpool route, the carpool platform 30 may push the highest matching degree and/or the second carpool route to the user terminal 20, and send a query request to the user terminal 20 to query whether the user 10 is willing to carpool. The user terminal 20 displays the highest matching degree, the second carpool route, and the inquiry request, as shown in fig. 6. If the user 10 clicks "yes" on the user terminal 20, S4 is executed, and if the user 10 clicks "no" on the user terminal 20, the process returns to S1.
S4: and allocating vehicles for the user according to the first carpooling route and the second carpooling route and generating carpooling information.
S5: and pushing the car sharing information to the user terminal.
In some embodiments, the user 10 may not only trigger a ride share request by clicking on the APP, but may also trigger a ride share request by way of a voice command. Similarly, the car pooling platform 30 may also generate voice prompt information corresponding to the car pooling information, and push the voice prompt information to the user terminal 20, so that the user terminal 20 performs voice broadcast according to the voice prompt information.
The embodiment of the disclosure provides a new car pooling method, which comprises the following steps: responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request, acquiring car sharing routes of at least two other users, projecting the first car sharing route and the car sharing routes of the other users onto a global discrete network system, calculating the matching degree between the projection of the first car sharing route on the global network system and the projections of the car sharing routes of the other users, determining that the route with the highest matching degree between the projection of the second car sharing route on the global network system and the projection of the first car sharing route in the car sharing routes of the other users is a second car sharing route, distributing vehicles for the users according to the first car sharing route and the second car sharing route and generating car sharing information, pushing the car sharing information to the user terminal, projecting the first car sharing route and the car sharing routes of the other users onto the global discrete network system, and calculating the matching degree between the projection of the first car sharing route on the global network system and the projection of the car sharing routes of the other users The spatial characteristics and the direction characteristics of the car pooling route are fully considered, the calculated matching degree is more accurate, the accuracy of the determined second car pooling route is higher, high reliability of car pooling information pushed by a user is achieved, and the technical effect of improving the car pooling success rate is achieved.
As can be appreciated in conjunction with fig. 7, in some embodiments, S2 includes,
s21: a first grid sequence of a first ride share route projected onto a global discrete grid system is determined.
The global discrete grid system comprises a plurality of grids, a first car sharing route is projected onto the global discrete grid system, the first car sharing route can be determined to pass through each grid of the global discrete grid system, and the grids passed by the first car sharing route form a grid sequence.
S22: determining a second grid sequence of the projected carpool routes of the other users to the global discrete grid system.
Based on the above example, it is determined that the carpool route of a is projected to the second grid sequence of the global discrete grid system, and it is determined that the carpool route of B is projected to the second grid sequence of the global discrete grid system.
For the description of the second grid sequence, reference may be made to the first grid sequence, which is not described herein again. Also, the order of executing S21 and S22 is not limited.
S23: and calculating the matching degree of the first grid sequence and the second grid sequences of other users.
Based on the above example, the matching degree of the first grid sequence with the second grid sequence of a is calculated, and the matching degree of the first grid with the second grid sequence of B is calculated.
As can be seen from fig. 8, in some embodiments, S23 specifically includes:
s231: an identification of each first mesh in the sequence of first meshes is obtained.
Each grid has a unique identification, such as an ID.
Exemplarily, if the first grid sequence includes X grids, an identification of each grid of the X grids is obtained respectively.
S232: an identification of each second grid in the sequence of second grids of the other users is obtained.
Based on the above example, an identification of each second mesh in the second mesh sequence of a is obtained, and an identification of each second mesh in the second mesh sequence of B is obtained. Also, the order of executing S231 and S232 is not limited.
S233: and determining the matching degree according to the identification of each first grid and the identification of each second grid of other users.
As can be seen in conjunction with fig. 9, in some embodiments, S233 includes:
s2321: and splicing the identification of each first grid to obtain a first character string.
Based on the above example, the X identifiers of the first grid are concatenated to obtain the first character string Z1.
S2322: and splicing the identifications of each second grid of other users to obtain a second character string.
Based on the above example, the identifier of each second grid in the second grid sequence of a is spliced to obtain a second character string ZA, and the identifier of each second grid in the second grid sequence of B is spliced to obtain a second character string ZB. Also, the order of executing S2321 and S2322 is not limited.
S2323: and calculating the similarity of the first character string and the second character strings of other users, and determining the similarity as the matching degree.
Based on the above example, the similarity Z1-a between the first character string Z1 and the second character string ZA is calculated, and the similarity Z1-a is determined as the matching degree between the first carpool route and the carpool route of a. The similarity Z1-B between the first character string Z1 and the second character string ZB is calculated, and the similarity Z1-B is determined as the matching degree between the first carpool route and the carpool route of B.
As can be appreciated in conjunction with fig. 10, in some embodiments, generating ride share information from the first ride share route and the second ride share route includes:
s41: and determining the information of the user corresponding to the second car sharing route as car sharing partner information.
In this step, the user corresponding to the second car sharing route may be determined as the car sharing partner 40 of the user 10, information of the car sharing partner 40 is acquired, and the acquired information is determined as car sharing partner information. The car sharing partner information includes, but is not limited to, information (such as age, sex, occupation, etc.) of the car sharing partner 40 and a second car sharing route.
S42: and determining vehicle information according to the first carpooling route and the second carpooling route.
The vehicle information includes, but is not limited to, the type of vehicle, the license plate number of the vehicle, and driver information. The driver information includes, but is not limited to, the terminal identification, driving record, age, and gender of the driver 60.
The car sharing information comprises vehicle information and information of car sharing partners.
According to another aspect of the disclosed embodiments, the disclosed embodiments provide a ride share device.
Referring to fig. 11, fig. 11 is a schematic block diagram of a car pooling device according to an embodiment of the disclosure.
As shown in fig. 11, the apparatus includes:
the system comprises an acquisition module 1, a display module and a control module, wherein the acquisition module is used for responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request and acquiring car sharing routes of at least two other users;
the projection module 2 is used for projecting the first car sharing route and the car sharing routes of other users onto the global discrete network system;
the calculation module 3 is used for calculating the matching degree between the projection of the first car sharing route on the global network system and the projections of the car sharing routes of other users;
the determining module 4 is used for determining that a route with the highest projection matching degree between the projection on the global network system and the first car sharing route in the car sharing routes of other users is a second car sharing route;
the generation module 5 is used for distributing vehicles for the user according to the first car sharing route and the second car sharing route and generating car sharing information;
and the pushing module 6 is used for pushing the car sharing information to the user terminal.
In some embodiments, the projection module 2 is specifically configured to determine that the first car-sharing route is projected to a first grid sequence of the global discrete grid system, and determine that the car-sharing routes of other users are projected to a second grid sequence of the global discrete grid system;
the calculating module 3 is specifically configured to calculate a matching degree between the first grid sequence and the second grid sequence of the other user.
In some embodiments, the calculation module 3 is specifically configured to obtain an identifier of each first grid in the first grid sequence, obtain an identifier of each second grid in the second grid sequences of other users, and determine the matching degree according to the identifier of each first grid and the identifier of each second grid of other users.
In some embodiments, the calculation module 3 is specifically configured to splice the identifiers of each first grid to obtain a first character string, splice the identifiers of each second grid of other users to obtain a second character string, calculate a similarity between the first character string and the second character string of the other users, and determine the similarity as the matching degree.
In some embodiments, the generation module is specifically configured to determine information of a user corresponding to the second car sharing route as car sharing partner information, and determine vehicle information according to the first car sharing route and the second car sharing route, where the car sharing information includes the vehicle information and information of a car sharing partner.
According to another aspect of the embodiments of the present disclosure, there is also provided an electronic device, including: a memory, a processor;
a memory for storing processor-executable instructions;
wherein, when executing the instructions in the memory, the processor is configured to implement the method of any of the embodiments above.
Referring to fig. 12, fig. 12 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure.
As shown in fig. 12, the electronic device includes a memory and a processor, and the electronic device may further include a communication interface and a bus, wherein the processor, the communication interface, and the memory are connected by the bus; the processor is used to execute executable modules, such as computer programs, stored in the memory.
The Memory may include a high-speed Random Access Memory (RAM) and may also include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Via at least one communication interface, which may be wired or wireless), the communication connection between the network element of the system and at least one other network element may be implemented using the internet, a wide area network, a local network, a metropolitan area network, etc.
The bus may be an ISA bus, PCI bus, EISA bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc.
The memory is used for storing a program, and the processor executes the program after receiving an execution instruction.
The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the device can also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field-Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component. The steps of the method disclosed in connection with the embodiments of the present disclosure may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.
According to another aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having stored therein computer-executable instructions, which when executed by a processor, are configured to implement the method according to any of the embodiments above.
The reader should understand that in the description of this specification, reference to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It should also be understood that, in the embodiments of the present invention, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (10)

1. A method of carpooling, the method comprising:
responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request, and acquiring car sharing routes of at least two other users;
projecting the first car sharing route and the car sharing routes of the other users onto a global discrete network system, and calculating the matching degree between the projection of the first car sharing route on the global discrete network system and the projections of the car sharing routes of the other users;
determining a route with the highest projection matching degree between the projection on the global network system and the projection of the first carpooling route in the carpooling routes of the other users as a second carpooling route;
allocating vehicles for the user according to the first car sharing route and the second car sharing route and generating car sharing information;
and pushing the car sharing information to the user terminal.
2. The method of claim 1, wherein projecting the first car-sharing route and the other user's car-sharing routes onto a global discrete network system, and wherein calculating the degree of match between the projection of the first car-sharing route on the global discrete network system and the projections of the other user's car-sharing routes comprises:
determining a first grid sequence of the first ride share route projected onto the global discrete grid system;
determining a second grid sequence of the other user's car pool routes projected onto the global discrete grid system;
and calculating the matching degree of the first grid sequence and the second grid sequence of the other users.
3. The method of claim 2, wherein the calculating the degree of matching of the first grid sequence to the second grid sequence of the other user comprises:
acquiring an identifier of each first grid in the first grid sequence;
acquiring the identifier of each second grid in the second grid sequences of the other users;
and determining the matching degree according to the identification of each first grid and the identification of each second grid of the other users.
4. The method of claim 3, wherein determining the degree of match based on the identity of each first grid and the identity of each second grid of the other users comprises:
splicing the identification of each first grid to obtain a first character string;
splicing the identification of each second grid of other users to obtain a second character string;
and calculating the similarity of the first character string and the second character strings of the other users, and determining the similarity as the matching degree.
5. The method of any of claims 1-4, wherein generating the ride share information from the first ride share route and the second ride share route comprises:
determining the information of the user corresponding to the second car sharing route as car sharing partner information;
determining vehicle information according to the first car sharing route and the second car sharing route;
the car sharing information comprises the vehicle information and information of the car sharing partner.
6. A ride share device, the device comprising:
the system comprises an acquisition module, a display module and a control module, wherein the acquisition module is used for responding to a first car sharing request sent by a user through a user terminal, acquiring a first car sharing route corresponding to the first car sharing request and acquiring car sharing routes of at least two other users;
the projection module is used for projecting the first car sharing route and the car sharing routes of other users onto a global discrete network system;
the calculation module is used for calculating the matching degree between the projection of the first car sharing route on the global network system and the projections of the car sharing routes of the other users;
the determining module is used for determining that a route with the highest projection matching degree between the projection on the global network system and the first carpooling route in the carpooling routes of the other users is a second carpooling route;
the generating module is used for distributing vehicles for the user according to the first car sharing route and the second car sharing route and generating car sharing information;
and the pushing module is used for pushing the car sharing information to the user terminal.
7. The apparatus of claim 6,
the projection module is specifically configured to determine that the first car-sharing route is projected to a first grid sequence of the global discrete grid system, and determine that the car-sharing routes of the other users are projected to a second grid sequence of the global discrete grid system;
the calculation module is specifically configured to calculate a matching degree between the first grid sequence and the second grid sequence of the other user;
the calculation module is specifically configured to obtain an identifier of each first grid in the first grid sequence, obtain an identifier of each second grid in the second grid sequences of the other users, and determine the matching degree according to the identifier of each first grid and the identifier of each second grid of the other users;
the calculation module is specifically configured to splice the identifiers of each first grid to obtain a first character string, splice the identifiers of each second grid of the other users to obtain a second character string, calculate a similarity between the first character string and the second character strings of the other users, and determine the similarity as the matching degree.
8. The apparatus according to claim 6 or 7, wherein the generating module is specifically configured to determine information of a user corresponding to the second car sharing route as car sharing partner information, and determine vehicle information according to the first car sharing route and the second car sharing route, wherein the car sharing information includes the vehicle information and information of the car sharing partner.
9. An electronic device, comprising: a memory, a processor;
a memory for storing the processor-executable instructions;
wherein the processor, when executing the instructions in the memory, is configured to implement the method of any of claims 1 to 5.
10. A computer-readable storage medium having computer-executable instructions stored therein, which when executed by a processor, are configured to implement the method of any one of claims 1 to 5.
CN201910762616.5A 2019-08-19 2019-08-19 Car pooling method and device, electronic equipment and storage medium Pending CN110619403A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910762616.5A CN110619403A (en) 2019-08-19 2019-08-19 Car pooling method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910762616.5A CN110619403A (en) 2019-08-19 2019-08-19 Car pooling method and device, electronic equipment and storage medium

Publications (1)

Publication Number Publication Date
CN110619403A true CN110619403A (en) 2019-12-27

Family

ID=68921914

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910762616.5A Pending CN110619403A (en) 2019-08-19 2019-08-19 Car pooling method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN110619403A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111739329A (en) * 2020-05-29 2020-10-02 腾讯科技（深圳）有限公司 Travel route generation method, travel route generation device, storage medium, and server

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104978420A (en) * 2015-06-30 2015-10-14 百度在线网络技术（北京）有限公司 Traveling route matching method and apparatus
CN107767200A (en) * 2016-08-18 2018-03-06 重庆无线绿洲通信技术有限公司 A kind of share-car method and device based on timesharing lease
KR20180067269A (en) * 2016-12-12 2018-06-20 현대자동차주식회사 Apparatus for mediating multi carpool, system having the same and method thereof
CN108628904A (en) * 2017-03-23 2018-10-09 北京嘀嘀无限科技发展有限公司 A kind of path code, Similar Track search method and device and electronic equipment
CN109191883A (en) * 2018-09-29 2019-01-11 电子科技大学 A kind of intelligent transportation system based on intelligent perception

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104978420A (en) * 2015-06-30 2015-10-14 百度在线网络技术（北京）有限公司 Traveling route matching method and apparatus
CN107767200A (en) * 2016-08-18 2018-03-06 重庆无线绿洲通信技术有限公司 A kind of share-car method and device based on timesharing lease
KR20180067269A (en) * 2016-12-12 2018-06-20 현대자동차주식회사 Apparatus for mediating multi carpool, system having the same and method thereof
CN108628904A (en) * 2017-03-23 2018-10-09 北京嘀嘀无限科技发展有限公司 A kind of path code, Similar Track search method and device and electronic equipment
CN109191883A (en) * 2018-09-29 2019-01-11 电子科技大学 A kind of intelligent transportation system based on intelligent perception

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111739329A (en) * 2020-05-29 2020-10-02 腾讯科技（深圳）有限公司 Travel route generation method, travel route generation device, storage medium, and server
CN111739329B (en) * 2020-05-29 2021-11-02 腾讯科技（深圳）有限公司 Travel route generation method, travel route generation device, storage medium, and server

Similar Documents

Publication Publication Date Title
CN107492063B (en) Boarding point recommendation processing method and system
CN108388988B (en) Block chain-based collaborative office method, system and computer-readable storage medium
CN108286981B (en) Vehicle path planning method and device of Internet of vehicles and computer equipment
CN110633815A (en) Car pooling method and device, electronic equipment and storage medium
CN111006682A (en) Navigation route planning method and device, electronic equipment and storage medium
CN110704177B (en) Computing task processing method and device, computer equipment and storage medium
CN110391938B (en) Method and apparatus for deploying services
CN109298926B (en) Method and device for entering resource transfer party into resource transfer platform and electronic equipment
US11486714B2 (en) Matching algorithm for data with different scales based on global road network features
CN110007916B (en) Interface rendering method and device of business system and server
CN111080407A (en) House information recommendation method and device, electronic equipment and readable storage medium
CN110245912A (en) A kind of electronic contract signature method, apparatus, storage medium and terminal device
CN110619402A (en) Vehicle dispatching method and device, electronic equipment and storage medium
CN111859172B (en) Information pushing method, device, electronic equipment and computer readable storage medium
US20200271457A1 (en) Map information management device, map information management system, and map information management method
CN114623844A (en) Navigation data processing method, device, program product, medium and electronic equipment
CN110619403A (en) Car pooling method and device, electronic equipment and storage medium
CN110166272B (en) Method, device and system for providing terminal equipment index arbitration service
CN111833119A (en) Order allocation method and device, electronic equipment and storage medium
CN114459492B (en) Method, device, equipment, storage medium and product for determining recommended route
CN113946729B (en) Data processing method and device for vehicle, electronic equipment and medium
CN111866051B (en) Resource information distribution method, device, equipment and medium
CN111966755B (en) APP application method, device and system based on block chain
CN110717752B (en) Electronic resource processing method, device, server and readable storage medium
CN107490383B (en) Service providing method, server and readable medium for path health information in navigation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20191227

RJ01 Rejection of invention patent application after publication