CN113496361A - Real-time transport capacity recommendation method - Google Patents
Real-time transport capacity recommendation method Download PDFInfo
- Publication number
- CN113496361A CN113496361A CN202010195828.2A CN202010195828A CN113496361A CN 113496361 A CN113496361 A CN 113496361A CN 202010195828 A CN202010195828 A CN 202010195828A CN 113496361 A CN113496361 A CN 113496361A
- Authority
- CN
- China
- Prior art keywords
- information
- transportation task
- task information
- goods
- historical
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000011156 evaluation Methods 0.000 claims description 38
- 238000004364 calculation method Methods 0.000 claims description 10
- 238000000605 extraction Methods 0.000 claims description 3
- 230000007547 defect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
-
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
-
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0838—Historical data
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Data Mining & Analysis (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Human Resources & Organizations (AREA)
- Development Economics (AREA)
- General Engineering & Computer Science (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Artificial Intelligence (AREA)
- Databases & Information Systems (AREA)
- Computational Linguistics (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Computation (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the technical field of computers, and particularly relates to a real-time transport capacity recommendation method. The method comprises the steps that firstly, a server receives current transportation task information input by a client, wherein the current transportation task information at least comprises address elements, and the address elements are goods picking place information and goods unloading place information; secondly, the server side generates a transportation recommendation list by utilizing a real-time transportation recommendation algorithm in a matching mode according to the received current transportation task information, wherein each piece of record information in the transportation recommendation list at least comprises license plate number information; and step three, returning the generated capacity recommendation list to the client. The method and the system match historical transportation task information of the vehicle with current transportation task information, establish a two-dimensional scoring table of matching degree, and realize high adaptability of transportation capacity recommendation through scoring.
Description
Technical Field
The invention belongs to the technical field of computers, and particularly relates to a real-time transport capacity recommendation method.
Background
The capacity recommendation means that matched recommended capacity (vehicles, drivers and the like) is obtained from historical transportation execution information according to the current road cargo transportation task, and the transportation scheduling efficiency is improved and the transportation cost is reduced through return cargo allocation or frequent route vehicle recommendation and the like.
The current method for recommending the transport capacity is mainly based on the available transport capacity near the goods departure place, but in the field of vehicle transportation, the driving paths of a driver and a vehicle are often relatively solidified, namely, the driver and the vehicle frequently go and return on a certain route. Therefore, the general transportation capacity recommendation method based on the hot area and the cold area cannot well solve the problem of accurate transportation capacity recommendation.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a real-time transport capacity recommendation method aiming at the defects in the prior art, wherein historical transport task information of a vehicle is matched with current transport task information, a two-dimensional score table of matching degree is established, and high adaptability of transport capacity recommendation is realized through scoring.
In order to solve the technical problems, the invention adopts the technical scheme that: a real-time capacity recommendation method comprises the following steps:
the method comprises the steps that firstly, a server receives current transportation task information input by a client, wherein the current transportation task information at least comprises address elements, and the address elements are goods picking place information and goods unloading place information;
secondly, the server side generates a transportation recommendation list by utilizing a real-time transportation recommendation algorithm in a matching mode according to the received current transportation task information, wherein each piece of record information in the transportation recommendation list at least comprises license plate number information;
the real-time capacity recommendation algorithm is used for matching and generating the capacity recommendation list, and the method comprises the following steps:
step 201, representing the information of a goods taking place and the information of a goods unloading place in the current transportation task information as a form of an administrative area code and a detailed street address, wherein the level of the administrative area code is N, and N is a positive integer;
step 202, matching from historical transportation task information by using an administrative area code of goods-lifting place information and an administrative area code of goods-unloading place information in the current transportation task information according to a forward matching rule and a backward matching rule, wherein the front M digits of the administrative area code of the goods-lifting place information in the historical transportation task information matched by the forward matching rule are the same as the front M digits of the administrative area code of the goods-lifting place information in the current transportation task information, the front M digits of the administrative area code of the goods-unloading place information in the historical transportation task information are the same as the front M digits of the administrative area code of the goods-unloading place information in the current transportation task information, M is more than or equal to 1 and less than or equal to alpha N, alpha is more than or equal to 1, alpha is a positive integer, and each alpha digit in the administrative area code represents an administrative level; the set of forward matching results is denoted as Rs；
The first M digits of the administrative region code of the goods-picking place information in the historical transportation task information matched by the reverse matching rule are the same as the first M digits of the administrative region code of the goods-unloading place information in the current transportation task information, the first M digits of the administrative region code of the goods-unloading place information in the historical transportation task information are the same as the first M digits of the administrative region code of the goods-picking place information in the current transportation task information, and the reverse matching result set is recorded as Rc；
R is Rs∪Rc；
Step 203, establishing a two-dimensional conformity evaluation table by taking the address elements of the current transportation task information as columns and taking each historical transportation task information in the collection R as rows; scoring each historical transportation task information by adopting an address evaluation function; the address evaluation function is a similarity evaluation function, and for a result set RsCalculating similarity between an administrative area code of the goods-picking place information in the historical transportation task information and an administrative area code of the goods-picking place information in the current transportation task information, and calculating similarity between an administrative area code of the goods-unloading place information in the historical transportation task information and an administrative area code of the goods-unloading place information in the current transportation task information, wherein the higher the similarity is, the higher the score is; for result set RcCalculating similarity between an administrative area code of the goods-taking place information in the historical transportation task information and an administrative area code of the goods-taking place information in the current transportation task information, and calculating similarity between an administrative area code of the goods-taking place information in the historical transportation task information and an administrative area code of the goods-taking place information in the current transportation task information, wherein the higher the similarity is, the higher the score is; taking the address elements of the current transportation task information as columns, and taking the scoring result as the sum value D of the score corresponding to the goods-taking place information and the score corresponding to the goods-unloading place information in the historical transportation task information1；
Step 204, sorting the plurality of historical transportation task information according to the grading result D of each piece of historical transportation task information from high to low, wherein D is k1D1，k1Extracting information of each historical task information according to the sequence of the weighted values scored for the corresponding address elements, at least extracting license plate number information, generating a transportation capacity recommendation list by using the extracted information and the extraction sequence, wherein the information extracted firstly is arranged at the first position of the transportation capacity recommendation list;
and step three, returning the generated capacity recommendation list to the client.
In the real-time transportation capacity recommendation method, when the address evaluation function is evaluated: recording the addresses as N according to the administrative level, comparing the two addresses from 1-N step by step, obtaining Z/N score for each same step, wherein Z is larger than 0, otherwise stopping comparison and obtaining 0 score for the step, and summing the comparison scores step by step to obtain the score.
In the above real-time transportation capacity recommendation method, in the first step, the current transportation task information further includes a date element, where the date element includes a planned delivery time and a planned arrival time; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the date elements of the current transportation task information as columns and each historical transportation task information in the collection R as rows; scoring each historical transportation task information by adopting a date evaluation function; in scoring, R is scored for the result setsThe calculation interval days S between the planned delivery time in the historical transportation task information and the planned delivery time in the current transportation task information is takenFIf S isFMore than or equal to Z, the score is 0, if SFIf < Z, the score is Z-SF(ii) a Calculating the interval days S between the planned receiving time in the historical transportation task information and the planned receiving time in the current transportation task informationSIf S isSMore than or equal to Z, the score is 0, if SSIf < Z, the score is Z-SS；
Record R for the result setcThe historical transportation task information is taken, and the calculation interval days S between the planned delivery time in the historical transportation task information and the planned receiving time in the current transportation task information is calculatedFIf S isFMore than or equal to Z, the score is 0, if SFIf < Z, the score is Z-SF(ii) a Taking the planned receiving time and the current transportation task information in the historical transportation task informationPlanned delivery time calculation interval days SSIf S isSMore than or equal to Z, the score is 0, if SSIf < Z, the score is Z-SS(ii) a Taking the date elements of the current transportation task information as columns, and taking the scoring result as the sum value D of the score corresponding to the goods-taking place information and the score corresponding to the goods-unloading place information in the historical transportation task information2；
In step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2，k2A weight value for the date element score.
In the above real-time transportation capacity recommendation method, in the first step, the current transportation task information further includes a quantity element, and the quantity element includes delivery quantity information; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the quantity elements of the current transportation task information as columns and taking each historical transportation task information in the set R as rows; grading each historical transportation task information by adopting a quantity evaluation function; when the evaluation is carried out, the delivery quantity information a in the historical transportation task information and the delivery quantity information b in the current transportation task information are taken, and the evaluation is carried out according to the formula of {1- (a-b)/[ (a + b) × 0.5]Z calculation score D3；
In step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2+k3D3，k3A weight value for scoring the corresponding number of elements.
In the real-time transportation capacity recommendation method, in the first step, the current transportation task information further includes a character element, and the character element includes cargo name information; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the character elements of the current transportation task information as columns and each historical transportation task information in the set R as rows; scoring each historical transportation task information by adopting a character evaluation function; during scoring, the goods name information T in the historical transportation task information and the goods name information U in the current transportation task information are taken, whether the goods name information T exists in the goods name information U or not is judged, if yes, the score is Z, and if not, the score is 0;
in step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2+k3D3+k4D4，k4And (4) the weighted value of the corresponding character element score.
Compared with the prior art, the invention has the following advantages: the method and the system match historical transportation task information of the vehicle with current transportation task information, establish a two-dimensional scoring table of matching degree, and realize high adaptability of transportation capacity recommendation through scoring. And when in matching, the four dimensions of the address element, the date element, the number element and the character element are matched and scored, so that the capacity recommendation has high adaptability.
Detailed Description
A real-time capacity recommendation method comprises the following steps:
the method comprises the steps that firstly, a server receives current transportation task information input by a client, wherein the current transportation task information at least comprises address elements, and the address elements are goods picking place information and goods unloading place information;
secondly, the server side generates a transportation recommendation list by utilizing a real-time transportation recommendation algorithm in a matching mode according to the received current transportation task information, wherein each piece of record information in the transportation recommendation list at least comprises license plate number information;
the real-time capacity recommendation algorithm is used for matching and generating the capacity recommendation list, and the method comprises the following steps:
step 201, representing the information of a goods taking place and the information of a goods unloading place in the current transportation task information as a form of an administrative area code and a detailed street address, wherein the level of the administrative area code is N, and N is a positive integer; for example, the administrative region code is composed of three administrative levels of region codes of "province-city-district/county" and N is 3, for example, an administrative region code is 130102, where the first two digits 13 represent the province of north river, the middle two digits represent 01 the city of the Shijiazhuang city, and the last two digits 02 represent the Changan district;
step 202, utilizing the administrative region code of the goods taking place information and the administrative region code of the goods unloading place information in the current transportation task informationMatching from historical transportation task information according to two matching rules of a forward direction and a reverse direction, wherein the former M digits of administrative area codes of goods-lifting place information in the historical transportation task information matched by the forward matching rule are the same as the former M digits of administrative area codes of goods-lifting place information in the current transportation task information, the former M digits of administrative area codes of goods-unloading place information in the historical transportation task information are the same as the former M digits of administrative area codes of goods-unloading place information in the current transportation task information, 1 is less than or equal to M and less than or equal to alpha N, alpha is greater than or equal to 1, alpha is a positive integer, each alpha digit in the administrative area codes represents an administrative level, for example, an administrative level 130102 is an administrative area code in China, each two digits represent an administrative level, and alpha is 2 at the moment, and a forward matching result set is Rs；
The first M digits of the administrative region code of the goods-picking place information in the historical transportation task information matched by the reverse matching rule are the same as the first M digits of the administrative region code of the goods-unloading place information in the current transportation task information, the first M digits of the administrative region code of the goods-unloading place information in the historical transportation task information are the same as the first M digits of the administrative region code of the goods-picking place information in the current transportation task information, and the reverse matching result set is recorded as Rc；
R is Rs∪Rc；
For example, assume that the administrative area code of the pickup location information in the current transportation task information is aaaaaaaa and the administrative area code of the unloading location information is bbbbbbbb, the administrative area code of the pickup location information in the history transportation task information that is matched in the forward direction is AAAAAA and the administrative area code of the unloading location information is bbbbbbbb, and the administrative area code of the pickup location information in the history transportation task information that is matched in the reverse direction is BBBBBB and the administrative area code of the unloading location information is aaaaaaaa;
step 203, establishing a two-dimensional conformity evaluation table by taking the address elements of the current transportation task information as columns and taking each historical transportation task information in the collection R as rows; scoring each historical transportation task information by adopting an address evaluation function; the address evaluation function is a similarity evaluation function,for result set RsCalculating similarity between an administrative area code of the goods-picking place information in the historical transportation task information and an administrative area code of the goods-picking place information in the current transportation task information, and calculating similarity between an administrative area code of the goods-unloading place information in the historical transportation task information and an administrative area code of the goods-unloading place information in the current transportation task information, wherein the higher the similarity is, the higher the score is; for result set RcCalculating similarity between an administrative area code of the goods-taking place information in the historical transportation task information and an administrative area code of the goods-taking place information in the current transportation task information, and calculating similarity between an administrative area code of the goods-taking place information in the historical transportation task information and an administrative area code of the goods-taking place information in the current transportation task information, wherein the higher the similarity is, the higher the score is; taking the address elements of the current transportation task information as columns, and taking the scoring result as the sum value D of the score corresponding to the goods-taking place information and the score corresponding to the goods-unloading place information in the historical transportation task information1；
For example, one address evaluation function principle is as follows: recording the addresses as N according to the administrative level, comparing the two addresses from 1-N step by step, obtaining Z/N score for each same step, wherein Z is larger than 0, otherwise stopping comparison and obtaining 0 score for the step, and summing the comparison scores step by step to obtain the score.
Step 204, sorting the plurality of historical transportation task information according to the grading result D of each piece of historical transportation task information from high to low, wherein D is k1D1，k1Extracting information of each historical task information according to the sequence of the weighted values scored for the corresponding address elements, at least extracting license plate number information, generating a transportation capacity recommendation list by using the extracted information and the extraction sequence, wherein the information extracted firstly is arranged at the first position of the transportation capacity recommendation list;
and step three, returning the generated capacity recommendation list to the client.
In another embodiment, in step one, the current transportation task information further comprises a date element, wherein the date element comprises a planned delivery time and a planned arrival time; step 203 also includes using the current transportation task informationTaking date elements as columns, taking each historical transportation task information in the collection R as a row, and establishing a two-dimensional conformity evaluation table; scoring each historical transportation task information by adopting a date evaluation function; in scoring, R is scored for the result setsThe calculation interval days S between the planned delivery time in the historical transportation task information and the planned delivery time in the current transportation task information is takenFIf S isFMore than or equal to Z, the score is 0, if SFIf < Z, the score is Z-SF(ii) a Calculating the interval days S between the planned receiving time in the historical transportation task information and the planned receiving time in the current transportation task informationSIf S isSMore than or equal to Z, the score is 0, if SSIf < Z, the score is Z-SS；
Record R for the result setcThe historical transportation task information is taken, and the calculation interval days S between the planned delivery time in the historical transportation task information and the planned receiving time in the current transportation task information is calculatedFIf S isFMore than or equal to Z, the score is 0, if SFIf < Z, the score is Z-SF(ii) a Calculating the interval days S between the planned receiving time in the historical transportation task information and the planned delivery time in the current transportation task informationSIf S isSMore than or equal to Z, the score is 0, if SSIf < Z, the score is Z-SS(ii) a Taking the date elements of the current transportation task information as columns, and taking the scoring result as the sum value D of the score corresponding to the goods-taking place information and the score corresponding to the goods-unloading place information in the historical transportation task information2；
In step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2，k2A weight value for the date element score.
In another embodiment, in step one, the current transportation task information further comprises a quantity element, and the quantity element comprises shipping quantity information; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the quantity elements of the current transportation task information as columns and taking each historical transportation task information in the set R as rows; using a quantitative rating function for each historical shipmentGrading the task information; when the evaluation is carried out, the delivery quantity information a in the historical transportation task information and the delivery quantity information b in the current transportation task information are taken, and the evaluation is carried out according to the formula of {1- (a-b)/[ (a + b) × 0.5]Z calculation score D3；
In step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2+k3D3，k3A weight value for scoring the corresponding number of elements.
In another embodiment, in step one, the current transportation task information further comprises a character element, and the character element comprises cargo name information; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the character elements of the current transportation task information as columns and each historical transportation task information in the set R as rows; scoring each historical transportation task information by adopting a character evaluation function; during scoring, the goods name information T in the historical transportation task information and the goods name information U in the current transportation task information are taken, whether the goods name information T exists in the goods name information U or not is judged, if yes, the score is Z, and if not, the score is 0;
in step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2+k3D3+k4D4，k4And (4) the weighted value of the corresponding character element score.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and all simple modifications, changes and equivalent structural changes made to the above embodiment according to the technical spirit of the present invention still fall within the protection scope of the technical solution of the present invention.
Claims (5)
1. A real-time capacity recommendation method is characterized by comprising the following steps: the method comprises the following steps:
the method comprises the steps that firstly, a server receives current transportation task information input by a client, wherein the current transportation task information at least comprises address elements, and the address elements are goods picking place information and goods unloading place information;
secondly, the server side generates a transportation recommendation list by utilizing a real-time transportation recommendation algorithm in a matching mode according to the received current transportation task information, wherein each piece of record information in the transportation recommendation list at least comprises license plate number information;
the real-time capacity recommendation algorithm is used for matching and generating the capacity recommendation list, and the method comprises the following steps:
step 201, representing the information of a goods taking place and the information of a goods unloading place in the current transportation task information as a form of an administrative area code and a detailed street address, wherein the level of the administrative area code is N, and N is a positive integer;
step 202, matching from historical transportation task information by using an administrative area code of goods-lifting place information and an administrative area code of goods-unloading place information in the current transportation task information according to a forward matching rule and a backward matching rule, wherein the front M digits of the administrative area code of the goods-lifting place information in the historical transportation task information matched by the forward matching rule are the same as the front M digits of the administrative area code of the goods-lifting place information in the current transportation task information, the front M digits of the administrative area code of the goods-unloading place information in the historical transportation task information are the same as the front M digits of the administrative area code of the goods-unloading place information in the current transportation task information, M is more than or equal to 1 and less than or equal to alpha N, alpha is more than or equal to 1, alpha is a positive integer, and each alpha digit in the administrative area code represents an administrative level; the set of forward matching results is denoted as Rs；
The first M digits of the administrative region code of the goods-picking place information in the historical transportation task information matched by the reverse matching rule are the same as the first M digits of the administrative region code of the goods-unloading place information in the current transportation task information, the first M digits of the administrative region code of the goods-unloading place information in the historical transportation task information are the same as the first M digits of the administrative region code of the goods-picking place information in the current transportation task information, and the reverse matching result set is recorded as Rc；
R is Rs∪Rc；
Step 203, taking the address elements of the current transportation task information as columns, taking each historical transportation task information in the collection R as rows,establishing a two-dimensional conformity evaluation table; scoring each historical transportation task information by adopting an address evaluation function; the address evaluation function is a similarity evaluation function, and for a result set RsCalculating similarity between an administrative area code of the goods-picking place information in the historical transportation task information and an administrative area code of the goods-picking place information in the current transportation task information, and calculating similarity between an administrative area code of the goods-unloading place information in the historical transportation task information and an administrative area code of the goods-unloading place information in the current transportation task information, wherein the higher the similarity is, the higher the score is; for result set RcCalculating similarity between an administrative area code of the goods-taking place information in the historical transportation task information and an administrative area code of the goods-taking place information in the current transportation task information, and calculating similarity between an administrative area code of the goods-taking place information in the historical transportation task information and an administrative area code of the goods-taking place information in the current transportation task information, wherein the higher the similarity is, the higher the score is; taking the address elements of the current transportation task information as columns, and taking the scoring result as the sum value D of the score corresponding to the goods-taking place information and the score corresponding to the goods-unloading place information in the historical transportation task information1；
Step 204, sorting the plurality of historical transportation task information according to the grading result D of each piece of historical transportation task information from high to low, wherein D is k1D1，k1Extracting information of each historical task information according to the sequence of the weighted values scored for the corresponding address elements, at least extracting license plate number information, generating a transportation capacity recommendation list by using the extracted information and the extraction sequence, wherein the information extracted firstly is arranged at the first position of the transportation capacity recommendation list;
and step three, returning the generated capacity recommendation list to the client.
2. A real-time capacity recommendation method according to claim 1, characterized by: when the address evaluation function is evaluated: recording the addresses as N according to the administrative level, comparing the two addresses from 1-N step by step, obtaining Z/N score for each same step, wherein Z is larger than 0, otherwise stopping comparison and obtaining 0 score for the step, and summing the comparison scores step by step to obtain the score.
3. A real-time capacity recommendation method according to claim 1 or 2, characterized by: in the first step, the current transportation task information further comprises a date element, wherein the date element comprises a scheduled delivery time and a scheduled arrival time; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the date elements of the current transportation task information as columns and each historical transportation task information in the collection R as rows; scoring each historical transportation task information by adopting a date evaluation function; in scoring, R is scored for the result setsThe calculation interval days S between the planned delivery time in the historical transportation task information and the planned delivery time in the current transportation task information is takenFIf S isFMore than or equal to Z, the score is 0, if SFIf < Z, the score is Z-SF(ii) a Calculating the interval days S between the planned receiving time in the historical transportation task information and the planned receiving time in the current transportation task informationSIf S isSMore than or equal to Z, the score is 0, if SSIf < Z, the score is Z-SS；
Record R for the result setcThe historical transportation task information is taken, and the calculation interval days S between the planned delivery time in the historical transportation task information and the planned receiving time in the current transportation task information is calculatedFIf S isFMore than or equal to Z, the score is 0, if SFIf < Z, the score is Z-SF(ii) a Calculating the interval days S between the planned receiving time in the historical transportation task information and the planned delivery time in the current transportation task informationSIf S isSMore than or equal to Z, the score is 0, if SSIf < Z, the score is Z-SS(ii) a Taking the date elements of the current transportation task information as columns, and taking the scoring result as the sum value D of the score corresponding to the goods-taking place information and the score corresponding to the goods-unloading place information in the historical transportation task information2；
In step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2，k2A weight value for the date element score.
4. A real-time capacity recommendation method according to claim 3, wherein: in the first step, the current transportation task information further comprises a quantity element, and the quantity element comprises delivery quantity information; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the quantity elements of the current transportation task information as columns and taking each historical transportation task information in the set R as rows; grading each historical transportation task information by adopting a quantity evaluation function; when the evaluation is carried out, the delivery quantity information a in the historical transportation task information and the delivery quantity information b in the current transportation task information are taken, and the evaluation is carried out according to the formula of {1- (a-b)/[ (a + b) × 0.5]Z calculation score D3；
In step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2+k3D3，k3A weight value for scoring the corresponding number of elements.
5. A real-time capacity recommendation method according to claim 4, wherein: in the first step, the current transportation task information further comprises character elements, and the character elements comprise cargo name information; step 203 further comprises establishing a two-dimensional conformity evaluation table by taking the character elements of the current transportation task information as columns and each historical transportation task information in the set R as rows; scoring each historical transportation task information by adopting a character evaluation function; during scoring, the goods name information T in the historical transportation task information and the goods name information U in the current transportation task information are taken, whether the goods name information T exists in the goods name information U or not is judged, if yes, the score is Z, and if not, the score is 0;
in step 204, the scoring result D ═ k of each historical transportation task information1D1+k2D2+k3D3+k4D4，k4And (4) the weighted value of the corresponding character element score.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010195828.2A CN113496361B (en) | 2020-03-19 | 2020-03-19 | Real-time transport capacity recommendation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010195828.2A CN113496361B (en) | 2020-03-19 | 2020-03-19 | Real-time transport capacity recommendation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113496361A true CN113496361A (en) | 2021-10-12 |
| CN113496361B CN113496361B (en) | 2022-05-20 |
Family
ID=77993383
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010195828.2A Expired - Fee Related CN113496361B (en) | 2020-03-19 | 2020-03-19 | Real-time transport capacity recommendation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113496361B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116911714A (en) * | 2023-09-11 | 2023-10-20 | 中关村科学城城市大脑股份有限公司 | Method, apparatus, electronic device, and computer-readable medium for transporting articles |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102393937A (en) * | 2011-10-12 | 2012-03-28 | 深圳市络道科技有限公司 | Address matching method and system of address tree based on backward production |
| CN103839148A (en) * | 2014-03-18 | 2014-06-04 | 上海电机学院 | Express recognizing and sorting system and method |
| CN104318413A (en) * | 2014-10-22 | 2015-01-28 | 长沙路联信息科技有限公司 | Logistics information matching method and system |
| CN105809390A (en) * | 2016-02-26 | 2016-07-27 | 北京运科网络科技有限公司 | Method and apparatus for calculating matching degree between drivers and goods |
| CN107180280A (en) * | 2017-06-16 | 2017-09-19 | 深圳市凡谷大地股份有限公司 | Logistics route planning method and system based on path adaptation |
| CN107506964A (en) * | 2017-08-23 | 2017-12-22 | 北京惠赢天下网络技术有限公司 | A kind of Distribution logistics network share method, system and terminal based on standard container |
| CN107862493A (en) * | 2017-10-20 | 2018-03-30 | 广西大学 | A kind of goods stock matching travels on the way the numerical value determination methods of goods nearby |
| CN109118131A (en) * | 2017-06-23 | 2019-01-01 | 菜鸟智能物流控股有限公司 | Logistics data processing method and device |
| CN109615290A (en) * | 2018-11-28 | 2019-04-12 | 北京京东尚科信息技术有限公司 | For obtaining the method, apparatus, system and medium of address for service |
| CN110119928A (en) * | 2019-05-07 | 2019-08-13 | 宏图物流股份有限公司 | A kind of vehicle match recommended method based on driver's feature |
| CN110400060A (en) * | 2019-07-08 | 2019-11-01 | 拉货宝网络科技有限责任公司 | A kind of Highway Logistics source of goods recommended method based on vehicle Geographic mapping |
| CN110880065A (en) * | 2019-11-06 | 2020-03-13 | 南京大学 | Return cargo source pushing method for special line driver |
-
2020
- 2020-03-19 CN CN202010195828.2A patent/CN113496361B/en not_active Expired - Fee Related
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102393937A (en) * | 2011-10-12 | 2012-03-28 | 深圳市络道科技有限公司 | Address matching method and system of address tree based on backward production |
| CN103839148A (en) * | 2014-03-18 | 2014-06-04 | 上海电机学院 | Express recognizing and sorting system and method |
| CN104318413A (en) * | 2014-10-22 | 2015-01-28 | 长沙路联信息科技有限公司 | Logistics information matching method and system |
| CN105809390A (en) * | 2016-02-26 | 2016-07-27 | 北京运科网络科技有限公司 | Method and apparatus for calculating matching degree between drivers and goods |
| CN107180280A (en) * | 2017-06-16 | 2017-09-19 | 深圳市凡谷大地股份有限公司 | Logistics route planning method and system based on path adaptation |
| CN109118131A (en) * | 2017-06-23 | 2019-01-01 | 菜鸟智能物流控股有限公司 | Logistics data processing method and device |
| CN107506964A (en) * | 2017-08-23 | 2017-12-22 | 北京惠赢天下网络技术有限公司 | A kind of Distribution logistics network share method, system and terminal based on standard container |
| CN107862493A (en) * | 2017-10-20 | 2018-03-30 | 广西大学 | A kind of goods stock matching travels on the way the numerical value determination methods of goods nearby |
| CN109615290A (en) * | 2018-11-28 | 2019-04-12 | 北京京东尚科信息技术有限公司 | For obtaining the method, apparatus, system and medium of address for service |
| CN110119928A (en) * | 2019-05-07 | 2019-08-13 | 宏图物流股份有限公司 | A kind of vehicle match recommended method based on driver's feature |
| CN110400060A (en) * | 2019-07-08 | 2019-11-01 | 拉货宝网络科技有限责任公司 | A kind of Highway Logistics source of goods recommended method based on vehicle Geographic mapping |
| CN110880065A (en) * | 2019-11-06 | 2020-03-13 | 南京大学 | Return cargo source pushing method for special line driver |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116911714A (en) * | 2023-09-11 | 2023-10-20 | 中关村科学城城市大脑股份有限公司 | Method, apparatus, electronic device, and computer-readable medium for transporting articles |
| CN116911714B (en) * | 2023-09-11 | 2023-12-08 | 中关村科学城城市大脑股份有限公司 | Method, apparatus, electronic device, and computer-readable medium for transporting articles |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113496361B (en) | 2022-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107818412A (en) | A kind of extensive bus passenger OD parallel calculating methods based on MapReduce | |
| CN107610471A (en) | Vehicle fake-license detection method and system | |
| CN110991967A (en) | Logistics transportation method and device | |
| CN113496361B (en) | Real-time transport capacity recommendation method | |
| CN104318327A (en) | Predictive parsing method for track of vehicle | |
| CN103902650A (en) | Solution for determining consignee address and zip code based on contact number of recipient in express industry | |
| US7584173B2 (en) | Edit distance string search | |
| CN108230724A (en) | A kind of urban mass-transit system Vehicle station name announcing missing data method for repairing and mending based on maximum probability estimation | |
| CN114647684A (en) | Traffic prediction method and device based on stacking algorithm and related equipment | |
| CN113743863A (en) | Vehicle and goods matching method based on intelligent contract | |
| CN112085236A (en) | City hotspot POI detection method and device based on network appointment order data | |
| CN103176976B (en) | A kind of association rule mining method based on data compression Apriori algorithm | |
| CN116775747A (en) | Personnel early warning method and system based on Apriori algorithm | |
| CN111027783A (en) | Global dynamic interaction decision algorithm for path selection | |
| JP2004217340A (en) | Transport plan preparing system and method thereof | |
| JP2006190054A (en) | Method and system for exchanging merchandise between stores, and program | |
| CN111209473B (en) | Vehicle and goods matching method and system based on big data | |
| CN112860766A (en) | Bus running number determination method and device | |
| CN112070429A (en) | Address merging method and system | |
| Rahma et al. | The best route determination using nearest neighbor approach | |
| CN115830901B (en) | Method and device for determining truck stay point | |
| CN107657406A (en) | A kind of transport power stage division and device | |
| CN106919800A (en) | The conflicting evidence management method of low similarity collision in a kind of evidence theory | |
| CN112184110B (en) | Method, system, device and storage medium for instant communication between logistics nodes | |
| CN112623603B (en) | Goods sorting method for intelligent storage |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20220520 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |