CN106339831B - Method and device for acquiring effective path for service - Google Patents
Method and device for acquiring effective path for service Download PDFInfo
- Publication number
- CN106339831B CN106339831B CN201510398792.7A CN201510398792A CN106339831B CN 106339831 B CN106339831 B CN 106339831B CN 201510398792 A CN201510398792 A CN 201510398792A CN 106339831 B CN106339831 B CN 106339831B
- Authority
- CN
- China
- Prior art keywords
- service
- nodes
- node
- path set
- effective
- 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
Abstract
The application provides a method and a device for acquiring an effective path for a service. The method comprises the following steps: filtering out incapability nodes aiming at the service according to service characteristics and the current state of the nodes to obtain an optional path consisting of effective nodes; dividing the selectable path into at least two segments by taking the same-level node in the effective nodes as a division point; calculating an effective path set of each segment; and acquiring the effective path set of the service based on the effective path set of each segment. The method and the device realize rapid and accurate acquisition of the effective path set of the service.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for obtaining an effective path for a service.
Background
The logistics is a process of organically combining functions of distribution, transportation, storage, packaging and the like according to actual needs to realize user requirements in the process of physically flowing goods or services from a supply place to a receiving place. The selectable points of distribution, transfer, trunk, customs, etc. involved in the logistics may be referred to as nodes. Selecting paths composed of different nodes has different costs and timeliness. The current methods for selecting paths are mostly: the completion is manual, that is, the various reachable paths are manually combined in advance, and a satisfactory path is selected from the reachable paths.
The method for manually selecting the path has at least the following disadvantages:
if the number of nodes involved in the path is large, the detailed information of all the nodes is difficult to grasp manually, so that it is difficult to determine an effective path which not only ensures low cost, but also ensures timeliness.
In addition, when a large amount of services select paths simultaneously, the efficiency of manually selecting the paths is low, and the service requirements of high efficiency and real-time calculation requirements are difficult to meet.
Disclosure of Invention
One of the technical problems solved by the present application is to provide a method and an apparatus for acquiring an effective path for a service, which can quickly and accurately acquire the effective path of the service, and thus ensure low cost and time efficiency.
According to an embodiment of an aspect of the present application, there is provided a method for obtaining an effective path for a service, including:
filtering out incapability nodes aiming at the service according to service characteristics and the current state of the nodes to obtain an optional path consisting of effective nodes;
dividing the selectable path into at least two segments by taking the same-level node in the effective nodes as a division point;
calculating an effective path set of each segment;
and acquiring the effective path set of the service based on the effective path set of each segment.
According to another aspect of the present application, an apparatus for obtaining an effective path for a service is provided, including:
the node filtering unit is used for filtering out the incapability nodes aiming at the service according to the service characteristics and the current state of the node to obtain an optional path consisting of effective nodes;
the segmentation unit is used for taking the nodes in the same level in the effective nodes as segmentation points and dividing the selectable path into at least two segments;
the segmentation calculation unit is used for calculating an effective path set of each segment;
and the effective path set acquisition unit is used for acquiring the effective path set of the service based on the effective path set of each segment.
By filtering the incapability nodes aiming at the service, the embodiment of the application can remove the invalid paths possibly formed by the incapability nodes, thereby reducing the calculation amount for obtaining the subsequent valid paths. By segmenting the paths formed by the effective nodes, calculating the effective path set of each segment and then acquiring the effective path set of the service based on the effective path set of each segment, the method can reduce intermediate data and simplify the calculation process of the effective path, thereby improving the effective path acquisition efficiency, realizing the quick and accurate acquisition of the effective path set of the service, namely ensuring low cost and ensuring timeliness.
It will be appreciated by those of ordinary skill in the art that although the following detailed description will proceed with reference being made to illustrative embodiments, the present application is not intended to be limited to these embodiments. Rather, the scope of the application is broad and is intended to be defined only by the claims that follow.
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 a flow chart of a method for obtaining an efficient path for a service according to one embodiment of the present application.
Fig. 2 is a diagram of all reachable paths of a service according to an embodiment of the present application.
Fig. 3 is a schematic diagram of an alternative path obtained after filtering out the incapability nodes from all reachable paths of the service shown in fig. 2 according to an embodiment of the present application.
FIG. 4 is a schematic diagram illustrating the segmentation of the alternative path shown in FIG. 3 according to one embodiment of the present application.
Fig. 5 is a flowchart of a method for obtaining an active path set of traffic based on an active path set per segment according to an embodiment of the present application.
Fig. 6 is a schematic structural diagram of an apparatus for obtaining an effective path for a service according to an embodiment of the present application.
The same or similar reference numbers in the drawings identify the same or similar elements.
Detailed Description
Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel, concurrently, or simultaneously. In addition, the order of the operations may be re-arranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, and the like.
The computer equipment comprises user equipment and network equipment. Wherein the user equipment includes but is not limited to computers, smart phones, PDAs, etc.; the network device includes, but is not limited to, a single network server, a server group consisting of a plurality of network servers, or a Cloud Computing (Cloud Computing) based Cloud consisting of a large number of computers or network servers, wherein Cloud Computing is one of distributed Computing, a super virtual computer consisting of a collection of loosely coupled computers. The computer equipment can be independently operated to realize the application, and can also be accessed into a network to realize the application through the interactive operation with other computer equipment in the network. The network in which the computer device is located includes, but is not limited to, the internet, a wide area network, a metropolitan area network, a local area network, a VPN network, and the like.
It should be noted that the user equipment, the network device, the network, etc. are only examples, and other existing or future computer devices or networks may also be included in the scope of the present application, if applicable, and are included by reference.
The methods discussed below, some of which are illustrated by flow diagrams, may be implemented by hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to perform the necessary tasks may be stored in a machine or computer readable medium such as a storage medium. The processor(s) may perform the necessary tasks.
Specific structural and functional details disclosed herein are merely representative and are provided for purposes of describing example embodiments of the present application. This application may, however, be embodied in many alternate forms and should not be construed as limited to only the embodiments set forth herein.
It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element may be termed a second element, and, similarly, a second element may be termed a first element, without departing from the scope of example embodiments. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may be present. In contrast, when an element is referred to as being "directly connected" or "directly coupled" to another element, there are no intervening elements present. Other words used to describe the relationship between elements (e.g., "between" versus "directly between", "adjacent" versus "directly adjacent to", etc.) should be interpreted in a similar manner.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It should also be noted that, in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may, in fact, be executed substantially concurrently, or the figures may sometimes be executed in the reverse order, depending upon the functionality/acts involved.
The method for obtaining the effective path for the service according to the embodiment of the application is suitable for various platforms or scenes where the application selects the logistics path for the service, for example, the routing is selected for the service in an e-commerce platform, or the routing is selected for the service in the logistics platform, and the like.
An object of the embodiments of the present application is to automatically select an effective path set (including at least one effective path) for a service, where the effective path set is a set of paths that guarantee low cost and/or timeliness, that is, there is no path among all reachable paths from a start point to an end point of the service, and the following conditions are satisfied: the cost is lower than that of the effective path A, and the time efficiency is shorter than that of the effective path A.
The execution subject of the method for acquiring the effective path for the service according to the embodiment of the present application may be a platform or an application server. It can be understood that the server acquires the effective path for the service on the premise that the information of each node can be obtained, including: the range to which each node belongs, the current state of each node, the upper limit of the capacity of each node, the function of each node (whether cold chain is supported, whether delivery is to be carried to the door, whether installation is to be carried to the door, and the like), and the like. The information of each node can be stored by a database which is specially used for storing the node information, and the server acquires the node information by accessing the database.
The technical solution of the present application is further described in detail below with reference to the accompanying drawings.
Fig. 1 is a flowchart of a method for obtaining an effective path for a service according to an embodiment of the present application, where the method mainly includes the following steps:
s10, filtering the incapability nodes aiming at the service according to the service characteristics and the current state of the nodes to obtain an optional path consisting of effective nodes;
s11, dividing the selectable path into at least two segments by taking the same-level node in the effective nodes as a dividing point;
s12, calculating an effective path set of each segment;
and S13, acquiring the effective path set of the service based on the effective path set of each segment.
The above steps are described in further detail below.
In an embodiment of step S10, the inability node for the service in the database storing the node information may be directly filtered, and the effective node for the service and the optional path formed by the effective node are obtained after filtering.
Another embodiment may first obtain all reachable paths of the service, and then filter out the non-capability nodes in all reachable paths. The method for acquiring all reachable paths of the service in the embodiment of the present application is not particularly limited, and may be, for example: and gradually selecting the next level node from the service starting point to the service ending point. Each level node constitutes a set of the level nodes. During filtering, the incapability nodes in each level node set can be filtered out respectively.
The service features described in step S10 include, but are not limited to, any one or more of the following: service coverage, service-to-logistics requirements, etc. Then the corresponding filtering of the incapability node aiming at the service according to the service characteristics comprises: and filtering out nodes which are not in the service coverage range and filtering out nodes which do not meet the requirement of the service on logistics. If the non-coverage area is not in the service coverage area, for example, the starting point is american X city, and the ending point is the logistics distribution service of chinese Y city, then the non-american overseas distribution nodes (or non-american X city overseas distribution nodes) are all nodes that are not in the service coverage area; the node that does not meet the requirement of the service on the logistics, for example, if the service needs the node in the logistics to support the cold chain function, the node that does not have the cold chain function is the node that does not meet the requirement of the service on the logistics.
The current state of the node comprises: the current processing capacity of the node, for example, whether the upper limit of the processing capacity of the node is reached. Then the filtering out the incapability node aiming at the service according to the current state of the node correspondingly comprises: and filtering out nodes which reach the upper limit of the node capacity. For example, for a transit node, its capacity cap is 200 (i.e. 200 services are processed simultaneously), when the current status of the transit node is 200, it indicates that the transit has reached the capacity cap.
As shown in fig. 2, in a logistics service with overseas user a as a starting point and china user b as a finishing point, after filtering out nodes (including overseas distribution 1, overseas transit warehouse 2, china trunk 3, china trunk 4 and china distribution 3) which do not support cold chain and have the capability reaching the upper limit, all the related nodes and reachable path information in the service coverage area, the obtained effective nodes and reachable path information are shown in fig. 3. Therefore, a large number of invalid reachable paths can be reduced through the filtering operation, the calculation workload of the subsequent effective paths is reduced, and the effective path acquisition efficiency is improved.
In this embodiment, a node obtained after filtering an incapability node is referred to as an active node, and a path of a service connected by the active node is referred to as an optional path.
The same level node, that is, the same number of nodes that need to pass through to reach the start point or the end point in the same service as described in step S11. As shown in fig. 3, the nodes arranged longitudinally are the same-level nodes, and if the overseas transit bunker 1 and the overseas transit bunker 3 are the same-level nodes, the distance from the starting point to the intermediate point needs to pass through one node, and if the distance from the starting point to the intermediate point needs to pass through two nodes, the distance from the intermediate point to the intermediate point needs to pass through one node, and the distance from the intermediate point to the intermediate point needs to pass through two nodes. Similarly, overseas distribution 2, 3, 4, 5 are same-level nodes, overseas trunks 1,2, 3, 4 are same-level nodes, China trunks 1,2, 5 are same-level nodes, and China distribution 1,2, 4, 5 are same-level nodes.
In step S11, the same-level node is used as a dividing point to divide the selectable path into at least two segments, that is, the same-level node is used as a dividing point to divide the selectable path into two segments, and if two dividing points are selected, the selectable path is divided into three segments. Fig. 4 is a schematic diagram of the selectable path in fig. 3 after being divided into three segments. Fig. 4 shows that the overseas transit warehouse is used as one of the division points, and the china customs is used as one of the division points.
It is understood that when selecting the division point, it is preferable to select a node with a smaller number of nodes on the same level as the division point, for example, if there are 3 overseas transit silos on the same level in fig. 3 and 2 customs china customs on the same level, then the nodes on the two levels are selected as the two division points. In this way, the calculation amount of subsequent segmentation calculation can be effectively reduced. Of course, the embodiment of the present application is not limited to this, and for example, three nodes connected by two paths may be used as one segment.
Step S12 may compute the valid path set for each segment in parallel. In fig. 4, a section from overseas user a to overseas transfer is referred to as a first section, a section from overseas transfer to china customs is referred to as a second section, and a section from china customs to china user b is referred to as a third section. And calculating the effective path set of three sections simultaneously.
First, it should be noted that the time and price of a path through which a node can go are recorded in a database storing node information. When the end point of one path is the same as the starting point of the other path, the two paths can be combined into a new path, and the time efficiency and the price of the new path are the sum of the time efficiency and the price of the two paths before combination. The method can acquire the time efficiency and the price of all paths from the starting point to the end point of each section. In calculating the valid path set for each segment, the following method may be employed:
defining an effective path set, when calculating an effective path of a section, putting all paths from a starting point to an end point of the section into the set, comparing one path with other paths in the set, judging whether a path with the time efficiency and the price lower than those of the path exists, if so, deleting the path from the set, otherwise, keeping the path, and finally obtaining the effective path set which is the effective path set of the section. For example, a path is represented in a format of (price, age), and if all paths included in the initial valid path set of a segment are as follows:
(3，8)、(3，5)、(4，4)、(5，3)、(5，9)、(6，4)；
after the compare-delete operation, the remaining paths in the set include:
(3，5)、(4，4)、(5，3)。
then the active path set of the segment contains the three paths. The effective path set of each segment can be calculated by the method.
The process of the method for obtaining the effective path set of the service based on the effective path set of each segment in step S13 may be as shown in fig. 5, and mainly includes the following sub-steps:
substep 50 obtains a merged path set by calculating a cartesian product of the valid path set of one segment and the valid path set of another segment adjacent thereto.
The neighbors, i.e. the end points of one segment are the same as the start points of another segment. For example, if the end point of the first segment is the same as the start point of the second segment in fig. 4, the first segment is adjacent to the second segment; and the end point of the second section is the same as the starting point of the third section, and the second section is adjacent to the third section.
For example, a Cartesian product of the active path set of the first segment and the active path set of the second segment is computed, or a Cartesian product of the active path set of the second segment and the active path set of the third segment is computed.
And a substep 51, filtering invalid paths in the merged path set to obtain a merged effective path set.
The invalid path is a path which does not satisfy the condition of the valid path.
For example, after calculating the cartesian product of the valid path set of the first segment and the valid path set of the second segment, invalid paths that do not satisfy the valid path condition may exist in the obtained paths, and then the invalid paths are filtered out.
In mathematics, the Cartesian product, also called direct product, of two sets X and Y, the first object being a member of X and the second object being one of all possible ordered pairs of Y, is represented as X Y.
Assuming that the set a is { a, B }, and the set B is {0,1,2}, the cartesian products of the two sets are { (a,0), (a,1), (a,2), (B,0), (B,1), (B,2) }.
Substep 52, determining whether the merged path is a complete path of the service;
if the path is a complete path of the service, ending the operation, and finally obtaining a combined effective path set which is an effective path set of the service;
if the path is not the complete path of the service, the steps are repeated iteratively until an effective path set of the whole path from the starting point of the service to the terminal is obtained. For example, if the cartesian product of the effective path set of the first segment and the effective path set of the second segment is calculated in substep 50, the merged effective path set is obtained after filtering out the invalid paths. If the end point of the path corresponding to the combined effective path set is the same as the start point of the third section, calculating the cartesian product of the combined effective path set and the effective path set of the third section, and filtering the obtained invalid path, wherein the finally obtained path is the effective path from the start point to the end point of the service.
An apparatus corresponding to the method for obtaining an effective path for a service is also provided in an embodiment of the present application, and as shown in fig. 6, the apparatus is a schematic structural diagram, and the apparatus mainly includes:
and the node filtering unit 60 is configured to filter out the incapability nodes for the service according to the service characteristics and the current state of the node, and obtain an optional path formed by the valid nodes.
A segmenting unit 61, configured to divide the selectable path into at least two segments by using a same-level node in the valid nodes as a segmentation point.
And a segment calculating unit 62, configured to calculate an effective path set of each segment.
An effective path set obtaining unit 63, configured to obtain an effective path set of the service based on the effective path set of each segment.
Optionally, the service features include: the service coverage. The corresponding node filtering unit 60 is configured to:
and filtering out nodes which are not in the service coverage range according to the service coverage range.
Optionally, the service features include: the demand of business for logistics. The corresponding node filtering unit 60 is configured to:
and filtering out nodes which do not meet the requirements of the business on the logistics according to the requirements of the business on the logistics.
The node filtering unit 60 may be further configured to:
and filtering out the nodes which reach the upper limit of the node capacity according to the current state of the nodes.
The segment calculation unit 61 is configured to:
obtaining a merged path set by calculating the Cartesian product of the effective path set of one section and the effective path set of the adjacent other section;
filtering invalid paths in the merged path set to obtain a merged effective path set;
and iteratively repeating the steps until an effective path set of the whole path from the starting point of the service to the terminal is obtained.
Alternatively, the segment calculation unit 61 may calculate the effective path set of each segment in parallel.
In summary, in the embodiment of the present application, by filtering out the incapability nodes for the service, the invalid paths that may be formed by the incapability nodes can be removed, so as to reduce the calculation amount for obtaining the subsequent valid paths. By segmenting the paths formed by the effective nodes, calculating the effective path set of each segment and then acquiring the effective path set of the service based on the effective path set of each segment, the method can reduce intermediate data and simplify the calculation process of the effective path, thereby improving the effective path acquisition efficiency and finally obtaining the effective path set with low cost and high timeliness.
In addition, the embodiment of the application segments the path formed by the effective nodes, and can use multiple threads, multiple processes or multiple machines to realize parallel calculation of the effective path of each segment, so that the effective path of the service can be acquired in real time no matter how the number of the nodes is increased, and the efficiency of acquiring the effective path of the service is ensured.
It should be noted that the present application may be implemented in software and/or a combination of software and hardware, for example, implemented using Application Specific Integrated Circuits (ASICs), general purpose computers or any other similar hardware devices. In one embodiment, the software programs of the present application may be executed by a processor to implement the steps or functions described above. Likewise, the software programs (including associated data structures) of the present application may be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like. Additionally, some of the steps or functions of the present application may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
In addition, some of the present application may be implemented as a computer program product, such as computer program instructions, which when executed by a computer, may invoke or provide methods and/or techniques in accordance with the present application through the operation of the computer. Program instructions which invoke the methods of the present application may be stored on a fixed or removable recording medium and/or transmitted via a data stream on a broadcast or other signal-bearing medium and/or stored within a working memory of a computer device operating in accordance with the program instructions. An embodiment according to the present application comprises an apparatus comprising a memory for storing computer program instructions and a processor for executing the program instructions, wherein the computer program instructions, when executed by the processor, trigger the apparatus to perform a method and/or a solution according to the aforementioned embodiments of the present application.
It will be evident to those skilled in the art that the present application is not limited to the details of the foregoing illustrative embodiments, and that the present application may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the application being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the system claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Claims (10)
1. A method for obtaining an efficient path for traffic, comprising:
the method comprises the steps that a server obtains node information, wherein the node information comprises a node function, and the node function comprises a cold chain function;
filtering out the incapability nodes aiming at the service according to the service characteristics and the current state of the nodes to obtain an optional path consisting of effective nodes, wherein the service characteristics comprise: service coverage and/or service-to-logistics requirements;
dividing the selectable path into at least two segments by taking the nodes at the same level in the effective nodes as dividing points, wherein the nodes at the same level are the nodes with the same number of nodes which need to pass through to reach a starting point or a destination in the same service;
calculating an effective path set of each segment in parallel;
and acquiring the effective path set of the service based on the effective path set of each section, and executing the service as a logistics path.
2. The method of claim 1, wherein the service characteristics comprise: the service coverage, filtering the incapability nodes aiming at the service according to the service characteristics comprises:
and filtering out nodes which are not in the service coverage range according to the service coverage range.
3. The method of claim 1 or 2, wherein the service characteristics comprise: the filtering of the incapability nodes aiming at the service according to the service characteristics comprises the following steps:
and filtering out nodes which do not meet the requirements of the business on the logistics according to the requirements of the business on the logistics.
4. The method of claim 1, wherein filtering out the incapacitated nodes for the traffic depending on a node current state comprises:
and filtering out the nodes which reach the upper limit of the node capacity according to the current state of the nodes.
5. The method of claim 1, wherein the obtaining the set of active paths for the traffic based on the set of active paths for each segment comprises:
obtaining a merged path set by calculating the Cartesian product of the effective path set of one section and the effective path set of the adjacent other section;
filtering invalid paths in the merged path set to obtain a merged effective path set;
and iteratively repeating the steps until an effective path set of the whole path from the starting point of the service to the terminal is obtained.
6. An apparatus for obtaining an efficient path for traffic, comprising:
the node filtering unit is used for acquiring node information, wherein the node information comprises a node function, and the node function comprises a cold chain function; filtering out the incapability nodes aiming at the service according to the service characteristics and the current state of the nodes to obtain an optional path consisting of effective nodes, wherein the service characteristics comprise: service coverage and/or service-to-logistics requirements;
a segmentation unit, configured to divide the selectable path into at least two segments by using a same-level node in the valid nodes as a partition point, where the same-level node is a node in the same service, where the number of nodes that need to pass through to reach a start point or an end point is the same;
the segmentation calculation unit is used for calculating the effective path set of each segment in parallel;
and the effective path set acquisition unit is used for acquiring the effective path set of the service based on the effective path set of each segment as a logistics path to execute the service.
7. The apparatus of claim 6, wherein the service characteristics comprise: a traffic coverage, the node filtering unit configured to:
and filtering out nodes which are not in the service coverage range according to the service coverage range.
8. The apparatus of claim 6 or 7, wherein the service characteristics comprise: a demand of the traffic on the logistics, the node filtering unit being configured to:
and filtering out nodes which do not meet the requirements of the business on the logistics according to the requirements of the business on the logistics.
9. The apparatus of claim 6, wherein the node filtering unit is configured to:
and filtering out the nodes which reach the upper limit of the node capacity according to the current state of the nodes.
10. The apparatus of claim 6, wherein the segment computation unit is configured to:
obtaining a merged path set by calculating the Cartesian product of the effective path set of one section and the effective path set of the adjacent other section;
filtering invalid paths in the merged path set to obtain a merged effective path set;
and iteratively repeating the steps until an effective path set of the whole path from the starting point of the service to the terminal is obtained.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510398792.7A CN106339831B (en) | 2015-07-09 | 2015-07-09 | Method and device for acquiring effective path for service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510398792.7A CN106339831B (en) | 2015-07-09 | 2015-07-09 | Method and device for acquiring effective path for service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106339831A CN106339831A (en) | 2017-01-18 |
| CN106339831B true CN106339831B (en) | 2022-04-05 |
Family
ID=57826369
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510398792.7A Active CN106339831B (en) | 2015-07-09 | 2015-07-09 | Method and device for acquiring effective path for service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106339831B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018185858A1 (en) | 2017-04-04 | 2018-10-11 | 株式会社Ｍｕｊｉｎ | Control device, picking system, distribution system, program, control method, and production method |
| DE112017007394B4 (en) | 2017-04-04 | 2020-12-03 | Mujin, Inc. | Information processing device, gripping system, distribution system, program and information processing method |
| DE112017007398B4 (en) | 2017-04-04 | 2021-11-18 | Mujin, Inc. | Control device, gripping system, distribution system, program and control method |
| WO2018185852A1 (en) | 2017-04-04 | 2018-10-11 | 株式会社Ｍｕｊｉｎ | Control device, picking system, distribution system, program, control method, and production method |
| CN110494259B (en) | 2017-04-04 | 2020-11-10 | 牧今科技 | Control device, pickup system, logistics system, program, control method, and production method |
| CN108932300B (en) * | 2018-06-06 | 2022-05-27 | 成都深思科技有限公司 | Filter analysis method and device for infinite iteration and storage medium |
| CN111915262B (en) * | 2020-08-14 | 2024-03-12 | 杭州网易再顾科技有限公司 | Task processing method, device, electronic equipment and computer readable storage medium |
| CN112330241B (en) * | 2020-10-13 | 2023-03-24 | 深圳市中农易讯信息技术有限公司 | Logistics visualization method, device, equipment and medium |
| CN113743852A (en) * | 2020-10-30 | 2021-12-03 | 北京京东振世信息技术有限公司 | Routing method, device, equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101592956A (en) * | 2009-06-30 | 2009-12-02 | 北京交通大学 | Transportation route of quick goods is determined method and apparatus |
| CN101635040A (en) * | 2009-08-31 | 2010-01-27 | 北京交通大学 | Method and device for determining cargo loading and transporting plan |
| CN103299326A (en) * | 2011-01-30 | 2013-09-11 | 北京协通天下科技有限公司 | A logistics system and a method for providing logistics service with the logistics system |
| CN103399868A (en) * | 2013-07-08 | 2013-11-20 | 哈尔滨工业大学（威海） | Method for optimizing foreign trade logistics path |
| CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
| CN104038418A (en) * | 2014-05-19 | 2014-09-10 | 暨南大学 | Routing method for hybrid topologic structure data center, path detection mechanism and message processing mechanism |
| US20150051834A1 (en) * | 2013-08-19 | 2015-02-19 | Amadeus S.A.S. | Ground-transportation network representation |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
-
2015
- 2015-07-09 CN CN201510398792.7A patent/CN106339831B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101592956A (en) * | 2009-06-30 | 2009-12-02 | 北京交通大学 | Transportation route of quick goods is determined method and apparatus |
| CN101635040A (en) * | 2009-08-31 | 2010-01-27 | 北京交通大学 | Method and device for determining cargo loading and transporting plan |
| CN103299326A (en) * | 2011-01-30 | 2013-09-11 | 北京协通天下科技有限公司 | A logistics system and a method for providing logistics service with the logistics system |
| US20130297527A1 (en) * | 2011-01-30 | 2013-11-07 | Beijing Co-Link Word Technology Co. Ltd | Logistics system and a method for providing logistics service with the logistics system |
| CN103399868A (en) * | 2013-07-08 | 2013-11-20 | 哈尔滨工业大学（威海） | Method for optimizing foreign trade logistics path |
| CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
| US20150051834A1 (en) * | 2013-08-19 | 2015-02-19 | Amadeus S.A.S. | Ground-transportation network representation |
| CN104038418A (en) * | 2014-05-19 | 2014-09-10 | 暨南大学 | Routing method for hybrid topologic structure data center, path detection mechanism and message processing mechanism |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106339831A (en) | 2017-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106339831B (en) | Method and device for acquiring effective path for service | |
| US11184241B2 (en) | Topology-aware continuous evaluation of microservice-based applications | |
| CN103761309B (en) | Operation data processing method and system | |
| US9727383B2 (en) | Predicting datacenter performance to improve provisioning | |
| US20170046653A1 (en) | Planning of transportation requests | |
| US9560092B2 (en) | Crowdsourced image analysis platform | |
| US8607188B2 (en) | Modeling task-site allocation networks | |
| US9322661B2 (en) | Geometric determination of shared travel routes | |
| JP2014519097A (en) | Method and system for recommending items | |
| CN105898205B (en) | Method and apparatus for monitoring target object by multiple cameras | |
| CN105868190B (en) | A kind of method and system optimizing task processing in ETL | |
| CN107251017A (en) | Determined via the effective connection path of sets cardinal | |
| US20120290726A1 (en) | Dynamically resizing a networked computing environment to process a workload | |
| CN105426375A (en) | Relationship network calculation method and apparatus | |
| CN107167151B (en) | Bus route setting method, route planning method and device | |
| US20200082026A1 (en) | Graph data processing | |
| CN110018996A (en) | A kind of the snapshot rollback method and relevant apparatus of distributed memory system | |
| CN111210315B (en) | Travel order processing method and device, electronic equipment and readable storage medium | |
| CN109308537A (en) | Website recommendation method and device | |
| CN107241370A (en) | The rollback method and system of resource operation under IaaS cloud environment | |
| CN109003148B (en) | Advertisement pushing method, advertisement pushing device, server and readable storage medium | |
| US20130046467A1 (en) | Method and apparatus for determining traveling route | |
| CN111829530B (en) | Evaluation method, evaluation device, storage medium and electronic equipment | |
| CN114329058A (en) | Image gathering method and device and electronic equipment | |
| CN112308266B (en) | Warehouse location method, warehouse location device, warehouse location equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180410 Address after: Four story 847 mailbox of the capital mansion of Cayman Islands, Cayman Islands, Cayman Applicant after: CAINIAO SMART LOGISTICS HOLDING Ltd. Address before: Cayman Islands Grand Cayman capital building a four storey No. 847 mailbox Applicant before: ALIBABA GROUP HOLDING Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |