CN109558986A - A kind of sort method and device of same city website dispatching sequence - Google Patents
A kind of sort method and device of same city website dispatching sequence Download PDFInfo
- Publication number
- CN109558986A CN109558986A CN201811506428.8A CN201811506428A CN109558986A CN 109558986 A CN109558986 A CN 109558986A CN 201811506428 A CN201811506428 A CN 201811506428A CN 109558986 A CN109558986 A CN 109558986A
- Authority
- CN
- China
- Prior art keywords
- delivery
- site
- distribution
- orders
- attribute
- 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 55
- 238000012384 transportation and delivery Methods 0.000 claims description 309
- 230000006870 function Effects 0.000 claims description 21
- 238000012163 sequencing technique Methods 0.000 claims description 14
- 238000012549 training Methods 0.000 claims description 6
- 230000000694 effects Effects 0.000 abstract description 2
- 238000013439 planning Methods 0.000 abstract description 2
- 230000008569 process Effects 0.000 description 9
- 239000002699 waste material Substances 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 239000000295 fuel oil Substances 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 239000003921 oil Substances 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012417 linear regression Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
This application provides the sort methods and device of a kind of same city website dispatching sequence, wherein this method comprises: the order information of multiple dispatching orders determines dispatching website based on the received；Based on all order informations, each dispatching website dispatching attribute is determined；Based on the dispatching attribute of each dispatching website, the dispatching priority of each dispatching website is determined；Dispatching priority based on each dispatching website, all dispensing station points are ranked up, wherein, the dispatching attribute includes at least one of the following: the cargo handling ratio of the distance between urgency level, the dispatching website and dispatching starting point of dispatching website and the dispatching website.Using the method for determining dispatching website dispatching attribute, determining dispatching website priority, dispatching sequence of making rational planning for achievees the effect that efficient, low fault rate, saves time resource the application.
Description
Technical Field
The application relates to the technical field of logistics transportation, in particular to a method and a device for sequencing delivery sequences of same-city stations.
Background
With the development of logistics business, business scenes are slowly expanded from express business in the same city to freight business of short-distance branches. In the same city business distribution, the distribution mode is often the distribution between two points, in the short-distance branch distribution, the distribution personnel need to distribute the goods to a plurality of places from the starting point, and the distribution efficiency is influenced by the distribution geographical position, the loading and unloading sequence, the loading and unloading amount, the distribution emergency degree and other factors, and how to reasonably select the distribution sequence is the technical problem of improving the distribution efficiency. In the prior art, a manual mode of selecting a distribution sequence is generally adopted. The applicant finds in research that the mode requires work with abundant experience of service personnel, is low in efficiency, is volatile and wrong, often cannot obtain the most distribution sequence, and causes fuel oil waste, time waste and even accidents such as misoperation.
Disclosure of Invention
In view of the above, an object of the present invention is to provide a method and an apparatus for sorting delivery orders of co-city sites, so as to improve delivery efficiency, reduce delivery time and oil consumption, and reduce error probability.
In a first aspect, an embodiment of the present application provides a method for sorting delivery orders of co-located sites, including:
determining a delivery site according to the received order information of the plurality of delivery orders;
determining the distribution attribute of each distribution site based on all the order information;
determining a delivery priority of each delivery site based on the delivery attributes of each delivery site;
sequencing all the distribution sites based on the distribution priority of each distribution site;
wherein the delivery attributes include at least one of:
the urgency of the delivery site, the distance between the delivery site and the delivery start point, and the cargo handling ratio of the delivery site.
With reference to the first aspect, an embodiment of the present application provides a first possible implementation manner of the first aspect, where the method includes calculating the delivery priority by using the following formula:
Y＝a×B+b×N+c×P+…+n×M
wherein Y is the delivery priority of the delivery site, B, N, P … M is the delivery attribute of the delivery site, and a, b, c … n is the weight of each delivery attribute of the delivery site.
In combination with the first possible implementation manner of the first aspect, the present application provides a second possible implementation manner of the first aspect, wherein,
the method further comprises the step of determining a weight for each delivery attribute:
acquiring sample data; the sample data comprises a plurality of historical delivery orders and order information of the historical delivery orders;
determining a delivery site of the plurality of historical delivery orders, a delivery attribute of each delivery site of the plurality of historical delivery orders and a delivery priority of each delivery site of the plurality of historical delivery orders according to order information of the plurality of historical delivery orders;
a weight for each delivery attribute is determined based on the delivery priority for each delivery site of the plurality of historical delivery orders, the delivery attribute for each delivery site of the plurality of historical delivery orders.
In combination with the first possible implementation manner of the first aspect or the second possible implementation manner of the first aspect, the present application provides a third possible implementation manner of the first aspect, wherein,
the determining a weight for each delivery attribute based on the delivery priority for each delivery site of the plurality of historical delivery orders and the delivery attribute for each delivery site of the plurality of historical delivery orders comprises:
substituting the distribution priority of each distribution site of the plurality of historical distribution orders and the distribution attribute of each distribution site of the plurality of historical distribution orders into the formula for calculating the distribution priority to obtain a weight function related to the distribution attribute;
identifying a squared loss function of the weighting function for the delivery attributes;
deriving the square loss function to make the derivative of the square loss function zero;
and solving the derivative of the square loss function to obtain the weight of the distribution attribute.
With reference to the first possible implementation manner of the first aspect, an embodiment of the present application provides a fourth possible implementation manner of the first aspect, where the method further includes sorting and storing the received delivery orders and order information of the delivery orders in time.
In a second aspect, a method for training a priority model includes:
acquiring sample data; the sample data comprises a plurality of historical delivery orders and order information of the historical delivery orders;
determining a delivery site of the plurality of historical delivery orders, a delivery attribute of each delivery site of the plurality of historical delivery orders and a delivery priority of each delivery site of the plurality of historical delivery orders according to order information of the plurality of historical delivery orders;
determining a weight of each delivery attribute based on the delivery priority of each delivery site of the plurality of historical delivery orders and the delivery attribute of each delivery site of the plurality of historical delivery orders;
based on the weight of each delivery attribute, a priority model is determined.
With reference to the second aspect, an embodiment of the present application provides a first possible implementation manner of the second aspect, where the priority model specifically includes:
Y＝a×B+b×N+c×P+…+n×M
wherein Y is the delivery priority of the delivery site, B, N, P … M is the delivery attribute of the delivery site, and a, b, c … n is the weight of each delivery attribute of the delivery site.
In a third aspect, an embodiment of the present application further provides a device for sorting delivery orders of co-located sites, including:
the first determining module is used for determining delivery stations according to the received order information of the plurality of delivery orders;
the second determining module is used for determining the distribution attribute of each distribution site based on all the order information;
a third determining module, configured to determine a delivery priority of each delivery site based on the delivery attribute of each delivery site;
and the sequencing module is used for sequencing all the distribution sites based on the distribution priority of each distribution site.
With reference to the third aspect, an embodiment of the present application provides a first possible implementation manner of the third aspect, where the sorting apparatus for a distribution sequence of sibling sites further includes:
and the storage module is used for sequencing and storing the received delivery orders and the order information of the delivery orders according to time.
In a fourth aspect, an embodiment of the present application further provides an electronic device, including: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating via the bus when the electronic device is running, the machine-readable instructions when executed by the processor performing the steps of any one of the possible implementations of the first aspect or the second aspect of the first aspect.
In a fifth aspect, this embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and the computer program is executed by a processor to perform the steps in the foregoing first aspect or any possible implementation manner of the second aspect of the first aspect.
Compared with the manual site sorting method in the prior art, the method and the device for sorting the same-city site distribution sequences can comprehensively consider various distribution electric distribution attributes influencing distribution in order information, determine the distribution priority of each distribution point according to the distribution attributes, sort the distribution points according to the distribution priorities, reasonably plan the distribution sequences, and achieve the effects of high efficiency, low error rate and time resource saving.
Furthermore, the method for sorting the delivery sequence of the same-city sites provided by the embodiment of the application can also ensure that the delivery priority is confirmed more accurately and quickly and simply by training the priority model.
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 is an application scenario diagram illustrating a method for sorting delivery orders of co-located sites according to an embodiment of the present application;
fig. 2 is a flowchart illustrating a method for sorting the distribution order of the same-city sites according to an embodiment of the present application;
FIG. 3 is a flowchart illustrating a method for determining a weight of each delivery attribute in a method for sorting delivery orders of co-located sites according to an embodiment of the present application;
FIG. 4 is a flowchart illustrating training of a priority model in a method for sorting the distribution order of the co-located sites according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram illustrating a sorting apparatus for the distribution sequence of the same-city stations according to an embodiment of the present application.
Fig. 6 is a flowchart illustrating another method for ordering the delivery order of the same-city sites according to the embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, 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 the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
Considering that most of the existing sorting methods for the distribution sequences of the same city stations are manual sorting, the method needs work with abundant experience of business personnel, is low in efficiency, is volatile and wrong, often cannot obtain the most distribution sequence, and causes accidents such as fuel oil waste, time waste and even malwork.
First, a description is given of a scenario in which the present embodiment is applicable. The method and the device can be applied to the scene of short-distance branch line freight. For example, as shown in fig. 1, an order flow comprises the path from point a, path B, C, D and finally point F, and requires a sequence such that the goods taken from point a must be placed at point C, requiring that the truck must arrive at point a before point C, and each station has a corresponding estimated time of arrival and estimated time of departure requirement. The reasonable planning of the path of the truck can optimize the driving distance, shorten the driving time, save fuel oil, save the delivery time of a driver, finally improve the delivery efficiency, reduce the delivery cost and obtain the maximum delivery income.
For the convenience of understanding the present embodiment, a detailed description will be given to a method for sorting the distribution sequence of the same-city sites disclosed in the embodiments of the present application.
Example one
As shown in fig. 2, a method for sorting a distribution sequence of co-located sites according to an embodiment of the present application includes:
s101, determining delivery stations according to received order information of a plurality of delivery orders;
in particular embodiments, a software platform (e.g., a logistics management platform) may record information for each delivery order generated, and from the order information, may determine at least one delivery site through which the delivery vehicle needs to pass.
S102, determining the distribution attribute of each distribution site based on all the order information;
in a specific embodiment, the order information should include: distribution station position information, a distance of distribution from an origin point of distribution of the distribution station, cargo handling information of the distribution station, a distribution due completion time, a distribution emergency degree, and the like. The delivery point information in the order information with quantifiable delivery attributes of the delivery sites includes: the urgency of the delivery site, the distance between the delivery site and the delivery start point, and the cargo handling ratio of the delivery site.
S103, determining the distribution priority of each distribution site based on the distribution attribute of each distribution site;
in particular embodiments, the delivery attributes of each delivery site affect the delivery priority of the delivery site, such as:
for the degree of urgency of delivery stations, more urgent stations should deliver earlier and should be ahead of the delivery order;
for the distance between the distribution station and the distribution starting point, under the condition of the same other conditions, the distribution station with the closer distance to the starting place needs to be sent first, so that the overall distribution distance is favorably shorter;
for the cargo loading and unloading ratio of the delivery stations, under the condition of a plurality of delivery stations, each delivery station can be loaded and unloaded, and the delivery stations with more cargoes and less cargoes should be preferentially sent, so that the cargoes on the vehicle are less and less along with the increase of the distance in the delivery process, and the aim of saving oil is fulfilled.
In the specific embodiment, the distribution attributes of the distribution sites are quantized, and the attribute values of the same distribution site are weighted and summed to obtain the distribution priority of the distribution sites.
And S104, sequencing all the delivery sites based on the delivery priority of each delivery site.
In a particular embodiment, the higher the delivery priority of a delivery site, the earlier the delivery site should be delivered, and the earlier the ranking position.
Example two
Based on S103 in the first embodiment, an embodiment of the present application further provides a method for determining a delivery priority of each delivery site based on a delivery attribute of each delivery site, where a calculation formula is as follows:
Y＝a×B+b×N+c×P+…+n×M
wherein Y is the delivery priority of the delivery site, B, N, P … M is the delivery attribute of the delivery site, and a, b, c … n is the weight of each delivery attribute of the delivery site.
In a specific embodiment, the delivery attributes of the delivery sites are quantized and then calculated by the above formula. The weight of each delivery attribute of the delivery site is calculated by a plurality of historical delivery orders and order information of the plurality of historical delivery orders.
The above process of calculating the weight for each delivery attribute of a delivery site is further described below by a specific embodiment.
EXAMPLE III
As shown in fig. 3, the process of determining the weight of each delivery attribute in S102 provided in the third embodiment of the present application includes:
s301, obtaining sample data; the sample data comprises a plurality of historical delivery orders and order information of the historical delivery orders;
in an embodiment, the sample data may be obtained from a database, where the sample data includes a plurality of historical delivery orders and order information of the plurality of historical delivery orders, and the order information of the plurality of historical delivery orders is the historical information of the order information in the first embodiment.
S302, determining distribution sites of a plurality of historical distribution orders, distribution attributes of each distribution site of the plurality of historical distribution orders and distribution priorities of each distribution site of the plurality of historical distribution orders according to order information of the plurality of historical distribution orders;
in a specific embodiment, the delivery site of the plurality of historical delivery orders, the delivery attribute of each delivery site of the plurality of historical delivery orders, and the delivery priority of each delivery site of the plurality of historical delivery orders are historical information of the delivery site of the delivery order, the delivery attribute of each delivery site of the delivery order, and the delivery priority of each delivery site of the delivery order in embodiment one.
S303, determining the weight of each distribution attribute based on the distribution priority of each distribution site of the plurality of historical distribution orders and the distribution attribute of each distribution site of the plurality of historical distribution orders.
In an embodiment, since the delivery priority of each delivery site of the plurality of historical delivery orders and the delivery attribute of each delivery site of the plurality of historical delivery orders are known information, the weight of each delivery attribute may be determined based on the formula for determining the delivery priority of each delivery site, the delivery priority of each delivery site of the plurality of historical delivery orders, and the delivery attribute of each delivery site of the plurality of historical delivery orders in the second embodiment.
Further, the determining a weight of each delivery attribute based on the delivery priority of each delivery site of the plurality of historical delivery orders and the delivery attribute of each delivery site of the plurality of historical delivery orders comprises:
substituting the distribution priority of each distribution site of the plurality of historical distribution orders and the distribution attribute of each distribution site of the plurality of historical distribution orders into the formula for calculating the distribution priority to obtain a weight function related to the distribution attribute;
identifying a squared loss function of the weighting function for the delivery attributes;
deriving the square loss function to make the derivative of the square loss function zero;
and solving the derivative of the square loss function to obtain the weight of the distribution attribute.
Here, the above process may be trained as a priority model, and the process of training the priority model and the process of determining the weight of each delivery attribute will be described in detail below with reference to specific embodiments.
Example four
As shown in fig. 4, a process of training a priority model provided in the fourth embodiment of the present application includes:
s401, obtaining sample data; the sample data comprises a plurality of historical delivery orders and order information of the historical delivery orders;
s402, determining distribution sites of a plurality of historical distribution orders, distribution attributes of each distribution site of the plurality of historical distribution orders and distribution priorities of each distribution site of the plurality of historical distribution orders according to order information of the plurality of historical distribution orders;
s403, determining the weight of each distribution attribute based on the distribution priority of each distribution site of the plurality of historical distribution orders and the distribution attribute of each distribution site of the plurality of historical distribution orders;
s404, determining a priority model based on the weight of each distribution attribute.
In a specific embodiment, the priority model is specifically:
Y＝a×B+b×N+c×P+…+n×M
wherein Y is the delivery priority of the delivery site, B, N, P … M is the delivery attribute of the delivery site, and a, b, c … n is the weight of each delivery attribute of the delivery site. Y is the inverse of the delivery cost required from the delivery starting point to the delivery site, and the higher the delivery cost, the lower the delivery priority of the delivery site.
In a particular embodiment, the weight for each distribution attribute is determined using a least squares method.
Here, in order to reduce the error, the linear model is established by not less than 3 sets of B, N, P … M, and the delivery attributes of the delivery points in this embodiment are the degree of urgency B of the delivery station, the distance N between the delivery station and the delivery start point, and the cargo handling ratio P of the delivery station.
The priority model may be expressed as:
Tk＝ak×Bk+bk×Nk+ck×Pk
where k is 1, …, m, m is the number of all delivery stations.
Introducing a parameter vector:
θ＝[ak,bk,ck]T
order:
then
Will YkViewed as a point in a coordinate system, YkDistance to priority model, i.e. weight on delivery attributesThe squared loss function of the weight function is:
wherein J is YkDistance to the priority model.
And d, deriving J to enable the derivative of J to be equal to zero, and obtaining the optimal solution of a, b and c.
In a specific embodiment, the weight of each distribution attribute may also be determined by using a method of solving a multiple Linear equation set to solve parameters, such as Linear Regression, polynominal Regression Polynomial Regression, ElasticNet Regression, and the like, which is not described herein again.
EXAMPLE five
As shown in fig. 5, a sorting apparatus 50 for the distribution sequence of the same city sites according to a sixth embodiment of the present application includes: a first determining module 51, a second determining module 52, a third determining module 53 and a sorting module 54; wherein,
the first determining module 51 is configured to determine a delivery site according to the received order information of the plurality of delivery orders;
the second determining module 52 is configured to determine a delivery attribute of each delivery site based on all the order information;
the third determining module 53 is configured to determine a delivery priority of each delivery site based on the delivery attribute of each delivery site;
the sorting module 54 is configured to sort all the delivery sites based on the delivery priority of each delivery site.
Optionally, the sorting apparatus 50 for the city site delivery sequence further includes: and the storage module 55 is configured to sort and store the received delivery orders and the order information of the delivery orders according to time.
EXAMPLE six
Based on the same technical concept, as shown in fig. 6, an embodiment of the present application is a method for sorting delivery orders of co-located sites, including:
s601, receiving order information;
s602, storing order information;
s603, calculating distribution priority;
and S604, sorting delivery sites.
The method for obtaining the formula in S603 includes:
s6031, determining order information;
s6032, counting the attributes of the distribution sites;
s6033, obtaining a formula for calculating distribution priority;
s6034, fitting by a least square method;
and S6035, obtaining a formula for calculating distribution priority.
Based on the same technical concept, embodiments of the present application further provide an electronic device and a computer storage medium for sorting a distribution sequence of the same city site, and refer to the following embodiments specifically.
The computer program product for sorting the distribution sequence of the same-city sites provided in the embodiment of the present application includes a computer-readable storage medium storing a non-volatile program code executable by a processor, where instructions included in the program code may be used to execute the method described in the foregoing method embodiment, and specific implementation may refer to the method embodiment, and is not described herein again.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Finally, it should be noted that: the above-mentioned embodiments are only specific embodiments of the present application, and are used for illustrating the technical solutions of the present application, but not limiting the same, and the scope of the present application is not limited thereto, and although the present application is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: any person skilled in the art can modify or easily conceive the technical solutions described in the foregoing embodiments or equivalent substitutes for some technical features within the technical scope disclosed in the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the exemplary embodiments of the present application, and are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for sequencing the delivery sequence of the same city sites is characterized by comprising the following steps:
determining a delivery site according to the received order information of the plurality of delivery orders;
determining the distribution attribute of each distribution site based on all the order information;
determining a delivery priority of each delivery site based on the delivery attributes of each delivery site;
sequencing all the distribution sites based on the distribution priority of each distribution site;
wherein the delivery attributes include at least one of:
the urgency of the delivery site, the distance between the delivery site and the delivery start point, and the cargo handling ratio of the delivery site.
2. The method of claim 1, wherein the dispatch priority is calculated by the formula:
Y＝a×B+b×N+c×P+…+n×M
wherein Y is the delivery priority of the delivery site, B, N, P … M is the delivery attribute of the delivery site, and a, b, c … n is the weight of each delivery attribute of the delivery site.
3. The method of claim 2, further comprising the step of determining a weight for each dispatch attribute:
acquiring sample data; the sample data comprises a plurality of historical delivery orders and order information of the plurality of historical delivery orders;
determining a delivery website of the plurality of historical delivery orders, a delivery attribute of each delivery website of the plurality of historical delivery orders and a delivery priority of each delivery website of the plurality of historical delivery orders according to order information of the plurality of historical delivery orders;
a weight for each delivery attribute is determined based on the delivery priority for each delivery site of the plurality of historical delivery orders, the delivery attribute for each delivery site of the plurality of historical delivery orders.
4. The method of claim 3, wherein determining a weight for each delivery attribute based on the delivery priority for each delivery site of the plurality of historical delivery orders, the delivery attribute for each delivery site of the plurality of historical delivery orders comprises:
substituting the distribution priority of each distribution site of the plurality of historical distribution orders and the distribution attribute of each distribution site of the plurality of historical distribution orders into the formula for calculating the distribution priority to obtain a weight function related to the distribution attribute;
identifying a squared loss function of the weighting function for the delivery attributes;
deriving the square loss function to make the derivative of the square loss function zero;
and solving the derivative of the square loss function to obtain the weight of the distribution attribute.
5. The method of claim 1, further comprising:
and sequencing and storing the received delivery orders and the order information of the delivery orders according to time.
6. A method for training a priority model, comprising:
acquiring sample data; the sample data comprises a plurality of historical delivery orders and order information of the historical delivery orders;
determining a delivery site of the plurality of historical delivery orders, a delivery attribute of each delivery site of the plurality of historical delivery orders and a delivery priority of each delivery site of the plurality of historical delivery orders according to order information of the plurality of historical delivery orders;
determining a weight of each delivery attribute based on the delivery priority of each delivery site of the plurality of historical delivery orders and the delivery attribute of each delivery site of the plurality of historical delivery orders;
based on the weight of each delivery attribute, a priority model is determined.
7. The method according to claim 6, wherein the priority model is specifically:
Y＝a×B+b×N+c×P+…+n×M
wherein Y is the delivery priority of the delivery site, B, N, P … M is the delivery attribute of the delivery site, and a, b, c … n is the weight of each delivery attribute of the delivery site.
8. A sequencing apparatus for scheduling orders of deliveries at a same site, comprising:
the first determining module is used for determining delivery stations according to the received order information of the plurality of delivery orders;
the second determining module is used for determining the distribution attribute of each distribution site based on all the order information;
a third determining module, configured to determine a delivery priority of each delivery site based on the delivery attribute of each delivery site;
and the sequencing module is used for sequencing all the distribution sites based on the distribution priority of each distribution site.
9. The apparatus of claim 8, wherein said means for sequencing the order of the deliveries of the same site further comprises:
and the storage module is used for sequencing and storing the received delivery orders and the order information of the delivery orders according to time.
10. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating over the bus when the electronic device is operating, the machine-readable instructions when executed by the processor performing the steps of the method of ordering the co-metro station delivery orders according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811506428.8A CN109558986A (en) | 2018-12-10 | 2018-12-10 | A kind of sort method and device of same city website dispatching sequence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811506428.8A CN109558986A (en) | 2018-12-10 | 2018-12-10 | A kind of sort method and device of same city website dispatching sequence |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109558986A true CN109558986A (en) | 2019-04-02 |
Family
ID=65869615
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811506428.8A Pending CN109558986A (en) | 2018-12-10 | 2018-12-10 | A kind of sort method and device of same city website dispatching sequence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109558986A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111580410A (en) * | 2020-04-22 | 2020-08-25 | 东风柳州汽车有限公司 | Logistics analysis method and device with timely intervention |
| CN111860918A (en) * | 2019-04-24 | 2020-10-30 | 北京京东尚科信息技术有限公司 | Distribution method and device, electronic device and computer readable medium |
| CN111915240A (en) * | 2019-05-10 | 2020-11-10 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating delivery route information |
| CN111950832A (en) * | 2019-05-17 | 2020-11-17 | 拉扎斯网络科技（上海）有限公司 | Scheduling method, device, server cluster and storage medium |
| CN112116271A (en) * | 2020-09-27 | 2020-12-22 | 拉扎斯网络科技（上海）有限公司 | Order data processing method and device |
| CN113506056A (en) * | 2021-06-23 | 2021-10-15 | 广州佳帆计算机有限公司 | Shuttle vehicle path planning method and device |
| CN113807788A (en) * | 2021-09-24 | 2021-12-17 | 天津中德应用技术大学 | Community distribution method, community distribution device and electronic equipment |
| CN114331266A (en) * | 2021-12-27 | 2022-04-12 | 深圳依时货拉拉科技有限公司 | Recommendation model training method and device and loading and unloading point recommendation method and device |
| CN114862304A (en) * | 2022-04-14 | 2022-08-05 | 圆通速递有限公司 | Terminal distribution station express package building method and system based on address mark mapping |
| CN116720803A (en) * | 2023-08-10 | 2023-09-08 | 深圳市兰洋科技有限公司 | Cloud distribution task processing method and system based on intelligent equipment |
| CN117273592A (en) * | 2023-11-22 | 2023-12-22 | 成都运荔枝科技有限公司 | Store distribution method under logistics scene |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120323554A1 (en) * | 2011-06-15 | 2012-12-20 | Mark Hopkins | Systems and methods for tuning parameters in statistical machine translation |
| CN106327010A (en) * | 2016-08-18 | 2017-01-11 | 浪潮软件股份有限公司 | Order delivering route generating method and order delivering route generating device |
| CN106845857A (en) * | 2017-02-17 | 2017-06-13 | 国网天津市电力公司 | A kind of dispatching task scheduling optimization method of intelligent electric meter |
| CN107358326A (en) * | 2017-07-20 | 2017-11-17 | 深圳市凯立德科技股份有限公司 | A kind of bicycle multiple spot dispenses circuitry processing method |
| CN107944737A (en) * | 2017-12-07 | 2018-04-20 | 北京小度信息科技有限公司 | Information processing method, device, electronic equipment and computer-readable recording medium |
| CN108153658A (en) * | 2016-12-02 | 2018-06-12 | 富士通株式会社 | The method and apparatus of models of priority training method and determining priorities of test cases |
| CN108304512A (en) * | 2018-01-19 | 2018-07-20 | 北京奇艺世纪科技有限公司 | A kind of thick sort method of video search engine, device and electronic equipment |
| CN108550069A (en) * | 2018-04-19 | 2018-09-18 | 上海携程商务有限公司 | Travelling requirement report method for pushing, device, electronic equipment, storage medium |
| CN108681845A (en) * | 2018-08-13 | 2018-10-19 | 叶苑庭 | A kind of wisdom logistics worksheet processing management system based on big data |
-
2018
- 2018-12-10 CN CN201811506428.8A patent/CN109558986A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120323554A1 (en) * | 2011-06-15 | 2012-12-20 | Mark Hopkins | Systems and methods for tuning parameters in statistical machine translation |
| CN106327010A (en) * | 2016-08-18 | 2017-01-11 | 浪潮软件股份有限公司 | Order delivering route generating method and order delivering route generating device |
| CN108153658A (en) * | 2016-12-02 | 2018-06-12 | 富士通株式会社 | The method and apparatus of models of priority training method and determining priorities of test cases |
| CN106845857A (en) * | 2017-02-17 | 2017-06-13 | 国网天津市电力公司 | A kind of dispatching task scheduling optimization method of intelligent electric meter |
| CN107358326A (en) * | 2017-07-20 | 2017-11-17 | 深圳市凯立德科技股份有限公司 | A kind of bicycle multiple spot dispenses circuitry processing method |
| CN107944737A (en) * | 2017-12-07 | 2018-04-20 | 北京小度信息科技有限公司 | Information processing method, device, electronic equipment and computer-readable recording medium |
| CN108304512A (en) * | 2018-01-19 | 2018-07-20 | 北京奇艺世纪科技有限公司 | A kind of thick sort method of video search engine, device and electronic equipment |
| CN108550069A (en) * | 2018-04-19 | 2018-09-18 | 上海携程商务有限公司 | Travelling requirement report method for pushing, device, electronic equipment, storage medium |
| CN108681845A (en) * | 2018-08-13 | 2018-10-19 | 叶苑庭 | A kind of wisdom logistics worksheet processing management system based on big data |
Non-Patent Citations (2)
| Title |
|---|
| 于雷 等: "模拟并行蚁群算法的绿色物流最小油耗 VRPSDP", 《计算机系统应用》 * |
| 李栋 等: "综合评价法的统一化研究", 《天津大学学报（社会科学版）》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111860918B (en) * | 2019-04-24 | 2024-01-16 | 北京京东振世信息技术有限公司 | Distribution method and device, electronic equipment and computer readable medium |
| CN111860918A (en) * | 2019-04-24 | 2020-10-30 | 北京京东尚科信息技术有限公司 | Distribution method and device, electronic device and computer readable medium |
| CN111915240A (en) * | 2019-05-10 | 2020-11-10 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating delivery route information |
| CN111950832A (en) * | 2019-05-17 | 2020-11-17 | 拉扎斯网络科技（上海）有限公司 | Scheduling method, device, server cluster and storage medium |
| CN111580410A (en) * | 2020-04-22 | 2020-08-25 | 东风柳州汽车有限公司 | Logistics analysis method and device with timely intervention |
| CN112116271A (en) * | 2020-09-27 | 2020-12-22 | 拉扎斯网络科技（上海）有限公司 | Order data processing method and device |
| CN113506056A (en) * | 2021-06-23 | 2021-10-15 | 广州佳帆计算机有限公司 | Shuttle vehicle path planning method and device |
| CN113807788A (en) * | 2021-09-24 | 2021-12-17 | 天津中德应用技术大学 | Community distribution method, community distribution device and electronic equipment |
| CN114331266A (en) * | 2021-12-27 | 2022-04-12 | 深圳依时货拉拉科技有限公司 | Recommendation model training method and device and loading and unloading point recommendation method and device |
| CN114862304A (en) * | 2022-04-14 | 2022-08-05 | 圆通速递有限公司 | Terminal distribution station express package building method and system based on address mark mapping |
| CN116720803A (en) * | 2023-08-10 | 2023-09-08 | 深圳市兰洋科技有限公司 | Cloud distribution task processing method and system based on intelligent equipment |
| CN116720803B (en) * | 2023-08-10 | 2024-01-12 | 深圳市兰洋科技有限公司 | Cloud distribution task processing method and system based on intelligent equipment |
| CN117273592A (en) * | 2023-11-22 | 2023-12-22 | 成都运荔枝科技有限公司 | Store distribution method under logistics scene |
| CN117273592B (en) * | 2023-11-22 | 2024-01-26 | 成都运荔枝科技有限公司 | Store distribution method under logistics scene |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109558986A (en) | A kind of sort method and device of same city website dispatching sequence | |
| CN102542395B (en) | A kind of emergency materials dispatching system and computing method | |
| US20220414590A1 (en) | System and Method to Predict Service Level Failure in Supply Chains | |
| CN111415104B (en) | Vehicle scheduling method, device, equipment and storage medium | |
| CN105389975A (en) | Chauffeured car scheduling method and apparatus | |
| CN112529332A (en) | Concrete transport vehicle scheduling method and device, terminal equipment and readable storage medium | |
| CN111105084A (en) | Logistics information processing method, device and equipment and computer storage medium | |
| US20120323622A1 (en) | Assessing Fitness of Drivers for Pending Trip Assignments | |
| CN111126643B (en) | Reservation method and reservation device of platform and readable storage medium | |
| CN107085777A (en) | A kind of live tracking of logistics goods and device | |
| US20130138330A1 (en) | System and method to optimize mass transport vehicle routing based on ton-mile cost information | |
| CN110705946A (en) | Cargo assembling method and cargo assembling system | |
| CN116523270B (en) | Logistics transportation task automatic scheduling method, equipment, server and medium | |
| CN112950091A (en) | Vehicle scheduling method, device and storage medium | |
| US20190012641A1 (en) | Freight capacity maximization system | |
| CN114757623A (en) | Freight order delivery method and device, electronic equipment and storage medium | |
| CN111832872A (en) | Vehicle scheduling method and device, electronic equipment and storage medium | |
| CN113222205A (en) | Path planning method and device | |
| CN116586312B (en) | Goods sorting method, device, electronic equipment and readable storage medium | |
| CN113935528A (en) | Intelligent scheduling method and device, computer equipment and storage medium | |
| CN112766868A (en) | Logistics vehicle distribution order matching method and device and computer equipment | |
| CN113807560A (en) | Logistics cost prediction method and device, electronic equipment and storage medium | |
| CN117114556A (en) | Management method, system and device for improving capacity scheduling efficiency | |
| CN116415787A (en) | Logistics transportation vehicle dispatching method, system and device | |
| CN116415747A (en) | Method and device for determining carpooling route and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190402 |