CN111191128B - Stroke matching method and device - Google Patents
Stroke matching method and device Download PDFInfo
- Publication number
- CN111191128B CN111191128B CN201911351489.6A CN201911351489A CN111191128B CN 111191128 B CN111191128 B CN 111191128B CN 201911351489 A CN201911351489 A CN 201911351489A CN 111191128 B CN111191128 B CN 111191128B
- Authority
- CN
- China
- Prior art keywords
- information
- trip
- travel information
- travel
- distance
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000012545 processing Methods 0.000 claims description 20
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012216 screening Methods 0.000 claims description 7
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000003111 delayed effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- 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
- 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
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- General Engineering & Computer Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Data Mining & Analysis (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
- Navigation (AREA)
Abstract
The embodiment of the invention provides a stroke matching method and device. The travel matching method comprises the following steps: under the condition of receiving first travel information sent by terminal equipment, determining a first target packet to which the first travel information belongs in at least two preset packets; determining a second target packet corresponding to the first target packet; and performing stroke matching on the first stroke information and second stroke information in the second target group. The technical scheme provided by the embodiment of the invention can enable the owner and the passenger to know the road degree of each other more quickly.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a stroke matching method and device.
Background
With the development of science and technology, network car booking gradually merges into the lives of people. The network car booking can ensure that the user can book the car without going out, thereby being convenient for the riding demand of the user.
The windward business in the field of network car booking is getting closer to the life of people. The utilization rate of the idle seats of the automobile is improved, the trip of people is facilitated, energy is saved, the environment is protected, and the traffic pressure is favorably reduced.
For the tailwind business, the information of the tailway degree can be provided for the convenience of the owner and the passenger who issue the journey to know the respective tailway degree. In the prior art, when the forward route program between the vehicle owner and the passenger is calculated, the newly issued route, such as the newly issued route of the passenger, can be matched with all vehicle owner routes, the calculation amount is large, the processor pressure is increased, and the consumed time is long.
Disclosure of Invention
The embodiment of the invention provides a travel matching method and a travel matching device, and aims to solve the problems of large calculation amount and long consumed time when the travel matching degree of a vehicle owner and a passenger is carried out in the prior art.
In order to solve the above technical problem, an embodiment of the present invention provides the following technical solutions:
in a first aspect, an embodiment of the present invention provides a route matching method, which is applied to a server, and the route matching method includes:
under the condition of receiving first travel information sent by terminal equipment, determining a first target packet to which the first travel information belongs in at least two preset packets; the at least two groups are grouped at least according to departure place information and expected departure time information in the travel information, the travel information in each group and the first travel information are issued by users of the same type, and the user type comprises: vehicle owners and passengers;
determining a second target packet corresponding to the first target packet; the travel information in the second target group and the travel information in the first target group are issued by different types of users;
and performing stroke matching on the first stroke information and second stroke information in the second target group.
In a second aspect, an embodiment of the present invention provides a route matching device, which is applied to a server, and the route matching device includes:
the first determining module is used for determining a first target group to which first travel information belongs in at least two preset groups under the condition of receiving the first travel information sent by the terminal equipment; the at least two groups are grouped at least according to departure place information and expected departure time information in the travel information, the travel information in each group and the first travel information are issued by users of the same type, and the user type comprises: vehicle owners and passengers;
a second determination module for determining a second target group corresponding to the first target group determined by the first determination module; the travel information in the second target group and the travel information in the first target group are issued by different types of users;
and the processing module is used for carrying out stroke matching on the first stroke information and the second stroke information in the second target grouping determined by the second determining module.
In a third aspect, an embodiment of the present invention provides an electronic device, where the electronic device includes: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps in the run-length matching method as described above when executing the computer program.
In a fourth aspect, the embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps in the route matching method as described above.
In the embodiment of the invention, when the matching degree between the travel of the vehicle owner and the travel of the passenger is determined, the new travel information (namely, the first travel information) is firstly grouped, and the group (namely, the first target group) to which the new travel information belongs is determined. And then determining a group (namely a second target group) corresponding to the first target group, and finally, only needing to carry out stroke matching on the new stroke information and the stroke information (namely the second stroke information) in the second target group. Because the grouping is carried out according to the departure place information and the predicted departure time information of the journey, in the corresponding passenger journey information grouping and the owner journey information grouping, the matching degree of the passenger journey information and the owner journey information is higher, and the referential performance is higher, therefore, the journey matching method provided by the embodiment of the invention can be carried out only by carrying out the journey matching on the new journey information and the journey information (namely the second journey information) in one grouping, and does not need to carry out the journey matching on the journey information newly issued by one user and all the journey information corresponding to another type of user, thereby reducing the data processing amount, being short in time consumption, improving the processing efficiency, and being beneficial to the fact that the owner and the passenger can know the road degree of each other more quickly.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the description of the embodiments of the present invention will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
Fig. 1 is a schematic flow chart of a trip matching method according to an embodiment of the present invention;
FIG. 2 is one of schematic diagrams of examples provided by embodiments of the present invention;
FIG. 3 is a second schematic diagram of an example provided by an embodiment of the present invention;
FIG. 4 is a block diagram of a trip matching apparatus provided in an embodiment of the present invention;
fig. 5 is a block diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention. It is to be understood that the embodiments described are only a few embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
According to an aspect of the embodiments of the present invention, a method for route matching is provided, which is applied to a server.
As shown in fig. 1, the trip matching method includes:
step 101: under the condition of receiving first travel information sent by the terminal equipment, determining a first target packet to which the first travel information belongs in at least two preset packets.
The at least two groups in this step are grouped according to at least the departure place information and the predicted departure time information in the trip information. The travel information in each group and the first travel information are issued by the same type of users, and the user types comprise: the owner and the passenger. In this embodiment of the present invention, the trip information may at least include: departure point information, destination information, and expected departure time information.
In the embodiment of the invention, the travel information of the car owner and the travel information of the passenger can be grouped respectively. Grouping may be performed based on at least the departure location information and the estimated departure time information in the trip information. For example, as shown in fig. 2, the passenger trip information regarding the departure place as the area a and the area B may be grouped into four time slots, respectively. The duration of each time period was 6 hours. In this way, when the server receives new trip information (corresponding to the first trip information), the server can perform grouping according to the departure point information and the expected departure time information in the new trip information and determine the target group (corresponding to the first target group) to which the server belongs. The departure place corresponding to the first travel information is in the departure place range corresponding to the first target group, and the predicted departure time in the first travel information is in the predicted departure time range corresponding to the first target group. It can be understood that the value range of the time period corresponding to each group may be designed according to actual requirements, and the time length of each time period may be the same or different.
Optionally, the terminal devices described herein include but are not limited to: mobile phones, tablet computers, and the like.
Step 102: a second target packet corresponding to the first target packet is determined.
The travel information in the second target group and the travel information in the first target group are issued by different types of users, namely when the travel information in the first target group is the travel information of passengers, the travel information in the second target group is the travel information of vehicle owners; when the travel information in the first target group is the travel information of the owner, the travel information in the second target group is the travel information of the passenger.
The departure location information and the predicted departure time corresponding to the second target group are matched with the departure location information and the predicted departure time corresponding to the first target group, for example, the value ranges of the departure location information and the predicted departure time corresponding to the second target group are the same as the value ranges of the departure location information and the predicted departure time corresponding to the first target group.
Step 103: and performing stroke matching on the first stroke information and the second stroke information in the second target packet.
In this step, after the second target packet corresponding to the first target packet is determined, the first trip information is trip-matched with the trip information (i.e., the second trip information) in the second target packet.
In the embodiment of the invention, when the matching degree between the travel of the vehicle owner and the travel of the passenger is determined, the new travel information (namely, the first travel information) is firstly grouped, and the group (namely, the first target group) to which the new travel information belongs is determined. And then determining a group (namely a second target group) corresponding to the first target group, and finally, only needing to carry out stroke matching on the new stroke information and the stroke information (namely the second stroke information) in the second target group.
Because the grouping is carried out according to the departure place information and the predicted departure time of the journey, in the corresponding passenger journey information grouping and the owner journey information grouping, the matching degree of the passenger journey information and the owner journey information is higher, and the referential performance is higher, therefore, the journey matching method provided by the embodiment of the invention can be carried out only by carrying out the journey matching on the new journey information and the journey information (namely the second journey information) in one grouping, and does not need to carry out the journey matching on the journey information newly issued by one user and all the journey information corresponding to the other type of users, thereby reducing the data processing amount, lightening the pressure of a processor, shortening the time consumption, improving the processing efficiency, and being beneficial to the owner and the passenger to know the degree of the mutual direct way more quickly.
Optionally, in this embodiment of the present invention, when determining, in step 102, a second target packet corresponding to the first target packet, the method may include: determining a first group which has the same departure place information and predicted departure time information and corresponds to the first target group; the first packet is determined as a second target packet corresponding to the first target packet.
And the travel information in the first grouping and the travel information in the first target grouping are issued by different types of users.
Generally, the trip information for the passenger and the trip information for the vehicle owner may be grouped in the same grouping manner, for example, when the trip information for the passenger is grouped in the grouping manner in the foregoing example, the trip information for the vehicle owner may be grouped in the same grouping manner. For example, with regard to the owner's trip information whose departure points are the areas a and B, grouping of four time periods is also performed, each time period has a duration of 6 hours, and the time start point and the time end point of each time period coincide with the time start point and the time end point of each grouped time period corresponding to the passenger trip information.
Optionally, in this embodiment of the present invention, when the second target group corresponding to the first target group is determined in step 102, the second target group corresponding to the first target group may also be determined according to a pre-established association relationship between the group corresponding to the passenger trip information and the group corresponding to the vehicle owner trip information. For example, the association relationship between the group corresponding to the passenger trip information numbered 1 and the group corresponding to the owner trip information numbered 1 is preset, so that the second target group corresponding to the first target group can be quickly found according to the pre-established association relationship.
Optionally, the step 103 of performing trip matching on the first trip information and the second trip information in the second target packet may include:
screening second travel information from the second target group; and carrying out travel matching on the first travel information and the second travel information.
And the time interval between the predicted departure time corresponding to the second trip information and the predicted departure time corresponding to the first trip information is less than or equal to the preset time interval.
In the embodiment of the present invention, when performing the trip matching between the first trip information and the trip information in the second target group, the trip information in the second target group may be first screened, the trip information of which the time interval of the estimated departure time corresponding to the first trip information is smaller than or equal to the preset time interval may be screened, and the trip information may be determined as the second trip information, and then the trip matching between the first trip information and the second trip information may be performed.
In the case where the estimated departure time is largely different, even if the vehicle owner and the passenger are on the way, the vehicle owner and the passenger may not be able to coordinate with each other in terms of time, and therefore, the trip information in the second target group is first screened based on the estimated departure time, and thus, the amount of computation can be further reduced.
Optionally, the step 103 of performing trip matching on the first trip information and the trip information in the second target packet may include:
by a preset formula: the degree of run matching is 1- [ (first distance + second distance)/third distance ], and run matching between the first run information and the run information in the second target packet is performed.
The first distance is a distance between a departure place corresponding to the first travel information and a departure place corresponding to the second travel information. The second distance is a distance between the destination corresponding to the first trip information and the destination corresponding to the second trip information. And when the first travel information is the travel information issued by the owner, the third distance is the distance between the departure place corresponding to the first travel information and the destination corresponding to the first travel information. And when the second trip information is the trip information issued by the owner, the third distance is the distance between the departure place corresponding to the second trip information and the destination corresponding to the second trip information.
Optionally, in at least two groups corresponding to the same origin, time ranges corresponding to two adjacent groups overlap each other for a preset time duration.
Generally, as shown in fig. 2, for packets of the same origin, for example, for a packet whose origin is region a, the time ranges from packet 1 to packet 4 are 0 point (excluding 0 point) to 6 point (including 6 point), 6 point (excluding 6 point) to 12 point (including 12 point), 12 point (excluding 12 point) to 18 point (including 18 point), and 18 point (excluding 18 point) to 24 point (including 24), respectively. However, for example, if the predicted departure time of a passenger is 6 o 'clock zero 1 min, then it is possible to have a suitable downwind turbine within one hour before 6 o' clock zero 1 min, but the travel information of the vehicle owner is grouped into groups corresponding to 0 o (excluding 0 o) to 6 o (including 6 o) and not into groups corresponding to 6 o (excluding 6 o) to 12 o (including 12 o), so that it is possible to miss the passenger and the vehicle owner from each other, and therefore, in the embodiment of the present invention, it may be set that: in at least two groups corresponding to the same starting place, the time ranges corresponding to two adjacent groups are mutually overlapped for a preset time length. As shown in fig. 3, for 4 packets corresponding to the same departure location, the time start point of each packet is extended forward by one hour (i.e. the overlapped preset time duration), and the time end point of each packet is extended backward by one hour, so that the time ranges corresponding to two adjacent packets are overlapped with each other by the preset time duration, thereby reducing the occurrence of the foregoing situation.
Optionally, in the embodiment of the present invention, after the first trip information is trip-matched with the second trip information in the second target group to obtain a trip matching degree value, the trip matching degree value may be sent to the owner terminal device and the passenger terminal device respectively for displaying, so as to be referred by the owner and the passenger. For example, the owner or passenger can communicate online and select each other according to the travel matching degree value. Optionally, the journey matching degree value exceeding the preset matching degree value may be sent to the owner terminal device and the passenger terminal device, respectively. Since the greater the travel matching degree value is, the greater the referenceability is, the preset matching degree value described herein is a matching degree value with a larger value, such as 50%, and the like.
Optionally, when performing the trip matching, the calculation may be delayed, that is, the trip information received within a preset time period is collected first, and then when the preset time period is ended, the trip information within the preset time period is uniformly subjected to the trip matching.
Assume that the existing departure points are a vehicle owner trip information set P1 and a passenger trip information set P2 for region C. A new set of owner trip information P11 and a new set of passenger trip information P22 originating from region C are collected over a period of time. A match between the trip information in P11 and P22, a match between the trip information in P11 and P2, and a match between the trip information in P22 and P1 are calculated.
In summary, in the embodiment of the present invention, when determining the matching degree between the travel of the vehicle owner and the travel of the passenger, the new travel information (i.e., the first travel information) is first grouped, and the group to which the new travel information belongs (i.e., the first target group) is determined. And then, grouping corresponding to the first target grouping (namely, a second target grouping), and finally, only performing stroke matching on the new stroke information and the stroke information in the second target grouping (namely, second stroke information). Because the grouping is performed according to the departure place information and the predicted departure time of the trip, in the corresponding passenger trip information grouping and the owner trip information grouping, the matching degree of the passenger trip information and the owner trip information is higher, and the referential property is higher, so that the trip matching method provided by the embodiment of the invention can be realized only by performing the trip matching on the new trip information and the trip information (namely the second trip information) in one grouping, and the trip matching between the newly released trip information of one user and all the trip information corresponding to the users of another type is not required, so that the data processing amount is reduced, the time consumption is short, the processing efficiency is improved, and the convenience is brought for the owner and the passenger to know the road degree of each other more quickly.
The above describes a route matching method provided by an embodiment of the present invention, and a device for dividing a boarding point provided by an embodiment of the present invention will be described below with reference to the accompanying drawings.
According to another aspect of the embodiments of the present invention, there is provided a trip matching apparatus, which is applied to a server, and can achieve all the details of the above-mentioned trip matching method embodiments and achieve the same effects, and therefore, in order to avoid repetition, the details are not repeated herein.
As shown in fig. 4, the stroke matching device includes:
the first determining module 401 is configured to, in a case that first travel information sent by a terminal device is received, determine, in at least two preset packets, a first target packet to which the first travel information belongs.
The at least two groups are grouped at least according to departure place information and expected departure time information in the travel information, the travel information in each group and the first travel information are issued by users of the same type, and the user type comprises: the owner and the passenger.
A second determining module 402, configured to determine a second target packet corresponding to the first target packet determined by the first determining module 401.
And the travel information in the second target group and the travel information in the first target group are issued by different types of users.
A processing module 403, configured to perform route matching on the first route information and the second route information in the second target packet determined by the second determining module 402.
Optionally, the second determining module 402 includes:
a first determination unit to determine a first packet in which departure place information and expected departure time information corresponding to the first target packet are the same.
And the travel information in the first grouping and the travel information in the first target grouping are issued by different types of users.
A second determination unit configured to determine the first packet determined by the first determination unit as a second target packet corresponding to the first target packet.
Optionally, the processing module 403 includes:
and the screening unit is used for screening the second stroke information in the second target group.
And the time interval between the predicted departure time corresponding to the second trip information and the predicted departure time corresponding to the first trip information is less than or equal to a preset time interval.
And the first processing unit is used for carrying out stroke matching on the first stroke information and the second stroke information screened by the screening unit.
Optionally, the processing module 403 includes:
a second processing unit, configured to, by a preset formula: a degree of trip matching ═ 1- [ (first distance + second distance)/third distance ], and trip matching between the first trip information and the second trip information is performed.
The first distance is a distance between a departure place corresponding to the first travel information and a departure place corresponding to the second travel information; the second distance is a distance between a destination corresponding to the first trip information and a destination corresponding to the second trip information; when the first travel information is travel information issued by an owner, the third distance is a distance between a departure place corresponding to the first travel information and a destination corresponding to the first travel information; and when the second travel information is the travel information issued by the owner, the third distance is a distance between a departure place corresponding to the second travel information and a destination corresponding to the second travel information.
Optionally, in at least two groups corresponding to the same origin, time ranges corresponding to two adjacent groups overlap each other for a preset time length.
In summary, in the embodiment of the present invention, when determining the matching degree between the travel of the vehicle owner and the travel of the passenger, the new travel information (i.e., the first travel information) is first grouped, and the group (i.e., the first target group) to which the new travel information belongs is determined. And then determining a group (namely a second target group) corresponding to the first target group, and finally, only needing to carry out stroke matching on the new stroke information and the stroke information (namely the second stroke information) in the second target group. Because the grouping is carried out according to the departure place information and the predicted departure time of the journey, in the corresponding passenger journey information grouping and the owner journey information grouping, the matching degree of the passenger journey information and the owner journey information is higher, and the referential performance is higher, therefore, by the journey matching method provided by the embodiment of the invention, only the journey information newly issued by one user and the journey information (namely, the second journey information) in one grouping are required to be subjected to journey matching, and the new journey information and all the journey information corresponding to another type of user are not required to be subjected to journey matching, so that the data processing amount is reduced, the time consumption is short, the processing efficiency is improved, and the convenience is brought for the owner and the passenger to know the road-following degree of each other more quickly.
According to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps in the above-mentioned run-length matching method when executing the computer program.
For example, fig. 5 shows a schematic physical structure diagram of an electronic device.
As shown in fig. 5, the electronic device may include: a processor (processor)510, a communication Interface (Communications Interface)520, a memory (memory)530, and a communication bus 540, wherein the processor 510, the communication Interface 520, and the memory 530 communicate with each other via the communication bus 540. Processor 510 may call logic instructions in memory 530 to perform the following method:
under the condition of receiving first travel information sent by terminal equipment, determining a first target packet to which the first travel information belongs in at least two preset packets; determining a second target packet corresponding to the first target packet; and performing stroke matching on the first stroke information and second stroke information in the second target group.
The at least two groups are grouped at least according to departure place information and expected departure time information in the travel information, the travel information in each group and the first travel information are issued by users of the same type, and the user type comprises: vehicle owners and passengers; the travel information in the second target group and the travel information in the first target group are issued by different types of users.
Furthermore, the logic instructions in the memory 530 may be implemented in the form of software functional units and stored in a computer readable storage medium when the software functional units are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes 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 various media capable of storing program codes.
According to a further aspect of the embodiments of the present invention, there is provided a computer-readable storage medium, on which a computer program is stored, which when executed by a processor is implemented to perform the steps of the above-mentioned run-length matching method, for example:
under the condition of receiving first travel information sent by terminal equipment, determining a first target packet to which the first travel information belongs in at least two preset packets; determining a second target packet corresponding to the first target packet; and performing stroke matching on the first stroke information and second stroke information in the second target group.
The at least two groups are grouped at least according to departure place information and expected departure time information in the travel information, the travel information in each group and the first travel information are issued by users of the same type, and the user type comprises: vehicle owners and passengers; the travel information in the second target group and the travel information in the first target group are issued by different types of users.
The above-described embodiments of the apparatus are merely illustrative, and the 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 modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A journey matching method is applied to a server and is characterized by comprising the following steps:
under the condition of receiving first travel information sent by terminal equipment, determining a first target packet to which the first travel information belongs in at least two preset packets; the at least two groups are grouped at least according to departure place information and expected departure time information in the travel information, the travel information in each group and the first travel information are issued by users of the same type, and the user type comprises: vehicle owners and passengers;
determining a second target packet corresponding to the first target packet; the travel information in the second target group and the travel information in the first target group are issued by different types of users;
performing trip matching on the first trip information and second trip information in the second target packet;
wherein said performing trip matching of the first trip information with the second trip information in the second target packet comprises:
by a preset formula: a trip matching degree ═ 1- [ (first distance + second distance)/third distance ], and the trip matching between the first trip information and the second trip information is performed;
the first distance is a distance between a departure place corresponding to the first travel information and a departure place corresponding to the second travel information; the second distance is a distance between a destination corresponding to the first trip information and a destination corresponding to the second trip information; when the first travel information is travel information issued by an owner, the third distance is a distance between a departure place corresponding to the first travel information and a destination corresponding to the first travel information; and when the second travel information is the travel information issued by the owner, the third distance is the distance between the departure place corresponding to the second travel information and the destination corresponding to the second travel information.
2. The trip matching method of claim 1, wherein said determining a second target grouping corresponding to the first target grouping comprises:
determining a first group which has the same departure place information and expected departure time information and corresponds to the first target group; the travel information in the first grouping and the travel information in the first target grouping are issued by different types of users;
determining the first packet as a second target packet corresponding to the first target packet.
3. The trip matching method of claim 1, wherein said trip matching the first trip information with second trip information in the second target packet comprises:
screening the second travel information in the second target group; the time interval between the predicted departure time corresponding to the second trip information and the predicted departure time corresponding to the first trip information is less than or equal to a preset time interval;
and carrying out travel matching on the first travel information and the second travel information.
4. The trip matching method according to claim 1, wherein the time ranges corresponding to two adjacent groups of the at least two groups corresponding to the same origin overlap each other by a predetermined time length.
5. A journey matching device applied to a server is characterized by comprising:
the first determining module is used for determining a first target group to which first travel information belongs in at least two preset groups under the condition of receiving the first travel information sent by the terminal equipment; the at least two groups are grouped at least according to departure place information and expected departure time information in the travel information, the travel information in each group and the first travel information are issued by users of the same type, and the user type comprises: vehicle owners and passengers;
a second determination module for determining a second target group corresponding to the first target group determined by the first determination module; the travel information in the second target group and the travel information in the first target group are issued by different types of users;
the processing module is used for carrying out stroke matching on the first stroke information and the second stroke information in the second target grouping determined by the second determining module;
wherein the processing module comprises:
a second processing unit, configured to, by a preset formula: a trip matching degree ═ 1- [ (first distance + second distance)/third distance ], and the trip matching between the first trip information and the second trip information is performed;
the first distance is a distance between a departure place corresponding to the first travel information and a departure place corresponding to the second travel information; the second distance is a distance between a destination corresponding to the first trip information and a destination corresponding to the second trip information; when the first travel information is travel information issued by an owner, the third distance is a distance between a departure place corresponding to the first travel information and a destination corresponding to the first travel information; and when the second travel information is the travel information issued by the owner, the third distance is the distance between the departure place corresponding to the second travel information and the destination corresponding to the second travel information.
6. The trip matching device of claim 5, wherein the second determining module comprises:
a first determining unit configured to determine a first packet in which departure place information and expected departure time information corresponding to the first target packet are the same; the travel information in the first grouping and the travel information in the first target grouping are issued by different types of users;
a second determination unit configured to determine the first packet determined by the first determination unit as a second target packet corresponding to the first target packet.
7. The stroke matching device of claim 5, wherein the processing module comprises:
a screening unit, configured to screen the second travel information from the second target group; the time interval between the predicted departure time corresponding to the second trip information and the predicted departure time corresponding to the first trip information is less than or equal to a preset time interval;
and the first processing unit is used for carrying out stroke matching on the first stroke information and the second stroke information screened by the screening unit.
8. The trip matching device according to claim 5, wherein the time ranges corresponding to two adjacent groups of the at least two groups corresponding to the same departure point overlap each other by a predetermined time.
9. An electronic device, comprising: processor, memory and computer program stored on the memory and executable on the processor, characterized in that the computer program realizes the steps of the run-length matching method according to any one of claims 1 to 4 when executed by the processor.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the journey matching method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911351489.6A CN111191128B (en) | 2019-12-24 | 2019-12-24 | Stroke matching method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911351489.6A CN111191128B (en) | 2019-12-24 | 2019-12-24 | Stroke matching method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111191128A CN111191128A (en) | 2020-05-22 |
| CN111191128B true CN111191128B (en) | 2022-06-07 |
Family
ID=70705833
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911351489.6A Active CN111191128B (en) | 2019-12-24 | 2019-12-24 | Stroke matching method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111191128B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111625571B (en) * | 2020-05-28 | 2021-06-08 | 上海钧正网络科技有限公司 | Service business matching method and device, computer equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103531025A (en) * | 2013-11-08 | 2014-01-22 | 宁波市康惠网络科技有限公司 | Carpooling system for matching information through route segmenting method |
| CN107767053A (en) * | 2017-10-23 | 2018-03-06 | 广东溢达纺织有限公司 | Matching method, device, storage medium and the computer equipment of rideshare trip |
| CN108304952A (en) * | 2017-01-12 | 2018-07-20 | 北京嘀嘀无限科技发展有限公司 | Information providing method and device in a kind of about vehicle application of network |
| CN109993329A (en) * | 2019-01-31 | 2019-07-09 | 阿里巴巴集团控股有限公司 | About vehicle information displaying method, device, system and equipment |
| CN110136431A (en) * | 2019-05-24 | 2019-08-16 | 深圳市元征科技股份有限公司 | A kind of vehicle sharing method and device |
-
2019
- 2019-12-24 CN CN201911351489.6A patent/CN111191128B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103531025A (en) * | 2013-11-08 | 2014-01-22 | 宁波市康惠网络科技有限公司 | Carpooling system for matching information through route segmenting method |
| CN108304952A (en) * | 2017-01-12 | 2018-07-20 | 北京嘀嘀无限科技发展有限公司 | Information providing method and device in a kind of about vehicle application of network |
| CN107767053A (en) * | 2017-10-23 | 2018-03-06 | 广东溢达纺织有限公司 | Matching method, device, storage medium and the computer equipment of rideshare trip |
| CN109993329A (en) * | 2019-01-31 | 2019-07-09 | 阿里巴巴集团控股有限公司 | About vehicle information displaying method, device, system and equipment |
| CN110136431A (en) * | 2019-05-24 | 2019-08-16 | 深圳市元征科技股份有限公司 | A kind of vehicle sharing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111191128A (en) | 2020-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107844843B (en) | Order processing method and server | |
| CN109829621A (en) | A kind of net about vehicle worksheet processing method and device | |
| CN107438226B (en) | Order issuing processing method and server | |
| CN110379180B (en) | Traffic signal control method, traffic signal control device and terminal equipment | |
| CN107919013B (en) | Get-on point processing method and server | |
| CN103761873B (en) | Carpooling system and utilize the share-car method of this Carpooling system | |
| CN105489001A (en) | Taxi scheduling optimization method and system | |
| CN112235162A (en) | Service-based monitoring method and device, electronic equipment and storage medium | |
| CN104332046A (en) | Taxi pooling method, system and server | |
| CN108399779B (en) | Vehicle scheduling processing method, device, equipment and storage medium | |
| CN106775936A (en) | The management method and device of a kind of virtual machine | |
| CN111256720B (en) | Navigation method and device | |
| CN112660209A (en) | Automatic train running chart adjusting method and device, electronic equipment and medium | |
| CN108399460A (en) | Network about vehicle Order splitting processing method and server | |
| CN111191128B (en) | Stroke matching method and device | |
| CN115988421A (en) | Time weight clustering-based occupational and residential area estimation method and device | |
| CN103956044A (en) | Intelligent taxi on-call system and method based on mobile internet | |
| CN105335313A (en) | Basic data transmission method and apparatus | |
| CN110826943B (en) | Method and related equipment for judging whether bus allocation is needed or not and determining bus allocation number | |
| CN112389445A (en) | Vehicle driving regulation and control method and device, vehicle-mounted equipment and readable storage medium | |
| CN107437208A (en) | Order processing method and server | |
| CN113743685B (en) | Method for determining bus timetable and electronic equipment | |
| CN107978145A (en) | A kind of method and system based on passengers quantity and run-length management Countryside Passenger Transportation public transport shift | |
| CN111833090A (en) | Method, device and equipment for processing car sharing order and storage medium | |
| CN104065642B (en) | Content delivering system, content distributing server and content distribution method |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |