CN111652561A - Route recommendation method, computer storage medium and electronic device - Google Patents

Route recommendation method, computer storage medium and electronic device Download PDF

Info

Publication number
CN111652561A
CN111652561A CN202010528672.5A CN202010528672A CN111652561A CN 111652561 A CN111652561 A CN 111652561A CN 202010528672 A CN202010528672 A CN 202010528672A CN 111652561 A CN111652561 A CN 111652561A
Authority
CN
China
Prior art keywords
line
cooperative
candidate
independent
cost
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010528672.5A
Other languages
Chinese (zh)
Inventor
张世伟
唐守殿
王燕
张建涛
朱振辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai zebra Laila Logistics Technology Co.,Ltd.
Original Assignee
Shanghai Kjing Xinda Science And Technology Group Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Kjing Xinda Science And Technology Group Co ltd filed Critical Shanghai Kjing Xinda Science And Technology Group Co ltd
Priority to CN202010528672.5A priority Critical patent/CN111652561A/en
Publication of CN111652561A publication Critical patent/CN111652561A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A line recommendation method, a computer storage medium and an electronic device include: acquiring information of an order, wherein the information of the order comprises: a goods taking address, a destination address, goods to be transported, a goods taking mode and a transportation time length; determining a carrying object according to the goods taking address, the destination address, the goods to be transported and the goods taking mode; determining a transport route for the carrier object; determining the expected time length corresponding to the transportation line; forming a transportation line set by the transportation lines with the estimated time length not greater than the transportation time length; determining a recommended route from a set of transportation routes; and recommending a recommended route. The method determines a carrying object according to the goods taking address, the destination address, the goods to be transported and the goods picking mode, determines the expected duration corresponding to the transportation line, forms the transportation line set by the transportation line with the expected duration not greater than the transportation duration, recommends the line in the transportation line set, and realizes the intelligent recommendation of a proper line.

Description

Route recommendation method, computer storage medium and electronic device
Technical Field
The present application relates to computer technologies, and in particular, to a line recommendation method, a computer storage medium, and an electronic device.
Background
With the development of the internet and electronic commerce, logistics is receiving attention.
The conventional logistics method simply lists available logistics lines to users, or simply lists various lines to users, and the users need to select a suitable line from a great deal of line information, and the users can spend much time on selecting the line but finally can not select the most suitable line.
Disclosure of Invention
The embodiment of the application provides a line recommendation method, a computer storage medium and an electronic device, so as to solve the technical problems.
According to a first aspect of embodiments of the present application, there is provided a line recommendation method, including:
obtaining information of an order, wherein the information of the order comprises: a goods taking address, a destination address, goods to be transported, a goods taking mode and a transportation time length;
determining a carrying object according to the goods taking address, the destination address, the goods to be transported and the goods taking mode;
determining a transport route of the carrier object;
determining the expected time length corresponding to the transportation line;
forming a transportation route set by the transportation routes with the estimated time length not greater than the transportation time length;
determining a recommended route from the set of transportation routes;
and recommending the recommended route.
In a second aspect, embodiments of the present application provide a computer storage medium having a computer program stored thereon, where the computer program is executed by a processor to implement the steps of the method as described above.
In a third aspect, an embodiment of the present application provides an electronic device, which includes a memory and one or more processors, where the memory is used to store one or more programs; the one or more programs, when executed by the one or more processors, implement the method as described above.
In the scheme provided in this embodiment, a carrying object is determined according to the pickup address, the destination address, the goods to be transported, and the pickup mode, the estimated duration corresponding to the transportation route is determined, the transportation routes with the estimated duration not greater than the transportation duration form a transportation route set, and the routes in the transportation route set are recommended, so that intelligent recommendation of appropriate routes is realized.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic flowchart illustrating a route recommendation method provided in an embodiment of the present application;
fig. 2 shows a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
The conventional logistics method simply lists available logistics lines to users, or simply lists various lines to users, and the users need to select a suitable line from a great deal of line information, and the users can spend much time on selecting the line but finally can not select the most suitable line.
Based on the above, the application provides a line recommendation method, which determines a carrying object according to the goods picking address, the destination address, the goods to be transported and the goods picking mode, determines the expected duration corresponding to the transportation line, forms a transportation line set with the transportation line of which the expected duration is not greater than the transportation duration, recommends the line in the transportation line set, and realizes intelligent recommendation of a proper line.
Referring to fig. 1, the data processing scheme provided in this embodiment is as follows:
101, obtaining the information of the order.
Wherein the information of the order comprises: the goods taking address, the destination address, the goods to be transported, the freight rate, the goods taking mode and the transportation time length. In addition, the information of the order may include, but is not limited to, owner, weight, volume, pick-up, payment for delivery, etc.
And 102, determining a carrying object according to the goods taking address, the destination address, the goods to be transported and the goods taking mode.
The carrier objects in this embodiment include three types, one is an independent carrier object, one is a cooperative carrier object set, and one is a joint carrier object.
The implementation process of the step is as follows:
102-1, determining a package object to form a package object set, wherein the service range of the package object comprises a pickup address, carries the goods to be transported and has an on-door goods receiving business.
102-2, determining the falling objects to form a falling object set, wherein the service range of the falling objects comprises destination addresses, and the falling objects carry goods to be transported and have businesses corresponding to the goods picking modes.
If the goods picking mode is self-picking, the goods falling object needs to open the self-picking service. When the goods picking mode is 'delivery to home', the goods falling object needs to open a 'dispatching' service.
102-3, determining the carrying objects belonging to the package object set and the falling object set as independent carrying objects, and forming all the independent carrying objects into an independent carrying object set.
102-4, forming the elements of the non-independent carrying objects in the package object set into a first package object subset, and forming the elements of the non-independent carrying objects in the falling object set into a first falling object subset.
102-5, if any element in the first package object subset has a cooperative relationship with any element in the first package object subset, determining any element in the first package object subset and the element having the cooperative relationship as a cooperative carrying object, and forming all the cooperative carrying objects into a cooperative carrying object set.
102-6, forming the elements of the non-cooperative carrier objects in the first subset of the package objects into a second subset of the package objects, and forming the elements of the non-cooperative carrier objects in the first subset of the drop objects into a second subset of the drop objects.
102-7, if any element in the second package object subset has a potential relationship with any element in the second package object subset, determining any element in the second package object subset and the element having the potential relationship as a joint carrying object, and forming all joint carrying objects into a joint carrying object set.
Wherein, among all the operation nodes of any element in the second package object subset and the operation nodes of the elements with potential relationship, at least one operation node is located in the same city.
Such as: the number of operation nodes of one element A in the second collection object subset is 3, and the operation nodes are respectively located in a city 1, a city 2 and a city 3, the element of the operation node arranged in the city 1 in the second collection object subset is an element having a potential relationship with the element A, the element of the operation node arranged in the city 2 in the second collection object subset is also an element having a potential relationship with the element A, and the element of the operation node arranged in the city 3 in the second collection object subset is also an element having a potential relationship with the element A.
102-8, taking all elements in the independent object carrying set, the cooperation object carrying set and the joint object carrying set as carrying objects.
The carrier enterprises of the independent carrier objects can independently meet the order requirements.
There are 2 actual carriers in the cooperation object, and there is business cooperation between 2 carriers, and 1 of them is responsible for picking up goods, and another 1 is responsible for dropping down goods.
The joint shipping object has 2 actual shipping enterprises, but no business cooperation exists among the 2 shipping enterprises, wherein 1 shipping enterprise is responsible for picking up goods, and the other 1 shipping enterprise is responsible for dropping down goods.
103, a transportation route of the object is determined.
The transportation route in this step can be calculated by the existing route calculation scheme, and this embodiment is not described again.
And 104, determining the corresponding estimated time length of the transportation line.
The estimated time length corresponding to the transportation route in this step can be calculated by the existing route operation time length calculation scheme, which is not described in detail in this embodiment.
And 105, forming the transportation routes with the predicted time length not greater than the transportation time length into a transportation route set.
This is performed to obtain a transportation route for each carrier object (independent, cooperative, and joint).
And 106, determining a recommended route from the transportation route set.
The specific implementation flow of the step is as follows:
106-1, determining the cost of each transportation line in the transportation line set.
The cost of the transport route in this step can be obtained from the estimated cost per unit time of the route operation duration.
The cost per unit time can be estimated according to the information of the product, goods, weight, volume, delivery mode, payment, collection payment and the like of the order.
106-2, calculating the gross interest rate of each transportation line according to the cost of each transportation line.
Wherein the gross interest rate of any transportation route is (transportation charge of the order-cost of any transportation route)/cost of any transportation route.
106-3, selecting the transportation line with the gross interest rate not less than the preset value as a candidate line.
Wherein, the preset value can be 5%.
106-4, determining a recommended route from the candidate routes.
106-4 is implemented as follows:
106-4-1, determining whether a historical cooperative line exists within a preset time period according to the information of the order.
106-4-2, if no historical cooperative lines exist, determining a recommended line from the candidate lines according to the carrying objects corresponding to the candidate lines.
Specifically, the recommended lines include 3, which are a fourth recommended line, a fifth recommended line and a sixth recommended line, respectively.
In specific implementation, the fourth recommended line is used as a main recommended line, the fifth recommended line is used as a first candidate recommended line, and the sixth recommended line is used as a second candidate recommended line.
The fourth recommended route is determined as follows:
and 1.1, taking the candidate line with the minimum expected duration in the candidate lines corresponding to the independent carrying object set elements as a fourth independent line.
And 1.2, taking the candidate line with the minimum expected duration in the candidate lines corresponding to the cooperative carrying object set elements as a fourth cooperative line.
And 1.3, taking the candidate line with the minimum expected duration in the candidate lines corresponding to the joint carrying object set elements as a fourth joint line.
And 1.4, determining a fourth recommended line from the fourth independent line, the fourth cooperative line and the fourth combined line.
The implementation manner of step 1.4 may be:
and 4-1, if the predicted time length of the fourth independent line-the predicted time length of the fourth cooperative line is less than the preset time difference, or if (the predicted time length of the fourth independent line/the predicted time length of the fourth cooperative line) -1 is less than the preset time ratio, taking the fourth independent line as a fourth recommended line.
4-2, if the predicted time length of the fourth independent line-the predicted time length of the fourth cooperative line is greater than or equal to the preset time difference, or if (the predicted time length of the fourth independent line/the predicted time length of the fourth cooperative line) -1 is greater than or equal to the preset time ratio, then
4-2-1, if the predicted duration of the fourth cooperative link-the predicted duration of the fourth joint link < the preset time difference, or if (the predicted duration of the fourth cooperative link/the predicted duration of the fourth joint link) -1< the preset time ratio, then the fourth cooperative link is taken as the fourth recommended link.
4-2-3, if the predicted time length of the fourth cooperative route-the predicted time length of the fourth joint route is larger than or equal to the preset time difference, or if (the predicted time length of the fourth cooperative route/the predicted time length of the fourth joint route) -1 is larger than or equal to the preset time proportion, taking the fourth joint route as a fourth recommended route.
Alternatively, the preset time difference is 0.5 days, and the preset time ratio is 0.25.
The fifth recommended route is determined by the following method:
and 2.1, taking the candidate line with the lowest cost in the candidate lines corresponding to the independent carrying object set elements as a fifth independent line.
And 2.2, taking the candidate line with the lowest cost in the candidate lines corresponding to the cooperative carrying object set elements as a fifth cooperative line.
And 2.3, taking the candidate line with the lowest cost in the candidate lines corresponding to the joint carrying object set elements as a fifth joint line.
And 2.4, determining a fifth recommended line from the fifth independent line, the fifth combined line and the fifth combined line.
The implementation manner of step 2.4 may be:
and 5-1, if the (cost of the fifth independent line/cost of the fifth combined line) -1< the preset cost ratio, taking the fifth independent line as a fifth recommended line.
5-2, if (cost of fifth independent line/cost of fifth combined line) -1 is greater than or equal to the preset cost ratio
And 5-2-1, if the ratio of (the cost of the fifth combined line/the cost of the fifth combined line) -1< the preset cost ratio, taking the fifth combined line as a fifth recommended line.
And 5-2-3, if the (cost of the fifth combined line/cost of the fifth combined line) -1 is larger than or equal to the preset cost ratio, taking the fifth combined line as a fifth recommended line.
Optionally, the preset cost ratio is 0.05.
The sixth recommended route is determined as follows:
and determining the comprehensive optimal coefficient of each candidate route, and determining the candidate route with the maximum comprehensive optimal coefficient as a sixth recommended route.
Wherein, for any candidate line, the integrated optimal coefficient is (maximum predicted duration in all candidate lines-predicted duration of any candidate line)/(maximum predicted duration in all candidate lines-minimum predicted duration in all candidate lines) + (maximum cost in all candidate lines-cost of any candidate line)/(maximum cost in all candidate lines-minimum cost in all candidate lines).
When the fourth recommended link is determined, a candidate link with the shortest expected duration is determined in the independent carrying object set, a candidate link with the shortest expected duration is determined in the cooperation carrying object set, and a candidate link with the shortest expected duration is determined in the combination carrying object set.
Preferentially selecting a candidate line with the shortest expected duration in the independent object set, namely an independent enterprise carrier line;
secondly, selecting a candidate line with the shortest expected duration in the cooperative carrier object set, namely a 'cooperative enterprise joint transportation line';
finally, selecting a candidate line with the shortest expected duration in the joint carrier object set, namely a line for joint transportation of the non-qualified enterprises;
the latter is preferred only when the transit time of the former is greater than that of the latter by 0.5 days or more than 25%.
In the step, when the fifth recommended route is determined, a candidate route with the minimum cost is determined in the independent object carrying set, a candidate route with the minimum cost is determined in the cooperation object carrying set, and a candidate route with the minimum cost is determined in the combination object carrying set.
Preferentially selecting a candidate line with the minimum cost in the independent carrier object set, namely an independent enterprise carrier line;
secondly, cooperating with the candidate line with the lowest cost in the object set, namely the line of the joint transportation of the cooperation enterprises;
finally, selecting a candidate line with the minimum cost in the joint carrier object set, namely a line for joint transportation of the non-qualified enterprises;
the latter is preferred only when the cost of transportation of the former is more than 5% higher than the latter.
106-4-3, if a historic cooperative line exists, determining whether the candidate line includes the historic cooperative line.
106-4-4, if the historical cooperative lines are not included in the candidate lines, determining a recommended line from the candidate lines according to the carrier objects corresponding to the candidate lines.
The implementation manner of determining the recommended route from the candidate routes according to the carrier object corresponding to each candidate route is the same as that in step 106-4-2, and is described in detail in step 106-4-2, and is not described herein again.
In step 106-4-4, the recommended routes include 3, namely, a fourth recommended route, a fifth recommended route and a sixth recommended route.
In specific implementation, the fourth recommended line is used as a main recommended line, the fifth recommended line is used as a first candidate recommended line, and the sixth recommended line is used as a second candidate recommended line.
106-4-5, if the historic cooperative lines are included in the candidate lines, the latest historic cooperative line included in the candidate lines is taken as the first recommended line.
106-4-6, calculating historical transit time and historical transit costs for the recent historical cooperative route.
106-4-7, if the candidate link with the estimated time length less than the historical transportation time length exists in the candidate links corresponding to the independent carrying object set elements, taking the candidate link with the estimated time length less than the historical transportation time length in the candidate links corresponding to the independent carrying object set elements as a second independent link. And if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a second independent line.
106-4-8, if the candidate link with the estimated duration less than the historical transportation duration exists in the candidate links corresponding to the cooperative carrying object set elements, taking the candidate link with the estimated duration less than the historical transportation duration in the candidate links corresponding to the cooperative carrying object set elements as a second cooperative link. And if no candidate link with the estimated time length smaller than the historical transportation time length exists in the candidate links corresponding to the cooperative carrying object set elements, taking the null value as a second cooperative link.
106-4-9, if the candidate link with the estimated duration less than the historical transportation duration exists in the candidate links corresponding to the joint carrying object set elements, taking the candidate link with the estimated duration less than the historical transportation duration in the candidate links corresponding to the joint carrying object set elements as a second joint link. And if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the joint carrying object set elements, taking the null value as a second joint line.
106-4-10, if the second independent line is not null, or the second cooperative line is not null, or the second combined line is not null, then determining a second recommended line from the second independent line, the second cooperative line, and the second combined line.
The implementation flow of steps 106-4-10 is as follows:
2-1, if the second independent line is not null, then
2-1-1, determining the second independent line as the second recommended line when the second cooperative line is null.
2-1-2, when the second cooperative line is not empty, if the predicted duration of the second independent line-the predicted duration of the second cooperative line < the preset time difference, or if (the predicted duration of the second independent line/the predicted duration of the second cooperative line) -1< the preset time ratio, then the second independent line is taken as the second recommended line. And if the predicted time length of the second independent line-the predicted time length of the second cooperative line is larger than or equal to the preset time difference, or if the ratio of (the predicted time length of the second independent line/the predicted time length of the second cooperative line) -1 is larger than or equal to the preset time, taking the second cooperative line as a second recommended line.
2-2, if the second independent line is null, then
2-2-1, if the second cooperative line is not null, then
2-2-1-1, when the second joint line is null, determining the second cooperative line as the second recommended line.
2-2-1-2, when the second cooperative line is not empty, if the predicted duration of the second cooperative line-the predicted duration of the second cooperative line < the preset time difference, or if (the predicted duration of the second cooperative line/the predicted duration of the second cooperative line) -1< the preset time ratio, then the second cooperative line is taken as the second recommended line. And if the predicted duration of the second cooperative line-the predicted duration of the second joint line is greater than or equal to the preset time difference, or if the ratio of (the predicted duration of the second cooperative line/the predicted duration of the second joint line) -1 is greater than or equal to the preset time, taking the second joint line as a second recommended line.
2-2-2, if the second cooperative line is null, the second cooperative line is taken as the second recommended line.
Preferably, the predetermined time difference is 0.5 days, and the predetermined time ratio is 0.25.
In the determination of the second recommended route,
preferentially selecting a candidate line with the shortest expected duration in the independent object set, namely an independent enterprise carrier line;
secondly, selecting a candidate line with the shortest expected duration in the cooperative carrier object set, namely a 'cooperative enterprise joint transportation line';
finally, selecting a candidate line with the shortest expected duration in the joint carrier object set, namely a line for joint transportation of the non-qualified enterprises;
the latter is preferred only when the transit time of the former is greater than that of the latter by 0.5 days or more than 25%.
106-4-11, if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the independent carrying object set elements, taking the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the independent carrying object set elements as third independent lines. And if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a third independent line.
106-4-12, if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the cooperative carrier object set elements, taking the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the cooperative carrier object set elements as third cooperative lines. And if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the null value as a third cooperative line.
106-4-13, if the candidate link with the cost less than the historical transportation cost exists in the candidate links corresponding to the joint carrying object set element, taking the candidate link with the cost less than the historical transportation cost in the candidate links corresponding to the joint carrying object set element as a third joint link. And if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the joint carrier object set elements, taking the null value as a third joint line.
106-4-14, determining a third recommended route from the third independent route, the third combined route, and the third combined route if the third independent route is not null, or the third combined route is not null.
The implementation flow of steps 106-4-14 is as follows:
3-1, if the third independent line is not null, then
3-1-1, when the third combined line is null, determining the third independent line as the third recommended line.
3-1-2, when the third combined line is not empty, if (the cost of the third independent line/the cost of the third combined line) -1< the preset cost ratio, taking the third independent line as a third recommended line. And if the (cost of the third independent line/cost of the third combined line) -1 is larger than or equal to the preset cost ratio, taking the third combined line as a third recommended line.
3-2, if the third independent line is null, then
3-2-1, if the third resultant line is not null, then
3-2-1-1, and when the third joint line is null, determining the third joint line as the third recommended line.
3-2-1-2, when the third combined line is not empty, if (the cost of the third combined line/the cost of the third combined line) -1< the preset cost ratio, the third combined line is taken as a third recommended line. And if the (cost of the third combined line/cost of the third combined line) -1 is larger than or equal to the preset cost ratio, taking the third combined line as a third recommended line.
3-2-2, if the third combined line is null, the third combined line is taken as the third recommended line.
Preferably, the preset cost ratio is 0.05.
In the determination of the third recommended route,
preferentially selecting a candidate line with the minimum cost in the independent carrier object set, namely an independent enterprise carrier line;
secondly, selecting a candidate line with the lowest cost in the cooperation carrier object set, namely a line for the cooperation enterprise joint transportation;
finally, selecting a candidate line with the minimum cost in the joint carrier object set, namely a line for joint transportation of the non-qualified enterprises;
the latter is preferred only when the cost of transportation of the former is more than 5% higher than the latter.
To this end, the recommended route includes 3 recommended routes, which are the first recommended route, the second recommended route, and the third recommended route.
In specific implementation, the first recommended line is used as a main recommended line, the second recommended line is used as a first candidate recommended line, and the third recommended line is used as a second candidate recommended line.
The recommended lines after step 106 is executed are three, and may be a first recommended line, a second recommended line and a third recommended line, or may be a fourth recommended line, a fifth recommended line and a sixth recommended line.
And 107, recommending a recommended route.
For the case where the recommended object corresponds to the joint carrier object, the cooperation relationship between 2 enterprises in the joint carrier object may be established after the step 107 is executed.
The method provided by the embodiment can consider the condition of joint transportation among enterprises, so that the recommended route is optimal.
It should be noted that, in this embodiment and the subsequent embodiments, ordinal numbers such as "first", "second", "third", "fourth", "fifth", and "sixth" are used for identification, and are used to identify different subsets of pick-up objects, subsets of drop-down objects, recommended routes, independent routes, cooperative routes, joint routes, and the like, and do not have actual meanings.
According to the method provided by the embodiment, the carrying object is determined according to the goods taking address, the destination address, the goods to be transported and the goods picking mode, the expected duration corresponding to the transportation line is determined, the transportation line with the expected duration not greater than the transportation duration forms a transportation line set, the line in the transportation line set is recommended, and intelligent recommendation of a proper line is achieved.
Based on the same inventive concept, the present embodiment provides a computer storage medium on which a computer program is stored, which when executed by a processor implements the following steps.
Acquiring information of an order, wherein the information of the order comprises: a goods taking address, a destination address, goods to be transported, a goods taking mode and a transportation time length;
determining a carrying object according to the goods taking address, the destination address, the goods to be transported and the goods taking mode;
determining a transport route for the carrier object;
determining the expected time length corresponding to the transportation line;
forming a transportation line set by the transportation lines with the estimated time length not greater than the transportation time length;
determining a recommended route from a set of transportation routes;
and recommending a recommended route.
Optionally, determining a carrying object according to the pickup address, the destination address, the goods to be transported and the pickup mode, including:
determining a collecting object to form a collecting object set, wherein the service range of the collecting object comprises a pickup address, and the collecting object carries goods to be transported and has an on-door goods receiving business;
determining a falling object to form a falling object set, wherein the service range of the falling object comprises a destination address, and the falling object carries goods to be transported and has a business corresponding to a goods picking mode;
determining the carrying objects belonging to both the collecting object set and the falling object set as independent carrying objects, and forming all the independent carrying objects into an independent carrying object set;
forming elements of non-independent carrying objects in the picking object set into a first picking object subset, and forming elements of non-independent carrying objects in the falling object set into a first falling object subset;
for any element in the first package object subset, if an element having a cooperative relationship with any element in the first package object subset exists in the first package object subset, determining any element in the first package object subset and the element having the cooperative relationship as a cooperative carrying object, and forming all the cooperative carrying objects into a cooperative carrying object set;
forming elements of non-cooperative carrying objects in the first picking object subset into a second picking object subset, and forming elements of non-cooperative carrying objects in the first picking object subset into a second picking object subset;
for any element in the second package object subset, if an element having a potential relationship with any element in the second package object subset exists in the second package object subset, determining any element in the second package object subset and the element having the potential relationship as a joint carrying object, and forming all joint carrying objects into a joint carrying object set; wherein, among all the operation nodes of any element in the second package object subset and the operation nodes of the elements with potential relationship, at least one operation node is positioned in the same city;
and all elements in the independent object carrying set, the cooperative object carrying set and the combined object carrying set are taken as carrying objects.
Optionally, determining a recommended route from the set of transportation routes comprises:
determining the cost of each transportation line in the transportation line set;
calculating the gross interest rate of each transportation line according to the cost of each transportation line, wherein the gross interest rate of any transportation line is (the transportation charge of an order-the cost of any transportation line)/the cost of any transportation line;
selecting a transportation line with the gross interest rate not less than a preset value as a candidate line;
a recommended route is determined from the candidate routes.
Optionally, determining a recommended route from the candidate routes includes:
determining whether a historical cooperative line exists in a preset time period or not according to the information of the order;
if no historical cooperative line exists, determining a recommended line from the candidate lines according to the carrying objects corresponding to the candidate lines;
if the historical cooperative line exists, determining whether the candidate line comprises the historical cooperative line;
if the candidate lines do not comprise the historical cooperative lines, determining a recommended line from the candidate lines according to the carrying objects corresponding to the candidate lines;
if the candidate lines include the historical cooperative lines, the latest historical cooperative lines included in the candidate lines are used as first recommended lines;
calculating the historical transportation time and the historical transportation cost of the recent historical cooperative route;
if the candidate line with the estimated duration less than the historical transportation duration exists in the candidate lines corresponding to the independent carrying object set elements, taking the candidate line with the estimated duration less than the historical transportation duration in the candidate lines corresponding to the independent carrying object set elements as a second independent line; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a second independent line;
if the candidate line with the estimated duration less than the historical transportation duration exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the candidate line with the estimated duration less than the historical transportation duration in the candidate lines corresponding to the cooperative carrying object set elements as a second cooperative line; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the null value as a second cooperative line;
if the candidate lines with the estimated duration less than the historical transportation duration exist in the candidate lines corresponding to the joint carrying object set elements, taking the candidate lines with the estimated duration less than the historical transportation duration in the candidate lines corresponding to the joint carrying object set elements as second joint lines; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the joint carrier object set elements, taking the null value as a second joint line;
if the second independent line is not null, or the second cooperative line is not null, or the second combined line is not null, determining a second recommended line from the second independent line, the second cooperative line and the second combined line;
if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the independent carrying object set elements, the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the independent carrying object set elements are taken as third independent lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a third independent line;
if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the cooperative carrying object set elements, the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the cooperative carrying object set elements are used as third cooperative lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the null value as a third cooperative line;
if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the joint carrying object set elements, the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the joint carrying object set elements are taken as third joint lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the joint carrier object set elements, taking the null value as a third combined line;
and if the third independent line is not null, or the third combined line is not null, determining a third recommended line from the third independent line, the third combined line and the third combined line.
Optionally, if the second independent line is not null, or the second cooperative line is not null, or the second combined line is not null, determining a second recommended line from the second independent line, the second cooperative line, and the second combined line includes:
2-1, if the second independent line is not null, then
2-1-1, when the second cooperative line is null, determining the second independent line as a second recommended line;
2-1-2, when the second cooperative line is not empty, if the predicted duration of the second independent line-the predicted duration of the second cooperative line is less than the preset time difference, or if (the predicted duration of the second independent line/the predicted duration of the second cooperative line) -1 is less than the preset time ratio, taking the second independent line as a second recommended line; if the estimated time length of the second independent line-the estimated time length of the second cooperative line is greater than or equal to the preset time difference, or if the ratio of (the estimated time length of the second independent line/the estimated time length of the second cooperative line) -1 is greater than or equal to the preset time, taking the second cooperative line as a second recommended line;
2-2, if the second independent line is null, then
2-2-1, if the second cooperative line is not null, then
2-2-1-1, when the second joint line is null, determining the second cooperative line as a second recommended line;
2-2-1-2, when the second cooperative line is not empty, if the predicted duration of the second cooperative line-the predicted duration of the second cooperative line < the preset time difference, or if (the predicted duration of the second cooperative line/the predicted duration of the second cooperative line) -1< the preset time ratio, then the second cooperative line is taken as a second recommended line; if the predicted duration of the second cooperative line-the predicted duration of the second joint line is greater than or equal to the preset time difference, or if the ratio of (the predicted duration of the second cooperative line/the predicted duration of the second joint line) -1 is greater than or equal to the preset time, taking the second joint line as a second recommended line;
2-2-2, if the second cooperative line is null, taking the second cooperative line as a second recommended line;
if the third independent line is not null, or the third combined line is not null, determining a third recommended line from the third independent line, the third combined line and the third combined line, including:
3-1, if the third independent line is not null, then
3-1-1, when the third combined line is null, determining the third independent line as a third recommended line;
3-1-2, when the third combined line is not empty, if (the cost of the third independent line/the cost of the third combined line) -1< the preset cost ratio, taking the third independent line as a third recommended line; if the (cost of the third independent line/cost of the third combined line) -1 is larger than or equal to the preset cost ratio, taking the third combined line as a third recommended line;
3-2, if the third independent line is null, then
3-2-1, if the third resultant line is not null, then
3-2-1-1, when the third joint line is null, determining the third joint line as a third recommended line;
3-2-1-2, when the third combined line is not empty, if (the cost of the third combined line/the cost of the third combined line) -1< the preset cost ratio, taking the third combined line as a third recommended line; if the (cost of the third combined line/cost of the third combined line) -1 is larger than or equal to the preset cost proportion, taking the third combined line as a third recommended line;
3-2-2, if the third combined line is null, the third combined line is taken as the third recommended line.
Optionally, determining a recommended route from the candidate routes according to the carrier object corresponding to each candidate route includes:
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the independent carrying object set elements as a fourth independent line;
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the cooperative carrying object set elements as a fourth cooperative line;
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the joint carrying object set elements as a fourth joint line;
determining a fourth recommended route from the fourth independent route, the fourth cooperative route, and the fourth joint route;
taking the candidate line with the lowest cost in the candidate lines corresponding to the independent carrying object set elements as a fifth independent line;
taking the candidate line with the lowest cost in the candidate lines corresponding to the cooperative carrying object set elements as a fifth cooperative line;
taking the candidate line with the lowest cost in the candidate lines corresponding to the joint carrying object set elements as a fifth joint line;
determining a fifth recommended route from the fifth independent route, the fifth combined route and the fifth combined route;
and determining the comprehensive optimal coefficient of each candidate route, and determining the candidate route with the maximum comprehensive optimal coefficient as a sixth recommended route.
Optionally, determining a fourth recommended route from among the fourth independent route, the fourth cooperative route, and the fourth joint route includes:
4-1, if the predicted duration of the fourth independent line-the predicted duration of the fourth cooperative line is less than the preset time difference, or if (the predicted duration of the fourth independent line/the predicted duration of the fourth cooperative line) -1 is less than the preset time ratio, taking the fourth independent line as a fourth recommended line;
4-2, if the predicted time length of the fourth independent line-the predicted time length of the fourth cooperative line is greater than or equal to the preset time difference, or if (the predicted time length of the fourth independent line/the predicted time length of the fourth cooperative line) -1 is greater than or equal to the preset time ratio, then
4-2-1, if the predicted duration of the fourth cooperative route-the predicted duration of the fourth joint route is less than the preset time difference, or if (the predicted duration of the fourth cooperative route/the predicted duration of the fourth joint route) -1 is less than the preset time ratio, taking the fourth cooperative route as a fourth recommended route;
4-2-3, if the predicted time length of the fourth cooperative route-the predicted time length of the fourth joint route is larger than or equal to the preset time difference, or if (the predicted time length of the fourth cooperative route/the predicted time length of the fourth joint route) -1 is larger than or equal to the preset time proportion, taking the fourth joint route as a fourth recommended route;
determining a fifth recommended route from the fifth independent route, the fifth combined route, and the fifth combined route, including:
5-1, if (the cost of the fifth independent line/the cost of the fifth combined line) -1< the preset cost ratio, taking the fifth independent line as a fifth recommended line;
5-2, if (cost of fifth independent line/cost of fifth combined line) -1 is greater than or equal to the preset cost ratio
5-2-1, if (the cost of the fifth combined line/the cost of the fifth combined line) -1< the preset cost ratio, taking the fifth combined line as a fifth recommended line;
5-2-3, if (the cost of the fifth combined line/the cost of the fifth combined line) -1 is larger than or equal to the preset cost proportion, taking the fifth combined line as a fifth recommended line;
determining a comprehensive optimal coefficient of each candidate route, comprising:
for any candidate line, the integrated optimal coefficient is (maximum expected duration in all candidate lines-expected duration of any candidate line)/(maximum expected duration in all candidate lines-minimum expected duration in all candidate lines) + (maximum cost in all candidate lines-cost of any candidate line)/(maximum cost in all candidate lines-minimum cost in all candidate lines).
Optionally, the preset value is 5%; the preset time difference is 0.5 day; the preset time proportion is 0.25; the preset cost ratio is 0.05.
The computer program stored in the computer storage medium provided in this embodiment determines a carrying object according to the pickup address, the destination address, the goods to be transported, and the pickup mode, determines an estimated duration corresponding to the transportation route, forms a transportation route set with the transportation route whose estimated duration is not greater than the transportation duration, recommends a route in the transportation route set, and realizes intelligent recommendation of a suitable route.
Based on the same inventive concept, the present embodiment provides an electronic device, see fig. 2, comprising a memory 201, a processor 202, a bus 203, and a computer program stored on the memory 201 and executable on the processor 202, wherein the processor 202 implements the following steps when executing the program.
Acquiring information of an order, wherein the information of the order comprises: a goods taking address, a destination address, goods to be transported, a goods taking mode and a transportation time length;
determining a carrying object according to the goods taking address, the destination address, the goods to be transported and the goods taking mode;
determining a transport route for the carrier object;
determining the expected time length corresponding to the transportation line;
forming a transportation line set by the transportation lines with the estimated time length not greater than the transportation time length;
determining a recommended route from a set of transportation routes;
and recommending a recommended route.
Optionally, determining a carrying object according to the pickup address, the destination address, the goods to be transported and the pickup mode, including:
determining a collecting object to form a collecting object set, wherein the service range of the collecting object comprises a pickup address, and the collecting object carries goods to be transported and has an on-door goods receiving business;
determining a falling object to form a falling object set, wherein the service range of the falling object comprises a destination address, and the falling object carries goods to be transported and has a business corresponding to a goods picking mode;
determining the carrying objects belonging to both the collecting object set and the falling object set as independent carrying objects, and forming all the independent carrying objects into an independent carrying object set;
forming elements of non-independent carrying objects in the picking object set into a first picking object subset, and forming elements of non-independent carrying objects in the falling object set into a first falling object subset;
for any element in the first package object subset, if an element having a cooperative relationship with any element in the first package object subset exists in the first package object subset, determining any element in the first package object subset and the element having the cooperative relationship as a cooperative carrying object, and forming all the cooperative carrying objects into a cooperative carrying object set;
forming elements of non-cooperative carrying objects in the first picking object subset into a second picking object subset, and forming elements of non-cooperative carrying objects in the first picking object subset into a second picking object subset;
for any element in the second package object subset, if an element having a potential relationship with any element in the second package object subset exists in the second package object subset, determining any element in the second package object subset and the element having the potential relationship as a joint carrying object, and forming all joint carrying objects into a joint carrying object set; wherein, among all the operation nodes of any element in the second package object subset and the operation nodes of the elements with potential relationship, at least one operation node is positioned in the same city;
and all elements in the independent object carrying set, the cooperative object carrying set and the combined object carrying set are taken as carrying objects.
Optionally, determining a recommended route from the set of transportation routes comprises:
determining the cost of each transportation line in the transportation line set;
calculating the gross interest rate of each transportation line according to the cost of each transportation line, wherein the gross interest rate of any transportation line is (the transportation charge of an order-the cost of any transportation line)/the cost of any transportation line;
selecting a transportation line with the gross interest rate not less than a preset value as a candidate line;
a recommended route is determined from the candidate routes.
Optionally, determining a recommended route from the candidate routes includes:
determining whether a historical cooperative line exists in a preset time period or not according to the information of the order;
if no historical cooperative line exists, determining a recommended line from the candidate lines according to the carrying objects corresponding to the candidate lines;
if the historical cooperative line exists, determining whether the candidate line comprises the historical cooperative line;
if the candidate lines do not comprise the historical cooperative lines, determining a recommended line from the candidate lines according to the carrying objects corresponding to the candidate lines;
if the candidate lines include the historical cooperative lines, the latest historical cooperative lines included in the candidate lines are used as first recommended lines;
calculating the historical transportation time and the historical transportation cost of the recent historical cooperative route;
if the candidate line with the estimated duration less than the historical transportation duration exists in the candidate lines corresponding to the independent carrying object set elements, taking the candidate line with the estimated duration less than the historical transportation duration in the candidate lines corresponding to the independent carrying object set elements as a second independent line; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a second independent line;
if the candidate line with the estimated duration less than the historical transportation duration exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the candidate line with the estimated duration less than the historical transportation duration in the candidate lines corresponding to the cooperative carrying object set elements as a second cooperative line; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the null value as a second cooperative line;
if the candidate lines with the estimated duration less than the historical transportation duration exist in the candidate lines corresponding to the joint carrying object set elements, taking the candidate lines with the estimated duration less than the historical transportation duration in the candidate lines corresponding to the joint carrying object set elements as second joint lines; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the joint carrier object set elements, taking the null value as a second joint line;
if the second independent line is not null, or the second cooperative line is not null, or the second combined line is not null, determining a second recommended line from the second independent line, the second cooperative line and the second combined line;
if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the independent carrying object set elements, the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the independent carrying object set elements are taken as third independent lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a third independent line;
if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the cooperative carrying object set elements, the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the cooperative carrying object set elements are used as third cooperative lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the null value as a third cooperative line;
if the candidate lines with the cost less than the historical transportation cost exist in the candidate lines corresponding to the joint carrying object set elements, the candidate lines with the cost less than the historical transportation cost in the candidate lines corresponding to the joint carrying object set elements are taken as third joint lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the joint carrier object set elements, taking the null value as a third combined line;
and if the third independent line is not null, or the third combined line is not null, determining a third recommended line from the third independent line, the third combined line and the third combined line.
Optionally, if the second independent line is not null, or the second cooperative line is not null, or the second combined line is not null, determining a second recommended line from the second independent line, the second cooperative line, and the second combined line includes:
2-1, if the second independent line is not null, then
2-1-1, when the second cooperative line is null, determining the second independent line as a second recommended line;
2-1-2, when the second cooperative line is not empty, if the predicted duration of the second independent line-the predicted duration of the second cooperative line is less than the preset time difference, or if (the predicted duration of the second independent line/the predicted duration of the second cooperative line) -1 is less than the preset time ratio, taking the second independent line as a second recommended line; if the estimated time length of the second independent line-the estimated time length of the second cooperative line is greater than or equal to the preset time difference, or if the ratio of (the estimated time length of the second independent line/the estimated time length of the second cooperative line) -1 is greater than or equal to the preset time, taking the second cooperative line as a second recommended line;
2-2, if the second independent line is null, then
2-2-1, if the second cooperative line is not null, then
2-2-1-1, when the second joint line is null, determining the second cooperative line as a second recommended line;
2-2-1-2, when the second cooperative line is not empty, if the predicted duration of the second cooperative line-the predicted duration of the second cooperative line < the preset time difference, or if (the predicted duration of the second cooperative line/the predicted duration of the second cooperative line) -1< the preset time ratio, then the second cooperative line is taken as a second recommended line; if the predicted duration of the second cooperative line-the predicted duration of the second joint line is greater than or equal to the preset time difference, or if the ratio of (the predicted duration of the second cooperative line/the predicted duration of the second joint line) -1 is greater than or equal to the preset time, taking the second joint line as a second recommended line;
2-2-2, if the second cooperative line is null, taking the second cooperative line as a second recommended line;
if the third independent line is not null, or the third combined line is not null, determining a third recommended line from the third independent line, the third combined line and the third combined line, including:
3-1, if the third independent line is not null, then
3-1-1, when the third combined line is null, determining the third independent line as a third recommended line;
3-1-2, when the third combined line is not empty, if (the cost of the third independent line/the cost of the third combined line) -1< the preset cost ratio, taking the third independent line as a third recommended line; if the (cost of the third independent line/cost of the third combined line) -1 is larger than or equal to the preset cost ratio, taking the third combined line as a third recommended line;
3-2, if the third independent line is null, then
3-2-1, if the third resultant line is not null, then
3-2-1-1, when the third joint line is null, determining the third joint line as a third recommended line;
3-2-1-2, when the third combined line is not empty, if (the cost of the third combined line/the cost of the third combined line) -1< the preset cost ratio, taking the third combined line as a third recommended line; if the (cost of the third combined line/cost of the third combined line) -1 is larger than or equal to the preset cost proportion, taking the third combined line as a third recommended line;
3-2-2, if the third combined line is null, the third combined line is taken as the third recommended line.
Optionally, determining a recommended route from the candidate routes according to the carrier object corresponding to each candidate route includes:
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the independent carrying object set elements as a fourth independent line;
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the cooperative carrying object set elements as a fourth cooperative line;
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the joint carrying object set elements as a fourth joint line;
determining a fourth recommended route from the fourth independent route, the fourth cooperative route, and the fourth joint route;
taking the candidate line with the lowest cost in the candidate lines corresponding to the independent carrying object set elements as a fifth independent line;
taking the candidate line with the lowest cost in the candidate lines corresponding to the cooperative carrying object set elements as a fifth cooperative line;
taking the candidate line with the lowest cost in the candidate lines corresponding to the joint carrying object set elements as a fifth joint line;
determining a fifth recommended route from the fifth independent route, the fifth combined route and the fifth combined route;
and determining the comprehensive optimal coefficient of each candidate route, and determining the candidate route with the maximum comprehensive optimal coefficient as a sixth recommended route.
Optionally, determining a fourth recommended route from among the fourth independent route, the fourth cooperative route, and the fourth joint route includes:
4-1, if the predicted duration of the fourth independent line-the predicted duration of the fourth cooperative line is less than the preset time difference, or if (the predicted duration of the fourth independent line/the predicted duration of the fourth cooperative line) -1 is less than the preset time ratio, taking the fourth independent line as a fourth recommended line;
4-2, if the predicted time length of the fourth independent line-the predicted time length of the fourth cooperative line is greater than or equal to the preset time difference, or if (the predicted time length of the fourth independent line/the predicted time length of the fourth cooperative line) -1 is greater than or equal to the preset time ratio, then
4-2-1, if the predicted duration of the fourth cooperative route-the predicted duration of the fourth joint route is less than the preset time difference, or if (the predicted duration of the fourth cooperative route/the predicted duration of the fourth joint route) -1 is less than the preset time ratio, taking the fourth cooperative route as a fourth recommended route;
4-2-3, if the predicted time length of the fourth cooperative route-the predicted time length of the fourth joint route is larger than or equal to the preset time difference, or if (the predicted time length of the fourth cooperative route/the predicted time length of the fourth joint route) -1 is larger than or equal to the preset time proportion, taking the fourth joint route as a fourth recommended route;
determining a fifth recommended route from the fifth independent route, the fifth combined route, and the fifth combined route, including:
5-1, if (the cost of the fifth independent line/the cost of the fifth combined line) -1< the preset cost ratio, taking the fifth independent line as a fifth recommended line;
5-2, if (cost of fifth independent line/cost of fifth combined line) -1 is greater than or equal to the preset cost ratio
5-2-1, if (the cost of the fifth combined line/the cost of the fifth combined line) -1< the preset cost ratio, taking the fifth combined line as a fifth recommended line;
5-2-3, if (the cost of the fifth combined line/the cost of the fifth combined line) -1 is larger than or equal to the preset cost proportion, taking the fifth combined line as a fifth recommended line;
determining a comprehensive optimal coefficient of each candidate route, comprising:
for any candidate line, the integrated optimal coefficient is (maximum expected duration in all candidate lines-expected duration of any candidate line)/(maximum expected duration in all candidate lines-minimum expected duration in all candidate lines) + (maximum cost in all candidate lines-cost of any candidate line)/(maximum cost in all candidate lines-minimum cost in all candidate lines).
Optionally, the preset value is 5%; the preset time difference is 0.5 day; the preset time proportion is 0.25; the preset cost ratio is 0.05.
The electronic equipment provided by the embodiment determines the carrying object according to the goods taking address, the destination address, the goods to be transported and the goods taking mode, determines the expected duration corresponding to the transportation line, forms the transportation line set by the transportation line with the expected duration not greater than the transportation duration, recommends the line in the transportation line set, and realizes intelligent recommendation of a proper line.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims (10)

1. A method for route recommendation, the method comprising:
obtaining information of an order, wherein the information of the order comprises: a goods taking address, a destination address, goods to be transported, a goods taking mode and a transportation time length;
determining a carrying object according to the goods taking address, the destination address, the goods to be transported and the goods taking mode;
determining a transport route of the carrier object;
determining the expected time length corresponding to the transportation line;
forming a transportation route set by the transportation routes with the estimated time length not greater than the transportation time length;
determining a recommended route from the set of transportation routes;
and recommending the recommended route.
2. The method of claim 1, wherein determining a carrier object based on the pick address, the destination address, the cargo to be transported, and the pick method comprises:
determining a purchase object to form a purchase object set, wherein the service range of the purchase object comprises the pick-up address, the purchase object carries the goods to be transported and has an on-door pick-up business;
determining a cargo object to form a cargo object set, wherein the service range of the cargo object comprises the destination address, the cargo to be transported is carried, and the cargo has a business corresponding to the cargo carrying mode;
determining the carrying objects belonging to both the collecting object set and the falling object set as independent carrying objects, and forming all the independent carrying objects into an independent carrying object set;
forming elements of non-independent carrying objects in the picking object set into a first picking object subset, and forming elements of non-independent carrying objects in the falling object set into a first falling object subset;
for any element in the first package object subset, if an element having a cooperative relationship with any element in the first package object subset exists in the first package object subset, determining any element in the first package object subset and the element having the cooperative relationship as a cooperative carrying object, and forming all the cooperative carrying objects into a cooperative carrying object set;
forming elements of non-cooperative carrying objects in the first picking object subset into a second picking object subset, and forming elements of non-cooperative carrying objects in the first picking object subset into a second picking object subset;
for any element in the second package object subset, if an element having a potential relationship with any element in the second package object subset exists in the second package object subset, determining any element in the second package object subset and the element having the potential relationship as a joint carrying object, and forming all joint carrying objects into a joint carrying object set; wherein, among all the operation nodes of any element in the second package object subset and the operation nodes of the elements with potential relationship, at least one operation node is positioned in the same city;
and all elements in the independent object carrying set, the cooperative object carrying set and the combined object carrying set are taken as carrying objects.
3. The method of claim 2, wherein the determining a recommended route from the set of transportation routes comprises:
determining the cost of each transportation line in the transportation line set;
calculating a gross interest rate of each transportation line according to the cost of each transportation line, wherein the gross interest rate of any transportation line is (freight of the order-cost of any transportation line)/the cost of any transportation line;
selecting a transportation line with the gross interest rate not less than a preset value as a candidate line;
a recommended route is determined from the candidate routes.
4. The method of claim 3, wherein determining the recommended route from the candidate routes comprises:
determining whether a historical cooperative line exists in a preset time period or not according to the information of the order;
if no historical cooperative line exists, determining a recommended line from the candidate lines according to the carrying objects corresponding to the candidate lines;
if the historical cooperative line exists, determining whether the candidate line comprises the historical cooperative line;
if the candidate lines do not comprise the historical cooperative lines, determining a recommended line from the candidate lines according to the carrying objects corresponding to the candidate lines;
if the candidate lines comprise historical cooperative lines, taking the latest historical cooperative line included in the candidate lines as a first recommended line;
calculating the historical transportation time and the historical transportation cost of the recent historical cooperative route;
if the candidate line with the estimated duration less than the historical transportation duration exists in the candidate lines corresponding to the independent carrying object set elements, taking the candidate line with the estimated duration less than the historical transportation duration in the candidate lines corresponding to the independent carrying object set elements as a second independent line; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a second independent line;
if the candidate link with the estimated duration less than the historical transportation duration exists in the candidate links corresponding to the cooperative carrying object set elements, taking the candidate link with the estimated duration less than the historical transportation duration in the candidate links corresponding to the cooperative carrying object set elements as a second cooperative link; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the null value as a second cooperative line;
if the candidate link with the estimated duration less than the historical transportation duration exists in the candidate links corresponding to the joint carrying object set elements, taking the candidate link with the estimated duration less than the historical transportation duration in the candidate links corresponding to the joint carrying object set elements as a second joint link; if no candidate line with the estimated time length smaller than the historical transportation time length exists in the candidate lines corresponding to the joint carrying object set elements, taking the null value as a second joint line;
if the second independent line is not null, or the second cooperative line is not null, or the second combined line is not null, determining a second recommended line from the second independent line, the second cooperative line and the second combined line;
if the candidate lines with the cost lower than the historical transportation cost exist in the candidate lines corresponding to the independent carrying object set elements, the candidate lines with the cost lower than the historical transportation cost in the candidate lines corresponding to the independent carrying object set elements are used as third independent lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the independent carrying object set elements, taking the null value as a third independent line;
if the candidate lines with the cost lower than the historical transportation cost exist in the candidate lines corresponding to the cooperative carrying object set elements, the candidate lines with the cost lower than the historical transportation cost in the candidate lines corresponding to the cooperative carrying object set elements are used as third cooperative lines; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the cooperative carrying object set elements, taking the null value as a third cooperative line;
if the candidate link with the cost less than the historical transportation cost exists in the candidate links corresponding to the joint carrying object set elements, taking the candidate link with the cost less than the historical transportation cost in the candidate links corresponding to the joint carrying object set elements as a third joint link; if no candidate line with the cost less than the historical transportation cost exists in the candidate lines corresponding to the joint carrying object set elements, taking the null value as a third joint line;
if the third independent line is not null, or the third combined line is not null, determining a third recommended line from the third independent line, the third combined line and the third combined line.
5. The method of claim 4, wherein determining a second recommended route from the second independent route, the second cooperative route, and the second joint route if the second independent route is not null, or the second cooperative route is not null, or the second joint route is not null, comprises:
2-1, if the second independent line is not null, then
2-1-1, when the second cooperative line is null, determining the second independent line as a second recommended line;
2-1-2, when a second cooperative line is not empty, if the predicted duration of the second independent line-the predicted duration of the second cooperative line < a preset time difference, or if (the predicted duration of the second independent line/the predicted duration of the second cooperative line) -1< a preset time ratio, then the second independent line is taken as a second recommended line; if the estimated time length of the second independent line-the estimated time length of the second cooperative line is larger than or equal to a preset time difference, or if (the estimated time length of the second independent line/the estimated time length of the second cooperative line) -1 is larger than or equal to a preset time ratio, taking the second cooperative line as a second recommended line;
2-2, if the second independent line is null, then
2-2-1, if the second cooperative line is not null, then
2-2-1-1, when the second joint line is null, determining the second cooperative line as a second recommended line;
2-2-1-2, when a second cooperative line is not empty, if the predicted duration of the second cooperative line-the predicted duration of the second cooperative line < a preset time difference, or if (the predicted duration of the second cooperative line/the predicted duration of the second cooperative line) -1< a preset time ratio, then taking the second cooperative line as a second recommended line; if the estimated duration of the second cooperative line-the estimated duration of the second joint line is greater than or equal to a preset time difference, or if (the estimated duration of the second cooperative line/the estimated duration of the second joint line) -1 is greater than or equal to a preset time ratio, taking the second joint line as a second recommended line;
2-2-2, if the second cooperative line is null, taking the second cooperative line as a second recommended line;
if the third independent line is not null, or the third combined line is not null, determining a third recommended line from the third independent line, the third combined line, and the third combined line, including:
3-1, if the third independent line is not null, then
3-1-1, when the third combined line is null, determining the third independent line as a third recommended line;
3-1-2, when a third combined line is not empty, if (the cost of the third independent line/the cost of the third combined line) -1< a preset cost ratio, taking the third independent line as a third recommended line; if the (cost of the third independent line/cost of the third combined line) -1 is larger than or equal to a preset cost ratio, taking the third combined line as a third recommended line;
3-2, if the third independent line is null, then
3-2-1, if the third resultant line is not null, then
3-2-1-1, when the third joint line is null, determining the third joint line as a third recommended line;
3-2-1-2, when a third combined line is not empty, if (the cost of the third combined line/the cost of the third combined line) -1< a preset cost ratio, taking the third combined line as a third recommended line; if the (cost of the third combined line/cost of the third combined line) -1 is larger than or equal to a preset cost ratio, taking the third combined line as a third recommended line;
3-2-2, and if the third combined line is a null value, taking the third combined line as a third recommended line.
6. The method of claim 4, wherein determining the recommended route from the candidate routes according to the carrier object corresponding to each candidate route comprises:
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the independent carrying object set elements as a fourth independent line;
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the cooperative carrying object set elements as a fourth cooperative line;
taking the candidate line with the minimum expected duration in the candidate lines corresponding to the joint carrying object set elements as a fourth joint line;
determining a fourth recommended route from the fourth independent route, the fourth cooperative route, and the fourth joint route;
taking the candidate line with the lowest cost in the candidate lines corresponding to the independent carrying object set elements as a fifth independent line;
taking the candidate line with the lowest cost in the candidate lines corresponding to the cooperative carrying object set elements as a fifth cooperative line;
taking the candidate line with the lowest cost in the candidate lines corresponding to the joint carrying object set elements as a fifth joint line;
determining a fifth recommended route from the fifth independent route, the fifth combined route, and the fifth combined route;
and determining the comprehensive optimal coefficient of each candidate route, and determining the candidate route with the maximum comprehensive optimal coefficient as a sixth recommended route.
7. The method of claim 6, wherein the determining a fourth recommended route from among the fourth independent route, the fourth cooperative route, and the fourth joint route comprises:
4-1, if the predicted duration of the fourth independent line-the predicted duration of the fourth cooperative line < the preset time difference, or if (the predicted duration of the fourth independent line/the predicted duration of the fourth cooperative line) -1< the preset time ratio, then taking the fourth independent line as a fourth recommended line;
4-2, if the estimated time length of the fourth independent line and the estimated time length of the fourth cooperative line are larger than or equal to a preset time difference, or if the ratio of (the estimated time length of the fourth independent line/the estimated time length of the fourth cooperative line) -1 is larger than or equal to a preset time ratio, then the ratio is obtained
4-2-1, if the predicted duration of the fourth cooperative link-the predicted duration of the fourth joint link < a preset time difference, or if (the predicted duration of the fourth cooperative link/the predicted duration of the fourth joint link) -1< a preset time ratio, then taking the fourth cooperative link as a fourth recommended link;
4-2-3, if the predicted duration of the fourth cooperative route-the predicted duration of the fourth joint route is greater than or equal to a preset time difference, or if (the predicted duration of the fourth cooperative route/the predicted duration of the fourth joint route) -1 is greater than or equal to a preset time ratio, taking the fourth joint route as a fourth recommended route;
the determining a fifth recommended route from the fifth independent route, the fifth combined route, and the fifth combined route includes:
5-1, if (the cost of the fifth independent line/the cost of the fifth combined line) -1< a preset cost ratio, taking the fifth independent line as a fifth recommended line;
5-2, if (the cost of the fifth independent line/the cost of the fifth combined line) -1 is larger than or equal to a preset cost ratio, then
5-2-1, if (the cost of the fifth combined line/the cost of the fifth combined line) -1< a preset cost ratio, taking the fifth combined line as a fifth recommended line;
5-2-3, if (the cost of the fifth combined line/the cost of the fifth combined line) -1 is larger than or equal to a preset cost ratio, taking the fifth combined line as a fifth recommended line;
the determining of the comprehensive optimal coefficient of each candidate route comprises the following steps:
for any candidate line, the integrated optimal coefficient is (maximum expected duration in all candidate lines-expected duration of any candidate line)/(maximum expected duration in all candidate lines-minimum expected duration in all candidate lines) + (maximum cost in all candidate lines-cost of any candidate line)/(maximum cost in all candidate lines-minimum cost in all candidate lines).
8. The method according to claim 5 or 7, characterized in that the preset value is 5%; the preset time difference is 0.5 day; the preset time proportion is 0.25; the preset cost ratio is 0.05.
9. A computer storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 8.
10. An electronic device comprising one or more processors, and memory for storing one or more programs; the one or more programs, when executed by the one or more processors, implement the method of any of claims 1 to 8.
CN202010528672.5A 2020-06-11 2020-06-11 Route recommendation method, computer storage medium and electronic device Pending CN111652561A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010528672.5A CN111652561A (en) 2020-06-11 2020-06-11 Route recommendation method, computer storage medium and electronic device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010528672.5A CN111652561A (en) 2020-06-11 2020-06-11 Route recommendation method, computer storage medium and electronic device

Publications (1)

Publication Number Publication Date
CN111652561A true CN111652561A (en) 2020-09-11

Family

ID=72344719

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010528672.5A Pending CN111652561A (en) 2020-06-11 2020-06-11 Route recommendation method, computer storage medium and electronic device

Country Status (1)

Country Link
CN (1) CN111652561A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112396233A (en) * 2020-11-20 2021-02-23 杭州贝嘟科技有限公司 Intelligent flat cable recommendation method and device, computer equipment and storage medium
CN112488623A (en) * 2020-11-30 2021-03-12 上海寻梦信息技术有限公司 Method, device, equipment and storage medium for displaying package pre-distribution route

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105277189A (en) * 2014-06-30 2016-01-27 高德软件有限公司 Route pushing method and device
CN106815706A (en) * 2017-01-20 2017-06-09 传化物流集团有限公司 A kind of distribute leaflets method and device
CN109816151A (en) * 2018-12-29 2019-05-28 天津五八到家科技有限公司 Transit route planning, replay method, server and storage medium
CN109858862A (en) * 2019-01-30 2019-06-07 深圳市快金数据技术服务有限公司 A kind of method, apparatus, equipment and the medium of intelligent recommendation logistics route
CN109871991A (en) * 2019-01-30 2019-06-11 深圳市快金数据技术服务有限公司 A kind of recommended method, device, equipment and the medium of logistics route
CN110264123A (en) * 2019-05-09 2019-09-20 中国平安财产保险股份有限公司 A kind of generation method and equipment of Distribution path
CN110490517A (en) * 2019-08-02 2019-11-22 拉货宝网络科技有限责任公司 A kind of sale of goods shipping order formula management method of networking
CN110909956A (en) * 2019-12-05 2020-03-24 上海凯京信达科技集团有限公司 Logistics line recommendation method, computer storage medium and electronic equipment

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105277189A (en) * 2014-06-30 2016-01-27 高德软件有限公司 Route pushing method and device
CN106815706A (en) * 2017-01-20 2017-06-09 传化物流集团有限公司 A kind of distribute leaflets method and device
CN109816151A (en) * 2018-12-29 2019-05-28 天津五八到家科技有限公司 Transit route planning, replay method, server and storage medium
CN109858862A (en) * 2019-01-30 2019-06-07 深圳市快金数据技术服务有限公司 A kind of method, apparatus, equipment and the medium of intelligent recommendation logistics route
CN109871991A (en) * 2019-01-30 2019-06-11 深圳市快金数据技术服务有限公司 A kind of recommended method, device, equipment and the medium of logistics route
CN110264123A (en) * 2019-05-09 2019-09-20 中国平安财产保险股份有限公司 A kind of generation method and equipment of Distribution path
CN110490517A (en) * 2019-08-02 2019-11-22 拉货宝网络科技有限责任公司 A kind of sale of goods shipping order formula management method of networking
CN110909956A (en) * 2019-12-05 2020-03-24 上海凯京信达科技集团有限公司 Logistics line recommendation method, computer storage medium and electronic equipment

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112396233A (en) * 2020-11-20 2021-02-23 杭州贝嘟科技有限公司 Intelligent flat cable recommendation method and device, computer equipment and storage medium
CN112396233B (en) * 2020-11-20 2024-10-15 杭州贝嘟科技有限公司 Intelligent flat cable recommendation method, device, computer equipment and storage medium
CN112488623A (en) * 2020-11-30 2021-03-12 上海寻梦信息技术有限公司 Method, device, equipment and storage medium for displaying package pre-distribution route
CN112488623B (en) * 2020-11-30 2024-09-06 上海寻梦信息技术有限公司 Method, device, equipment and storage medium for displaying package pre-distribution route

Similar Documents

Publication Publication Date Title
CN109934520B (en) Shelf scheduling method and device
CN107194646B (en) Inventory scheduling method and device
CN109345161B (en) Value flow-oriented distribution order dispatching method
CN110796405B (en) System and method for automatic package tracking and prioritized re-ordering
CN108891838B (en) Order processing method, apparatus, electronic equipment and computer readable storage medium
CN105867322B (en) System and method for the program management in material processing apparatuses
CN109840729B (en) Method and system for positioning bin, storage medium and electronic equipment
CN109214756B (en) Vehicle logistics scheduling method and device, storage medium and terminal
CN109948964A (en) Information output method and device
CN109978470B (en) Logistics information determination method, device, equipment and medium
CN110070312A (en) Order processing method and apparatus
CN113240369B (en) Goods sorting method, device, equipment and storage medium
CN109685429B (en) Distribution capacity determining method and device, electronic equipment and storage medium
CN109533759A (en) A kind of automatic shifting library method and automatic shifting library system
US20230042127A1 (en) A method for assigning items into one or more containers and related electronic device
CN115994725A (en) Logistics part freight method, device, equipment and storage medium
CN111652561A (en) Route recommendation method, computer storage medium and electronic device
CN112396368A (en) Distribution route planning method and system and server equipment
CN110390497B (en) Article warehouse-in method and device
CN111222819B (en) Method for determining a cargo vehicle, warehouse management device, system, device and medium
CN111784223B (en) Cargo allocation data processing method, device and storage medium
CN112364262A (en) Goods finding route recommendation method and device, electronic equipment and storage medium
CN116187092A (en) Dynamic distribution order allocation optimization method considering supply and demand states of transport capacity system
CN113222490A (en) Inventory allocation method and device
US20220405697A1 (en) Systems And Methods For Dynamic Management Of Consolidation Orders

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
TA01 Transfer of patent application right

Effective date of registration: 20210318

Address after: 200333 room 3110, No. 100, Lane 130, Taopu Road, Putuo District, Shanghai

Applicant after: Shanghai zebra Laila Logistics Technology Co.,Ltd.

Address before: Room 308-1, area C, 1718 Daduhe Road, Putuo District, Shanghai 200333

Applicant before: Shanghai kjing XinDa science and Technology Group Co.,Ltd.

TA01 Transfer of patent application right
RJ01 Rejection of invention patent application after publication

Application publication date: 20200911

RJ01 Rejection of invention patent application after publication