A logistics distribution route planning method and device
Through the intelligent automatic wiring method, a logistics distribution line that meets the preset conditions is generated, which solves the problems of low manual operation efficiency and poor effect, and realizes efficient and balanced logistics distribution line planning, which is suitable for large-scale promotion.
Patent Information
- Application Number
- CN201910167224.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2019-03-06
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2039-03-06
AI Technical Summary
The existing logistics distribution line planning mainly relies on manual operation, resulting in low efficiency and poor wiring effect, making it difficult to cope with massive order demands, and the calculation complexity is high, making it difficult to ensure global load rate and vehicle load balancing.
An intelligent automatic wiring method is adopted to generate marking points by obtaining order data sets, determine the boundary of marking point distribution, search marking points based on the search range, generate distribution lines that meet preset conditions, optimize line planning, and improve wiring efficiency and effects.
It realizes automatic wiring, improves wiring efficiency and effect, balances vehicle load, saves time and costs, and can quickly process thousands of orders, meeting the wiring needs of massive orders.
Smart Images

Figure CN109978447B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of computer technology, and in particular to a method and device for planning a logistics distribution route. Background Art
[0002] At present, the distribution of ordered items is mainly based on four dimensions: city warehouse, distribution service provider, distribution area, and distribution time. The data is divided, and the orders are combined to form a line (that is, a logistics distribution line composed of multiple orders), and the orders on the line are delivered to the users on time to complete the fulfillment. The line arrangement is a very important business function module. An unreasonable line arrangement plan may have the following problems: too many orders on a single line lead to delivery timeouts, and if the points on the line are too scattered, the driver will take a detour to affect the delivery efficiency, or the load of the line vehicles is uneven, some line vehicles are overweight, and some line vehicles have too low a loading rate, and the line vehicles are not fully utilized.
[0003] The existing wiring method mainly relies on manual work, which is usually done by business personnel based on their experience. Manual wiring is difficult to guarantee the global loading rate. In addition, the number of lines to be arranged is often large, which takes a long time. Usually, only a few hundred orders can be arranged manually in one hour. With the continuous development of the business, the number of warehouse orders has increased exponentially. The wiring problem has become a business bottleneck, and a more intelligent wiring solution is urgently needed to solve it. Summary of the invention
[0004] In view of this, the embodiments of the present application provide a logistics distribution route planning method and device, which improves the routing efficiency, optimizes the logistics distribution routes and meets the routing requirements of massive orders. It has low computational complexity and is suitable for large-scale promotion.
[0005] According to a first aspect of the present application, a logistics distribution route planning method is provided, comprising:
[0006] Acquire an order data set, wherein the order data set includes delivery destination information of multiple orders;
[0007] Generate corresponding marking points according to the delivery destination information of each order;
[0008] Determine a boundary of the distribution of the marking points, search for marking points within the boundary according to a search range, and obtain a first marking point within the search range, wherein the search range is determined by a search reference point and a search step size;
[0009] If the first marking point satisfies a preset route generation condition, a delivery route including the first marking point is generated.
[0010] According to a second aspect of the present application, a logistics distribution route planning device is provided, the device comprising:
[0011] An acquisition unit, used to acquire an order data set, wherein the order data set includes delivery destination information of multiple orders;
[0012] A marking unit, used to generate corresponding marking points according to the delivery destination information of each order;
[0013] A search unit, configured to determine a boundary of the distribution of the marking points, search for marking points within the boundary according to a search range, and obtain a first marking point within the search range, wherein the search range is determined by a search reference point and a search step size;
[0014] A planning unit is configured to generate a delivery route including the first marking point if the first marking point satisfies a preset route generation condition.
[0015] According to the third aspect of the present application, an electronic device is provided, characterized in that the electronic device comprises: a processor, and a memory storing a computer program that can be run on the processor; wherein the processor is used to execute the steps of the method described in the first aspect of the present application when executing the computer program in the memory.
[0016] According to the fourth aspect of the present application, a non-transitory computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the method described in the first aspect of the present application are implemented.
[0017] Beneficial effects: By applying the solution of the embodiment of the present application, by acquiring the order data set, generating corresponding marking points according to the delivery destination information of each order, determining the boundary of the distribution of the marking points, searching for the marking points within the boundary according to the search range, and obtaining the first marking point within the search range; if the first marking point meets the preset route generation conditions, a delivery route containing the first marking point is generated. Compared with the manual route arrangement method, the embodiment of the present application automatically arranges the routes, improves the route arrangement efficiency and generates routes according to preset conditions, optimizes the route arrangement effect, makes the route arrangement more reasonable, and the load of vehicles on each route is relatively balanced, which is conducive to making full use of resources, saving costs, and improving user experience. In addition, the technical solution of the embodiment of the present application does not have too many intermediate iterative steps, and the calculation speed is fast. For tens of thousands of orders, the route arrangement results can be given within a few seconds, meeting the route arrangement needs of massive orders. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] Figure 1 is a flow chart of a logistics distribution route planning method according to an embodiment of the present application;
[0019] Figure 2 is a schematic diagram of marking points corresponding to an order in one embodiment of the present application;
[0020] Figure 3 yes Figure 2 A schematic diagram of one of the boundaries of the marked points shown;
[0021] Figure 4 yes Figure 2 A schematic diagram of the boundary of the second marked point shown;
[0022] Figure 5 is Figure 4 Schematic diagram of the search in the shown boundary;
[0023] Figure 6 is Figure 4 A schematic diagram showing changing the search reference point when searching within the boundary shown;
[0024] Figure 7 is a block diagram of a logistics distribution route planning device according to an embodiment of the present application;
[0025] Figure 8 is a schematic diagram of the structure of an electronic device according to an embodiment of the present application;
[0026] Fig. 9 It is a schematic diagram of the structure of a non-transitory computer-readable storage medium according to an embodiment of the present application. DETAILED DESCRIPTION
[0027] In order to make the above-mentioned purposes, features and advantages of the embodiments of the present application more obvious and easy to understand, the embodiments of the present application are further described in detail below in conjunction with the accompanying drawings and specific implementation methods. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the embodiments of the present application.
[0028] In order to solve the problems of low efficiency and poor routing effect caused by manual routing that restrict business development, one technical concept is to use an intelligent automatic routing solution to regard order routing as a VRP (vehicle routing problem). VRP is an NP-hard problem in the field of combinatorial optimization. NP (non-deterministic polynomial) is a type of problem that cannot be optimally solved in polynomial time.
[0029] There are some mainstream intelligent algorithm models for vrp problems, such as GA (Genetic Algorithm), ACO (Ant Colony Optimization), Metaheuristic (Meta-heuristic algorithm), ALNS (Adaptive Large Neighborhood Search), etc. These intelligent algorithms are essentially full of random shadows, and the intermediate process is difficult to control. Moreover, these intelligent algorithms are limited by the data scale of the problem to be solved. Usually, the effect of processing orders within a few hundred is better, but when the data scale reaches thousands or tens of thousands, the model performance drops sharply, and even the iteration results do not converge within a few hours, and it is impossible to output a better feasible solution, and the calculation time is long.
[0030] In view of this, this embodiment proposes a logistics route distribution planning method, which simulates the way of thinking when arranging lines manually, and the output result is a feasible solution, which is also a local optimal solution to a certain extent. The way of thinking of manual line arrangement is to preferentially connect the points in the "cluster" area into lines; arrange from the edge to the middle, the points at the edge are sparse and difficult to handle, and the points in the middle are dense and easy to concentrate and process. Start with the difficult and then the easy, and finally fine-tune. In this way, it can basically ensure that the load of line vehicles is balanced, control the number of orders on a single line within an appropriate limit, and try to arrange adjacent orders on one line to avoid drivers taking detours and save delivery time.
[0031] Figure 1 is a flow chart of a logistics distribution route planning method according to an embodiment of the present application, see Figure 1 The logistics distribution route planning method of this embodiment includes:
[0032] Step S101, obtaining an order data set, wherein the order data set includes delivery destination information of multiple orders;
[0033] Step S102, generating corresponding marking points according to the delivery destination information of each order;
[0034] Step S103, determining a boundary of the distribution of the marking points, searching for marking points within the boundary according to a search range, and obtaining a first marking point within the search range, wherein the search range is determined by a search reference point and a search step size;
[0035] Step S104: if the first marking point satisfies a preset route generation condition, a delivery route including the first marking point is generated.
[0036] Depend on Figure 1As shown, the logistics distribution route planning method of this embodiment improves the efficiency of routing compared with manual routing. Experiments have confirmed that for the same order data, the number of routings (i.e., the number of generated routings) is reduced by at least 10% on average compared with manual routing. It also meets the routing needs of massive orders and optimizes the routing effect. Compared with solutions using other intelligent algorithms, the logistics distribution route planning method of this embodiment can easily handle thousands of order routing tasks, with fewer intermediate iterations and a shorter computing time to output the local optimal solution, saving time while ensuring the routing effect.
[0037] The following focuses on explaining the implementation steps of the logistics distribution route planning method of the embodiment of the present application in conjunction with a specific application scenario.
[0038] In actual applications, the process starts with step one, obtaining the order data set from the data source and generating corresponding marking points based on the delivery destination information of each order.
[0039] Specifically, an order data set includes delivery destination information of multiple orders. For example, an order data set includes 2,000 order information, and each order information includes delivery destination information of the order. The delivery destination information here is, for example, the latitude and longitude information of the delivery destination, and the delivery destination is, for example, Beijing Zhongguancun.
[0040] See also Figure 2 , Figure 2 The figure shows the marking points corresponding to the delivery destination information of each order generated based on the acquired order data set. Figure 2 Multiple marking points are shown, each of which can correspond to a delivery destination in an order. Figure 2 The marking points in the figure are only for reference. In specific applications, the number of marking points generated may far exceed Figure 2 The quantity indicated in .
[0041] Step 2: Determine the distribution boundary of the marked points.
[0042] In this embodiment, determining the boundary of the distribution of marker points includes: locating contour points among the marker points; connecting the contour points in sequence to obtain a first polygon, or obtaining a minimum circumscribed rectangle based on the contour points connected in sequence, wherein the minimum circumscribed rectangle refers to a rectangle that contains the contour points and is tangent to the contour points; and obtaining the boundary based on the first polygon or the minimum circumscribed rectangle.
[0043] Combination Figure 3 and Figure 4 It can be seen that the present application provides two methods for determining the distribution boundary of the marking points. The first method is to use a first polygon to wrap the corresponding point of the order. The first polygon (such as Figure 3 The second method is to use the minimum circumscribed rectangle, such as Figure 4 As shown in Figure 1, the minimum circumscribed rectangle refers to a rectangle that contains the contour points and is tangent to the contour points. In practical applications, it should be selected according to needs.
[0044] For simplicity, the following Figure 4 The distribution boundary shown in the figure is used as an example to illustrate how to search for marked points within the distribution boundary. Since the process of searching points within the distribution boundary is the same, Figure 3 The search process within the distribution boundary shown is described below and will not be repeated here.
[0045] After determining the distribution boundary of the marked points, execute step three to determine the search direction.
[0046] Specifically, in this embodiment, based on the delivery destination information corresponding to the marked points within the boundary, the difference between the maximum longitude and the minimum longitude among the marked points within the boundary is calculated to obtain a first difference; the difference between the maximum latitude and the minimum latitude among the marked points within the boundary is calculated to obtain a second difference; if the first difference is greater than the second difference, the horizontal direction is determined as the first search direction; if the first difference is less than or equal to the second difference, the vertical direction is determined as the first search direction; after determining the first search direction, the second search direction is determined according to the sparsity of the marked points in the first search direction, wherein the second search direction is consistent with the direction from sparse to dense marked points.
[0047] For Figure 4 The marking point distribution boundary shown in the figure, in this embodiment, there are two strategies for determining the search direction, namely
[0048] Vertical-strategy – processes data vertically;
[0049] Horizontal-strategy — processes data horizontally;
[0050] There are two execution strategies for each search direction strategy:
[0051] Vertical-strategy (North2South, referred to as N2S; South2North, referred to as S2N),
[0052] Horizontal-strategy (West2East, referred to as W2E; East2West, referred to as E2W),
[0053] The expression for determining the search direction searchDirection strategy is as follows:
[0054] searchDirection=(maxLng-minLng)>(maxLat-minLat)? Horizontal-strategy: Vertical-strategy.
[0055] Here, Lat represents latitude information, and Lng represents longitude information. That is, the difference between the maximum longitude (maxLng) and the minimum longitude (minLng) of the marked points within the boundary is calculated to obtain the first difference; the difference between the maximum latitude (maxLat) and the minimum latitude (minLat) of the marked points within the boundary is calculated to obtain the second difference; if the first difference is greater than the second difference, the horizontal direction is determined as the first search direction, and if the first difference is less than or equal to the second difference, the vertical direction is determined as the first search direction.
[0056] Take the Vertical-strategy strategy as an example to illustrate its specific execution strategy:
[0057] N2S - Search and process data from top to bottom (or north to south);
[0058] S2N - Search and process data from bottom to top (or south to north).
[0059] In this embodiment, whether N2S or S2N is used, the principle of giving priority to the end with sparse points is adopted. That is, after determining the first search direction (vertical or horizontal direction), the second search direction is determined according to the sparseness of the marked points in the first search direction. The second search direction is consistent with the direction from sparse to dense marked points. Figure 4 Taking the distribution boundary shown as an example, Figure 4 The lower marking points within the middle boundary are sparsely distributed, while the upper marking points are densely distributed. Therefore, the second search direction is S2N - from bottom to top (or from south to north).
[0060] Note: The Horizontal-strategy process is similar to the Vertical-strategy process, so it will not be described in detail.
[0061] Step 4: Search for marked points within the boundary according to the search range.
[0062] Here, searching for marked points within the boundary according to the search range includes: determining a search direction; selecting a starting marked point on the side of the search direction where the marked points are relatively sparse as an initial search reference point, determining a circular or semicircular search range with the initial search reference point as the center and the search step as the radius, and if the distance from the marked point within the boundary to the center of the circle is less than the radius, determining the marked point as the first marked point within the search range; wherein the search step Step = R + i*L; R represents the reference radius, L is the reference step, i represents the search distance factor, R and L are both constants, and i is a natural number.
[0063] See also Figure 5 After determining the search direction, start to determine the search range 503 with 504 as the center in the boundary 501, draw circles according to the search range 503, and the marked point 502 in the circle is used as the first marked point. The process of drawing circles in this embodiment is: take the starting point 504 on the sparsest side of the search direction as the initial search reference point, and draw circles with the search step (R+i*L) as the dynamic radius. In the search step (R+i*L), R is the reference radius (constant), L is the reference step (constant), and after each search, the search distance factor i=i+1 is set, that is, the search distance is increased.
[0064] Step 5: Generate wiring;
[0065] After searching according to step 4, if the first marking point within the search range satisfies the preset route generation condition, a delivery route including the first marking point is generated. The preset route generation condition here includes at least a first condition and a second condition; if the first marking point satisfies the first condition and the second condition, it is determined that the first marking point satisfies the preset route generation condition, wherein the first condition is that the number of the first marking points is greater than a preset number threshold, and the second condition is that the order product attribute corresponding to the first marking point matches the specification of the corresponding vehicle.
[0066] That is to say, if the number of first marking points is greater than the preset number threshold and the order product attributes corresponding to the first marking points match the specifications of the corresponding vehicle, then a line can be generated. For example, the number of first marking points is 7, the preset number threshold is 6, and after comparison, it is determined that the number of first marking points is greater than the preset number threshold. The specifications (such as length, width and height) of the corresponding vehicle, such as vehicle A, are 490 cm × 200 cm × 240 cm. The specifications of the order products (such as TVs) corresponding to the first marking points are added, and the sum is compared with the vehicle specifications to obtain a comparison result, such as adaptation. Then, based on these two conditions, a line containing the first marking points can be generated.
[0067] In addition, in response to the first marking point not satisfying the preset line generation condition, the search range is adjusted; the marking points within the boundary are searched according to the adjusted search range until the first marking point satisfies the preset line generation condition. That is, more marking points can be selected as the first marking point by expanding the search range, and then it is determined whether the first marking point satisfies the preset line generation condition.
[0068] Step 6: Adjust the search range to search for marked points within the boundary.
[0069] In this embodiment, adjusting the search range includes: adjusting the search reference point and / or search step of the search range; adjusting the search reference point of the search range includes: calculating the center of gravity of a polygon and using the center of gravity as the search reference point of the search range, wherein the vertex of the polygon is the first marking point; adjusting the search step of the search range includes: adding 1 to the search step of the search range.
[0070] See also Figure 6 , indicating the search reference point of the search range is adjusted, that is, the search reference point is adjusted from the original point 504 to point 505. Point 505 is a polygon whose vertices are all the first marking points ( Figure 6 The center of gravity of the triangle).
[0071] It should be noted that, in one embodiment, the search range can be adjusted as follows: Figure 5 and Figure 6 As shown in FIG. 1 , both the search reference point and the search step length are adjusted. In another embodiment, only the search step length may be adjusted without adjusting the search reference point, for example, Figure 5 As shown, the initial search reference point is used as the center of the circle, and the search step size is increased each time the search is performed. This cycle is repeated to search for the marked points within the boundary, and then determine whether the conditions for generating the line arrangement are met. The difference between these two different adjustment methods is that the adjustment method of adjusting both the search reference point and the search step size is suitable for scenarios with sparse point distribution, such as scenarios where the delivery destinations of various orders are far apart, and the generated routes do not overlap. For scenarios with dense and concentrated point distribution, it is easier to use the adjustment method of only adjusting the search step size without adjusting the search reference point to avoid line overlap and optimize the line arrangement effect.
[0072] In addition, after generating a delivery route including a first marking point, the method of this embodiment further includes: filtering the first marking point, redefining the boundary according to the remaining marking points within the boundary, and searching for the marking points within the redefined boundary according to the search range. In practical applications, after generating a route, the first marking point is filtered out to avoid repeated calculations. The boundary is redefined for the remaining points, and the above steps 2 to 6 are performed on the redefined boundary until all marking points are processed and the process ends.
[0073] Thus, the logistics distribution route planning method of this embodiment does not have too many intermediate iteration steps, and the calculation speed is fast. The routing results of thousands of orders can be given within a few seconds, which greatly improves the routing efficiency. Moreover, the method of this embodiment is not sensitive to the data scale, and can easily handle the mixed routing tasks of thousands of orders, simplifying the algorithm parameter setting, saving time and ensuring the routing effect.
[0074] The method of this embodiment further includes, after generating a distribution route including the first marking point: assigning the distribution task associated with the distribution route to the corresponding vehicle in the preset vehicle set. For example, the distribution task associated with the first route is assigned to vehicle A. It should be noted that this embodiment maintains a preset vehicle set, which includes the basic information of multiple vehicles. After each route is generated, the route is assigned to the corresponding vehicle so that the corresponding vehicle can perform the distribution task and complete the logistics distribution. Compared with manual route arrangement, the method of this embodiment reduces the number of routes, improves the full load rate, and reduces the distribution mileage of vehicles on each route.
[0075] In addition to associating vehicles and delivery routes as described above, after generating the delivery route, this embodiment determines the geographical area corresponding to the delivery route, matches the driver suitable for the delivery route based on the geographical area and the acquired driver active area information, and obtains a matching result, wherein the driver active area information is obtained by mining historical delivery data based on the principle of fixed delivery routes using fixed drivers. That is to say, in actual applications, a delivery principle is set, that is, fixed delivery routes use fixed drivers, and historical delivery data within a period of time is mined to determine the driver who frequently delivers to the geographical area corresponding to the generated delivery route, and then the route tasks are assigned to the appropriate driver.
[0076] Therefore, based on data-driven, statistical methods are used to explore drivers' delivery habits and fix drivers to fixed routes. This not only improves the driver's user experience, but more importantly, it allows drivers to significantly improve delivery efficiency based on their familiarity with road conditions.
[0077] The present invention also provides a logistics distribution route planning device, which is based on the same technical concept as the aforementioned logistics distribution route planning method. Figure 7 is a block diagram of a logistics distribution route planning device according to an embodiment of the present application, see Figure 7 , the logistics distribution route planning device 700 includes:
[0078] An acquisition unit 701 is used to acquire an order data set, wherein the order data set includes delivery destination information of multiple orders;
[0079] A marking unit 702, used to generate corresponding marking points according to the delivery destination information of each order;
[0080] A searching unit 703 is configured to determine a boundary of the distribution of the marking points, and search for marking points within the boundary according to a search range to obtain a first marking point within the search range, wherein the search range is determined by a search reference point and a search step size;
[0081] The planning unit 704 is configured to generate a delivery route including the first marking point if the first marking point satisfies a preset route generation condition.
[0082] In one embodiment of the present application, the search unit 703 is also used to adjust the search range in response to the first marking point not satisfying the preset line generation condition; and search for marking points within the boundary based on the adjusted search range until the first marking point satisfies the preset line generation condition.
[0083] In one embodiment of the present application, the search unit 703 is specifically used to adjust the search reference point and / or the search step of the search range; adjusting the search reference point of the search range includes: calculating the center of gravity of the polygon, and using the center of gravity as the search reference point of the search range, wherein the vertex of the polygon is the first marking point; adjusting the search step of the search range includes: adding 1 to the search step of the search range.
[0084] In one embodiment of the present application, the preset route generation conditions include at least a first condition and a second condition; the planning unit 704 is specifically used to determine that the first marking point satisfies the preset route generation conditions if the first marking point satisfies the first condition and the second condition, wherein the first condition is that the number of the first marking points is greater than a preset number threshold, and the second condition is that the order product attributes corresponding to the first marking point match the specifications of the corresponding vehicle.
[0085] In one embodiment of the present application, the search unit 703 is used to locate contour points among the marking points; connect the contour points in sequence to obtain a first polygon, or obtain a minimum circumscribed rectangle based on the contour points connected in sequence, wherein the minimum circumscribed rectangle refers to a rectangle that contains the contour points and is tangent to the contour points; and obtain the boundary based on the first polygon or the minimum circumscribed rectangle.
[0086] In one embodiment of the present application, the search unit 703 is used to search for the marked points within the boundary based on the search range, including: determining a search direction; selecting a starting marked point on the side of the search direction where the marked points are sparser as an initial search reference point, and determining a circular or semicircular search range with the initial search reference point as the center and the search step as the radius; if the distance from the marked point within the boundary to the center of the circle is less than the radius, the marked point is determined to be the first marked point within the search range; wherein the search step Step = R + i*L; R represents the reference radius, L is the reference step, i represents the search distance factor, R and L are both constants, and i is a natural number.
[0087] In one embodiment of the present application, the search unit 703 is used to calculate the difference between the maximum longitude and the minimum longitude of the marked points within the boundary according to the delivery destination information corresponding to the marked points within the boundary to obtain a first difference; calculate the difference between the maximum latitude and the minimum latitude of the marked points within the boundary to obtain a second difference; if the first difference is greater than the second difference, the horizontal direction is determined as the first search direction, and if the first difference is less than or equal to the second difference, the vertical direction is determined as the first search direction; after determining the first search direction, determine the second search direction according to the sparsity of the marked points in the first search direction, wherein the second search direction is consistent with the sparse to dense direction of the marked points.
[0088] In one embodiment of the present application, the search unit 703 is further configured to filter the first marking points, redefine the boundary according to the remaining marking points within the boundary, and search for marking points within the redetermined boundary according to the search range.
[0089] In one embodiment of the present application, the logistics distribution route planning device 700 also includes a vehicle matching unit, which is used to assign the distribution tasks associated with the distribution route to corresponding vehicles in a preset vehicle set.
[0090] In one embodiment of the present application, the logistics distribution route planning device 700 also includes a driver matching unit, which is used to determine the geographical area corresponding to the distribution route after generating the distribution route, and match the driver suitable for the distribution route according to the geographical area and the obtained driver active area information to obtain a matching result, wherein the driver active area information is obtained by mining historical distribution data based on the principle of using fixed drivers for fixed distribution routes.
[0091] about Figure 7 The examples and explanations of the functions performed by the units in the illustrated device are consistent with the examples and explanations in the aforementioned method embodiments, and are not described one by one here.
[0092] It should be noted that:
[0093] The algorithm and display provided herein are not inherently related to any specific computer, virtual device or other equipment. Various general devices can also be used together with the teaching based on this. According to the above description, it is obvious to construct the structure required for this type of device. In addition, the embodiment of the application is not directed to any specific programming language either. It should be understood that various programming languages can be utilized to realize the content of the embodiment of the application described herein, and the description of the above specific language is to disclose the best mode of implementation of the embodiment of the application.
[0094] In the description provided herein, a large number of specific details are described. However, it is understood that the embodiments of the present application can be practiced without these specific details. In some instances, well-known methods, structures and techniques are not shown in detail so as not to obscure the understanding of this description.
[0095] Similarly, it should be understood that in order to streamline the present disclosure and help understand one or more of the various application aspects, in the above description of the exemplary embodiments of the present application, the various features of the embodiments of the present application are sometimes grouped together into a single embodiment, figure, or description thereof. However, the disclosed method should not be interpreted as reflecting the following intention: the claimed embodiments of the present application require more features than the features clearly stated in each claim. More specifically, as reflected in the claims below, the application aspects are less than all the features of the single embodiment disclosed above. Therefore, the claims following the specific embodiment are hereby explicitly incorporated into the specific embodiment, wherein each claim itself serves as a separate embodiment of the present application.
[0096] Those skilled in the art will appreciate that the modules in the devices in the embodiments may be adaptively changed and arranged in one or more devices different from the embodiments. The modules or units or components in the embodiments may be combined into one module or unit or component, and in addition they may be divided into a plurality of submodules or subunits or subcomponents. Except that at least some of such features and / or processes or units are mutually exclusive, all features disclosed in this specification (including the accompanying claims, abstracts and drawings) and all processes or units of any method or device disclosed in this manner may be combined in any combination. Unless otherwise expressly stated, each feature disclosed in this specification (including the accompanying claims, abstracts and drawings) may be replaced by an alternative feature providing the same, equivalent or similar purpose.
[0097] In addition, those skilled in the art will appreciate that, although some embodiments described herein include certain features included in other embodiments but not other features, the combination of features of different embodiments is meant to be within the scope of the embodiments of the present application and to form different embodiments. For example, in the claims below, any one of the claimed embodiments may be used in any combination.
[0098] The various component embodiments of the embodiments of the present application can be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. It should be understood by those skilled in the art that a microprocessor or digital signal processor (DSP) can be used in practice to implement some or all functions of some or all components in the page performance test device according to the embodiments of the present application. The application can also be implemented as a device or device program (e.g., computer program and computer program product) for performing a part or all of the methods described herein. Such a program implementing the embodiments of the present application can be stored on a computer-readable medium, or can have the form of one or more signals. Such a signal can be downloaded from an Internet website, or provided on a carrier signal, or provided in any other form.
[0099] For example, Figure 8 It is a schematic diagram of the structure of an electronic device of an embodiment of the present application. The electronic device 800 includes: a processor 801, and a memory 802 storing a computer program that can be run on the processor 801. The processor 801 is used to execute the steps of the method in the embodiment of the present application when executing the computer program in the memory 802. The memory 802 can be an electronic memory such as a flash memory, an EEPROM (electrically erasable programmable read-only memory), an EPROM, a hard disk or a ROM. The memory 802 has a storage space 803 for storing a computer program 804 for executing any method step in the above method. The computer program 804 can be read from or written to one or more computer program products. These computer program products include program code carriers such as hard disks, compact disks (CDs), memory cards or floppy disks. Such computer program products are typically, for example Fig. 9 Non-transitory computer-readable storage medium shown.
[0100] Fig. 99 is a schematic diagram of the structure of a non-transitory computer-readable storage medium of an embodiment of the present application. The computer-readable storage medium 900 stores a computer program 804 for executing the method steps according to the embodiment of the present application, which can be read by the processor 801 of the electronic device 800. When the computer program 804 is executed by the electronic device 800, the electronic device 800 executes the various steps in the method described above. Specifically, the computer program 804 stored in the computer-readable storage medium can execute the method shown in any of the above embodiments. The computer program 804 can be compressed in an appropriate form.
[0101] It should be noted that the above embodiments illustrate rather than limit the embodiments of the present application, and that those skilled in the art may design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference symbol between brackets should not be constructed as a limitation on the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "one" or "an" preceding an element does not exclude the presence of multiple such elements. The embodiments of the present application may be implemented by means of hardware including several different elements and by means of appropriately programmed computers. In a unit claim that lists several devices, several of these devices may be embodied by the same hardware item. The use of the words, second, and third, etc. does not indicate any order, and these words may be interpreted as names.
Claims
1. A logistics distribution route planning method, characterized in that: include: Acquire an order data set, wherein the order data set includes delivery destination information of multiple orders; Generate corresponding marking points according to the delivery destination information of each order; Determine a boundary of the distribution of the marking points, search for marking points within the boundary according to a search range, and obtain a first marking point within the search range, wherein the search range is determined by a search reference point and a search step size; If the first marking point satisfies a preset route generation condition, generating a delivery route including the first marking point; Determining the boundary of the distribution of the marking points includes: Locate the contour points among the marking points; connect the contour points in sequence to obtain a first polygon, or obtain a minimum circumscribed rectangle based on the contour points connected in sequence, wherein the minimum circumscribed rectangle refers to a rectangle that contains the contour points and is tangent to the contour points; obtain the boundary according to the first polygon or the minimum circumscribed rectangle; The step of searching for the marked points within the boundary according to the search range includes: Determine the search direction; A starting marking point on the side with fewer marking points in the search direction is selected as the initial search reference point, and a circular or semicircular search range is determined with the initial search reference point as the center and the search step as the radius. If the distance from the marking point within the boundary to the center of the circle is less than the radius, the marking point is determined to be the first marking point within the search range; wherein the search step Step = R + i*L; R represents the reference radius, L is the reference step, i represents the search distance factor, R and L are both constants, and i is a natural number.
2. The method according to claim 1, characterized in that The method further includes: In response to the first marking point not satisfying a preset line generation condition, adjusting the search range; The marked points within the boundary are searched according to the adjusted search range until the first marked points meet the preset line generation condition.
3. The method according to claim 2, characterized in that The adjusting the search range includes: adjusting the search reference point and / or the search step length of the search range; Adjusting the search reference point of the search range includes: calculating the centroid of a polygon and using the centroid as the search reference point of the search range, wherein the vertex of the polygon is the first marking point; Adjusting the search step size of the search range includes: adding 1 to the search step size of the search range.
4. The method according to claim 3, characterized in that The preset line generation condition includes at least a first condition and a second condition; If the first marking point satisfies the first condition and the second condition, it is determined that the first marking point satisfies a preset line generation condition, The first condition is that the number of the first marking points is greater than a preset number threshold. The second condition is that the order product attribute corresponding to the first marking point matches the specification of the corresponding vehicle.
5. The method according to claim 1, characterized in that Determining the search direction includes: According to the delivery destination information corresponding to the marked points within the boundary, the difference between the maximum longitude and the minimum longitude among the marked points within the boundary is calculated to obtain a first difference; Calculate the difference between the maximum latitude and the minimum latitude of the marked points within the boundary to obtain a second difference; If the first difference is greater than the second difference, the horizontal direction is determined as the first search direction; if the first difference is less than or equal to the second difference, the vertical direction is determined as the first search direction; After determining the first search direction, determine the second search direction according to the sparsity of the marking points in the first search direction, wherein the second search direction is consistent with the direction from sparse to dense marking points.
6. The method according to claim 1 or 2, characterized in that: After generating the delivery route including the first marking point, the method further includes: The first marking point is filtered, the boundary is redetermined according to the remaining marking points within the boundary, and the marking points within the redetermined boundary are searched according to the search range.
7. The method according to claim 1 or 2, characterized in that: After generating the delivery route including the first marking point, the method further includes: The delivery tasks associated with the delivery route are assigned to corresponding vehicles in the preset vehicle set.
8. The method according to claim 1 or 2, characterized in that: After generating the delivery route including the first marking point, the method further includes: after generating the delivery route, determining a geographical area corresponding to the delivery route, According to the geographic area and the obtained driver active area information, a driver suitable for the delivery route is matched to obtain a matching result, wherein the driver active area information is obtained by mining historical delivery data based on the principle of using fixed drivers for fixed delivery routes.
9. A logistics distribution route planning device, characterized in that: The device includes: An acquisition unit, used to acquire an order data set, wherein the order data set includes delivery destination information of multiple orders; A marking unit, used to generate corresponding marking points according to the delivery destination information of each order; A search unit, configured to determine a boundary of the distribution of the marking points, search for marking points within the boundary according to a search range, and obtain a first marking point within the search range, wherein the search range is determined by a search reference point and a search step size; Determining the boundary of the distribution of the marker points includes: locating contour points among the marker points; sequentially connecting the contour points to obtain a first polygon, or obtaining a minimum circumscribed rectangle based on the contour points connected in sequence, wherein the minimum circumscribed rectangle refers to a rectangle that contains the contour points and is tangent to the contour points; obtaining the boundary according to the first polygon or the minimum circumscribed rectangle; The step of searching for the marked point within the boundary according to the search range includes: determining a search direction; selecting a starting marked point on the side of the search direction where the marked points are sparser as an initial search reference point, determining a circular or semicircular search range with the initial search reference point as the center and the search step as the radius, and if the distance from the marked point within the boundary to the center is less than the radius, determining the marked point as the first marked point within the search range; wherein the search step Step = R + i * L; R represents the reference radius, L is the reference step, i represents the search distance factor, R and L are both constants, and i is a natural number; A planning unit is configured to generate a delivery route including the first marking point if the first marking point satisfies a preset route generation condition.
10. An electronic device, characterized in that: The electronic device comprises: a processor, and a memory storing a computer program executable on the processor; wherein the processor is configured to execute the steps of the method according to any one of claims 1 to 8 when executing the computer program in the memory.
11. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 8 are implemented.
