CN113822609A - Logistics line generation method and device and server - Google Patents
Logistics line generation method and device and server Download PDFInfo
- Publication number
- CN113822609A CN113822609A CN202010564854.8A CN202010564854A CN113822609A CN 113822609 A CN113822609 A CN 113822609A CN 202010564854 A CN202010564854 A CN 202010564854A CN 113822609 A CN113822609 A CN 113822609A
- Authority
- CN
- China
- Prior art keywords
- logistics
- candidate
- line
- route
- value
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000012216 screening Methods 0.000 claims abstract description 12
- 238000012545 processing Methods 0.000 claims description 23
- 230000008901 benefit Effects 0.000 claims description 22
- 238000009826 distribution Methods 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 13
- 238000003860 storage Methods 0.000 claims description 12
- 238000012546 transfer Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 14
- 230000008569 process Effects 0.000 description 12
- 238000011156 evaluation Methods 0.000 description 8
- 230000007704 transition Effects 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000001960 triggered effect Effects 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000004140 cleaning Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003828 downregulation Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 238000012886 linear function Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000003827 upregulation Effects 0.000 description 1
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
The embodiment of the application provides a method and a device for generating a logistics route and a server, which are used for improving the accuracy of the generated logistics route to a certain extent. The method for generating the logistics line provided by the embodiment of the application comprises the following steps: acquiring a logistics stroke of a logistics line to be generated; acquiring candidate logistics lines matched with the logistics route, and acquiring user acceptance values of the candidate logistics lines; and screening out target logistics lines with user acceptance values higher than a threshold value from the candidate logistics lines, and issuing the target logistics lines to the client so that the client pushes the target logistics lines to the user.
Description
Technical Field
The application relates to the field of logistics, in particular to a method and a device for generating a logistics line and a server.
Background
In the conventional planning work of the logistics routes, each logistics route is manually established by a price adjuster based on the cost of each logistics route and the market, and the logistics routes can be subsequently put on the market and put on consumers.
With the continuous development of computer technology, the existing logistics work can be realized through an online logistics platform, and after a client side determines a logistics route, a server side generates a logistics route according to the logistics route reported by the client side.
In the existing research process of the related art, the inventor finds that the accuracy of the logistics route generated by the server side is not high, and the client side often makes further adjustment after receiving the logistics route issued by the server side.
Disclosure of Invention
The embodiment of the application provides a generation method and device of a logistics route, a server and a computer readable storage medium, which are used for improving the accuracy of the generated logistics route to a certain extent.
In a first aspect, an embodiment of the present application provides a method for generating a logistics route, where the method includes:
acquiring a logistics stroke of a logistics line to be generated;
acquiring candidate logistics lines matched with the logistics route, and acquiring user acceptance values of the candidate logistics lines;
and screening out target logistics lines with user acceptance values higher than a threshold value from the candidate logistics lines, and issuing the target logistics lines to the client so that the client pushes the target logistics lines to the user.
With reference to the first aspect of the embodiment of the present application, in a first possible implementation manner of the first aspect of the embodiment of the present application, the obtaining a user acceptance value of the candidate logistics route includes:
obtaining the candidate logistics line length and the candidate logistics line valuation of the candidate logistics line;
screening a logistics line set with the line length in the same range as the candidate logistics line length from different logistics lines;
and acquiring the distribution value of the logistics line with the line price in the equivalent range of the candidate logistics line valuation in the logistics line set, and identifying the distribution value as a user acceptance value.
With reference to the first possible implementation manner of the first aspect of the embodiment of the present application, in a second possible implementation manner of the first aspect of the embodiment of the present application, after obtaining a candidate logistics route matched with a logistics route and obtaining a user acceptance value of the candidate logistics route, the method further includes:
when the user acceptance value is lower than the threshold value, acquiring the adjustment price value of the candidate logistics line under the constraint condition of satisfying the cost of the logistics line;
and updating the candidate logistics route valuation of the candidate logistics route according to the adjusted price value so as to improve the user acceptance value.
With reference to the second possible implementation manner of the first aspect of the embodiment of the present application, in a third possible implementation manner of the first aspect of the embodiment of the present application, when the user acceptance value is lower than the threshold, and under the condition that the constraint condition of the cost of the logistics route is satisfied, acquiring the adjusted price of the candidate logistics route includes:
and when the user acceptance value is lower than the threshold value, acquiring different expected benefits of the logistics line under different adjustment price values under the condition of meeting the constraint condition of the logistics line cost, and acquiring the adjustment price value of the maximum expected benefit.
With reference to the third possible implementation manner of the first aspect of the embodiment of the present application, in the fourth possible implementation manner of the first aspect of the embodiment of the present application, when the user acceptance value is lower than the threshold, under the constraint condition that the cost of the logistics route is satisfied, obtaining different expected gains of the logistics route under different adjustment price values, and obtaining the adjustment price value of the maximum expected gain includes:
and when the user acceptance value is lower than the threshold value, under the condition of meeting the constraint condition of the cost of the logistics line, calculating different expected benefits of the logistics line under different adjustment price values according to a preset adjustment price step length and an adjustment price state transfer network, and obtaining the adjustment price value of the maximum expected benefit.
With reference to the fourth possible implementation manner of the first aspect of the embodiment of the present application, in a fifth possible implementation manner of the first aspect of the embodiment of the present application, the obtaining the candidate logistics route length and the candidate logistics route evaluation of the candidate logistics route includes:
and obtaining the candidate logistics line valuation according to the candidate logistics line length, the candidate logistics line type and the user type of the candidate logistics line.
With reference to the fifth possible implementation manner of the first aspect of the embodiment of the present application, in a sixth possible implementation manner of the first aspect of the embodiment of the present application, the obtaining of the candidate logistics route matched with the logistics route in the current time period includes:
acquiring the travel characteristics of the logistics travel, wherein the travel characteristics comprise at least one of a starting time period, a starting address, an arrival time period, an arrival address, logistics piece characteristics, a priority identification and a user identification;
and matching the travel characteristics with the travel characteristics of different logistics lines, and identifying the logistics line with the matching degree higher than the threshold value of the matching degree as a candidate logistics line.
In a second aspect, an embodiment of the present application provides a device for generating a logistics route, where the device includes:
the receiving and sending unit is used for acquiring the logistics travel of the logistics line to be generated;
the processing unit is used for acquiring candidate logistics lines matched with the logistics route and acquiring user acceptance values of the candidate logistics lines; and screening out target logistics lines with user acceptance values higher than a threshold value from the candidate logistics lines, and issuing the target logistics lines to the client through the transceiving unit so that the client pushes the target logistics lines to the user.
With reference to the second aspect of the embodiment of the present application, in a first possible implementation manner of the second aspect of the embodiment of the present application, the processing unit is specifically configured to:
obtaining the candidate logistics line length and the candidate logistics line valuation of the candidate logistics line;
screening a logistics line set with the line length in the same range as the candidate logistics line length from different logistics lines;
and acquiring the distribution value of the logistics line with the line price in the equivalent range of the candidate logistics line valuation in the logistics line set, and identifying the distribution value as a user acceptance value.
With reference to the first possible implementation manner of the first aspect of the embodiment of the present application, the processing unit is further configured to:
when the user acceptance value is lower than the threshold value, acquiring the adjustment price value of the candidate logistics line under the constraint condition of satisfying the cost of the logistics line;
and updating the candidate logistics route valuation of the candidate logistics route according to the adjusted price value so as to improve the user acceptance value.
With reference to the second possible implementation manner of the second aspect of the embodiment of the present application, in a third possible implementation manner of the first aspect of the embodiment of the present application, the processing unit is specifically configured to:
and when the user acceptance value is lower than the threshold value, acquiring different expected benefits of the logistics line under different adjustment price values under the condition of meeting the constraint condition of the logistics line cost, and acquiring the adjustment price value of the maximum expected benefit.
With reference to the third possible implementation manner of the second aspect of the embodiment of the present application, in a fourth possible implementation manner of the second aspect of the embodiment of the present application, the processing unit is specifically configured to:
and when the user acceptance value is lower than the threshold value, under the condition of meeting the constraint condition of the cost of the logistics line, calculating different expected benefits of the logistics line under different adjustment price values according to a preset adjustment price step length and an adjustment price state transfer network, and obtaining the adjustment price value of the maximum expected benefit.
With reference to the fourth possible implementation manner of the second aspect of the embodiment of the present application, in a fifth possible implementation manner of the second aspect of the embodiment of the present application, the processing unit is specifically configured to:
and obtaining the candidate logistics line valuation according to the candidate logistics line length, the candidate logistics line type and the user type of the candidate logistics line.
With reference to the fifth possible implementation manner of the second aspect of the embodiment of the present application, in a sixth possible implementation manner of the second aspect of the embodiment of the present application, the processing unit is specifically configured to:
acquiring the travel characteristics of the logistics travel, wherein the travel characteristics comprise at least one of a starting time period, a starting address, an arrival time period, an arrival address, logistics piece characteristics, a priority identification and a user identification;
and matching the travel characteristics with the travel characteristics of different logistics lines, and identifying the logistics line with the matching degree higher than the threshold value of the matching degree as a candidate logistics line.
In a third aspect, an embodiment of the present application further provides a server, which includes a processor and a memory, where the memory stores a computer program, and the processor executes the steps in any one of the methods provided in the embodiments of the present application when calling the computer program in the memory.
In a fourth aspect, this application further provides a computer-readable storage medium, where a plurality of instructions are stored, and the instructions are adapted to be loaded by a processor to perform the steps in any one of the methods provided by this application.
As can be seen from the above, the embodiments of the present application have the following beneficial effects:
in the embodiment of the application, the server firstly obtains the logistics route of the logistics route to be generated, then obtains the candidate logistics route matched with the logistics route, obtains the user acceptance value of the candidate logistics route, then screens out the target logistics route with the user acceptance value higher than the threshold value from the candidate logistics routes, and sends the target logistics route to the client, so that the client pushes the target logistics route to the user, in the process, because the target logistics route pushed to the user is screened by combining the user acceptance value on the basis of the candidate logistics route matched with the logistics route determined by the user, not only the transportation condition of the logistics piece per se can be met in the aspect of logistics resources, but also the logistics route can be screened again in the aspect of the user, therefore, the condition that the user adjusts the target logistics route can be effectively reduced to a certain extent, the accuracy of the generated target logistics route can be improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a schematic flow chart of a method for generating a logistics route according to an embodiment of the present disclosure;
FIG. 2 is a schematic view of a scenario according to an embodiment of the present application;
FIG. 3 is a schematic diagram of another scenario according to an embodiment of the present application;
FIG. 4 is a flowchart illustrating step S102 according to the embodiment of FIG. 1;
FIG. 5 is a schematic flow chart illustrating step S102 according to the corresponding embodiment of FIG. 1;
FIG. 6 is a schematic diagram of another scenario according to an embodiment of the present application;
FIG. 7 is a schematic diagram of another scenario according to an embodiment of the present application;
FIG. 8 is a schematic flow chart of a method for generating a logistics circuit according to an embodiment of the present application;
FIG. 9 is a schematic diagram of another scenario according to an embodiment of the present application;
FIG. 10 is a schematic structural diagram of a device for generating a logistics route according to an embodiment of the present application;
fig. 11 is a schematic structural diagram of a server according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the description that follows, specific embodiments of the present application will be described with reference to steps and symbols executed by one or more computers, unless otherwise indicated. Accordingly, these steps and operations will be referred to, several times, as being performed by a computer, the computer performing operations involving a processing unit of the computer in electronic signals representing data in a structured form. This operation transforms the data or maintains it at locations in the computer's memory system, which may be reconfigured or otherwise altered in a manner well known to those skilled in the art. The data maintains a data structure that is a physical location of the memory that has particular characteristics defined by the data format. However, while the principles of the application have been described in language specific to above, it is not intended to be limited to the specific form set forth herein, and it will be recognized by those of ordinary skill in the art that various of the steps and operations described below may be implemented in hardware.
The principles of the present application may be employed in numerous other general-purpose or special-purpose computing, communication environments or configurations. Examples of well known computing systems, environments, and configurations that may be suitable for use with the application include, but are not limited to, hand-held telephones, personal computers, servers, multiprocessor systems, microcomputer-based systems, mainframe-based computers, and distributed computing environments that include any of the above systems or devices.
The terms "first", "second", and "third", etc. in this application are used to distinguish between different objects and not to describe a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions.
First, before describing the embodiments of the present application, the related contents of the embodiments of the present application with respect to the application context will be described.
The method and the device for generating the logistics route and the computer-readable storage medium can be applied to a server and used for improving the accuracy of the generated logistics route to a certain extent.
In the related art, after a client reports a logistics route determined by a user, a server selects a target logistics route with appropriate logistics resources from the planned logistics routes of a logistics transportation network on the basis of a receiving and sending address and a receiving and sending time period related to the logistics route, and sends the selected target logistics route.
Based on the above defects in the related art, the embodiment of the application provides a method for generating a logistics route, and a user acceptance value is introduced in the process of generating the logistics route, so that a target logistics route pushed to a user has higher user acceptance, and therefore, the situation that the user adjusts the target logistics route can be effectively reduced to a certain extent, the accuracy of the generated target logistics route can be improved, and the defects in the related art can be overcome.
In this embodiment of the present application, the client may be understood as User Equipment (UE), the UE may specifically be a terminal device such as a smart phone, a tablet computer, a laptop computer, a palm top computer, a desktop computer, or a Personal Digital Assistant (PDA), the UE may directly access the server, or access the server through a browser, the UE has a User interaction capability, and the User may enter a selected logistics route on the UE and view a pushed target logistics line.
The client may also be understood as an Application running on the UE, which may access the logistics platform, such as an Application (Application) pre-installed by the UE or an optionally installed third party APP; also, for example, applets in some APPs, do not require installation to access the server.
The server refers to a hardware device implemented by running server software on a computer device capable of providing services through a network, that is, the server may be understood as a server device, a host device, or even a UE, and the server may also be composed of a large number of hardware devices as a whole through a clustering technique, so as to collectively perform a service for generating a logistics route according to an embodiment of the present disclosure.
The logistics line can be understood as a transportation path used for transporting logistics articles when logistics transportation service is provided, and specifically, the logistics line can be an express line in the express delivery industry.
Next, a method for generating a logistics route provided in the embodiment of the present application will be described.
First, referring to fig. 1, fig. 1 shows a schematic flow chart of a method for generating a logistics route according to an embodiment of the present application, where in the embodiment of the present application, the method for generating a logistics route may specifically include:
step S101, acquiring a logistics route of a logistics route to be generated, wherein the logistics route is generated by user operation triggered by a logistics route operation option displayed by a user at a client;
the physical distribution schedule may be directly reported by the client, or may be sent by other devices, for example, the physical distribution schedule reported by the client may be forwarded by these devices, or for example, the physical distribution schedule generated or stored by a device other than the client is sent by the client.
Illustratively, at the client side, a user may trigger the user operation generation at a logistics route operation option displayed at the client to obtain the logistics route, and directly report the logistics route or forward the logistics route to the server applying the method for generating the logistics route.
By way of example, taking a client as a smart phone as an example, referring to a scene schematic diagram of the embodiment shown in fig. 2, a user may open an applet interface in an APP at the client side, and select an XX courier applet in the applet interface, a display interface of the XX courier applet may provide operation options of a plurality of different courier categories, the user may select an operation option corresponding to a courier delivery mode according to the current courier delivery route, and after selecting a target courier delivery mode, open an courier route operation option interface to fill in the current courier route, such as sender information (sender name and address), recipient information (recipient name and address), a delivery mode (for example, home pickup, delivery from a website), delivery time, and the like in the figure, where the types and the number of the courier route operation options may be adjusted according to reality, and part of the options may also be filled with default information and the content adjusted by the user as appropriate.
After the client acquires the user operation triggered by the logistics route operation option displayed by the user at the client, the corresponding logistics route can be generated according to the user operation, and the corresponding logistics route is reported to the server through the network, so that the server is triggered to perform subsequent logistics route generation processing.
Step S102, obtaining candidate logistics routes matched with the logistics route, and obtaining user acceptance values of the candidate logistics routes;
after the server acquires the logistics route, the logistics route can be matched with different logistics lines stored in the database, and matched candidate logistics lines are obtained.
The different logistics lines may include historical logistics lines, or new logistics lines planned and developed by related workers, and these logistics lines may indicate the movement tracks of different logistics vehicles for transporting the logistics items in different time periods, and in the movement tracks, the different logistics vehicles may pass through one or more logistics nodes along the way, and these logistics nodes may be nodes such as a transfer site, a network node, a service point, a joining point, or an express delivery cabinet, so as to perform logistics operations such as receiving, transferring, or dispatching the logistics items.
And simultaneously acquiring the candidate logistics line matched with the logistics route, and acquiring the user acceptance value of the candidate logistics line.
It is understood that different logistics circuits stored in the database may be configured with different user acceptance values in advance, or the user acceptance value of the current candidate logistics circuit may be obtained in real time.
The user acceptance value is used for indicating the acceptance degree of the candidate logistics line on the user side, and the higher the user acceptance value is, the higher the acceptance degree of the user on the candidate logistics line is.
Step S103, screening out target logistics lines with user acceptance values higher than a threshold value from the candidate logistics lines, and issuing the target logistics lines to the client so that the client pushes the target logistics lines to the user.
After obtaining the candidate logistics circuits and the user acceptance values thereof, the server can compare the user acceptance values of the candidate logistics circuits with a preset threshold value, and screen the logistics circuits with the user acceptance values higher than the threshold value from the candidate logistics circuits as target logistics circuits.
Taking another scenario diagram of the embodiment of the present application shown in fig. 3 as an example, in an actual application, the number of the target logistics lines issued by the service type to the client may be one or more according to an actual situation, and after receiving the target logistics line issued by the server, the client may display an interface to push the contents of the target logistics line to the user, as shown in fig. 3, where the contents of the target logistics line may include a moving track of a logistics vehicle, a logistics node of a route, and a predicted arrival time of the logistics node, and after viewing the target logistics line pushed by the client, the user may confirm or adjust the target logistics line, and provide a new logistics route or a new limiting condition, so that the target logistics line is reported to the server by the client to adjust the target logistics line.
As can be seen from the embodiment shown in fig. 1, in the embodiment of the present application, the server first obtains the logistics route of the logistics route to be generated, then obtains the candidate logistics route matched with the logistics route, and obtains the user acceptance value of the candidate logistics route, then screens out the target logistics route with the user acceptance value higher than the threshold value from the candidate logistics routes, and sends the target logistics route to the client, so that the client pushes the target logistics route to the user, in this process, because the target logistics route pushed to the user is screened by combining the user acceptance value on the basis of the candidate logistics route matched with the logistics route determined by the user, not only the transportation condition of the logistics piece itself in terms of logistics resources can be satisfied, but also the logistics route can be screened again in terms of the user, therefore, the situation that a user adjusts the target logistics route can be effectively reduced to a certain extent, and the accuracy of the generated target logistics route can be improved.
The following proceeds to a detailed description of the various steps of the embodiment shown in fig. 1:
in an exemplary implementation manner, in the step S102 in the embodiment corresponding to fig. 1, referring to a flowchart of the step S102 in the embodiment corresponding to fig. 1 shown in fig. 4, the obtaining of the candidate logistics route may specifically include:
step S401, acquiring a journey characteristic of a logistics journey, wherein the journey characteristic comprises at least one of a starting time period, a starting address, an arrival time period, an arrival address, a logistics piece characteristic, a priority identification and a user identification;
as can be seen from fig. 2, the logistics travel according to the embodiment of the present application may include not only the start address, the start time period, the arrival address, and the arrival time period related to the logistics transportation task, but also a logistics piece feature, which is used to characterize the body of the logistics piece, such as a small piece, a large piece, a heavy piece, and the like distinguished according to weight or volume, and also such as a fragile identifier, a deformation identifier, and the like distinguished according to a fragile degree or a deformable program, and further, in the logistics transportation, other travel features, such as a priority identifier, a user identifier, and the like, may be introduced according to actual needs, and may be combined or adjusted according to actual needs.
The client can also set part of the journey characteristics of the logistics journey, such as priority identification and user identification, according to account information of a currently logged-in user account, and the user does not need to perform user operation in logistics journey operation options to fill in information.
And step S402, matching the travel characteristics with the travel characteristics of different logistics lines, and identifying the logistics line with the matching degree higher than the threshold value of the matching degree as a candidate logistics line.
In the process of matching the candidate logistics route, the server can match the travel characteristics of the logistics route with the travel characteristics of different logistics routes stored in the database, and obtain corresponding matching values.
It can be understood that different stroke features may configure corresponding weights, so that each stroke feature may obtain a corresponding sub-matching value in the matching process, and then the sub-matching values are accumulated or multiplied to obtain a total matching value.
Illustratively, if the travel characteristics of the current logistics travel include: priority mark 5, user mark 4, weight 34.8kg, volume 80cm 100cm 160cm ═ 1.28m3Start address a, start time period 8 on the first day: 00-9: time period 00, arrival at site B, arrival time period 19 on the fifth day: 00 to 22: the 00 time period.
Taking the priority identifier and the user identifier as an example, if the threshold of the priority identifier or the user identifier is 3, the priority identifier 5 or the user identifier 4 means that the importance of the logistics transportation task is higher than that of other logistics transportation tasks, and the aircraft air transportation can be adopted or a transportation mode with high transportation efficiency such as that a logistics vehicle directly drives to an arrival place from a starting address without passing through a logistics node can be adopted. For such scenarios, the priority identifier and the user identifier may be weighted higher, so that when a threshold condition of the priority identifier or the user identifier is satisfied, the route may have a higher matching degree with the logistics route with high transportation efficiency, for example, when both the priority identifier and the user identifier are higher than the threshold, the matching degree is 150% by 150% or 225%.
Wherein, these logistics lines need to satisfy the starting address A, the starting time period is 8 on the first day: 00-9: time period 00, arrival at site B, arrival time period 19 on the fifth day: 00 to 22: the constraint of the travel characteristics in the 00 time period can configure the sub-matching degrees meeting the address conditions and the time conditions to be 100% of the basic degree, and the matching degree of 225% 100% is provided at this time.
It can be seen that different logistics lines can be configured for different logistics transportation scenarios, and correspondingly, different weights can be configured for different journey characteristics according to different logistics transportation scenarios, so that candidate logistics lines with high matching degree of the corresponding logistics transportation scenarios can be obtained according to the journey characteristics of the current logistics journey.
Next, in the description of step S102 in the embodiment corresponding to fig. 1, a user acceptance value that can be obtained in real time for the current candidate distribution line is mentioned, and a real-time processing of the user acceptance value is described below.
In another exemplary implementation manner, referring to fig. 5 showing another flowchart of step S102 in the embodiment corresponding to fig. 1 of the present application, step S102 in the embodiment corresponding to fig. 1 may specifically include the following steps S501 to S503:
step S501, obtaining candidate logistics line length and candidate logistics line valuation of candidate logistics lines;
it is understood that the candidate logistics route acquired by the server may include not only the travel trajectory of the logistics vehicle transporting the logistics piece in different time periods, but also the route length and the route estimation of the travel trajectory, that is, the candidate logistics route length and the candidate logistics route estimation of the candidate logistics route.
The candidate logistics route estimation can be calculated by linear function, curve function or piecewise function with the route length as an independent variable, and the function can be configured according to actual needs.
In one exemplary implementation of the present invention,
the obtaining of the candidate logistics route valuation specifically includes:
and obtaining the candidate logistics line valuation according to the candidate logistics line length, the candidate logistics line type and the user type of the candidate logistics line.
It can be understood that, in the embodiment of the present application, the candidate logistics line valuation can be adjusted on the basis of the candidate logistics line length according to different candidate logistics line types and user types, so as to obtain a more detailed candidate logistics line valuation.
Illustratively, if the candidate stream circuit type is a high-cost complex type, the evaluation coefficient k1 is 30%, and if the user type is a promotion activity participation user type, the evaluation coefficient k2 is 20%, at which time if the candidate stream circuit length e is an argument, the initial candidate stream circuit evaluation calculated by the evaluation function is f (e), and the final candidate stream circuit evaluation Q is (1+ 30%) (1-20%) f (e).
On the basis of the length of the candidate logistics line, different candidate logistics line types and user types are configured, so that the candidate logistics line evaluation can be more flexibly obtained.
Step S502, screening a logistics line set with the line length in the same range as the candidate logistics line length from different logistics lines;
in the above, it has been mentioned that candidate logistics lines can be matched from different logistics lines, these logistics lines may include historical logistics lines, and may also include new logistics lines planned and developed by related staff, and in this case, a logistics line set whose line length is in an equivalent range to the above-mentioned candidate logistics line length may also be screened from these logistics lines.
Illustratively, if the length ranges of A [ 239-.
These different equivalent ranges of line lengths can be adjusted according to actual needs, wherein as the line length of the logistics line increases, the section span corresponding to the equivalent range can be wider, for example, X [12km-15km ], Y [150km-200km ], the section span of the X group of equivalent ranges is 3km, and the section span of the Y group of equivalent ranges is 50 km.
Step S503, in the logistics route set, obtaining the distribution value of the logistics route with the route price in the equivalent range of the candidate logistics route estimation, and identifying the distribution value as the user acceptance value.
Similarly to the above, in the screened logistics line set, the logistics lines in the equivalent range of the candidate logistics line valuations of the candidate logistics lines can be continuously identified, and at this time, the distribution values of the logistics lines in the logistics line set can be obtained, and the distribution values can also be understood as probability densities.
Further, in the acquisition of the division value, a price (or estimate) per unit length of each logistics route, such as a single kilometer price (or estimate),
for example, as shown in fig. 6 and 7, respectively, the scene schematic diagram of the embodiment of the present application may be obtained, a large amount of transaction data may be obtained first, statistics may be performed according to different time periods and single kilometer prices to obtain a trend curve between the single kilometer price and the volume of transaction shown in fig. 5, after data cleaning, a fitting scheme such as positive-power distribution or logarithmic positive-power distribution may be used to perform fitting to obtain a fitting function between the single kilometer price and the volume probability density corresponding to each time period, as shown in the fitting function shown in fig. 6, as the single kilometer price increases, the probability density increases first, and then changes to a decreasing trend, and the line price in an equivalent range to the preferred logistics line estimation is brought into the fitting function, so as to obtain a corresponding probability density, which is used as a user acceptance value.
When the user acceptance value of the candidate logistics line reaches the threshold value, the server can issue the target logistics line with the user acceptance value reaching the threshold value to the client, and for the candidate logistics line with the user acceptance value not reaching the threshold value, the server can actively adjust to improve the user acceptance value of the candidate logistics line.
As another exemplary implementation manner, as another flow diagram of the method for generating a logistics route in the embodiment of the present application shown in fig. 8, after step S102 in the embodiment of fig. 1 of the present application, in addition to step S103, the method may further include:
step S801, when the user acceptance value is lower than the threshold value, under the constraint condition that the logistics line cost is met, acquiring the adjustment price value of the candidate logistics line;
it is to be understood that, referring to fig. 7, for a candidate logistics route with a low customer acceptance value, if the evaluation is adjusted, including down-regulation or up-regulation, on the basis of satisfying the logistics route cost, the customer acceptance value can be increased to some extent.
In practical applications, the adjustment process of the valuation may be defaulted to the down-adjustment process.
The adjustment price value can be a default numerical value, or a numerical value obtained by combining the current user acceptance value and processing in real time, and can be set according to actual needs.
Step S802, the candidate logistics route valuation of the candidate logistics route is updated according to the adjusted price value so as to improve the user acceptance value.
Illustratively, adjusting the price value may lower the default value by 1-tuple; or if the current estimate is 38 and the user acceptance value is 35%, then 38 × [ (70% -35%)/3 ] ═ 4.43 units may be adjusted downward, and if rounded, 4.5 units may be adjusted downward.
After updating the candidate logistics route estimation of the candidate logistics route, the new user acceptance value of the candidate logistics route can be obtained for updating.
Further, in another exemplary implementation manner, in step S701 of the corresponding embodiment of fig. 7, the adjustment price value may be processed in real time and the finally determined value is adjusted multiple times, and in this embodiment, the finally determined adjustment price value may be determined in combination with the expected profit.
In other words, step S801 may include:
and when the user acceptance value is lower than the threshold value, acquiring different expected benefits of the logistics line under different adjustment price values under the condition of meeting the constraint condition of the logistics line cost, and acquiring the adjustment price value of the maximum expected benefit.
It can be understood that the candidate logistics line valuation can be updated under different adjustment price values through testing the candidate logistics lines to improve the user acceptance value, meanwhile, corresponding different expected benefits can be obtained, and the adjustment price value obtaining the maximum expected benefit is used as the finally determined adjustment price value.
Wherein the expected revenue Q, Q (candidate logistics route estimate-candidate logistics route cost) is a user acceptance value.
The price adjusting value determined by the data processing can not only be beneficial to improving the user acceptance value, but also can ensure that the profit requirement of the logistics service is met, and both can be considered.
In yet another exemplary implementation, a state transition network, or state transition equation, may be configured as a landing scheme.
In the step S801, specifically, the following steps may be performed:
and when the user acceptance value is lower than the threshold value, under the constraint condition of meeting the cost of the logistics line, transferring the public network according to the preset adjustment price step length and the adjustment price state, calculating different expected benefits of the logistics line under different adjustment price values, and obtaining the adjustment price value of the maximum expected benefit.
It can be understood that, if the process of setting the adjusted price value each time is understood as an adjustment stage, and the expected profit obtained from the price value adjusted each time is the state corresponding to each adjustment node, the process of settling the adjusted price value of the next stage and the expected profit corresponding to the adjusted price value of the previous stage according to the adjusted price value of the previous stage and the expected profit corresponding to the adjusted price value of the previous stage is a data processing process of the state transition network, which is used for dynamically planning the expected profit of each layer of adjustment stage and obtaining the maximum expected profit.
Illustratively, if price adjustment is performed discretely at intervals of 0.1 yuan only in the upper and lower limit ranges, the adjustment value of the price adjustment value is fixed 0.1 yuan, and is adjusted down by 0.1 yuan or is adjusted up by 0.1 yuan;
the lower limit of price adjustment is pl, cdf (pl) is 0.135%;
upper limit of price adjustment pu, cdf (pu) 99.865%;
where cdf (P) is the above-mentioned distribution value of the logistics route with the logistics route price of P in the logistics route set, such as the function value in the fitting function between the single kilometer price and the deal probability density in fig. 7.
Setting the price adjustment times as n, the state transition network is n layers, each layer uses m discrete price states, the minimum price of each layer is pl, the maximum price is pu, the connecting line between the kth layer and the kth +1 layer only exists between price states p with pk +1 being greater than or equal to pk, and the network schematic diagram can refer to another scene schematic diagram of the embodiment of the application shown in fig. 9;
m { (pu-pl)/0.1} + 1;
and using the state transition equation:
wherein, cdf (P) is the distribution value of the logistics line with the logistics line price P in the logistics line set, cost is the approved target price, and cost-pk is the profit of the logistics line for bargaining at the price pk.
And (5) solving from the nth layer to the first layer in a recursion mode, wherein the final objective is as follows:
i.e. to maximize the expected yield, the solution may yield a dynamic pricing scheme { pk | k ═ 1,2.. n }.
It should be noted that, in practical applications, the method for generating a logistics line provided in this embodiment of the present application is not only suitable for generating a logistics line for a consumer whose client side enjoys logistics services, so as to improve transaction efficiency and user experience of the consumer, but also suitable for generating a logistics line for a worker whose client side handles logistics services at a logistics node, such as a worker at an express delivery site, where the method for generating a logistics line provided in this embodiment of the present application can determine estimates of a plurality of logistics lines and even a logistics line in a unified manner, so as to provide high-quality data support for the site, and then put these logistics lines into practical applications, and push them to consumers who enjoy logistics services through the site.
If the method for generating a logistics route provided by the embodiment of the application is applied to providing a logistics route for a worker who handles logistics business at a logistics node on a client side, a target logistics route issued by a server side for the first time can be selected preferably as the logistics route with the highest user acceptance higher than a threshold value and the highest profit.
In order to better implement the method for generating the logistics route provided by the embodiment of the application, the embodiment of the application also provides a device for generating the logistics route.
Referring to fig. 10, fig. 10 is a schematic structural diagram of a generating device of a logistics route according to an embodiment of the present application, in the embodiment of the present application, the generating device 1000 of a logistics route may specifically include the following structure:
a transceiving unit 1001 configured to acquire a logistics route of a logistics route to be generated;
the processing unit 1002 is configured to acquire a candidate logistics route matched with the logistics route, and acquire a user acceptance value of the candidate logistics route; from the candidate logistics lines, a target logistics line with a user acceptance value higher than a threshold value is screened out, and the target logistics line is issued to the client through the transceiving unit 1001, so that the client pushes the target logistics line to the user.
In an exemplary implementation, the processing unit 1002 is specifically configured to:
obtaining the candidate logistics line length and the candidate logistics line valuation of the candidate logistics line;
screening a logistics line set with the line length in the same range as the candidate logistics line length from different logistics lines;
and acquiring the distribution value of the logistics line with the line price in the equivalent range of the candidate logistics line valuation in the logistics line set, and identifying the distribution value as a user acceptance value.
In yet another exemplary implementation, the processing unit 1002 is further configured to:
when the user acceptance value is lower than the threshold value, acquiring the adjustment price value of the candidate logistics line under the constraint condition of satisfying the cost of the logistics line;
and updating the candidate logistics route valuation of the candidate logistics route according to the adjusted price value so as to improve the user acceptance value.
In another exemplary implementation, the processing unit 1002 is specifically configured to:
and when the user acceptance value is lower than the threshold value, acquiring different expected benefits of the logistics line under different adjustment price values under the condition of meeting the constraint condition of the logistics line cost, and acquiring the adjustment price value of the maximum expected benefit.
In another exemplary implementation, the processing unit 1002 is specifically configured to:
and when the user acceptance value is lower than the threshold value, under the condition of meeting the constraint condition of the cost of the logistics line, calculating different expected benefits of the logistics line under different adjustment price values according to a preset adjustment price step length and an adjustment price state transfer network, and obtaining the adjustment price value of the maximum expected benefit.
In another exemplary implementation, the processing unit 1002 is specifically configured to:
and obtaining the candidate logistics line valuation according to the candidate logistics line length, the candidate logistics line type and the user type of the candidate logistics line.
In another exemplary implementation, the processing unit 1002 is specifically configured to:
acquiring the travel characteristics of the logistics travel, wherein the travel characteristics comprise at least one of a starting time period, a starting address, an arrival time period, an arrival address, logistics piece characteristics, a priority identification and a user identification;
and matching the travel characteristics with the travel characteristics of different logistics lines, and identifying the logistics line with the matching degree higher than the threshold value of the matching degree as a candidate logistics line.
Referring to fig. 11, fig. 11 shows a schematic structural diagram of a server according to an embodiment of the present application, specifically, the server according to the present application includes a processor 1101, a memory 1102, and an input/output device 1103, where the processor 1101 is configured to implement, when executing a computer program stored in the memory 1102, each step of the method for generating a logistics route according to any embodiment corresponding to fig. 1 to 9; alternatively, when the processor 1101 is configured to execute the computer program stored in the memory 1102, the functions of the units in the embodiment corresponding to fig. 10 are implemented, for example, the hardware structure corresponding to the transceiver unit 1001 in fig. 10 is the input/output device 1103, the hardware structure corresponding to the processing unit 1002 is the processor 1101, and the memory 1102 is configured to store the computer program required by the processor 1101 to execute the method for generating the logistics route in any embodiment corresponding to fig. 1 to 9.
Illustratively, the computer program may be divided into one or more modules/units, which are stored in the memory 1102 and executed by the processor 1101 to complete the present application. One or more modules/units may be a series of computer program instruction segments capable of performing certain functions, the instruction segments being used to describe the execution of a computer program in a computer device.
The server may include, but is not limited to, a processor 1101, a memory 1102, and an input-output device 1103. It will be understood by those skilled in the art that the illustration is merely an example of a server, and is not intended to limit the server, and may include more or less components than those illustrated, or combine some components, or different components, for example, the server may further include a network access device, a bus, etc., and the processor 1101, the memory 1102, the input output device 1103, and the network access device, etc., are connected via the bus.
The Processor 1101 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, the processor being the control center for the server and the various interfaces and lines connecting the various parts of the overall server.
The memory 1102 may be used to store computer programs and/or modules, and the processor 1101 implements various functions of the computer device by running or executing the computer programs and/or modules stored in the memory 1102 and calling data stored in the memory 1102. The memory 1102 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to the use of the server, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
The processor 1101, when executing the computer program stored in the memory 1102, may specifically implement the following functions:
acquiring a logistics stroke of a logistics line to be generated;
acquiring candidate logistics lines matched with the logistics route, and acquiring user acceptance values of the candidate logistics lines;
and screening out target logistics lines with user acceptance values higher than a threshold value from the candidate logistics lines, and issuing the target logistics lines to the client so that the client pushes the target logistics lines to the user.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the generation apparatus of the logistics route, the server and the corresponding units thereof described above may refer to the descriptions of the generation method of the logistics route in any embodiment corresponding to fig. 1 to 9, and are not described herein again in detail.
It will be understood by those skilled in the art that all or part of the steps of the methods of the above embodiments may be performed by instructions or by associated hardware controlled by the instructions, which may be stored in a computer readable storage medium and loaded and executed by a processor.
To this end, an embodiment of the present application provides a computer-readable storage medium, where a plurality of instructions are stored, and the instructions can be loaded by a processor to execute steps in the method for generating a logistics route in any embodiment corresponding to fig. 1 to 9 in the present application, and specific operations may refer to descriptions of the method for generating a logistics route in any embodiment corresponding to fig. 1 to 9, which are not described herein again.
Wherein the computer-readable storage medium may include: read Only Memory (ROM), Random Access Memory (RAM), magnetic or optical disks, and the like.
Since the instructions stored in the computer-readable storage medium can execute the steps in the method for generating a logistics route in any embodiment corresponding to fig. 1 to 9 in the present application, the beneficial effects that can be achieved by the method for generating a logistics route in any embodiment corresponding to fig. 1 to 9 in the present application can be achieved, for details, see the foregoing description, and are not repeated herein.
The method, the apparatus, the server and the computer-readable storage medium for generating a logistics route provided by the present application are described in detail above, and a specific example is applied in the present application to explain the principle and the implementation of the present application, and the description of the above embodiment is only used to help understand the method and the core idea of the present application; meanwhile, for those skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. A method of generating a logistics circuit, the method comprising:
acquiring a logistics stroke of a logistics line to be generated;
acquiring candidate logistics lines matched with the logistics routes, and acquiring user acceptance values of the candidate logistics lines;
and screening out the target logistics line with the user acceptance value higher than a threshold value from the candidate logistics lines, and issuing the target logistics line to the client so that the client pushes the target logistics line to the user.
2. The method of claim 1, wherein the obtaining the user acceptance value of the candidate logistics route comprises:
obtaining the candidate logistics line length and the candidate logistics line valuation of the candidate logistics line;
screening out a logistics line set with the line length in the same range as the candidate logistics line length from the different logistics lines;
and acquiring the distribution value of the logistics line with the line price in the equivalent range of the candidate logistics line valuation in the logistics line set, and identifying the distribution value as the user acceptance value.
3. The method of claim 2, wherein after obtaining the candidate logistics route matching the logistics route and obtaining the user acceptance value of the candidate logistics route, the method further comprises:
when the user acceptance value is lower than the threshold value, acquiring the adjustment price value of the candidate logistics route under the constraint condition of satisfying the logistics route cost;
and updating the candidate logistics route valuation of the candidate logistics route according to the adjusted price value so as to improve the user acceptance value.
4. The method of claim 3, wherein obtaining the adjusted price of the candidate logistics route under the constraint of satisfying the logistics route cost when the user acceptance value is lower than the threshold value comprises:
and when the user acceptance value is lower than the threshold value, acquiring different expected benefits of the logistics line under different adjustment price values under the condition of meeting the constraint condition of the logistics line cost, and acquiring the adjustment price value of the maximum expected benefit.
5. The method of claim 4, wherein when the user acceptance value is lower than the threshold value, obtaining different expected gains of the logistics route at different adjusted price values under the constraint condition that the logistics route cost is met, and obtaining the adjusted price value of the maximum expected gain comprises:
and when the user acceptance value is lower than the threshold value, under the condition of meeting the constraint condition of the logistics line cost, calculating different expected benefits of the logistics line under different adjustment price values according to a preset adjustment price step length and an adjustment price state transfer network, and obtaining the adjustment price value of the maximum expected benefit.
6. The method of claim 5, wherein obtaining the candidate logistics route length and candidate logistics route valuation for the candidate logistics route comprises:
and obtaining the candidate logistics line valuation according to the candidate logistics line length, the candidate logistics line type and the user type of the candidate logistics line.
7. The method of claim 6, wherein the obtaining the candidate logistics route matching the logistics route in the current time period comprises:
acquiring a travel characteristic of the logistics travel, wherein the travel characteristic comprises at least one of a starting time period, a starting address, an arrival time period, an arrival address, a logistics piece characteristic, a priority identification and a user identification;
and matching the travel characteristics with the travel characteristics of different logistics lines, and identifying the logistics line with the matching degree higher than the threshold value of the matching degree as the candidate logistics line.
8. An apparatus for generating a distribution line, the apparatus comprising:
the receiving and sending unit is used for acquiring the logistics travel of the logistics line to be generated;
the processing unit is used for acquiring candidate logistics lines matched with the logistics route and acquiring user acceptance values of the candidate logistics lines; and screening out the target logistics line with the user acceptance value higher than a threshold value from the candidate logistics lines, and issuing the target logistics line to the client through the transceiving unit so that the client pushes the target logistics line to the user.
9. A server comprising a processor and a memory, the memory having stored therein a computer program, the processor when calling the computer program in the memory performing the method of any of claims 1 to 7.
10. A computer-readable storage medium storing a plurality of instructions adapted to be loaded by a processor to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010564854.8A CN113822609A (en) | 2020-06-19 | 2020-06-19 | Logistics line generation method and device and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010564854.8A CN113822609A (en) | 2020-06-19 | 2020-06-19 | Logistics line generation method and device and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113822609A true CN113822609A (en) | 2021-12-21 |
Family
ID=78924318
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010564854.8A Pending CN113822609A (en) | 2020-06-19 | 2020-06-19 | Logistics line generation method and device and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113822609A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114757662A (en) * | 2022-06-13 | 2022-07-15 | 深圳市九方通逊电商物流有限公司 | Internet-based cross-border service trading platform management system and method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105243526A (en) * | 2015-09-09 | 2016-01-13 | 安吉汽车物流有限公司 | Social vehicle logistics system |
| CN109284948A (en) * | 2017-07-20 | 2019-01-29 | 菜鸟智能物流控股有限公司 | Logistics object selection method, logistics object selection device and electronic device |
| CN110348628A (en) * | 2019-07-08 | 2019-10-18 | 重庆交通大学 | A kind of multimodal transport service network optimization method based on preference |
| CN110503528A (en) * | 2019-08-28 | 2019-11-26 | 江苏满运软件科技有限公司 | A kind of circuit recommendation method, apparatus, equipment and storage medium |
| US20200034791A1 (en) * | 2018-07-27 | 2020-01-30 | Goldtek Technology Co., Ltd. | Dynamic logistics management system and method |
-
2020
- 2020-06-19 CN CN202010564854.8A patent/CN113822609A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105243526A (en) * | 2015-09-09 | 2016-01-13 | 安吉汽车物流有限公司 | Social vehicle logistics system |
| CN109284948A (en) * | 2017-07-20 | 2019-01-29 | 菜鸟智能物流控股有限公司 | Logistics object selection method, logistics object selection device and electronic device |
| US20200034791A1 (en) * | 2018-07-27 | 2020-01-30 | Goldtek Technology Co., Ltd. | Dynamic logistics management system and method |
| CN110348628A (en) * | 2019-07-08 | 2019-10-18 | 重庆交通大学 | A kind of multimodal transport service network optimization method based on preference |
| CN110503528A (en) * | 2019-08-28 | 2019-11-26 | 江苏满运软件科技有限公司 | A kind of circuit recommendation method, apparatus, equipment and storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114757662A (en) * | 2022-06-13 | 2022-07-15 | 深圳市九方通逊电商物流有限公司 | Internet-based cross-border service trading platform management system and method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210232984A1 (en) | Order allocation system and method | |
| CN110645983B (en) | Path planning method, device and system for unmanned vehicle | |
| CN104537831B (en) | The method and apparatus of vehicle scheduling | |
| CN104599217B (en) | Method and apparatus for the current destination for determining passenger | |
| CN113222305B (en) | Order scheduling method, order scheduling device, storage medium and electronic equipment | |
| CN104809601B (en) | The mutual auxiliary system of express delivery based on electronic map | |
| CN109816128B (en) | Method, device and equipment for processing network taxi appointment orders and readable storage medium | |
| US20180374181A1 (en) | System and method of user behavior based service dispatch | |
| CN110503528B (en) | Line recommendation method, device, equipment and storage medium | |
| CN107633358B (en) | Facility site selection and distribution method and device | |
| CN113259144A (en) | Storage network planning method and device | |
| CN113128744A (en) | Distribution planning method and device | |
| US20220044570A1 (en) | Dispatching provider devices utilizing multi-outcome transportation-value metrics and dynamic provider device modes | |
| CN110858347A (en) | Method and device for logistics distribution and order distribution | |
| CN113822609A (en) | Logistics line generation method and device and server | |
| US20220044569A1 (en) | Dispatching provider devices utilizing multi-outcome transportation-value metrics and dynamic provider device modes | |
| CN104956420B (en) | Watch for Train delay is notified | |
| Klundert et al. | ASAP: The after-salesman problem | |
| CN113657759A (en) | Task processing method, device, equipment and storage medium | |
| CN104731788B (en) | The processing method and equipment of promotion message | |
| CN111105176B (en) | Data processing method, device, equipment and storage medium | |
| CN112801324B (en) | Travel recommendation method and device, electronic equipment and computer readable storage medium | |
| CN113283830B (en) | Method, device, equipment and computer readable medium for generating waybill information sequence | |
| CN115099865A (en) | Data processing method and device | |
| CN112508423B (en) | Guide route generation method and device |
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 |