CN107085754B - Information output method and device - Google Patents
Information output method and device Download PDFInfo
- Publication number
- CN107085754B CN107085754B CN201710264864.8A CN201710264864A CN107085754B CN 107085754 B CN107085754 B CN 107085754B CN 201710264864 A CN201710264864 A CN 201710264864A CN 107085754 B CN107085754 B CN 107085754B
- Authority
- CN
- China
- Prior art keywords
- node
- leaf
- root
- leaf node
- closest
- 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.)
- Active
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
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application discloses an information output method and device. One embodiment of the method comprises: acquiring position information and historical distribution information of at least one node for constructing a circuit diagram, wherein the at least one node comprises: a root node, at least one transit node, and at least one first leaf node; connecting each transit node to a root node; for each first leaf node, determining a transfer node closest to the first leaf node according to the position information of at least one node, and determining a first arrival time from a root node to the first leaf node through the transfer node closest to the root node; if the first arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the first leaf node, otherwise, connecting the first leaf node to the root node; and outputting the route graph distributed to each node from the root node according to the connection relation among the nodes. This embodiment enables outputting a route pattern with high distribution efficiency and low distribution cost.
Description
Technical Field
The application relates to the technical field of computers, in particular to the field of logistics application, and particularly relates to an information output method and device.
Background
The logistics distribution service has become the most core industry link of China electronic commerce, and a comprehensive and complete logistics distribution solution can be provided, so that the logistics distribution service also becomes a problem which needs to be concerned by many small and medium-sized sellers and brand merchants of electronic commerce suppliers. A logistics distribution network is a collection of organizations and facilities that are interrelated in the distribution process. Its ultimate goal is to satisfy the end customer, thereby achieving value and enhancing the capabilities of the supply chain as a whole.
The structure of the distribution network determines that the tasks assumed by the nodes at different levels throughout the distribution network are different. The reasonable determination of the distribution route is that the goods are transported to the hands of the user at the fastest speed through the least links by using the least power, the shortest mileage and the least cost. The influence of reasonably planning the delivery route on the delivery cost is much larger than that of general transportation, so that an efficient delivery route needs to be made on the basis of a comprehensive plan so as to reduce the delivery cost and improve the customer experience.
Disclosure of Invention
The present application aims to provide an information output method and apparatus to solve the technical problems mentioned in the background section above.
In a first aspect, an embodiment of the present application provides an information output method, where the method includes: acquiring position information and historical distribution information of at least one node for constructing a circuit diagram, wherein the at least one node comprises: the system comprises a root node, at least one transit node and at least one first leaf node, wherein the root node is a starting node of each line in the line graph, the first leaf node is a termination node of the line arriving in a preset first distribution time range in the line graph, and the transit node is a node for connecting the root node and each leaf node; connecting each transit node to a root node; for each first leaf node, determining a transfer node closest to the first leaf node according to the position information of at least one node, and determining a first arrival time of the first leaf node from a root node to the first leaf node through the closest transfer node according to the historical distribution information of at least one node; if the first arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the first leaf node; otherwise, connecting the first leaf node to the root node; and outputting the route graph distributed to each node from the root node according to the connection relation between at least one node.
In some embodiments, the at least one node further comprises at least one second leaf node, the second leaf node being a termination node of a line in the line graph that arrives within a preset second delivery time range; and before outputting the routing graph distributed from the root node to each node according to the connection relation between at least one node, the method further comprises the following steps: for each second leaf node, performing the steps of: acquiring the connection relation between each second blade node and at least one node; determining a second leaf node which is directly or indirectly connected with the root node and is closest to the second leaf node according to the position information of at least one node and the connection relation, and determining a second arrival time which is distributed from the root node to the second leaf node through the second leaf node closest to the root node according to the historical distribution information of at least one node; if the second arrival time is within the second distribution time range, connecting the second leaf node to a second leaf node closest to the second leaf node; otherwise, determining a transit node closest to the second leaf node according to the position information of at least one node, and determining a third arrival time from the root node to the second leaf node through the transit node closest to the root node according to the historical delivery information of at least one node; and if the third arrival time is within the second distribution time range, connecting the second leaf node to the transfer node closest to the third arrival time, and otherwise, connecting the second leaf node to the root node.
In some embodiments, before outputting the wire graph distributed from the root node to each node according to the connection relationship between at least one node, the method further includes: for each first leaf node not connected to a second leaf node, performing the steps of: determining a first leaf node closest to the first leaf node according to the position information of at least one node, and determining a fourth arrival time of the first leaf node distributed from the root node to the first leaf node through the first leaf node closest to the first leaf node according to the historical distribution information of at least one node; if the fourth arrival time is within the first distribution time range, connecting the first leaf node to the first leaf node closest to the fourth arrival time; otherwise, determining a transit node closest to the first leaf node according to the position information of at least one node, and determining a fifth arrival time from the root node to the first leaf node through the transit node closest to the first leaf node according to the historical delivery information of at least one node; and if the fifth arrival time is within the first distribution time range, connecting the first leaf node to the nearest transit node, otherwise, connecting the first leaf node to the root node.
In some embodiments, the method further comprises: forming at least one first leaf node and/or at least one second leaf node into a sub-node set; for each child node in the set of child nodes, performing the steps of: determining the distance between the child node and each transfer node and the distance between the child node and the root node according to the position information of at least one node; sequencing all the transfer nodes according to the sequence of the distances from small to large to obtain at least one sequenced transfer node; selecting a transfer node closest to the child node from the sorted at least one transfer node; if the distance between the nearest transit node and the child node is equal to the distance between the root node and the child node, connecting the child node to the root node; otherwise, for each non-nearest transit node, determining whether the side length and the angle of a triangle formed by the transit node, the root node and the child node meet a predetermined first condition or a second condition, and if the side length and the angle meet the first condition or the second condition, connecting the child node to the transit node.
In some embodiments, the first condition comprises: the side length of the edge formed by the root node and the child node is greater than or equal to the side length of the edge formed by the root node and the transfer node; and the included angle between the edge formed by the child node and the transfer node and the edge formed by the root node and the transfer node is larger than a preset angle; and the sum of the side length of the edge formed by the child node and the transfer node and the side length of the edge formed by the root node and the transfer node is smaller than the product of the side length of the edge formed by the root node and the child node and a first coefficient, wherein the first coefficient is larger than 1.
In some embodiments, the second condition comprises: the side length of the edge formed by the root node and the child node is smaller than that of the edge formed by the root node and the transfer node; and the side length of the edge formed by the child node and the transfer node is less than the product of the side length of the edge formed by the root node and the transfer node and a second coefficient, wherein the second coefficient is more than 0 and less than 1.
In a second aspect, an embodiment of the present application provides an information output apparatus, including: an obtaining unit, configured to obtain location information and historical delivery information of at least one node used for constructing a routing graph, where the at least one node includes: the system comprises a root node, at least one transit node and at least one first leaf node, wherein the root node is a starting node of each line in the line graph, the first leaf node is a termination node of the line arriving in a preset first distribution time range in the line graph, and the transit node is a node for connecting the root node and each leaf node; a first connection unit for connecting each of the transit nodes to a root node; the second connection unit is used for determining a transit node closest to the first leaf node according to the position information of at least one node and determining first arrival time of the transit node closest to the first leaf node from the root node according to the historical delivery information of at least one node; if the first arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the first leaf node; otherwise, connecting the first leaf node to the root node; and the output unit is used for outputting the circuit diagram distributed to each node from the root node according to the connection relation among at least one node.
In some embodiments, the at least one node further comprises at least one second leaf node, the second leaf node being a termination node of a line in the line graph that arrives within a preset second delivery time range; and the apparatus further comprises: a third connection unit for, for each second leaf node, performing the steps of: acquiring the connection relation between each second blade node and at least one node; determining a second leaf node which is directly or indirectly connected with the root node and is closest to the second leaf node according to the position information of at least one node and the connection relation, and determining a second arrival time which is distributed from the root node to the second leaf node through the second leaf node closest to the root node according to the historical distribution information of at least one node; if the second arrival time is within the second distribution time range, connecting the second leaf node to a second leaf node closest to the second leaf node; otherwise, determining a transit node closest to the second leaf node according to the position information of at least one node, and determining a third arrival time from the root node to the second leaf node through the transit node closest to the root node according to the historical delivery information of at least one node; and if the third arrival time is within the second distribution time range, connecting the second leaf node to the transfer node closest to the third arrival time, and otherwise, connecting the second leaf node to the root node.
In some embodiments, the apparatus further comprises: a fourth connecting unit, configured to, for each first leaf node that is not connected to the second leaf node, perform the following steps: determining a first leaf node closest to the first leaf node according to the position information of at least one node, and determining a fourth arrival time of the first leaf node distributed from the root node to the first leaf node through the first leaf node closest to the first leaf node according to the historical distribution information of at least one node; if the fourth arrival time is within the first distribution time range, connecting the first leaf node to the first leaf node closest to the fourth arrival time; otherwise, determining a transit node closest to the first leaf node according to the position information of at least one node, and determining a fifth arrival time from the root node to the first leaf node through the transit node closest to the first leaf node according to the historical delivery information of at least one node; and if the fifth arrival time is within the first distribution time range, connecting the first leaf node to the nearest transit node, otherwise, connecting the first leaf node to the root node.
In some embodiments, the apparatus further comprises: a fifth connecting unit, configured to combine at least one first leaf node and/or at least one second leaf node into a set of child nodes; for each child node in the set of child nodes, performing the steps of: determining the distance between the child node and each transfer node and the distance between the child node and the root node according to the position information of at least one node; sequencing all the transfer nodes according to the sequence of the distances from small to large to obtain at least one sequenced transfer node; selecting a transfer node closest to the child node from the sorted at least one transfer node; if the distance between the nearest transit node and the child node is equal to the distance between the root node and the child node, connecting the child node to the root node; otherwise, for each non-nearest transit node, determining whether the side length and the angle of a triangle formed by the transit node, the root node and the child node meet a predetermined first condition or a second condition, and if the side length and the angle meet the first condition or the second condition, connecting the child node to the transit node.
In a third aspect, an embodiment of the present application provides an apparatus, including: one or more processors; storage means for storing one or more programs which, when executed by one or more processors, cause the one or more processors to carry out a method according to any one of the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the method according to any one of the first aspect.
According to the information output method provided by the embodiment of the application, the position information and the historical distribution information of at least one node for constructing the route graph are analyzed, the distribution path with the lowest cost among the nodes meeting the distribution timeliness is determined, and the route graph from the root node to each leaf node is output, so that the logistics distribution efficiency is improved and the distribution cost is reduced while the distribution timeliness is guaranteed.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture diagram in which the present application may be applied;
FIG. 2 is a flow diagram of one embodiment of an information output method according to the present application;
FIG. 3 is a schematic diagram of an application scenario of an information output method according to the present application;
FIG. 4 is a flow chart of yet another embodiment of an information output method according to the present application;
fig. 5 is a schematic diagram of still another application scenario of an information output method according to the present application;
FIG. 6 is a schematic block diagram of an embodiment of an information output apparatus according to the present application;
FIG. 7 is a block diagram of a computer system suitable for use in implementing a server according to embodiments of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 shows an exemplary system architecture 100 to which embodiments of the information output method or information output apparatus of the present application may be applied.
As shown in fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal apparatuses 101, 102, and 103 may store location information and historical delivery information of each node.
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting wire-graph browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server providing various services, such as a background roadmap server providing support for roadmaps displayed on the terminal devices 101, 102, 103. The background wire-graph server may analyze and perform other processing on the received data such as the location information and the historical delivery information of each node, and feed back a processing result (e.g., a re-planned wire graph) to the terminal device.
It should be noted that the information output method provided in the embodiment of the present application is generally executed by the server 105, and accordingly, the information output apparatus is generally disposed in the server 105.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
With continued reference to FIG. 2, a flow 200 of one embodiment of an information output method according to the present application is shown. The information output method comprises the following steps:
In this embodiment, an electronic device (for example, a server shown in fig. 1) on which the information output method operates may obtain, through a terminal in which information of each node is stored in a wired connection manner or a wireless connection manner, location information and historical delivery information of at least one node used for constructing a routing graph, where the at least one node includes: the system comprises a root node, at least one transit node and at least one first leaf node, wherein the root node is a starting node of each line in the line graph, the first leaf node is a termination node of the line arriving in a preset first distribution time range in the line graph, and the transit node is a node for connecting the root node and each leaf node. The route map is a delivery route map in the logistics distribution process. The node is a corresponding coordinate point of the logistics warehouse on the delivery route map. The location information is actual geographical location information of a corresponding logistics warehouse of the node, for example, western stations in beijing. The historical delivery information may include the items delivered, the route, the time, the frequency of delivery, etc. If the content of the historical delivery information is more, the historical delivery information of the latest period can be taken, for example, the current month is October, and the historical delivery information of September can be adopted. The first delivery time is the expected latest arrival time, e.g., 9 am the second day.
In this embodiment, each transit node is connected to a root node to ensure that the start node of each line of the line graph to be constructed is the root node.
In this embodiment, the distance is not a straight line distance between nodes, but an actual distribution route distance between the real geographical locations of two nodes. For example, the first leaf node a and the transit node B are expected to cross the river, and although the straight line distance is closest, since a and B are not connected by a bridge, the delivery vehicle cannot directly cross the river and needs to bypass the transit node C to cross the river, and the transit node C is the transit node closest to the first leaf node a.
In this embodiment, since the delivery is generally delivered at a fixed time point every day, not at any time, it is necessary to refer to the historical delivery information to determine the actual delivery time. For example, a good arrives at the root node at 8 pm, and the historical delivery information records that the fastest delivery can be made from the root node to the transit node at 10 pm and from the transit node to the first leaf node at 8 am. And determining the first arrival time as 8 o' clock in the next morning according to the latest distribution time point.
In this embodiment, it is determined whether the first arrival time is within the first delivery time range based on the first arrival time determined in step 204. For example, the first delivery time is 9 am on the second day, and the first arrival time in the above example is 8 am on the second day, where the first arrival time is within the first delivery time range.
In this embodiment, if the first arrival time is within the first distribution time range, the first leaf node is connected to the relay node closest to the first leaf node. Because the timeliness requirement can be met, goods do not need to be directly picked up from the root node, the distribution pressure of the root node can be relieved by shunting and distributing the transit nodes, and the distribution timeliness can be guaranteed.
In this embodiment, if the first arrival time is not within the first delivery time range, the first leaf node is connected to the root node. Therefore, the distribution time is saved by no passing through any transfer node, and the distribution timeliness is ensured.
In step 208, it is determined whether the first leaf node is traversed.
In this embodiment, step 203-.
In some optional implementations of this embodiment, for each first leaf node that is not connected to a second leaf node (the second leaf node is a termination node of a line arriving within a preset second delivery time range in the line graph), the following steps are performed: determining a first leaf node closest to the first leaf node according to the position information of at least one node, and determining a fourth arrival time of the first leaf node distributed from the root node to the first leaf node through the first leaf node closest to the first leaf node according to the historical distribution information of at least one node; if the fourth arrival time is within the first distribution time range, connecting the first leaf node to the first leaf node closest to the fourth arrival time; otherwise, determining a transit node closest to the first leaf node according to the position information of at least one node, and determining a fifth arrival time from the root node to the first leaf node through the transit node closest to the first leaf node according to the historical delivery information of at least one node; and if the fifth arrival time is within the first distribution time range, connecting the first leaf node to the nearest transit node, otherwise, connecting the first leaf node to the root node. And sequentially determining the distribution time according to the sequence of the first leaf node, the transit node and the root node, and sharing the distribution pressure of the upper-level node as much as possible.
And 209, outputting the route graph distributed to each node from the root node according to the connection relation between at least one node.
In this embodiment, each line in the distribution graph starts from the root node and ends at the first leaf node, part of the first leaf nodes are directly connected with the root node, and part of the first leaf nodes are indirectly connected with the root node through the transit node. Since the distribution route is re-planned, the time from the root node to each first leaf node also needs to be updated according to the newly generated route map.
With continued reference to fig. 3, fig. 3 is a schematic diagram of an application scenario of the information output method according to the present embodiment. In the application scenario of fig. 3, the server may obtain a map including information of nodes of the distribution network, where the map includes a root node 301, transit nodes 302, 303, and 304, and leaf nodes 305, 306, 307, and 308. Determining that the leaf nodes 305, 306, 307 are connected to the transit node based on the historical delivery information and the location information may ensure that the first arrival time of the delivery to the leaf nodes is within the first delivery time range. The leaf node 308 is too far from the root node 301 to guarantee timely arrival if the distribution is performed via the transit node, so the leaf node 308 is directly connected to the root node 301. The distribution personnel may distribute the goods to the leaf nodes 305, 306, 307, 308 according to the routes shown in fig. 3.
According to the method provided by the embodiment of the application, the transit node which is closest to the first leaf node and is guaranteed to be time-efficient is selected according to the position information and the historical distribution information of each node, so that the pressure and the distribution cost of the root node are reduced. If no suitable transfer node exists, the data is directly distributed to the first leaf node from the root node to ensure the distribution timeliness, so that a low-cost and efficient distribution route is output.
With further reference to fig. 4, a flow 400 of yet another embodiment of an information output method is shown. The process 400 of the information output method includes the following steps:
In the present embodiment, the second leaf node is a termination node of a line arriving within a preset second delivery time range in the line graph. The second delivery time is later than the first delivery time, for example, if the first delivery time is 9 am on the second day, the second delivery time may be 9 am on the third day or 9 am on the fourth day. The method of step 401 is substantially the same as that of step 201, and therefore is not described in detail.
And 402, acquiring the connection relation between each second blade node and at least one node.
In the present embodiment, the connection relationship between each second leaf node and at least one node can be obtained based on step 201 and 206. That is, the connection relationship between the second leaf node and the first leaf node, the transit node, and the root node can be determined.
And step 403, traversing the second leaf node, and determining a second leaf node which is directly or indirectly connected with the root node and has the closest distance to the second leaf node according to the position information and the connection relation of at least one node.
In this embodiment, based on the connection relationship between each second leaf node and at least one node obtained in step 402, a second leaf node that has been directly or indirectly connected to the root node may be determined, and for each second leaf node that has not been connected, a second leaf node that has been connected to the root node and is closest to the unconnected second leaf node may be determined.
In this embodiment, since the delivery is generally delivered at a fixed time point every day, and is not delivered at any time, it is necessary to refer to the historical delivery information to determine the actual delivery time. For example, a piece of goods arrives at the root node at 8 pm, the historical delivery information records that the goods can be delivered from the root node to the second leaf node closest to the root node at 10 pm recently, and the goods can be delivered to the second leaf node unconnected to the root node at 8 am on the third day. And determining the second arrival time as 8 am on the third day according to the latest distribution time point.
In this embodiment, it is determined whether the second arrival time is within the second delivery time range based on the second arrival time determined in step 404. For example, the second delivery time is 9 am on the third day, and the second arrival time in the above example is 8 am on the third day, where the second arrival time is within the second delivery time range.
In the present embodiment, if the second arrival time is within the second distribution time range, the second leaf node is connected to the second leaf node closest in distance. Because the timeliness requirement can be met, goods do not need to be directly picked up from the transit node, the distribution pressure of the transit node can be relieved by shunting and distributing other second blade nodes, and the distribution timeliness can be guaranteed.
In this embodiment, if the second arrival time is not within the second distribution time range, it needs to further determine whether the first leaf node is connected to the transit node or the root node, so that the third arrival time distributed by the transit node needs to be calculated in advance.
In this embodiment, it is determined whether the third arrival time is within the second delivery time range based on the third arrival time determined in step 407. For example, the second delivery time is 9 am on the third day, and the third arrival time in the above example is 8 am on the third day, where the third arrival time is within the second delivery time range.
In the present embodiment, if the third arrival time is within the second distribution time range, the second leaf node is connected to the relay node closest to the second leaf node. Because the timeliness requirement can be met, goods do not need to be directly picked up from the root node, the distribution pressure of the root node can be relieved by shunting and distributing the transit nodes, and the distribution timeliness can be guaranteed.
The second leaf node is connected to the root node, step 410.
In this embodiment, if the third arrival time is not within the second distribution time range, the second leaf node is connected to the root node. Therefore, the distribution time is saved by no passing through any transfer node, and the distribution timeliness is ensured.
In this embodiment, the step 403 and the step 410 need to be performed for each second leaf node, and the step 412 is not performed until a connection root node or a transit node is selected for each second leaf node.
And step 412, outputting the route graph distributed to each node from the root node according to the connection relation among at least one node.
In this embodiment, each line in the distribution graph starts from a root node and terminates at a first leaf node or a second leaf node, a part of the first leaf nodes are directly connected with the root node, a part of the first leaf nodes are indirectly connected with the root node via a transit node, a part of the second leaf nodes are directly connected with the root node, a part of the second leaf nodes are indirectly connected with the root node via the transit node, and a part of the second leaf nodes are connected with the transit node and the root node via the first leaf node or the second leaf node. Since the distribution route is re-planned, the time from the root node to each of the first leaf node and the second leaf node also needs to be updated according to the newly generated route map.
In some optional implementations of this embodiment, the method further includes: forming at least one first leaf node and/or at least one second leaf node into a sub-node set; for each child node in the set of child nodes, performing the steps of: determining the distance between the child node and each transfer node and the distance between the child node and the root node according to the position information of at least one node; sequencing all the transfer nodes according to the sequence of the distances from small to large to obtain at least one sequenced transfer node; selecting a transfer node closest to the child node from the sorted at least one transfer node; if the distance between the nearest transit node and the child node is equal to the distance between the root node and the child node, connecting the child node to the root node; otherwise, for each non-nearest transit node, determining whether the side length and the angle of a triangle formed by the transit node, the root node and the child node meet a predetermined first condition or a second condition, and if the side length and the angle meet the first condition or the second condition, connecting the child node to the transit node.
In some optional implementations of this embodiment, the first condition includes: the side length of the edge formed by the root node and the child node is greater than or equal to the side length of the edge formed by the root node and the transfer node; and the included angle between the edge formed by the child node and the transfer node and the edge formed by the root node and the transfer node is larger than a preset angle; and the sum of the side length of the edge formed by the child node and the transfer node and the side length of the edge formed by the root node and the transfer node is smaller than the product of the side length of the edge formed by the root node and the child node and a first coefficient, wherein the first coefficient is larger than 1.
As shown in FIG. 5, the selection is made to connect to the root node via a transit nodeIn turn, the child node C503 is required to be closer to the transit node B502, and the child node C503 is outside the circle centered on the root node a501 and having a radius of the length of the line segment AB. If C is the child node 503, then &inthe graph>45。The 45 degree angle is a parameter and represents the division range, and it is needless to say that angles larger than 45 degrees, such as 60 degrees, may be selected, but in order to reduce the distribution pressure of the root node, the angles are reduced as much as possible. Although an angle of 45 degrees is defined, if the nearest relay node of the child node is determined to be a relay node after sorting, the nearest relay node cannot be too far away from the relay node, and the first coefficient may be 1.6 times.
In some optional implementations of this embodiment, the second condition includes: the side length of the edge formed by the root node and the child node is smaller than that of the edge formed by the root node and the transfer node; and the side length of the edge formed by the child node and the transfer node is less than the product of the side length of the edge formed by the root node and the transfer node and a second coefficient, wherein the second coefficient is more than 0 and less than 1.
As shown in fig. 5, when selecting connection with the root node via the transit node, it is required that the child node C503 is closer to the root node a501, but if the nearest transit node of the child node C503 is determined as the current transit node, it is also necessary to ensure that the transportation route of the cargo cannot be too far away, and it is necessary to limit the transportation route to the inside of a circle having the transit node as the center and having a radius of a second coefficient x the length of the line segment AB, and the second coefficient may be 0.5.
As can be seen from fig. 4, compared with the embodiment corresponding to fig. 2, the flow 400 of the information output method in the present embodiment highlights the step of determining the distribution from the root node to the second leaf node. Therefore, the scheme described in the embodiment can introduce more leaf nodes, so that more comprehensive route planning and more effective distribution are realized.
With further reference to fig. 6, as an implementation of the methods shown in the above-mentioned figures, the present application provides an embodiment of an information output apparatus, which corresponds to the method embodiment shown in fig. 2, and which is particularly applicable to various electronic devices.
As shown in fig. 6, the information output apparatus 600 of the present embodiment includes: an acquisition unit 601, a first connection unit 602, a second connection unit 603, and an output unit 604. The obtaining unit 601 is configured to obtain location information and historical delivery information of at least one node used for constructing a routing graph, where the at least one node includes: the route distribution method comprises a root node, at least one transit node and at least one first leaf node, wherein the root node is a starting node of each route in the route graph, the first leaf node is a termination node of routes arriving in a preset first distribution time range in the route graph, and the transit node is a node for connecting the root node and each leaf node; a first connection unit 602 is configured to connect each transit node to the root node; the second connecting unit 603 is configured to, for each first leaf node, determine, according to the location information of the at least one node, a transit node closest to the first leaf node, and determine, according to the historical delivery information of the at least one node, a first arrival time at which the node is delivered from the root node to the first leaf node via the closest transit node; if the first arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the first leaf node; otherwise, connecting the first leaf node to the root node; the output unit 604 is configured to output the wire graph distributed from the root node to each node according to the connection relationship between the at least one node.
In this embodiment, specific processing of the acquisition unit 601, the first connection unit 602, the second connection unit 603, and the output unit 604 of the information output apparatus 600 may refer to step 201, step 202, step 203, step 204 in the corresponding embodiment of fig. 2.
In some optional implementations of this embodiment, the at least one node further includes at least one second leaf node, and the second leaf node is a termination node of a line arriving within a preset second delivery time range in the line graph; and the apparatus 600 further comprises: a third connection unit for, for each second leaf node, performing the steps of: acquiring the connection relation between each second blade node and at least one node; determining a second leaf node which is directly or indirectly connected with the root node and is closest to the second leaf node according to the position information and the connection relation of at least one node, and determining second arrival time which is distributed from the root node to the second leaf node through the second leaf node closest to the root node according to the historical distribution information of at least one node; if the second arrival time is within the second distribution time range, connecting the second leaf node to a second leaf node closest to the second leaf node; otherwise, determining a transit node closest to the second leaf node according to the position information of at least one node, and determining a third arrival time from the root node to the second leaf node through the transit node closest to the root node according to the historical delivery information of at least one node; and if the third arrival time is within the second distribution time range, connecting the second leaf node to the transfer node closest to the third arrival time, and otherwise, connecting the second leaf node to the root node.
In some optional implementations of this embodiment, the apparatus 600 further includes: a fourth connecting unit, configured to, for each first leaf node that is not connected to the second leaf node, perform the following steps: determining a first leaf node closest to the first leaf node according to the position information of at least one node, and determining a fourth arrival time of the first leaf node distributed from the root node to the first leaf node through the first leaf node closest to the first leaf node according to the historical distribution information of at least one node; if the fourth arrival time is within the first distribution time range, connecting the first leaf node to the first leaf node closest to the fourth arrival time; otherwise, determining a transit node closest to the first leaf node according to the position information of at least one node, and determining a fifth arrival time from the root node to the first leaf node through the transit node closest to the first leaf node according to the historical delivery information of at least one node; and if the fifth arrival time is within the first distribution time range, connecting the first leaf node to the nearest transit node, otherwise, connecting the first leaf node to the root node.
In some optional implementations of this embodiment, the apparatus 600 further includes: a fifth connecting unit, configured to combine at least one first leaf node and/or at least one second leaf node into a set of child nodes; for each child node in the set of child nodes, performing the steps of: determining the distance between the child node and each transfer node and the distance between the child node and the root node according to the position information of at least one node; sequencing all the transfer nodes according to the sequence of the distances from small to large to obtain at least one sequenced transfer node; selecting a transfer node closest to the child node from the sorted at least one transfer node; if the distance between the nearest transit node and the child node is equal to the distance between the root node and the child node, connecting the child node to the root node; otherwise, for each non-nearest transit node, determining whether the side length and the angle of a triangle formed by the transit node, the root node and the child node meet a predetermined first condition or a second condition, and if the side length and the angle meet the first condition or the second condition, connecting the child node to the transit node.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use in implementing a server according to embodiments of the present application. The terminal device/server shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program, when executed by a Central Processing Unit (CPU)701, performs the above-described functions defined in the method of the present application. It should be noted that the computer readable medium described herein can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present application may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes an acquisition unit, a first connection unit, a second connection unit, and an output unit. Here, the names of the units do not constitute a limitation to the unit itself in some cases, and for example, the acquisition unit may also be described as a "unit that acquires the location information and the historical delivery information of at least one node used to construct the route map".
As another aspect, the present application also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be present separately and not assembled into the device. The computer readable medium carries one or more programs which, when executed by the apparatus, cause the apparatus to: acquiring position information and historical distribution information of at least one node for constructing a circuit diagram, wherein the at least one node comprises: the system comprises a root node, at least one transit node and at least one first leaf node, wherein the root node is a starting node of each line in the line graph, the first leaf node is a termination node of the line arriving in a preset first distribution time range in the line graph, and the transit node is a node for connecting the root node and each leaf node; connecting each transit node to a root node; for each first leaf node, determining a transfer node closest to the first leaf node according to the position information of at least one node, and determining a first arrival time of the first leaf node from a root node to the first leaf node through the closest transfer node according to the historical distribution information of at least one node; if the first arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the first leaf node; otherwise, connecting the first leaf node to the root node; and outputting the route graph distributed to each node from the root node according to the connection relation between at least one node.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by a person skilled in the art that the scope of the invention as referred to in the present application is not limited to the embodiments with a specific combination of the above-mentioned features, but also covers other embodiments with any combination of the above-mentioned features or their equivalents without departing from the inventive concept. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (8)
1. An information output method, characterized in that the method comprises:
acquiring position information and historical delivery information of at least one node for constructing a route graph, wherein the at least one node comprises: the node comprises a root node, at least one relay node and at least one first leaf node, wherein the root node is a starting node of each line in the line graph, the first leaf node is a termination node of the line arriving within a preset first distribution time range in the line graph, the relay node is a node for connecting the root node and each leaf node, the at least one node further comprises at least one second leaf node, and the second leaf node is a termination node of the line arriving within a preset second distribution time range in the line graph;
connecting each transit node to the root node;
for each first leaf node, determining a transit node closest to the first leaf node according to the position information of the at least one node, and determining a first arrival time of the transit node closest to the root node and the first leaf node according to historical delivery information of the at least one node; if the first arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the first leaf node; otherwise, connecting the first leaf node to the root node;
acquiring the connection relation between each second blade node and the at least one node;
for each second leaf node, performing the steps comprising: determining a second leaf node which is directly or indirectly connected with the root node and is closest to the second leaf node according to the position information of the at least one node and the connection relation, and determining a second arrival time of delivering from the root node to the second leaf node through the second leaf node closest to the root node according to historical delivery information of the at least one node; if the second arrival time is within the second distribution time range, connecting the second leaf node to the second leaf node closest to the distance; otherwise, determining a transit node closest to the second leaf node according to the position information of the at least one node, and determining a third arrival time from the root node to the second leaf node via the transit node closest to the second leaf node according to the historical delivery information of the at least one node; if the third arrival time is within the second distribution time range, connecting the second leaf node to the transfer node closest to the distance, otherwise, connecting the second leaf node to the root node;
grouping the at least one first leaf node and/or the at least one second leaf node into a set of sub-nodes;
for each child node in the set of child nodes, performing the steps of: determining the distance between the child node and each transfer node and the distance between the child node and the root node according to the position information of the at least one node; sequencing all the transfer nodes according to the sequence of the distances from small to large to obtain at least one sequenced transfer node; selecting a transfer node closest to the child node from the at least one sorted transfer node; if the distance between the nearest transit node and the child node is equal to the distance between the root node and the child node, connecting the child node to the root node; otherwise, for each non-nearest transit node, determining whether the side length and the angle of a triangle formed by the transit node, the root node and the child node meet a predetermined first condition or a second condition, and if the side length and the angle of the triangle meet the first condition or the second condition, connecting the child node to the transit node;
and outputting the route graph distributed to each node from the root node according to the connection relation among the at least one node.
2. The method according to claim 1, wherein before outputting the route graph distributed from the root node to the nodes according to the connection relationship between the at least one node, the method further comprises:
for each first leaf node not connected to a second leaf node, performing the steps of:
determining a first leaf node closest to the first leaf node according to the position information of the at least one node, and determining a fourth arrival time of the first leaf node distributed from the root node to the first leaf node through the first leaf node closest to the first leaf node according to the historical distribution information of the at least one node;
if the fourth arrival time is within the first distribution time range, connecting the first leaf node to the first leaf node closest to the first distribution time range;
otherwise, determining a transit node closest to the first leaf node according to the position information of the at least one node, and determining a fifth arrival time of the transit node from the root node to the first leaf node through the transit node closest to the first leaf node according to the historical delivery information of the at least one node; and if the fifth arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the distance, otherwise, connecting the first leaf node to the root node.
3. The method of claim 1, wherein the first condition comprises:
the side length of the edge formed by the root node and the child node is greater than or equal to the side length of the edge formed by the root node and the transfer node; and is
An included angle between an edge formed by the child node and the transfer node and an edge formed by the root node and the transfer node is larger than a preset angle; and is
The sum of the side length of the edge formed by the child node and the transfer node and the side length of the edge formed by the root node and the transfer node is smaller than the product of the side length of the edge formed by the root node and the child node and a first coefficient, wherein the first coefficient is larger than 1.
4. The method of claim 1, wherein the second condition comprises:
the side length of the edge formed by the root node and the child node is smaller than that of the edge formed by the root node and the transfer node; and is
The side length of the edge formed by the child node and the transfer node is smaller than the product of the side length of the edge formed by the root node and the transfer node and a second coefficient, wherein the second coefficient is larger than 0 and smaller than 1.
5. An information output apparatus, characterized in that the apparatus comprises:
an obtaining unit, configured to obtain location information and historical delivery information of at least one node used for constructing a routing graph, where the at least one node includes: the node comprises a root node, at least one relay node and at least one first leaf node, wherein the root node is a starting node of each line in the line graph, the first leaf node is a termination node of the line arriving within a preset first distribution time range in the line graph, the relay node is a node for connecting the root node and each leaf node, the at least one node further comprises at least one second leaf node, and the second leaf node is a termination node of the line arriving within a preset second distribution time range in the line graph;
a first connection unit for connecting each transit node to the root node;
a second connection unit, configured to, for each first leaf node, determine, according to the location information of the at least one node, a relay node closest to the first leaf node, and determine, according to historical delivery information of the at least one node, a first arrival time at which the root node is delivered to the first leaf node via the closest relay node; if the first arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the first leaf node; otherwise, connecting the first leaf node to the root node;
a third connection unit for, for each second leaf node, performing the steps of: acquiring the connection relation between each second blade node and the at least one node; determining a second leaf node which is directly or indirectly connected with the root node and is closest to the second leaf node according to the position information of the at least one node and the connection relation, and determining a second arrival time of delivering from the root node to the second leaf node through the second leaf node closest to the root node according to historical delivery information of the at least one node; if the second arrival time is within the second distribution time range, connecting the second leaf node to the second leaf node closest to the distance; otherwise, determining a transit node closest to the second leaf node according to the position information of the at least one node, and determining a third arrival time from the root node to the second leaf node via the transit node closest to the second leaf node according to the historical delivery information of the at least one node; if the third arrival time is within the second distribution time range, connecting the second leaf node to the transfer node closest to the distance, otherwise, connecting the second leaf node to the root node;
a fifth connecting unit, configured to combine the at least one first leaf node and/or the at least one second leaf node into a set of child nodes;
for each child node in the set of child nodes, performing the steps of: determining the distance between the child node and each transfer node and the distance between the child node and the root node according to the position information of the at least one node; sequencing all the transfer nodes according to the sequence of the distances from small to large to obtain at least one sequenced transfer node; selecting a transfer node closest to the child node from the at least one sorted transfer node; if the distance between the nearest transit node and the child node is equal to the distance between the root node and the child node, connecting the child node to the root node; otherwise, for each non-nearest transit node, determining whether the side length and the angle of a triangle formed by the transit node, the root node and the child node meet a predetermined first condition or a second condition, and if the side length and the angle of the triangle meet the first condition or the second condition, connecting the child node to the transit node;
and the output unit is used for outputting the circuit diagram distributed to each node from the root node according to the connection relation among the at least one node.
6. The apparatus of claim 5, further comprising:
a fourth connecting unit, configured to, for each first leaf node that is not connected to the second leaf node, perform the following steps:
determining a first leaf node closest to the first leaf node according to the position information of the at least one node, and determining a fourth arrival time of the first leaf node distributed from the root node to the first leaf node through the first leaf node closest to the first leaf node according to the historical distribution information of the at least one node;
if the fourth arrival time is within the first distribution time range, connecting the first leaf node to the first leaf node closest to the first distribution time range;
otherwise, determining a transit node closest to the first leaf node according to the position information of the at least one node, and determining a fifth arrival time of the transit node from the root node to the first leaf node through the transit node closest to the first leaf node according to the historical delivery information of the at least one node; and if the fifth arrival time is within the first distribution time range, connecting the first leaf node to the transfer node closest to the distance, otherwise, connecting the first leaf node to the root node.
7. An apparatus, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-4.
8. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710264864.8A CN107085754B (en) | 2017-04-21 | 2017-04-21 | Information output method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710264864.8A CN107085754B (en) | 2017-04-21 | 2017-04-21 | Information output method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107085754A CN107085754A (en) | 2017-08-22 |
| CN107085754B true CN107085754B (en) | 2021-02-26 |
Family
ID=59612331
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710264864.8A Active CN107085754B (en) | 2017-04-21 | 2017-04-21 | Information output method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107085754B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109902985A (en) * | 2017-12-08 | 2019-06-18 | 北京京东尚科信息技术有限公司 | Postal transportation networks method, equipment and computer readable storage medium |
| CN112116120A (en) * | 2019-06-20 | 2020-12-22 | 北京京东振世信息技术有限公司 | Logistics path planning method and device |
| CN113077199A (en) * | 2020-01-06 | 2021-07-06 | 北京京东振世信息技术有限公司 | Method and device for determining distribution route |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101592956B (en) * | 2009-06-30 | 2011-01-12 | 北京交通大学 | Method and device for determining transportation route of quick goods |
| EP3007116A1 (en) * | 2014-10-08 | 2016-04-13 | Deutsche Post AG | Supporting the transport of shipments |
| CN104484719A (en) * | 2014-12-11 | 2015-04-01 | 北京金山安全软件有限公司 | Method and device for determining node line to be recommended |
| CN106372822B (en) * | 2015-07-21 | 2021-12-03 | 菜鸟智能物流控股有限公司 | Service object reservation time period processing method and device |
-
2017
- 2017-04-21 CN CN201710264864.8A patent/CN107085754B/en active Active
Non-Patent Citations (2)
| Title |
|---|
| The hierarchical system modeling for the planning of comprehensive passenger transportation hub nodes;Xiaohui Zhang;《7th Advanced Forum on Transportation of China》;20120705;13-15 * |
| 面向综合运输网络的复杂供应链问题建模与耦合求解算法;潘国强;《计算机集成制造***》;20150309;3042-3053 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107085754A (en) | 2017-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110555640A (en) | Method and device for route planning | |
| WO2020164319A1 (en) | Goods pickup method and device | |
| CN107085754B (en) | Information output method and device | |
| CN112184100A (en) | Article inventory monitoring method and device, electronic equipment and computer readable medium | |
| CN110648089A (en) | Method and device for determining delivery timeliness of articles | |
| CN113128743A (en) | Goods picking path planning method and device | |
| CN115660244B (en) | Route information generation method, device, equipment and medium | |
| CN113222205A (en) | Path planning method and device | |
| CN112085442A (en) | Device operation method, device, electronic device and computer readable medium | |
| CN110858332B (en) | Order production method and device | |
| CN113537676B (en) | Method and device for determining completion time of transportation task | |
| CN113762674B (en) | Order distribution method and device | |
| CN114418482A (en) | Order information processing method and device, electronic equipment and computer readable medium | |
| CN113762573B (en) | Logistics network optimization method and device | |
| CN110555642A (en) | Method and device for determining route starting point | |
| CN113159659A (en) | Method, device, equipment and computer readable medium for updating manifest aging | |
| CN113627837B (en) | Goods collection positioning method and device | |
| CN112441364B (en) | Container warehouse-in or warehouse-back method and device for automatic warehouse | |
| CN112085441A (en) | Information generation method and device, electronic equipment and computer readable medium | |
| CN113361739A (en) | Method and device for generating goods picking path | |
| CN112446565A (en) | Method and device for matching vehicles for orders | |
| CN112116120A (en) | Logistics path planning method and device | |
| CN113077199A (en) | Method and device for determining distribution route | |
| CN110633933A (en) | Method and device for planning ambiguous line | |
| CN112529346A (en) | Task allocation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1237506 Country of ref document: HK |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |