CN111626664A - Distribution line planning method and device, storage medium and electronic equipment - Google Patents

Distribution line planning method and device, storage medium and electronic equipment Download PDF

Info

Publication number
CN111626664A
CN111626664A CN202010367068.9A CN202010367068A CN111626664A CN 111626664 A CN111626664 A CN 111626664A CN 202010367068 A CN202010367068 A CN 202010367068A CN 111626664 A CN111626664 A CN 111626664A
Authority
CN
China
Prior art keywords
historical
route
template
delivery
target
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010367068.9A
Other languages
Chinese (zh)
Inventor
张曼钰
马斗
王少飞
田乐
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Sankuai Online Technology Co Ltd
Original Assignee
Beijing Sankuai Online Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Sankuai Online Technology Co Ltd filed Critical Beijing Sankuai Online Technology Co Ltd
Priority to CN202010367068.9A priority Critical patent/CN111626664A/en
Publication of CN111626664A publication Critical patent/CN111626664A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/23—Clustering techniques
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • 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

Abstract

The present disclosure relates to a delivery route planning method and apparatus, a storage medium, and an electronic device, the method including: generating a target historical line template covering order points of an order to be delivered, wherein the historical line template is an edge geometric area determined based on a historical delivery line; planning the route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point contained in the target historical route template to obtain a delivery route which is most matched with the delivery attribute information, wherein the delivery attribute information comprises the carrying capacity of the historical delivery route in the target historical route template.

Description

Distribution line planning method and device, storage medium and electronic equipment
Technical Field
The present disclosure relates to the field of path planning, and in particular, to a method and an apparatus for planning a delivery route, a storage medium, and an electronic device.
Background
Unlike the traditional shopping scenario, in modern life, most online shopping orders are not delivered one-to-one by merchants, but are submitted to a delivery platform by the merchants, and the delivery platform arranges the dispatchers to deliver uniformly. The unified delivery increases the delivery efficiency of goods, solves the difficulty of taking and paying goods by merchants and customers, and simultaneously, for a carrying platform, the better route planning can not only improve the delivery efficiency, but also improve the experience of users, therefore, the route planning mode is continuously improved along with the progress of the logistics industry.
Disclosure of Invention
An object of the present disclosure is to provide a distribution route planning method and apparatus, a storage medium, and an electronic device, so as to solve the above technical problems.
In order to achieve the above object, a first aspect of the present disclosure provides a distribution line planning method, including: generating a target historical line template covering order points of an order to be delivered, wherein the historical line template is an edge geometric area determined based on a historical delivery line; planning the route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point contained in the target historical route template to obtain a delivery route which is most matched with the delivery attribute information, wherein the delivery attribute information comprises the carrying capacity of the historical delivery route in the target historical route template.
Optionally, the planning, according to the delivery attribute information of the target historical route template and the order point included in the target historical route template, a route of the order to be delivered to obtain a delivery route most matched with the delivery attribute information includes:
aiming at any one target historical line template, judging whether the total loading capacity of the order points in the target historical line template is consistent with the loading capacity of the historical distribution route corresponding to the target historical line template; and if the absolute value of the difference between the total loading capacity and the loading capacity is in a preset range, planning a distribution line in the target historical line template according to the position of a booking point in the target historical line template.
Optionally, the planning of a delivery route in the target historical route template according to the position of the order point in the target historical route template includes: planning a delivery line meeting target constraint conditions in the target historical line template according to the position of a order point in the target historical line template, wherein the target constraint conditions comprise at least one of the following targets: the total delivery mileage is shortest and the delivery cost is lowest.
Optionally, the method further comprises: if the absolute value of the difference between the total loading capacity and the carrying capacity is not in the preset range and the total loading capacity is lower than the carrying capacity, merging the target historical line template and an adjacent target historical line template into the same historical line template; and if the absolute value of the difference between the total loading capacity and the loading capacity of the combined historical line template is within the preset range, planning a distribution line in the combined historical line template according to the coordinates of the order points in the combined historical line template.
Optionally, the method further comprises:
if the absolute value of the difference between the total loading capacity and the loading capacity is not in the preset range and the total loading capacity is larger than the loading capacity, classifying part of order points in the target historical line template into an adjacent target historical line template of the target historical line template, so that the absolute value of the difference between the total loading capacity of the remaining order points in the target historical line template and the loading capacity of the target historical line template historical distribution line is in the preset range.
Optionally, the generating a target historical route template covering order points of the orders to be delivered includes: generating a historical route template based on the historical distribution route; for the historical line template covered with the order points, determining a clustering center of an order point set in the historical line template; and for the order points which are not positioned in any historical line template, determining a cluster center closest to the order points, and extending the historical line template corresponding to the cluster center to cover the order points to obtain the target historical line template.
Optionally, the method further comprises: establishing a two-dimensional coordinate system, and determining coordinate position ranges of a plurality of target historical route templates in the two-dimensional coordinate system, wherein the coordinate position ranges are used for determining other target historical route templates adjacent to a single target historical route template.
In a second aspect of the present disclosure, a delivery route planning apparatus is provided, the apparatus including: the generation module is used for generating a target historical line template covering order points of the orders to be delivered, wherein the historical line template is an edge geometric area determined based on the historical delivery lines; and the planning module is used for planning the route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point contained in the target historical route template so as to obtain the delivery route which is most matched with the delivery attribute information, wherein the delivery attribute information comprises the carrying capacity of the historical delivery route in the target historical route template.
Optionally, the planning module further includes: the judging submodule is used for judging whether the total loading capacity of the order points in the target historical line template is consistent with the loading capacity of the historical distribution route corresponding to the target historical line template or not aiming at any target historical line template; and the planning submodule is used for planning a distribution line in the target historical line template according to the position of a booking point in the target historical line template if the absolute value of the difference value between the total loading capacity and the loading capacity is in a preset range.
Optionally, the planning sub-module is configured to plan a delivery route meeting a target constraint condition in the target historical route template according to a position of a order point in the target historical route template, where the target constraint condition includes at least one of the following targets: the total delivery mileage is shortest and the delivery cost is lowest.
Optionally, the planning module further includes a merging sub-module, configured to merge the target historical route template and an adjacent target historical route template into a same historical route template if an absolute value of a difference between the total loading capacity and the loading capacity is not within the preset range and the total loading capacity is lower than the loading capacity; and the planning submodule is further configured to plan a distribution line in the merged historical line template according to coordinates of a booking point in the merged historical line template if an absolute value of a difference between the total loading capacity and the loading capacity of the merged historical line template is within the preset range.
Optionally, the planning module further includes a separation submodule, configured to, if an absolute value of a difference between the total loading capacity and the loading capacity is not within the preset range and the total loading capacity is greater than the loading capacity, classify a part of order points in the target historical route template into an adjacent target historical route template of the target historical route template, so that an absolute value of a difference between a total loading capacity of remaining order points in the target historical route template and a loading capacity of the target historical route template historical distribution route is within the preset range.
Optionally, the generating module is configured to generate a historical route template based on a historical delivery route; for the historical line template covered with the order points, determining a clustering center of an order point set in the historical line template; and for the order points which are not positioned in any historical line template, determining a cluster center closest to the order points, and extending the historical line template corresponding to the cluster center to cover the order points to obtain the target historical line template.
Optionally, the apparatus further includes a positioning module, configured to establish a two-dimensional coordinate system, and determine a coordinate position range of the plurality of target historical route templates in the two-dimensional coordinate system, where the coordinate position range is used to determine other target historical route templates adjacent to a single target historical route template.
In a third aspect of the disclosure, a computer-readable storage medium is provided, on which a computer program is stored, which program, when being executed by a processor, carries out the steps of the method of any one of the first aspect of the disclosure.
In a fourth aspect of the present disclosure, an electronic device is provided, which includes a memory having a computer program stored thereon and a processor configured to execute the computer program in the memory to implement the steps of the method in any one of the first aspect of the present disclosure.
Based on the technical scheme, the following technical effects can be at least achieved:
the route planning of the order to be delivered at this time can be determined based on the historical delivery route of the historical delivery order and the delivery attribute information corresponding to the historical delivery route, so that a deliverer who is familiar with a certain area can deliver the order of the area, the relevance and the customer viscosity between the customer and the area are enhanced, the route can be planned for the customer according to the delivery attribute information of each historical delivery order on the basis of improving the delivery experience of the customer in the area and the delivery efficiency, the efficiency of route planning is realized, and the situation of capacity waste caused by the mismatching of the loading capacity and the carrying capacity is reduced. Additional features and advantages of the disclosure will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure without limiting the disclosure. In the drawings:
FIG. 1 is a flow chart illustrating a delivery route planning method according to an exemplary disclosed embodiment.
FIG. 2 is a schematic diagram illustrating a target historical route template according to an exemplary disclosed embodiment.
FIG. 3 is a schematic diagram illustrating an historical route template override order point, according to an exemplary disclosed embodiment.
FIG. 4 is a schematic diagram illustrating a historical route template at a location range summarized in a coordinate system according to an exemplary disclosed embodiment.
FIG. 5 is a flow chart illustrating a delivery route planning method according to an exemplary disclosed embodiment.
FIG. 6 is a block diagram illustrating a delivery route planning apparatus according to an exemplary disclosed embodiment.
FIG. 7 is a block diagram illustrating an electronic device according to an exemplary disclosed embodiment.
Detailed Description
The following detailed description of specific embodiments of the present disclosure is provided in connection with the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present disclosure, are given by way of illustration and explanation only, not limitation.
FIG. 1 is a flow chart illustrating a delivery route planning method, as shown in FIG. 1, according to an exemplary disclosed embodiment, the method including the steps of:
and S11, generating a target historical route template covering the order points of the orders to be delivered, wherein the historical route template is an edge geometric area determined based on the historical delivery routes.
For example, when the order to be delivered is a take-away order, the order point may be a location point of a restaurant maker and a location point of a customer, and when the order to be delivered is an express order, the order point may be a delivery destination address of all orders from the same warehouse, which is not limited in this disclosure.
After all order points are determined, an edge geometry corresponding to each historical delivery order can be determined based on historical delivery routes in the historical delivery orders, the edge geometry is projected to the outer edge of the order points in the map to be matched, one edge geometry with the edge geometry most similar to the edge shape of the order points is determined as a target historical route template, or a plurality of adjacent edge geometries matched with the edge shape of the order points after the edge geometries are spliced are determined as a plurality of target historical route templates. Wherein, a historical delivery route refers to a route that a delivery person passes after completing delivery of the taken goods after taking the goods from the warehouse.
In a possible implementation manner, the key positions of the historical delivery routes may be abstracted as delivery points, the delivery point of each historical delivery order is used as a delivery point set, a convex hull algorithm is performed on all the delivery point sets and all the order point sets, a plurality of target sets are determined, and the outer edge set area of each target set is used as a plurality of target historical route templates.
Each historical route template has its corresponding delivery attribute information, such as driver information, driver assessment information, vehicle type, vehicle weight, etc., determined based on the historical delivery orders that generated the historical route template.
In a possible implementation, the historical delivery route may be a delivery route of a historical delivery order within a preset time range, for example, a delivery route of a historical delivery order completed within one month, a delivery route of a historical delivery order under a preset weather condition, for example, a delivery route of a historical delivery order completed on a rainy day, a delivery route of a historical delivery order completed on a preset working day, for example, a delivery route of a historical delivery order completed on a tuesday, or a delivery route of a historical delivery order completed on an a shift day. When the target historical delivery route template is generated, the target historical delivery order is determined according to the delivery conditions, and then the target historical delivery template is determined according to the historical delivery route of the target historical delivery order. For example, when the order to be delivered is a Tuesday (the deliverer B shift, and is rainy), historical delivery routes for historical delivery orders completed within a month of rain and within the B shift, may be determined, and a target historical route template may be determined based on these historical delivery routes. The target historical route template may also be determined by screening historical delivery orders of the deliverer whose current value is the current value, for example, when the delivery date of the order to be delivered is Tuesday and the deliverer has Zhang three and Liquan vacation on Tuesday, historical delivery orders of other deliverers except Zhang three and Liquan may be determined, and the target historical route template may be generated based on the delivery routes of the historical delivery orders.
It is worth noting that the target historical route template is not exactly the same geometric area as the outer edge of the order point, but is a collection of one or more historical route templates with higher similarity. As shown in fig. 2, the solid black dots represent order points, and the target historical route template may include all order points or only a part of order points, as shown in the dashed box 1 in fig. 2, and there is a part of order points outside the target historical route template; when there are a plurality of target historical route templates, there may be gaps between the plurality of target historical route templates as indicated by a dashed box 2 in fig. 3, and there may also be overlaps as indicated by a dashed box 3 in fig. 3.
In one possible implementation, a historical route template may be generated based on historical delivery routes, for the historical route template covered with the order points, a cluster center of a set of order points in the historical route template is determined, for the order points not in any of the historical route templates, a cluster center closest to the order point is determined, and the historical route template for the cluster center is extended to cover the order point, so as to obtain the target historical route template.
As shown in fig. 3, historical route templates A, B, C, D with a high similarity between the split outer edge and the outer edge of the order point set are generated based on the historical distribution route, the centroid of each historical route template is a ', B', C ', D' (represented by a hollow circle), wherein there are order points a and B outside the historical route templates, (the order points in the historical route templates are not represented in the figure), then the centroid a 'closer to the order point a is determined and the historical route template a is extended to cover the order point a according to a preset sequence (for example, an order of converging from top to bottom, from left to right, from outside to inside, from the outer edge clockwise to inside, and the like), the centroid a' closer to the order point a is determined again, the centroid of the historical route template a is determined again to be a ", then the centroid C 'closer to the order point B is determined from the centroids a", B', C ', D', the historical route template C is extended to cover the order point b. And after all order points are covered by the historical route template, determining all current historical route templates as the target historical route template.
And S12, planning the route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point contained in the target historical route template to obtain a delivery route which is most matched with the delivery attribute information, wherein the delivery attribute information comprises the carrying capacity of the historical delivery route in the target historical route template.
Aiming at any one target historical line template, judging whether the total loading capacity of the order points in the target historical line template is consistent with the loading capacity of the historical distribution route corresponding to the target historical line template; and if the absolute value of the difference between the total loading capacity and the loading capacity is in a preset range, planning a distribution line in the target historical line template according to the position of a booking point in the target historical line template.
For example, a target historical route template with a capacity of 110 for one vehicle, wherein the capacity may refer to a saturated load of the host vehicle of the target historical route template, that is, a standard load that is not empty or not overloaded. If the preset range is 10 (which represents that no load of 10 or overload of 10 is allowed relative to the saturated load), if the total loading capacity of all order points in the target historical route template is 100, the difference between the loading capacity and the loading capacity is 10, and the order points in the target historical route template can be arranged on the basis of the preset in-class constraint function and the distribution target function.
It should be noted that when the total loading capacity is smaller than the loading capacity and the difference value is within the preset range, the line arrangement may be performed on the order points in the target historical route template, so as to reduce the risk of overload.
In one possible implementation, a delivery route that meets a target constraint within the target historic route template can be planned according to the position of a order point in the target historic route template, wherein the target constraint comprises at least one of the following targets: the total delivery mileage is shortest and the delivery cost is lowest.
In a possible implementation manner, if an absolute value of a difference between the total loading capacity and the loading capacity is not within the preset range and the total loading capacity is lower than the loading capacity, merging the target historical line template and an adjacent target historical line template into the same historical line template; and if the absolute value of the difference between the total loading capacity and the loading capacity of the combined historical line template is within the preset range, planning a distribution line in the combined historical line template according to the coordinates of the order points in the combined historical line template.
For example, when the total loading capacity of the currently winding displacement target historical route template is 70 and the loading capacity is 100, it may be determined that the target historical route templates adjacent to the target historical route template are merged, and if the total loading capacity of the adjacent target historical route templates is 30, the total loading capacity of the merged target historical route template is 100, and if the total loading capacity matches the loading capacity, the winding displacement may be performed on the merged target historical route template.
In a possible implementation manner, if the absolute value of the difference between the total loading capacity and the loading capacity is not within the preset range and the total loading capacity is greater than the loading capacity, part of order points in the target historical route template are classified into an adjacent target historical route template of the target historical route template, so that the absolute value of the difference between the total loading capacity of the remaining order points in the target historical route template and the loading capacity of the target historical route template historical distribution route is within the preset range.
For example, when the total loading amount of the destination historical route template currently being wired is 100 and the loading amount is 70, order points of the overloaded portion may be added to the adjacent destination historical route template (for example, when the total loading amounts of some order points are added to be 30 or close to 30, the order points may be determined as order points of the overloaded portion), thereby reducing the load in the current destination historical route template.
It should be noted that the above two embodiments can be flexibly combined, for example, when the total loading capacity of the target history route template a is 100, the loading capacity is 70, the total loading capacity of the target history route template B is 60, the loading capacity is 100, the total loading capacity of the target history route template C is 90, and the loading capacity is 80, according to the preset sequence, after adding 30 units of order points of loading capacity to the target history route template a adjacent to the target history route template B, the total loading capacity of the target history route template a is 70, the loading capacity is 70, the total loading capacity of the target history route template a is 90, and the loading capacity is 100, the target history route template B adjacent to the target history route template B can be merged to obtain the target history route template B with the total loading capacity of 180 and the loading capacity of 100, the single point of the loading capacity of 80 units can be separated from the target history route template B again, and adding the target historical route template C, wherein the total loading capacity of the processed target historical route template B is 100 and the loading capacity is 100, the total loading capacity of the processed target historical route template C is 80 and the loading capacity is 80, so far, the total loading capacity of all the target historical route templates is matched with the loading capacity, and each distribution vehicle does not run in no-load mode or only runs in no-load mode and is in the optimal running state.
It is worth noting that the total loading and capacity may refer to weight, volume, or parameters including both weight and volume, which the present disclosure is not limited to.
In a possible implementation, a two-dimensional coordinate system may be established, and coordinate position ranges of a plurality of target historical route templates in the two-dimensional coordinate system are determined, and the coordinate position ranges are used for determining other target historical route templates adjacent to a single target historical route template. For example, as shown in fig. 4, the position range of the history route template of the irregular shape in the coordinate system may be determined as (x 2-x 1, y 2-y 1), where x1 and x2 are the maximum abscissa and the minimum abscissa of the irregular shape, respectively, and y1 and y2 are the maximum ordinate and the minimum ordinate of the irregular shape, respectively.
When the templates are separated and combined, other templates adjacent to the template in the wire arrangement process can be sequentially determined according to a preset sequence, such as a mode of simultaneous convergence of multiple points from left to right, from top to bottom, from outside to inside, clockwise convergence of a single point from outside to inside and the like, based on the coordinate range, and the adjacent relation of the templates is considered in a geometrical sense, so that the calculation amount of the multi-dimensional template position information can be reduced when the templates are separated and combined.
After finishing the wire arrangement after the initial line planning, optimizing the line based on the line form, span, line crossing and line balance, and if the line form jump point exists, the span is large, the line crossing, the line order is not given to the adjacent line, and the driver of the line order is not in the unbalanced distribution condition, optimizing according to an in-class constraint function and an objective function.
Based on the technical scheme, the following technical effects can be at least achieved:
the route planning of the order to be delivered at this time can be determined based on the historical delivery route of the historical delivery order and the delivery attribute information corresponding to the historical delivery route, so that a deliverer who is familiar with a certain area can deliver the order of the area, the relevance and the customer viscosity between the customer and the area are enhanced, the route can be planned for the customer according to the delivery attribute information of each historical delivery order on the basis of improving the delivery experience of the customer in the area and the delivery efficiency, the efficiency of route planning is realized, and the situation of capacity waste caused by the mismatching of the loading capacity and the carrying capacity is reduced.
FIG. 5 is a flow chart illustrating a delivery route planning method, as shown in FIG. 5, according to an exemplary disclosed embodiment, the method including the steps of:
and S51, generating a historical route template based on the historical delivery route, and determining the cluster center of the order point set in the historical route template for the historical route template covering the order points of the orders to be delivered.
For example, when the order to be delivered is a take-away order, the order point may be a location point of a restaurant maker and a location point of a customer, and when the order to be delivered is an express order, the order point may be a delivery destination address of all orders from the same warehouse, which is not limited in this disclosure.
After all order points are determined, an edge geometry corresponding to each historical delivery order can be determined based on historical delivery routes in the historical delivery orders, the edge geometry is projected to the outer edge of the order points in the map to be matched, one edge geometry with the edge geometry most similar to the edge shape of the order points is determined as a target historical route template, or a plurality of adjacent edge geometries matched with the edge shape of the order points after the edge geometries are spliced are determined as a plurality of target historical route templates. Wherein, a historical delivery route refers to a route that a delivery person passes after completing delivery of the taken goods after taking the goods from the warehouse.
In a possible implementation manner, the key positions of the historical delivery routes may be abstracted as delivery points, the delivery point of each historical delivery order is used as a delivery point set, a convex hull algorithm is performed on all the delivery point sets and all the order point sets, a plurality of target sets are determined, and the outer edge set area of each target set is used as a plurality of target historical route templates.
Each historical route template has its corresponding delivery attribute information, such as driver information, driver assessment information, vehicle type, vehicle weight, etc., determined based on the historical delivery orders that generated the historical route template.
In a possible implementation, the historical delivery route may be a delivery route of a historical delivery order within a preset time range, for example, a delivery route of a historical delivery order completed within one month, a delivery route of a historical delivery order under a preset weather condition, for example, a delivery route of a historical delivery order completed on a rainy day, a delivery route of a historical delivery order completed on a preset working day, for example, a delivery route of a historical delivery order completed on a tuesday, or a delivery route of a historical delivery order completed on an a shift day. When the target historical delivery route template is generated, the target historical delivery order is determined according to the delivery conditions, and then the target historical delivery template is determined according to the historical delivery route of the target historical delivery order. For example, when the order to be delivered is a Tuesday (the deliverer B shift, and is rainy), historical delivery routes for historical delivery orders completed within a month of rain and within the B shift, may be determined, and a target historical route template may be determined based on these historical delivery routes. The target historical route template may also be determined by screening historical delivery orders of the deliverer whose current value is the current value, for example, when the delivery date of the order to be delivered is Tuesday and the deliverer has Zhang three and Liquan vacation on Tuesday, historical delivery orders of other deliverers except Zhang three and Liquan may be determined, and the target historical route template may be generated based on the delivery routes of the historical delivery orders.
It is worth noting that the target historical route template is not exactly the same geometric area as the outer edge of the order point, but is a collection of one or more historical route templates with higher similarity. As shown in fig. 2, the target historical route template may include all the order points, or may include only a part of the order points, and there is a part of the order points located outside the target historical route template; when there are multiple target historical route templates, there may be gaps between the multiple target historical route templates, and overlap may also occur.
And S52, for the order points which are not in any historical line template, determining the cluster center closest to the order points, and extending the historical line template corresponding to the cluster center to cover the order points to obtain the target historical line template.
As shown in fig. 3, historical route templates A, B, C, D with high similarity between the spliced outer edge and the outer edge of the order point set are generated based on the historical distribution route, the centroids of each historical route template are a ', B', C ', and D', respectively, wherein, order points a and b outside the historical route template (the order points in the historical route template are not shown in the figure) can be determined according to a preset sequence (for example, the sequence of converging from top to bottom, from left to right, from outside to inside, from outer edge to inside and the like), the centroid A' which is closer to the order point a is firstly determined, and extending the historical route template A to cover the order point a, re-determining the centroid of the historical route template A as A ', determining the centroid C' closer to the order point B from the centroid A ', the centroid B', the centroid C 'and the centroid D', and extending the historical route template C to cover the order point B. And after all order points are covered by the historical route template, determining all current historical route templates as the target historical route template.
And S53, establishing a two-dimensional coordinate system, and determining coordinate position ranges of the target historical route templates in the two-dimensional coordinate system, wherein the coordinate position ranges are used for determining other target historical route templates adjacent to the single target historical route template.
For example, as shown in fig. 4, the position range of the history route template of the irregular shape in the coordinate system may be determined as (x 2-x 1, y 2-y 1), where x1 and x2 are the maximum abscissa and the minimum abscissa of the irregular shape, respectively, and y1 and y2 are the maximum ordinate and the minimum ordinate of the irregular shape, respectively.
And S54, aiming at one target historical circuit template, judging whether the total loading capacity of the order points in the target historical circuit template is consistent with the loading capacity of the historical distribution route corresponding to the target historical circuit template.
For example, a target historical route template with a capacity of 110 for one vehicle, wherein the capacity may refer to a saturated load of the host vehicle of the target historical route template, that is, a standard load that is not empty or not overloaded. If the preset range is 10 (which represents that no load of 10 or overload of 10 is allowed relative to the saturated load), if the total loading capacity of all order points in the target historical route template is 100, the difference between the loading capacity and the loading capacity is 10, and the order points in the target historical route template can be arranged on the basis of the preset in-class constraint function and the distribution target function.
If the absolute value of the difference between the total loading capacity and the loading capacity is within the preset range, step S57 is executed.
If the absolute value of the difference between the total loading capacity and the loading capacity is not within the preset range and the total loading capacity is lower than the loading capacity, step S55 is executed.
If the absolute value of the difference between the total loading capacity and the loading capacity is not within the preset range, and the total loading capacity is greater than the loading capacity, step S56 is executed.
And S55, merging the target historical line template and the adjacent target historical line template into the same historical line template.
For example, when the total loading capacity of the currently winding displacement target historical route template is 70 and the loading capacity is 100, it may be determined that the target historical route templates adjacent to the target historical route template are merged, and if the total loading capacity of the adjacent target historical route templates is 30, the total loading capacity of the merged target historical route template is 100, and if the total loading capacity matches the loading capacity, the winding displacement may be performed on the merged target historical route template.
Returning to step S24, the merged target historical route template is determined again to determine whether the total loading capacity of the order points in the target historical route template matches the loading capacity of the historical distribution route corresponding to the target historical route template.
And S56, classifying part of order points in the target historical line template into an adjacent target historical line template of the target historical line template, so that the absolute value of the difference between the total loading capacity of the remaining order points in the target historical line template and the loading capacity of the historical distribution line of the target historical line template is in the preset range.
For example, when the total loading amount of the destination historical route template currently being wired is 100 and the loading amount is 70, order points of the overloaded portion may be added to the adjacent destination historical route template (for example, when the total loading amounts of some order points are added to be 30 or close to 30, the order points may be determined as order points of the overloaded portion), thereby reducing the load in the current destination historical route template.
It should be noted that, the above-mentioned steps S25 and S26 may be flexibly combined, for example, when the total loading capacity of the target history route template a is 100, the loading capacity is 70, the total loading capacity of the target history route template B is 60, the loading capacity is 100, the total loading capacity of the target history route template C is 90, and the loading capacity is 80, according to the preset sequence, after adding 30 units of order points of the loading capacity to the target history route template a adjacent to the target history route template B, the total loading capacity of the target history route template a is 70, the loading capacity is 70, the total loading capacity of the target history route template B is 90, and the loading capacity is 100, the target history route template B with the total loading capacity of 180 and the loading capacity of 100 may be merged from the target history route template C adjacent to the target history route template B, and then the 80 units of order points of the loading capacity are separated from the target history route template B again, and adding the target historical route template C, wherein the total loading capacity of the processed target historical route template B is 100 and the loading capacity is 100, the total loading capacity of the processed target historical route template C is 80 and the loading capacity is 80, so far, the total loading capacity of all the target historical route templates is matched with the loading capacity, and each distribution vehicle does not run in no-load mode or only runs in no-load mode and is in the optimal running state.
When the templates are separated and combined, other templates adjacent to the template in the wire arrangement process can be sequentially determined according to a preset sequence, such as a mode of simultaneous convergence of multiple points from left to right, from top to bottom, from outside to inside, clockwise convergence of a single point from outside to inside and the like, based on the coordinate range, and the adjacent relation of the templates is considered in a geometrical sense, so that the calculation amount of the multi-dimensional template position information can be reduced when the templates are separated and combined.
And S57, planning a distribution line which meets the target constraint condition in the target historical line template according to the position of the order point in the target historical line template.
Arranging lines for order points in the target historical route template based on a preset in-class constraint function and a delivery target function, that is, planning delivery routes meeting target constraint conditions in the target historical route template according to positions of the order points in the target historical route template, where the target constraint conditions include at least one of the following targets: the total delivery mileage is shortest and the delivery cost is lowest.
And S58, optimizing the distribution route to obtain a target distribution route.
After finishing the wire arrangement after the initial line planning, optimizing the line based on the line form, span, line crossing and line balance, and if the line form jump point exists, the span is large, the line crossing, the line order is not given to the adjacent line, and the driver of the line order is not in the unbalanced distribution condition, optimizing according to an in-class constraint function and an objective function.
Based on the technical scheme, the following technical effects can be at least achieved:
the route planning of the order to be delivered at this time can be determined based on the historical delivery route of the historical delivery order and the delivery attribute information corresponding to the historical delivery route, so that a deliverer who is familiar with a certain area can deliver the order of the area, the relevance and the customer viscosity between the customer and the area are enhanced, the route can be planned for the customer according to the delivery attribute information of each historical delivery order on the basis of improving the delivery experience of the customer in the area and the delivery efficiency, the efficiency of route planning is realized, and the situation of capacity waste caused by the mismatching of the loading capacity and the carrying capacity is reduced.
Fig. 6 is a block diagram illustrating a delivery route planning apparatus according to an exemplary disclosed embodiment, and as shown in fig. 6, the apparatus 600 includes a generation module 610 and a planning module 620.
The generating module 610 is configured to generate a target historical route template covering order points of the order to be delivered, where the historical route template is an edge geometric area determined based on the historical delivery route.
A planning module 620, configured to plan a route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point included in the target historical route template, so as to obtain a delivery route most matched with the delivery attribute information, where the delivery attribute information includes a carrying capacity of a historical delivery route in the target historical route template.
The planning module further comprises:
the judging submodule is used for judging whether the total loading capacity of the order points in the target historical line template is consistent with the loading capacity of the historical distribution route corresponding to the target historical line template or not aiming at any target historical line template;
and the planning submodule is used for planning a distribution line in the target historical line template according to the position of a booking point in the target historical line template if the absolute value of the difference value between the total loading capacity and the loading capacity is in a preset range.
The planning submodule is configured to plan a distribution line meeting a target constraint condition in the target historical line template according to a position of a order point in the target historical line template, where the target constraint condition includes at least one of the following targets: the total delivery mileage is shortest and the delivery cost is lowest.
The planning module further comprises a merging submodule, configured to merge the target historical line template and an adjacent target historical line template into a same historical line template if an absolute value of a difference between the total loading capacity and the loading capacity is not within the preset range and the total loading capacity is lower than the loading capacity;
and the planning submodule is further configured to plan a distribution line in the merged historical line template according to coordinates of a booking point in the merged historical line template if an absolute value of a difference between the total loading capacity and the loading capacity of the merged historical line template is within the preset range.
The planning module further comprises a separation submodule, configured to, if the absolute value of the difference between the total loading capacity and the loading capacity is not within the preset range and the total loading capacity is greater than the loading capacity, classify some order points in the target historical line template into an adjacent target historical line template of the target historical line template, so that the absolute value of the difference between the total loading capacity of remaining order points in the target historical line template and the loading capacity of the target historical line template historical distribution line is within the preset range.
The generation module is used for generating a historical route template based on a historical distribution route; for the historical line template covered with the order points, determining a clustering center of an order point set in the historical line template; and for the order points which are not positioned in any historical line template, determining a cluster center closest to the order points, and extending the historical line template corresponding to the cluster center to cover the order points to obtain the target historical line template.
The device further comprises a positioning module, a storage module and a display module, wherein the positioning module is used for establishing a two-dimensional coordinate system and determining a coordinate position range of the plurality of target historical route templates in the two-dimensional coordinate system, and the coordinate position range is used for determining other target historical route templates adjacent to the single target historical route template.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
Based on the technical scheme, the following technical effects can be at least achieved:
the route planning of the order to be delivered at this time can be determined based on the historical delivery route of the historical delivery order and the delivery attribute information corresponding to the historical delivery route, so that a deliverer who is familiar with a certain area can deliver the order of the area, the relevance and the customer viscosity between the customer and the area are enhanced, the route can be planned for the customer according to the delivery attribute information of each historical delivery order on the basis of improving the delivery experience of the customer in the area and the delivery efficiency, the efficiency of route planning is realized, and the situation of capacity waste caused by the mismatching of the loading capacity and the carrying capacity is reduced.
Fig. 7 is a block diagram illustrating an electronic device 700 in accordance with an example embodiment. As shown in fig. 7, the electronic device 700 may include: a processor 701 and a memory 702. The electronic device 700 may also include one or more of a multimedia component 703, an input/output (I/O) interface 704, and a communication component 705.
The processor 701 is configured to control the overall operation of the electronic device 700 to complete all or part of the steps of the distribution route planning method. The memory 702 is used to store various types of data to support operation at the electronic device 700, such as instructions for any application or method operating on the electronic device 700 and application-related data, such as contact data, transmitted and received messages, pictures, audio, video, and the like. The Memory 702 may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random Access Memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk, or optical disk. The multimedia components 703 may include screen and audio components. Wherein the screen may be, for example, a touch screen and the audio component is used for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signal may further be stored in the memory 702 or transmitted through the communication component 705. The audio assembly also includes at least one speaker for outputting audio signals. The I/O interface 704 provides an interface between the processor 701 and other interface modules, such as a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 705 is used for wired or wireless communication between the electronic device 700 and other devices. Wireless communication, such as Wi-Fi, bluetooth, Near Field Communication (NFC), 2G, 3G, 4G, NB-IOT, eMTC, or other 5G, etc., or a combination of one or more of them, which is not limited herein. The corresponding communication component 705 may thus include: Wi-Fi module, Bluetooth module, NFC module, etc.
In an exemplary embodiment, the electronic Device 700 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic components for performing the distribution route planning method described above.
In another exemplary embodiment, a computer readable storage medium comprising program instructions which, when executed by a processor, implement the steps of the delivery route planning method described above is also provided. For example, the computer readable storage medium may be the memory 702 described above including program instructions that are executable by the processor 701 of the electronic device 700 to perform the delivery route planning method described above.
The preferred embodiments of the present disclosure are described in detail with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure.
It should be noted that, in the foregoing embodiments, various features described in the above embodiments may be combined in any suitable manner, and in order to avoid unnecessary repetition, various combinations that are possible in the present disclosure are not described again.
In addition, any combination of various embodiments of the present disclosure may be made, and the same should be considered as the disclosure of the present disclosure, as long as it does not depart from the spirit of the present disclosure.

Claims (10)

1. A method for planning a distribution route, comprising:
generating a target historical line template covering order points of an order to be delivered, wherein the historical line template is an edge geometric area determined based on a historical delivery line;
planning the route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point contained in the target historical route template to obtain a delivery route which is most matched with the delivery attribute information, wherein the delivery attribute information comprises the carrying capacity of the historical delivery route in the target historical route template.
2. The method according to claim 1, wherein the planning the route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point included in the target historical route template to obtain the delivery route that most matches the delivery attribute information comprises:
aiming at any one target historical line template, judging whether the total loading capacity of the order points in the target historical line template is consistent with the loading capacity of the historical distribution route corresponding to the target historical line template;
and if the absolute value of the difference between the total loading capacity and the loading capacity is in a preset range, planning a distribution line in the target historical line template according to the position of a booking point in the target historical line template.
3. The method of claim 2, wherein planning distribution routes within the target historic route template according to the location of a point of order in the target historic route template comprises:
planning a delivery line meeting target constraint conditions in the target historical line template according to the position of a order point in the target historical line template, wherein the target constraint conditions comprise at least one of the following targets: the total delivery mileage is shortest and the delivery cost is lowest.
4. The method of claim 2, further comprising:
if the absolute value of the difference between the total loading capacity and the carrying capacity is not in the preset range and the total loading capacity is lower than the carrying capacity, merging the target historical line template and an adjacent target historical line template into the same historical line template;
and if the absolute value of the difference between the total loading capacity and the loading capacity of the combined historical line template is within the preset range, planning a distribution line in the combined historical line template according to the coordinates of the order points in the combined historical line template.
5. The method of claim 2, further comprising:
if the absolute value of the difference between the total loading capacity and the loading capacity is not in the preset range and the total loading capacity is larger than the loading capacity, classifying part of order points in the target historical line template into an adjacent target historical line template of the target historical line template, so that the absolute value of the difference between the total loading capacity of the remaining order points in the target historical line template and the loading capacity of the target historical line template historical distribution line is in the preset range.
6. The method of any of claims 1 to 3, wherein generating a target historic route template covering order points for orders to be delivered comprises:
generating a historical route template based on the historical distribution route;
for the historical line template covered with the order points, determining a clustering center of an order point set in the historical line template;
and for the order points which are not positioned in any historical line template, determining a cluster center closest to the order points, and extending the historical line template corresponding to the cluster center to cover the order points to obtain the target historical line template.
7. The method according to claim 4 or 5, characterized in that the method further comprises:
establishing a two-dimensional coordinate system, and determining coordinate position ranges of a plurality of target historical route templates in the two-dimensional coordinate system, wherein the coordinate position ranges are used for determining other target historical route templates adjacent to a single target historical route template.
8. A delivery route planning apparatus, characterized in that the apparatus comprises:
the generation module is used for generating a target historical line template covering order points of the orders to be delivered, wherein the historical line template is an edge geometric area determined based on the historical delivery lines;
and the planning module is used for planning the route of the order to be delivered according to the delivery attribute information of the target historical route template and the order point contained in the target historical route template so as to obtain the delivery route which is most matched with the delivery attribute information, wherein the delivery attribute information comprises the carrying capacity of the historical delivery route in the target historical route template.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
10. An electronic device, comprising:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to carry out the steps of the method of any one of claims 1 to 7.
CN202010367068.9A 2020-04-30 2020-04-30 Distribution line planning method and device, storage medium and electronic equipment Pending CN111626664A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010367068.9A CN111626664A (en) 2020-04-30 2020-04-30 Distribution line planning method and device, storage medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010367068.9A CN111626664A (en) 2020-04-30 2020-04-30 Distribution line planning method and device, storage medium and electronic equipment

Publications (1)

Publication Number Publication Date
CN111626664A true CN111626664A (en) 2020-09-04

Family

ID=72259887

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010367068.9A Pending CN111626664A (en) 2020-04-30 2020-04-30 Distribution line planning method and device, storage medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN111626664A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112906980A (en) * 2021-03-19 2021-06-04 杉数科技(北京)有限公司 Order processing method, device and system and readable storage medium
CN113673934A (en) * 2021-08-26 2021-11-19 深圳市易流科技股份有限公司 Method, device, equipment and storage medium for matching order and line
CN115439071A (en) * 2022-11-09 2022-12-06 成都运荔枝科技有限公司 Cold-chain logistics transportation order processing method and system
CN113673934B (en) * 2021-08-26 2024-04-26 深圳市易流科技股份有限公司 Order and line matching method and device, equipment and storage medium

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112906980A (en) * 2021-03-19 2021-06-04 杉数科技(北京)有限公司 Order processing method, device and system and readable storage medium
CN112906980B (en) * 2021-03-19 2024-02-27 杉数科技(北京)有限公司 Order processing method, device and system and readable storage medium
CN113673934A (en) * 2021-08-26 2021-11-19 深圳市易流科技股份有限公司 Method, device, equipment and storage medium for matching order and line
CN113673934B (en) * 2021-08-26 2024-04-26 深圳市易流科技股份有限公司 Order and line matching method and device, equipment and storage medium
CN115439071A (en) * 2022-11-09 2022-12-06 成都运荔枝科技有限公司 Cold-chain logistics transportation order processing method and system

Similar Documents

Publication Publication Date Title
CN111366160B (en) Path planning method, path planning device and terminal equipment
US10685416B2 (en) Suggested pickup location for ride services
CN111486861B (en) Path planning method, device, equipment and medium
JP2019028992A (en) Method of generating delivery plan of delivery vehicle, apparatus and system
CN111626664A (en) Distribution line planning method and device, storage medium and electronic equipment
CN103134505A (en) Route planning system and method thereof
CN110533254B (en) Road section identification method, device, equipment and storage medium
CN113682318B (en) Vehicle running control method and device
CN110503528A (en) A kind of circuit recommendation method, apparatus, equipment and storage medium
CN113128744A (en) Distribution planning method and device
CN112328719A (en) Path information display method, device, terminal and storage medium
US20130047106A1 (en) Object relocation device, method and program for relocating map object
CN113139139A (en) Method, apparatus, electronic device, and medium for determining boarding point
CN107704942B (en) Distribution path determining method, device and equipment
US11287277B2 (en) Information processor, information processing method, and computer-readable recording medium, and information processing system
CN116346863B (en) Vehicle-mounted network data processing method, device, equipment and medium based on federal learning
CN113706857A (en) Method, device and equipment for determining road trafficability and storage medium
CN113240218B (en) Logistics distribution planning method and system based on big data
CN113739798B (en) Path planning method and device
CN107391728A (en) Data digging method and data mining device
CN115481329A (en) Boarding point determination method, computer storage medium, and computer program product
US20210166186A1 (en) Information processing device, moving device, information processing system, method, and program
CN113010807B (en) Method, device, equipment and storage medium for determining boarding point
CN111143486A (en) Service position acquisition method and device, electronic equipment and storage medium
US11629967B2 (en) Route planning method, device and computer storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20200904

WD01 Invention patent application deemed withdrawn after publication