CN112837003A - Method and device for determining delivery range of courier - Google Patents
Method and device for determining delivery range of courier Download PDFInfo
- Publication number
- CN112837003A CN112837003A CN201911164499.9A CN201911164499A CN112837003A CN 112837003 A CN112837003 A CN 112837003A CN 201911164499 A CN201911164499 A CN 201911164499A CN 112837003 A CN112837003 A CN 112837003A
- Authority
- CN
- China
- Prior art keywords
- courier
- order
- grid
- delivery
- orders
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000004088 simulation Methods 0.000 claims abstract description 29
- 238000013507 mapping Methods 0.000 claims abstract description 15
- 238000004422 calculation algorithm Methods 0.000 claims description 18
- 238000004590 computer program Methods 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 15
- 230000006870 function Effects 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000032683 aging Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012549 training Methods 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
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0204—Market segmentation
- G06Q30/0205—Location or geographical consideration
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Data Mining & Analysis (AREA)
- Human Resources & Organizations (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and a device for determining the delivery range of a courier, and relates to the technical field of computers. One embodiment of the method comprises: dividing a map corresponding to a distribution area of a distribution site into a plurality of grids; mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid; determining coordinates of a center point of each grid based on the order within each grid; and determining the binding relationship between the courier and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the delivery range of the courier. The implementation method can adjust the distribution range of the couriers, ensure the balance of the workload among the couriers, improve the distribution efficiency and reduce the labor cost; and the delivery range of each courier is further optimized through the delivery timeliness of the couriers after simulation adjustment.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for determining the delivery range of couriers.
Background
The distribution is taken as the 'last kilometer' of the logistics system, the final client is directly faced, and the whole capacity of the distribution link directly influences the loyalty of the client to the enterprise. The distribution area division is beneficial to making quick response to the distribution demand and meeting the personalized demand of the customer. However, the delivery area of each courier is different, and there may be a large difference in the workload of the couriers.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art: currently, adjustment of couriers' delivery areas mainly depends on manual adjustment by managers such as a station leader according to the number of orders in each delivery area. The mode has larger error, consumes a large amount of manpower, and manual adjustment cannot ensure the performance timeliness of the couriers, so that the distribution efficiency is influenced, and the user experience is influenced.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for determining a delivery range of couriers, which are capable of adjusting the delivery range of couriers, ensuring workload balance among the couriers, improving delivery efficiency, and reducing labor cost; and the adjusted delivery timeliness of the couriers is simulated, and the delivery range of each courier is further optimized according to the simulation result.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of determining a delivery range of a courier, including:
dividing a map corresponding to a distribution area of a distribution site into a plurality of grids;
mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid;
determining coordinates of a center point of each grid based on the order within each grid;
and determining the binding relationship between the courier and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the delivery range of the courier.
Optionally, determining the binding relationship between the courier and the grid based on the order in each grid and the coordinates of the center point of each grid includes: and determining the binding relationship between the courier and the grids by utilizing a multi-traveler work balance algorithm based on the orders in each grid and the coordinates of the central point of each grid.
Optionally, determining the binding relationship between the courier and the grid by using a multi-traveler work balance algorithm based on the order in each grid and the coordinates of the center point of each grid includes:
the shortest distribution distance of each courier and the smallest difference of order quantity among the couriers are taken as targets, and the binding relation between each grid and one courier is calculated by taking each grid and only one courier as a constraint condition; the distribution distance of the courier is determined according to the distance between grids bound with the courier, and the order quantity of the courier is determined according to the order quantity in the grids bound with the courier.
Optionally, after determining the binding relationship between the courier and the grid, the method further includes: simulating the performance timeliness of the courier based on the order in the bound grid; and according to the simulation result, carrying out meshing on the map corresponding to the delivery area again so as to determine the delivery range of the courier again.
Optionally, simulating the performance age of the courier based on the order within the bound grid comprises:
dividing orders in a grid bound with a courier into delivery orders and pickup orders;
arranging the dispatch orders according to the delivery finishing sequence to construct a dispatch order queue, and sequentially calculating courier time stamps corresponding to the dispatch orders according to the dispatch orders; the courier timestamp is determined according to the distance consumption time, the delivery service time and the pickup service time;
adding the pickup order into the delivery order queue based on pickup time of the pickup order and courier timestamp corresponding to the delivery order to construct a courier fulfillment order queue;
and calculating the courier timestamp corresponding to each order in the courier performance order queue so as to simulate the performance timeliness of the couriers.
Optionally, adding the package pull order to the package order queue based on the package pull time of the package pull order and the time of the package order completing the delivery comprises:
and determining a target delivery order closest to the pull-up order by using a KNN proximity algorithm based on the pull-up time of the pull-up order and the delivery completion time of the delivery order, and adding the pull-up order behind the target delivery order.
To achieve the above object, according to another aspect of an embodiment of the present invention, there is provided an apparatus for determining a delivery range of a courier, including:
the grid division module is used for dividing the map corresponding to the distribution area of the distribution site into a plurality of grids;
the order mapping module is used for mapping the historical orders belonging to the distribution sites into the grids and counting the orders in each grid;
the central point coordinate determination module is used for determining the central point coordinate of each grid based on the order in each grid;
and the binding module is used for determining the binding relationship between the courier and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the delivery range of the courier.
Optionally, the binding module is further configured to: and determining the binding relationship between the courier and the grids by utilizing a multi-traveler work balance algorithm based on the orders in each grid and the coordinates of the central point of each grid.
Optionally, the binding module is further configured to: the shortest distribution distance of each courier and the smallest difference of order quantity among the couriers are taken as targets, and the binding relation between each grid and one courier is calculated by taking each grid and only one courier as a constraint condition; the distribution distance of the courier is determined according to the distance between grids bound with the courier, and the order quantity of the courier is determined according to the order quantity in the grids bound with the courier.
Optionally, the apparatus further comprises a simulation module, configured to simulate the performance aging of the courier based on the orders in the bound grid;
the meshing module is further configured to: and according to the simulation result, carrying out meshing on the map corresponding to the delivery area again so as to determine the delivery range of the courier again.
Optionally, the simulation module is further configured to: dividing orders in a grid bound with a courier into delivery orders and pickup orders; arranging the dispatch orders according to the delivery finishing sequence to construct a dispatch order queue, and sequentially calculating courier time stamps corresponding to the dispatch orders according to the dispatch orders; the courier timestamp is determined according to the distance consumption time, the delivery service time and the pickup service time; adding the pickup order into the delivery order queue based on pickup time of the pickup order and courier timestamp corresponding to the delivery order to construct a courier fulfillment order queue; and calculating the courier timestamp corresponding to each order in the courier performance order queue so as to simulate the performance timeliness of the couriers.
Optionally, the simulation module is further configured to: and determining a target delivery order closest to the pull-up order by using a KNN proximity algorithm based on the pull-up time of the pull-up order and the delivery completion time of the delivery order, and adding the pull-up order behind the target delivery order.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize the method for determining the delivery range of the courier according to the embodiment of the invention.
To achieve the above object, according to an aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by a processor, implementing a method of determining a courier delivery range according to an embodiment of the present invention.
One embodiment of the above invention has the following advantages or benefits: the map corresponding to the distribution area of the distribution site is divided into a plurality of grids; mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid; determining coordinates of a center point of each grid based on the order within each grid; determining the binding relationship between the couriers and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the couriers form a technical means of the distribution range of the couriers, so that the distribution range of the couriers can be adjusted, the balance of the workload among the couriers is ensured, the distribution efficiency is improved, and the labor cost is reduced; simulating the performance timeliness of the courier through orders in the binding-based grid; and according to the simulation result, the map corresponding to the distribution area is divided again so as to determine the distribution range of the couriers again, the distribution timeliness of the adjusted couriers is simulated, and the distribution range of each courier is further optimized according to the simulation result.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main flow of a method of determining a courier delivery envelope according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of meshing in a method of determining a dispatch area of a courier according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of the main flow of a method of determining a courier delivery envelope according to another embodiment of the present invention;
FIG. 4 is a schematic diagram illustrating simulation of courier performing timeliness in a method for determining courier delivery bounds according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of the major modules of an apparatus for determining a courier delivery envelope according to an embodiment of the present invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 7 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of a main flow of a method for determining a delivery range of a courier according to an embodiment of the present invention, as shown in fig. 1, the method includes:
step S101: dividing a map corresponding to a distribution area of a distribution site into a plurality of grids, and determining a center point coordinate of each grid.
In this step, the distribution area of the distribution site is mapped to the geographic space based on the longitude and latitude corresponding to the distribution area of the distribution site, and the longitude and latitude range of the distribution area on the map is obtained. The map is then divided into N grids, where N is an integer greater than 1. Specifically, the size of the grid may be flexibly set according to the application scenario, and the present invention is not limited herein. As a specific example, a mesh division diagram corresponding to a delivery area of a delivery site is shown in fig. 2.
Step S102: and mapping the historical orders belonging to the delivery sites into the grids, and counting the orders in each grid.
In this step, the receiving address of the historical order of the delivery site may be converted into latitude and longitude data based on the map service provider address resolution interface, and then the historical order is mapped onto the grid, and statistics is performed on the historical order in the grid.
Step S103: based on the order within each grid, the center point coordinates for each grid are determined.
In this embodiment, the grid center point coordinate refers to a barycentric coordinate of the order in the grid, and the specific calculation mode is an average value of longitude and latitude of all orders in the grid. E.g. longitude coordinates of the center point
Where m denotes the total number of orders, xmThe longitude of the mth order.
Step S104: and determining the binding relationship between the courier and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the delivery range of the courier.
In this step, the multi-traveler work balance algorithm can be used to determine the binding relationship between the courier and the grid. The multi-traveler Problem (MTSP) can be described as that a plurality of travelers traverse a plurality of cities, and the shortest path traversing all the cities is obtained on the premise that each city is passed by one traveler once, so that the Problem is a classic combined optimization Problem.
For the order delivery scenario in this embodiment, the binding relationship between the courier and the grid may be specifically determined according to the following process:
the shortest distribution distance of each courier and the smallest difference of order quantity among the couriers are taken as targets, and the binding relation between each grid and one courier is calculated by taking each grid and only one courier as a constraint condition; the distribution distance of the courier is determined according to the distance between grids bound with the courier, and the order quantity of the courier is determined according to the order quantity in the grids bound with the courier.
More specifically, the binding relationship of the courier to the grid may be determined according to the following process:
assuming that N grids and Q couriers are in total, the total number of orders in the grid i is M, and the distance between the grid i and the central point of the grid j is dij(the distance represents the distance between two grids in this embodiment), which is attributed to the kth blockThe order quantity of the deliverer is Ck。
The first target is: the delivery distance of M couriers is shortest;
an objective function:
wherein, yikThe binding relationship between the grid i and the courier k is represented, the variable is 0-1, 1 represents that the grid i is bound with the courier k (namely, orders in the grid i are delivered by the courier k), and 0 represents that the grid i is not bound with the courier k.
And a second target: the difference in order amount between couriers is minimal;
an objective function: min (C)z-Cp) Wherein, CzIndicates the maximum order quantity among all couriers, CpRepresenting the smallest amount of orders among all couriers.
Constraint conditions are as follows:
i.e., orders within each grid can only be delivered by one courier.
And calculating to obtain the binding relationship between the courier and the grid through the target I, the target II and the constraint condition, wherein the grid bound with the courier forms the distribution range of the courier.
The method for determining the delivery range of the couriers, provided by the embodiment of the invention, can adjust the delivery range of the couriers, ensure the balance of workload among the couriers, improve the delivery efficiency and reduce the labor cost.
In an alternative embodiment, the data obtained above may be stored, for example, longitude and latitude data of a delivery station, station contour fence, related data of a segmented grid, grid fence, and the like, and detail data of a historical order (which may include an order number, a receiving address and corresponding longitude and latitude data, a delivery order completion time, a pickup order taking time, and the like), and the like, so as to facilitate subsequent query. The station outline fence data is composed of a series of longitude and latitude coordinate points, and the series of coordinates can be acquired through a geo-fence interface provided by a map service provider and can also be drawn manually. By way of example, a site silhouette fence is an edge of the map shown in FIG. 2. Mesh fence data can be understood as latitude and longitude coordinates of 4 vertices of the mesh.
Fig. 3 is a flowchart illustrating a method for determining a delivery area of a courier according to another embodiment of the present invention, as shown in fig. 3, the method includes:
step S301: dividing a map corresponding to a distribution area of a distribution site into a plurality of grids;
step S302: mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid;
step S303: determining coordinates of a center point of each grid based on the order within each grid;
step S304: determining the binding relationship between the courier and the grids based on the order in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the distribution range of the courier;
step S305: simulating the performance timeliness of the courier based on the order in the bound grid;
step S306: and according to the simulation result, carrying out meshing on the map corresponding to the delivery area again so as to determine the delivery range of the courier again.
Step S101 to step S104 may be referred to in step S301 to step S304, which is not described herein again.
For step S305, the courier' S performance age may be simulated according to the following process:
(1) and dividing the orders in the grid bound with the courier into delivery orders and pickup orders. Wherein, the dispatch order refers to an order taken from a warehouse, and the courier is responsible for distributing the order from a distribution station to a client. The order acquisition means that a customer sends an order, and the courier is responsible for acquiring the order from the customer to the delivery site.
(2) Arranging the dispatch orders according to the delivery finishing sequence to construct a dispatch order queue, and sequentially calculating courier time stamps corresponding to the dispatch orders according to the dispatch orders; the courier timestamp is determined according to the distance consumption time, the delivery service time and the pickup service time; . In this embodiment, the current timestamp is recorded when the dispatch order is delivered to the customer.
(3) And adding the pickup orders into the delivery order queue based on pickup time of the pickup orders and courier timestamps corresponding to the delivery orders so as to construct a courier fulfillment order queue.
Wherein, a target dispatch order closest to the package order can be determined by using a KNN proximity algorithm, and the package order is added behind the target dispatch order. The KNN proximity algorithm (k-nearest neighbor) is a basic classification and regression method, which basically does: given a test case, the k nearest example points in the training set are found based on some distance metric, and then prediction is performed based on the information of the k nearest neighbors.
In this embodiment, the target package orders with the package pickup time after the package order delivery completion time can be determined, then the target package orders closest to the package order delivery completion time are found out from the set of the target package orders by using the KNN proximity algorithm, and the target package orders are added to the package orders.
(4) And calculating the courier timestamp corresponding to each order in the courier performance order queue so as to simulate the performance timeliness of the couriers.
In this embodiment, the courier timestamp is the sum of the journey elapsed time (the quotient of the journey divided by the courier's speed), the dispatch service time, and the package service time. The speed of the courier, the delivery service time and the pickup service time can be preset according to experience values, and the route is determined according to a receiving address or a pickup address.
In this embodiment, first, a courier timestamp corresponding to each delivery order is sequentially calculated according to a delivery order queue; then, sequentially analyzing target pickup orders with pickup time after the time stamp of the courier, finding out the nearest target delivery order by using a KNN proximity algorithm, and adding the pickup orders to the delivery order; calculating the courier timestamp of the package collecting order according to the package collecting distance consumed time and the package collecting service time; sequentially updating courier timestamps corresponding to the delivery orders behind the pickup orders; and repeating the steps until the last order is finished. Thus, a courier delivery order, a courier pickup order and corresponding courier performance order queues are obtained. Through the order of couriers for performing, the performance timeliness of the couriers after the distribution range of the couriers is divided can be known.
In this embodiment, in a certain time period of delivery and delivery times, a delivery order queue is first constructed based on a delivery order, and meanwhile, a package acquisition order of the package acquisition times in the time period may affect the work content of couriers, and the package acquisition order needs to be distributed to a distributor corresponding to a grid to which the package acquisition order belongs, so that the distributor newly adds a package acquisition order task. And adding the package orders into the delivery order queue to form a courier contract-performing order queue, wherein the time effectiveness of subsequent orders can be influenced by newly added packages. The simulation process is mainly characterized in that the simulation of collecting items is added in the order sending process, and each newly added collecting order can influence the order after the courier timestamp. After the package acquisition orders are distributed, calculating the courier timestamp of each order when all orders in the courier fulfillment order queue in the wave are completed, and meanwhile, comparing the final timestamp with the cut-off timestamp of the wave.
For step S306, according to the simulation effect, the map corresponding to the delivery area is re-gridded, and the binding relationship between the courier and the grid is re-calculated, so as to re-determine the delivery range of the courier.
The method for determining the delivery range of the courier in the embodiment of the invention divides a map corresponding to a delivery area of a delivery site into a plurality of grids; mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid; determining coordinates of a center point of each grid based on the order within each grid; determining the binding relationship between the couriers and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the couriers form a technical means of the distribution range of the couriers, so that the distribution range of the couriers can be adjusted, the balance of the workload among the couriers is ensured, the distribution efficiency is improved, and the labor cost is reduced; simulating the performance timeliness of the courier through orders in the binding-based grid; and according to the simulation result, the map corresponding to the distribution area is divided again so as to determine the distribution range of the couriers again, the distribution timeliness of the adjusted couriers is simulated, and the distribution range of each courier is further optimized according to the simulation result.
In an alternative embodiment, in the field of logistics, a lot is usually sent or pulled in units of a lot that aggregates a plurality of orders, and industry common practice refers to the lot of this job as the number of delivery times, as shown in fig. 4: one wave from 8 to 12 and the second from 12 to 16. For a simple example, the order is taken from the warehouse to the user in the morning and afternoon, which are two times. Then for this case, the courier performance order queue of each wave is obtained by taking the wave as a unit when simulating courier performance timeliness. Specifically, before a delivery order queue is constructed, orders are divided according to wave times, namely the delivery orders are divided according to different wave times distributed to the delivery orders in a courier site grid. And dividing the piece collecting orders into corresponding order wave numbers according to the piece collecting order receiving time stamps and the starting time stamps of different wave numbers of the piece sending orders. Sequentially calculating the courier timestamp corresponding to each delivery according to the delivery orders in the single-wave delivery order queue; analyzing the package order of the package order receiving time after the time stamp, finding out the nearest package order by using a KNN (K nearest neighbor) algorithm, and adding the package order to the package order; calculating the courier timestamp of the package collecting order according to the package collecting distance consumed time and the package collecting service time; sequentially updating the corresponding courier timestamp of each subsequent dispatch; and repeating the steps until the last order is finished. Thus, the courier fulfillment order queue with each wave frequency including couriers' dispatch orders, pickup orders and corresponding courier timestamps is calculated.
Fig. 5 is a schematic diagram of main blocks of an apparatus 500 for determining a courier delivery range according to an embodiment of the present invention, as shown in fig. 5, the apparatus 500 includes:
a grid dividing module 501, configured to divide a map corresponding to a distribution area of a distribution site into multiple grids;
an order mapping module 502, configured to map historical orders belonging to the distribution site into the grids, and count orders in each grid;
a central point coordinate determination module 503, configured to determine a central point coordinate of each grid based on the order in each grid;
and a binding module 504, configured to determine a binding relationship between the courier and the grid based on the order in each grid and the center point coordinate of each grid, where the grid bound to the courier constitutes a delivery range of the courier.
Optionally, the binding module is further configured to 504: and determining the binding relationship between the courier and the grids by utilizing a multi-traveler work balance algorithm based on the orders in each grid and the coordinates of the central point of each grid.
Optionally, the binding module is further configured to 504: the shortest distribution distance of each courier and the smallest difference of order quantity among the couriers are taken as targets, and the binding relation between each grid and one courier is calculated by taking each grid and only one courier as a constraint condition; the distribution distance of the courier is determined according to the distance between grids bound with the courier, and the order quantity of the courier is determined according to the order quantity in the grids bound with the courier.
Optionally, the apparatus further comprises a simulation module, configured to simulate the performance aging of the courier based on the orders in the bound grid;
the meshing module 501 is further configured to: and according to the simulation result, carrying out meshing on the map corresponding to the delivery area again so as to determine the delivery range of the courier again.
Optionally, the simulation module is further configured to: dividing orders in a grid bound with a courier into delivery orders and pickup orders;
arranging the dispatch orders according to the delivery finishing sequence to construct a dispatch order queue, and sequentially calculating courier time stamps corresponding to the dispatch orders according to the dispatch orders; the courier timestamp is determined according to the distance consumption time, the delivery service time and the pickup service time;
adding the pickup order into the delivery order queue based on pickup time of the pickup order and courier timestamp corresponding to the delivery order to construct a courier fulfillment order queue;
and calculating the courier timestamp corresponding to each order in the courier performance order queue so as to simulate the performance timeliness of the couriers.
Optionally, the simulation module is further configured to: and determining a target delivery order closest to the pull-up order by using a KNN proximity algorithm based on the pull-up time of the pull-up order and the delivery completion time of the delivery order, and adding the pull-up order behind the target delivery order.
The device for determining the delivery range of the courier in the embodiment of the invention divides a map corresponding to a delivery area of a delivery site into a plurality of grids; mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid; determining coordinates of a center point of each grid based on the order within each grid; determining the binding relationship between the couriers and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the couriers form a technical means of the distribution range of the couriers, so that the distribution range of the couriers can be adjusted, the balance of the workload among the couriers is ensured, the distribution efficiency is improved, and the labor cost is reduced; simulating the performance timeliness of the courier through orders in the binding-based grid; and according to the simulation result, the map corresponding to the distribution area is divided again so as to determine the distribution range of the couriers again, the distribution timeliness of the adjusted couriers is simulated, and the distribution range of each courier is further optimized according to the simulation result.
The device can execute the method provided by the embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the method provided by the embodiment of the present invention.
Fig. 6 illustrates an exemplary system architecture 600 of a method of determining a courier delivery envelope, or an apparatus for determining a courier delivery envelope, to which embodiments of the invention may be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 605. The network 604 serves to provide a medium for communication links between the terminal devices 601, 602, 603 and the server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like. Various communication client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, and the like, may be installed on the terminal devices 601, 602, and 603.
The terminal devices 601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 605 may be a server that provides various services, such as a background management server that supports shopping websites browsed by users using the terminal devices 601, 602, and 603. The background management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (e.g., target push information and product information) to the terminal device.
It should be noted that the method for determining the delivery range of the courier provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, the apparatus for determining the delivery range of the courier is generally disposed in the server 605.
It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a sending module, an obtaining module, a determining module, and a first processing module. The names of these modules do not in some cases constitute a limitation on the unit itself, and for example, the sending module may also be described as a "module that sends a picture acquisition request to a connected server".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:
dividing a map corresponding to a distribution area of a distribution site into a plurality of grids;
mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid;
determining coordinates of a center point of each grid based on the order within each grid;
determining the binding relationship between the courier and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the distribution range of the courier
According to the technical scheme of the embodiment of the invention, a map corresponding to a distribution area of a distribution site is divided into a plurality of grids; mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid; determining coordinates of a center point of each grid based on the order within each grid; determining the binding relationship between the couriers and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the couriers form a technical means of the distribution range of the couriers, so that the distribution range of the couriers can be adjusted, the balance of the workload among the couriers is ensured, the distribution efficiency is improved, and the labor cost is reduced; simulating the performance timeliness of the courier through orders in the binding-based grid; and according to the simulation result, the map corresponding to the distribution area is divided again so as to determine the distribution range of the couriers again, the distribution timeliness of the adjusted couriers is simulated, and the distribution range of each courier is further optimized according to the simulation result.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (14)
1. A method of determining a courier delivery envelope, comprising:
dividing a map corresponding to a distribution area of a distribution site into a plurality of grids;
mapping the historical orders belonging to the distribution sites into the grids, and counting the orders in each grid;
determining coordinates of a center point of each grid based on the order within each grid;
and determining the binding relationship between the courier and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the delivery range of the courier.
2. The method of claim 1, wherein determining a binding relationship of the courier to the grid based on the order within each grid and the coordinates of the center point of each grid comprises:
and determining the binding relationship between the courier and the grids by utilizing a multi-traveler work balance algorithm based on the orders in each grid and the coordinates of the central point of each grid.
3. The method of claim 2, wherein determining a binding relationship of a courier to a grid using a multi-traveler work-balancing algorithm based on orders within each grid and center point coordinates of each grid comprises:
the shortest distribution distance of each courier and the smallest difference of order quantity among the couriers are taken as targets, and the binding relation between each grid and one courier is calculated by taking each grid and only one courier as a constraint condition; the distribution distance of the courier is determined according to the distance between grids bound with the courier, and the order quantity of the courier is determined according to the order quantity in the grids bound with the courier.
4. The method of claim 1, wherein after determining the binding relationship of the courier to the grid, the method further comprises:
simulating the performance timeliness of the courier based on the order in the bound grid;
and according to the simulation result, carrying out meshing on the map corresponding to the delivery area again so as to determine the delivery range of the courier again.
5. The method of claim 4, wherein simulating the performance age of the courier based on the order within the bound grid comprises:
dividing orders in a grid bound with a courier into delivery orders and pickup orders;
arranging the dispatch orders according to the delivery finishing sequence to construct a dispatch order queue, and sequentially calculating courier time stamps corresponding to the dispatch orders according to the dispatch orders; the courier timestamp is determined according to the distance consumption time, the delivery service time and the pickup service time;
adding the pickup order into the delivery order queue based on pickup time of the pickup order and courier timestamp corresponding to the delivery order to construct a courier fulfillment order queue;
and calculating the courier timestamp corresponding to each order in the courier performance order queue so as to simulate the performance timeliness of the couriers.
6. The method of claim 5, wherein adding the package order to the package order queue based on package time of the package order and time of package order completion delivery comprises:
and determining a target delivery order closest to the pull-up order by using a KNN proximity algorithm based on the pull-up time of the pull-up order and the delivery completion time of the delivery order, and adding the pull-up order behind the target delivery order.
7. An apparatus for determining a dispatch area for a courier, comprising:
the grid division module is used for dividing the map corresponding to the distribution area of the distribution site into a plurality of grids;
the order mapping module is used for mapping the historical orders belonging to the distribution sites into the grids and counting the orders in each grid;
the central point coordinate determination module is used for determining the central point coordinate of each grid based on the order in each grid;
and the binding module is used for determining the binding relationship between the courier and the grids based on the orders in each grid and the coordinates of the central point of each grid, wherein the grids bound with the courier form the delivery range of the courier.
8. The apparatus of claim 7, wherein the binding module is further configured to:
and determining the binding relationship between the courier and the grids by utilizing a multi-traveler work balance algorithm based on the orders in each grid and the coordinates of the central point of each grid.
9. The apparatus of claim 8, wherein the binding module is further configured to:
the shortest distribution distance of each courier and the smallest difference of order quantity among the couriers are taken as targets, and the binding relation between each grid and one courier is calculated by taking each grid and only one courier as a constraint condition; the distribution distance of the courier is determined according to the distance between grids bound with the courier, and the order quantity of the courier is determined according to the order quantity in the grids bound with the courier.
10. The apparatus of claim 7, further comprising a simulation module to simulate a performance age of the courier based on orders within the bound grid;
the meshing module is further configured to: and according to the simulation result, carrying out meshing on the map corresponding to the delivery area again so as to determine the delivery range of the courier again.
11. The apparatus of claim 10, wherein the simulation module is further configured to:
dividing orders in a grid bound with a courier into delivery orders and pickup orders;
arranging the dispatch orders according to the delivery finishing sequence to construct a dispatch order queue, and sequentially calculating courier time stamps corresponding to the dispatch orders according to the dispatch orders; the courier timestamp is determined according to the distance consumption time, the delivery service time and the pickup service time;
adding the pickup order into the delivery order queue based on pickup time of the pickup order and courier timestamp corresponding to the delivery order to construct a courier fulfillment order queue;
and calculating the courier timestamp corresponding to each order in the courier performance order queue so as to simulate the performance timeliness of the couriers.
12. The apparatus of claim 11, wherein the simulation module is further configured to:
and determining a target delivery order closest to the pull-up order by using a KNN proximity algorithm based on the pull-up time of the pull-up order and the delivery completion time of the delivery order, and adding the pull-up order behind the target delivery order.
13. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
14. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911164499.9A CN112837003B (en) | 2019-11-25 | 2019-11-25 | Method and device for determining delivery range of courier |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911164499.9A CN112837003B (en) | 2019-11-25 | 2019-11-25 | Method and device for determining delivery range of courier |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112837003A true CN112837003A (en) | 2021-05-25 |
| CN112837003B CN112837003B (en) | 2024-09-20 |
Family
ID=75922807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911164499.9A Active CN112837003B (en) | 2019-11-25 | 2019-11-25 | Method and device for determining delivery range of courier |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112837003B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114971490A (en) * | 2022-06-20 | 2022-08-30 | 上海东普信息科技有限公司 | Cross-region pickup monitoring method, device, equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120284083A1 (en) * | 2011-05-04 | 2012-11-08 | LaShou Group INC. | System and method for merchandise distribution |
| CN107464018A (en) * | 2017-08-01 | 2017-12-12 | 北京同城必应科技有限公司 | A kind of Distribution path optimization method and device, computer equipment, storage medium |
| KR101854860B1 (en) * | 2017-07-27 | 2018-05-04 | 최희정 | System for distribution service using delivery man |
| CN108364146A (en) * | 2017-01-26 | 2018-08-03 | 北京小度信息科技有限公司 | Logistics distribution emulation mode and device |
| CN108960694A (en) * | 2017-05-19 | 2018-12-07 | 北京京东尚科信息技术有限公司 | Dispense area determination method and device |
| CN109214613A (en) * | 2017-06-29 | 2019-01-15 | 北京京东尚科信息技术有限公司 | A kind of method, apparatus, electronic equipment and the storage medium of automatic distribution task |
| CN109636121A (en) * | 2018-11-16 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Distribution transport capacity scheduling method, order distribution method and device and electronic equipment |
| CN110020925A (en) * | 2019-04-15 | 2019-07-16 | 北京闪送科技有限公司 | Order processing method, apparatus, equipment and storage medium |
| CN110363453A (en) * | 2018-03-26 | 2019-10-22 | 北京京东振世信息技术有限公司 | Distribution information method for visualizing and device |
-
2019
- 2019-11-25 CN CN201911164499.9A patent/CN112837003B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120284083A1 (en) * | 2011-05-04 | 2012-11-08 | LaShou Group INC. | System and method for merchandise distribution |
| CN108364146A (en) * | 2017-01-26 | 2018-08-03 | 北京小度信息科技有限公司 | Logistics distribution emulation mode and device |
| CN108960694A (en) * | 2017-05-19 | 2018-12-07 | 北京京东尚科信息技术有限公司 | Dispense area determination method and device |
| CN109214613A (en) * | 2017-06-29 | 2019-01-15 | 北京京东尚科信息技术有限公司 | A kind of method, apparatus, electronic equipment and the storage medium of automatic distribution task |
| KR101854860B1 (en) * | 2017-07-27 | 2018-05-04 | 최희정 | System for distribution service using delivery man |
| CN107464018A (en) * | 2017-08-01 | 2017-12-12 | 北京同城必应科技有限公司 | A kind of Distribution path optimization method and device, computer equipment, storage medium |
| CN110363453A (en) * | 2018-03-26 | 2019-10-22 | 北京京东振世信息技术有限公司 | Distribution information method for visualizing and device |
| CN109636121A (en) * | 2018-11-16 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Distribution transport capacity scheduling method, order distribution method and device and electronic equipment |
| CN110020925A (en) * | 2019-04-15 | 2019-07-16 | 北京闪送科技有限公司 | Order processing method, apparatus, equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 张源凯;黄敏芳;胡祥培;: "网上超市订单分配与物流配送联合优化方法", 系统工程学报, no. 02, 15 April 2015 (2015-04-15) * |
| 麻存瑞;柏;赵欣苗;曾玮;: "快递配送车辆路径优化研究", 交通运输系统工程与信息, no. 04, 15 August 2017 (2017-08-15) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114971490A (en) * | 2022-06-20 | 2022-08-30 | 上海东普信息科技有限公司 | Cross-region pickup monitoring method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112837003B (en) | 2024-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110645983B (en) | Path planning method, device and system for unmanned vehicle | |
| US20200286039A1 (en) | Information generation method and apparatus | |
| CN110858332B (en) | Order production method and device | |
| CN110830604B (en) | DNS scheduling method and device | |
| CN110069579A (en) | Fence method of partition and device | |
| CN109978213B (en) | Task path planning method and device | |
| CN111178810B (en) | Method and device for generating information | |
| CN111861225A (en) | Task allocation method and device, electronic equipment and storage medium | |
| CN107633358A (en) | Facility addressing and the method and apparatus of distribution | |
| CN114612212A (en) | Business processing method, device and system based on risk control | |
| CN107085754B (en) | Information output method and device | |
| CN112837003B (en) | Method and device for determining delivery range of courier | |
| CN110930101B (en) | Method, device, electronic equipment and readable medium for determining delivery time of order | |
| CN113190558A (en) | Data processing method and system | |
| CN108810130B (en) | Method and device for planning distribution request | |
| CN113128820A (en) | Method, apparatus, device and computer readable medium for evaluating warehouse adjustment plans | |
| CN115099865A (en) | Data processing method and device | |
| CN113283830B (en) | Method, device, equipment and computer readable medium for generating waybill information sequence | |
| CN113762864B (en) | Logistics site selection method and device | |
| CN113537680B (en) | Method and device for determining completion time of transportation task | |
| CN115098558A (en) | Flight data statistical method and device | |
| CN115344359A (en) | Computing power resource allocation method, device, computer readable storage medium and equipment | |
| CN114257521A (en) | Flow prediction method, device, electronic equipment and storage medium | |
| CN111985967A (en) | Article information generation method and device, electronic equipment and computer readable medium | |
| CN113762566B (en) | Method and device for calculating delivery time |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |