CN111667085B - Logistics routing network determining method, device, medium and electronic equipment - Google Patents
Logistics routing network determining method, device, medium and electronic equipment Download PDFInfo
- Publication number
- CN111667085B CN111667085B CN201910176740.3A CN201910176740A CN111667085B CN 111667085 B CN111667085 B CN 111667085B CN 201910176740 A CN201910176740 A CN 201910176740A CN 111667085 B CN111667085 B CN 111667085B
- Authority
- CN
- China
- Prior art keywords
- node
- route
- transportation
- determining
- transport
- 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
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000004590 computer program Methods 0.000 claims description 9
- 210000004209 hair Anatomy 0.000 claims description 6
- 238000011156 evaluation Methods 0.000 claims 1
- 230000006870 function Effects 0.000 description 46
- 238000010586 diagram Methods 0.000 description 12
- 238000012545 processing Methods 0.000 description 5
- 230000032683 aging Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 238000005457 optimization Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000001550 time effect Effects 0.000 description 1
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)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the invention provides a method, a device, a medium and electronic equipment for determining a logistics routing network, which comprise the following steps: according to the obtained position information of each node, determining the transportation route and the navigation distance from each node to other nodes; based on the transport route and the navigation distance, respectively determining transport route results from each node to other nodes, and generating a transport route set; and after the corresponding weight is given to each transport route in the transport route set, comprehensively evaluating the transport route set to determine the optimal logistics route network. The technical scheme of the embodiment of the invention is based on the feasible routing network, combines the actual transportation requirement and the service scene, flexibly and efficiently determines the optimal logistics routing network, reduces the labor cost and realizes the multi-objective function rapid planning of the whole logistics network.
Description
Technical Field
The invention relates to the technical field of logistics, in particular to a method and a device for determining a logistics routing network, a medium and electronic equipment.
Background
With the surge of electronic commerce, online shopping has become an indispensable part of life. Especially under the condition that holidays reach daily billions of logistics orders, various merchants and each merchant can meet respective requirements in network marketing and online shopping.
In the prior art, the logistics transportation mode is mainly selected by manually evaluating the service, however, the following problems exist: (1) the current mode relies primarily on human experience; (2) With the increase of nodes (sorting, warehouse and stations), the combination number range index is increased, and the manual work cannot be considered in all aspects; (3) a lot of manpower is consumed; (4) the optimization space is limited.
It should be noted that the information disclosed in the above background section is only for enhancing understanding of the background of the invention and thus may include information that does not form the prior art that is already known to those of ordinary skill in the art.
Disclosure of Invention
The embodiment of the invention aims to provide a method, a device, a medium and electronic equipment for determining a logistics routing network, and further at least to a certain extent solves one or more problems that the related art depends on manual experience, cannot be comprehensively evaluated manually, consumes a large amount of manpower and material resources, is limited in optimization space and the like.
Other features and advantages of the invention will be apparent from the following detailed description, or may be learned by the practice of the invention.
According to a first aspect of an embodiment of the present invention, there is provided a method for determining a logistics routing network, including:
according to the obtained position information of each node, determining the transportation route and the navigation distance from each node to other nodes;
based on the transport route and the navigation distance, respectively determining transport route results from each node to other nodes, and generating a transport route set;
and after the corresponding weight is given to each transport route in the transport route set, comprehensively evaluating the transport route set to determine the optimal logistics route network.
In one embodiment of the present invention, the determining the transport route result from each node to other nodes based on the transport route and the navigation distance includes:
forward differencing the time of each access node and the access time opened by the node to obtain each time difference value, summing the time difference values, and determining the feasible transportation route from each node to other nodes within the time allowable range by the minimum value in the obtained sum value, wherein the feasible transportation route from each node to other nodes within the time allowable range is determined by the function:
determining the feasible transportation route, wherein beta is as follows j Representing the time of access to the node b j The access time of the node is represented, and min represents the minimum value;
determining a transportation route with highest transportation timeliness from the determined feasible transportation routes, specifically, by a function:
f 1 (x)＝∑ ij∈OD t ij
by making the function f 1 (x) And determining the transport route with the minimum value as the transport route with the highest timeliness, wherein i represents a starting node, j represents a destination node, OD represents a set of feasible transport routes from each node to other nodes, and t represents the transport time of the feasible transport routes.
In one embodiment of the present invention, the OD represents a set of feasible transportation routes from each node to other nodes, including:
the constraints of the OD set include:
at least one of a straight forwarding route in which the start node reaches the destination node, a first forwarding route in which the start node reaches the destination node through one transit node, a second forwarding route in which the start node reaches the destination node through two transit nodes, and a third forwarding route in which the start node reaches the destination node through three transit nodes,
the transportation path from each node to other nodes satisfies the hair straightening condition, and
when the transportation path from each node to other nodes is a piece, the freight bill of the transportation path is smaller than the whole freight bill set by the transportation path, and
the transportation path from each node to other nodes can only meet one transportation mode of whole vehicle transportation or part transportation.
In one embodiment of the present invention, the method further comprises:
based on the transportation route, determining the transportation route with the largest number of straight sending, wherein the transportation route is determined by a function:
will cause the function f 2 (x) The maximum transport route is determined as the most straight transport route, where i denotes the start node, j denotes the destination node, and i+.j, P denotes the set including the individual nodes, x when the start node i is directly reachable to the destination node j ij =1, otherwise, x ij ＝0。
In one embodiment of the present invention, the method further comprises:
based on the transportation route, determining the transportation route with the minimum sorting quantity, wherein the transportation route is determined by a function:
will cause the function f 3 (x) The smallest transport route is determined as the transport route with the smallest sorting number, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the number of sorting nodes k passed from the originating node i to the destination node j, +.>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
In one embodiment of the present invention, the method further comprises:
and determining a transportation route with the minimum total cost based on the transportation offline and the navigation distance, wherein the transportation route with the minimum total cost is determined by a function:
will cause the function f 4 (x) The transport route with the smallest value is determined as the transport route with the smallest total cost, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the costs associated with the selection of the transportation of the piece goods or the whole vehicle from the starting node i to the destination node j via the sorting node k>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
In one embodiment of the present invention, before each transport route in the transport route set is given a corresponding weight, the method further includes:
setting corresponding target values for the transport route with highest timeliness, the transport route with the largest number of straight-sending, the transport route with the smallest sorting number and the transport route with the smallest total cost determined in the transport route set to obtain a target vector: f= (F) 1 0 ,f 2 0 ,f 3 0 ,f 4 0 ) Wherein f 1 0 Representing the most time-efficient transport route target value f 2 0 Representing the transport route target value f with the largest number of straight hairs 3 0 Representing the transport route target value, f, with the minimum sorting quantity 4 0 The total cost is the least transportation route target value.
In one embodiment of the present invention, after the assigning of the corresponding weights to the transport routes in the transport route set, the comprehensively evaluating the transport route set to determine an optimal logistics route network includes:
setting a corresponding priority factor P according to the priority degree of each transport route in the transport route set i Where i= {1,2,3,4}, by a function
Comprehensively evaluating the transport route set, and determining the transport route with the minimum value of the function F (x) as an optimal logistics route network, wherein F i (x) Representing the ith transport route in the transport route set, f i 0 Indicating the target value corresponding to the i-th transportation route.
According to a second aspect of the embodiment of the present invention, a determining apparatus for a logistics routing network includes:
the first determining module is used for determining the transportation route and the navigation distance from each node to other nodes according to the acquired position information of each node;
the generation module is used for respectively determining the transportation route results from each node to other nodes based on the transportation route and the navigation distance and generating a transportation route set;
and the second determining module is used for comprehensively evaluating the transport route set after giving corresponding weights to the transport routes in the transport route set so as to determine the optimal logistics route network.
According to a third aspect of embodiments of the present invention, there is provided a computer readable medium having stored thereon a computer program, characterized in that the program when executed by a processor implements the method for determining a logistics routing network of the first aspect.
According to a fourth aspect of an embodiment of the present invention, there is provided an electronic device including: one or more processors; and a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method for determining a logistics routing network of the first aspect.
The technical scheme provided by the embodiment of the invention can have the following beneficial effects:
the embodiment of the invention provides a method, a device, a medium and electronic equipment for determining a logistics routing network, which comprise the following steps: according to the obtained position information of each node, determining the transportation route and the navigation distance from each node to other nodes; based on the transport route and the navigation distance, respectively determining transport route results from each node to other nodes, and generating a transport route set; and after the corresponding weight is given to each transport route in the transport route set, comprehensively evaluating the transport route set to determine the optimal logistics route network. The technical scheme of the embodiment of the invention is based on the feasible routing network, and combines the actual transportation requirement and the service scene to flexibly and efficiently determine the optimal logistics routing network.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention. It is evident that the drawings in the following description are only some embodiments of the present invention and that other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art. In the drawings:
FIG. 1 schematically illustrates a flow chart of a method of determining a logistics routing network in accordance with one embodiment of the present invention;
FIG. 2 schematically illustrates a block diagram of a determination system of a logistics routing network in accordance with one embodiment of the present invention;
FIG. 3 schematically illustrates a flow chart of a logistics routing network determination algorithm in accordance with one embodiment of the present invention;
FIG. 4 schematically illustrates a block diagram of a determining device of a logistics routing network in accordance with one embodiment of the present invention;
fig. 5 shows a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the invention.
The block diagrams depicted in the figures are merely functional entities and do not necessarily correspond to physically separate entities. That is, the functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow diagrams depicted in the figures are exemplary only, and do not necessarily include all of the elements and operations/steps, nor must they be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
Fig. 1 schematically shows a flow chart of a method of determining a logistics routing network according to one embodiment of the present invention.
Referring to fig. 1, a method for determining a logistics routing network according to an embodiment of the present invention includes the steps of:
step S110, according to the obtained position information of each node, determining the transportation route and the navigation distance from each node to other nodes.
In one embodiment of the invention, the node may be a sorting center in a logistics transportation network, comprising: sorting center basic information and sorting center attribute information, wherein the sorting center basic information at least comprises: sorting center position information and sorting center maximum processing single-quantity information per hour; the sorting center attribute information includes: the system comprises a common sorting center, a provincial junction and an area junction, wherein the common sorting center is used for bearing a common sorting function, the provincial junction is used for bearing an inner-provincial and peripheral sorting and collecting/bulk cargo function, and the area junction is used for bearing an inner-area sorting and collecting/bulk cargo function.
In one embodiment of the invention, after the position information of each node is obtained, the transportation route from each node to other nodes and the navigation distance between the nodes are determined based on the longitude and latitude information in the position information.
Step S120, based on the transport route and the navigation distance, respectively determining the transport route result from each node to other nodes, and generating a transport route set.
In one embodiment of the invention, the determination of the logistics routing network is divided into multi-objective planning according to the unique needs of sorting, for example, planning can be performed from four aspects respectively: four target plans with optimal total route timeliness, maximum direct trunk route quantity, minimum sorting transit quantity and minimum total cost are realized, and a single target plan is solved by taking the four target plans as an example.
In one embodiment of the present invention, a first objective is to achieve an overall route aging optimum, specifically, to forward make a difference between a time of each access node and an access time opened by the node to obtain each time difference value, to sum each time difference value, and to determine a feasible transportation route from each node to other nodes within a time allowable range by using a minimum value of the obtained sum values, wherein:
determining the feasible transportation route, wherein beta is as follows j Representing the time of access to the node b j The access time of the node is represented, and min represents the minimum value;
and determining a transportation route with highest transportation timeliness from the determined feasible transportation routes, wherein the transportation route with highest transportation timeliness is determined by a function:
f 1 (x)＝∑ ij∈OD t ij (2)
by making the function f 1 (x) And determining the transport route with the minimum value as the transport route with the highest timeliness, wherein i represents a starting node, j represents a destination node, OD represents a set of feasible transport routes from each node to other nodes, and t represents the transport time of the feasible transport routes.
In one embodiment of the present invention, based on the foregoing scheme, the OD set should satisfy the following constraint:
(1) At least one of a straight forwarding route from an initial node to a destination node, a first forwarding route from the initial node to the destination node through one transit node, a second forwarding route from the initial node to the destination node through two transit nodes, and a third forwarding route from the initial node to the destination node through three transit nodes;
(2) The transportation paths from each node to other nodes meet the straight sending condition;
(3) When the transportation paths from each node to other nodes are parts, the freight bill quantity of the transportation paths is smaller than the whole freight bill quantity set by the transportation paths;
(4) The transportation path from each node to other nodes can only meet one transportation mode of whole vehicle transportation or part transportation.
In one embodiment of the present invention, the whole vehicle transportation refers to that a truck must be used alone for transportation due to the nature, shape, or transportation condition of the cargo; the above-mentioned spare part transportation refers to the form of transporting different cargos after being gathered into one car according to the same arrival when the cargos to be transported are not less than one car.
In one embodiment of the present invention, the second objective is to maximize the number of routes for straight delivery, specifically, based on the above-mentioned transportation route, determining the transportation route with the largest number of straight delivery, wherein the function is:
will cause the function f 2 (x) The maximum transport route is determined as the most straight transport route, where i denotes the start node, j denotes the destination node, and i+.j, P denotes the set including the individual nodes, x when the start node i is directly reachable to the destination node j ij =1, otherwise, x ij ＝0。
In one embodiment of the present invention, the third objective is to minimize the sorting number, specifically, based on the above-mentioned transportation route, determining the transportation route with the smallest sorting number, wherein the following functions are used:
will cause the function f 3 (x) The smallest transport route is determined as the transport route with the smallest sorting number, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the number of sorting nodes k passed from the originating node i to the destination node j, +.>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
In one embodiment of the present invention, the fourth objective is that the total cost is minimum, specifically, based on the above-mentioned transportation offline and navigation distance, determining the transportation route with the minimum total cost, wherein the total cost is determined by the function:
will cause the function f 4 (x) The transport route with the smallest value is determined as the transport route with the smallest total cost, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the costs associated with the selection of the transportation of the piece goods or the whole vehicle from the starting node i to the destination node j via the sorting node k>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
And step S130, after the corresponding weight is given to each transport route in the transport route set, comprehensively evaluating the transport route set to determine an optimal logistics route network.
In an embodiment of the present invention, after each single-objective planned transportation route determined in step S120 is determined, the determined transportation routes are combined and solved according to the priority order of each objective, so as to determine an optimal logistics routing network.
Before each transport route in the transport route set is given a corresponding weight, setting a corresponding target value to obtain a target vector for the transport route with the highest timeliness, the transport route with the largest number of straightforward routes, the transport route with the smallest sorting number and the transport route with the smallest total cost determined in the transport route set: f= (F) 1 0 ,f 2 0 ,f 3 0 ,f 4 0 ) Wherein f 1 0 Representing the most time-efficient transport route target value f 2 0 Representing the transport route target value f with the largest number of straight hairs 3 0 Representing the transport route target value, f, with the minimum sorting quantity 4 0 The total cost is the least transportation route target value.
In one embodiment of the invention, based on the foregoing, the method according to the foregoing transport route setSetting corresponding priority factors P for priority degree of each transport route i Where i= {1,2,3,4}, by the function:
comprehensively evaluating the transport route set, and determining the transport route with the minimum value of the function F (x) as an optimal logistics route network, wherein F i (x) Representing the ith transport route in the transport route set, f i 0 Indicating the target value corresponding to the i-th transportation route.
Fig. 2 schematically illustrates a block diagram of a determination system of a logistics routing network in accordance with one embodiment of the present invention.
As shown in fig. 2, the determining system of the logistics routing network according to one embodiment of the present invention includes: a logistics routing network algorithm core 201, basic data 202 and configuration information 203; wherein,
the base data 202 includes:
sorting center basic information: sorting center position information and sorting center maximum processing single-quantity information per hour;
sorting center attribute: common sorting: bears the common sorting function; the provincial junction: bears the functions of inner-province and peripheral sorting and collecting/bulk cargo; regional hub: a sorting and collecting/bulk cargo function in the bearing area;
vehicle resource pool: vehicle types may be used; the theoretical loading rate of the vehicle may be used; vehicle cost may be used;
navigation of vehicle running: distance travelled by the vehicle; the vehicle driving time; a vehicle travel track;
the base data 202 is used for the flow routing network algorithm core 201 to call.
The configuration information 203 includes:
sorting center attribute configuration: each sort assumes different responsibilities according to configuration; if no configuration exists, sorting the same grade;
transfer relation in sorting center: the system is used for configuring three-level supporting relations of sorting, provincial junction and regional junction; support dual region selection; if no configuration exists, no supporting relationship (parallel to the whole network) is arranged between sorting;
sorting wave number setting: setting the time information of the daily arrival and departure times of the trunk and branch lines according to the service requirements; dry leg opening standard configuration: the method comprises the steps of carrying out a first treatment on the surface of the Complete vehicle and spare part opening standard: benchmark amount, transportation distance and recommended vehicle model; forced opening circuit configuration;
capacity priority configuration: capacity of transport: railway, sea, air, car (whole car, piece);
regional cargo quantity configuration: different provinces/areas, order volume, weight configuration;
the configuration information 203 is used for the invocation by the flow routing network algorithm core 201.
The logistics routing network algorithm core 201 comprises:
step S2011, determining all feasible route lines according to the sorting center basic information and the sorting center attribute information in the basic data 202;
step S2012, according to the vehicle resource pool in the basic data 202 and the sorting center attribute configuration, sorting center transfer relation, regional cargo quantity, sorting wave number and trunk branch line opening standard in the configuration information 203, configuring cargo collection/transfer rules, sorting node connection and available transport capacity resources for each feasible route line;
step S2013, determining the transport route with the optimal total time effect, the transport route with the largest number of straight trunk lines, the transport route with the smallest total sorting number and the transport route with the smallest total cost according to the vehicle driving navigation in the basic data 202 and the transport capacity priority and the objective function priority in the configuration information 203;
and step S2014, comprehensively evaluating the transportation route determined in the step S2013 according to the priority, and outputting an optimal logistics routing network.
Fig. 3 schematically shows a flow chart of a logistics routing network determination algorithm according to one embodiment of the present invention.
As shown in fig. 3, the flow of the logistics routing network determination algorithm according to one embodiment of the present invention comprises:
step S301: acquiring routes between every two nodes according to longitude and latitude of each node;
step S302: calculating the navigation distance between every two nodes according to the longitude and latitude of the nodes;
step S303: determining an independent solving mode of each target one by one according to the unique sorting requirement;
step S304: the route total aging is optimal;
in one embodiment of the invention, the optimization is performed in two steps, according to the sorting shift time requirement, wherein,
the first step: selecting a feasible route reached in the shift time, and accessing all time beta of the sorting center j Time b required by sorting center j The sum of forward differences of (2) is minimized by the function:
determining feasible routes within a time allowed range, wherein beta j Representing the time of access to the node b j The access time of the node is represented, and min represents the minimum value;
and a second step of: the route total aging is optimal, and the total aging is realized by the following functions:
f 1 (x)＝∑ ij∈OD t ij
by making the function f 1 (x) The transportation route with the minimum value is determined to be the transportation route with the highest timeliness, wherein i represents a starting node, j represents a destination node, OD represents a set of feasible transportation routes from each node to other nodes, and t represents the transportation time of the feasible transportation routes;
in one embodiment of the invention, the requirements for each OD constraint include:
(1) Each OD has four routes, i.e., straight, through one transit point, through two transit points, through three transit points, only one line;
(2) Each arc can meet the hair straightening condition;
(3) When the arc is a part, the single quantity on the arc is smaller than the constraint of the whole vehicle corresponding to the arc;
(4) Each arc has at most 1 running method, and the whole car or the parts are on the order.
Step S305: the number of routes of the direct trunk is the largest;
in one embodiment of the invention, the function is performed by:
will cause the function f 2 (x) The maximum transport route is determined as the most straight transport route, where i denotes the start node, j denotes the destination node, and i+.j, P denotes the set including the individual nodes, x when the start node i is directly reachable to the destination node j ij =1, otherwise, x ij ＝0。
Step S306: the total parts transfer quantity is minimum;
in one embodiment of the invention, the function is performed by:
will cause the function f 3 (x) The smallest transport route is determined as the transport route with the smallest sorting number, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the number of sorting nodes k passed from the originating node i to the destination node j, +.>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
Step S307: the total cost is minimal;
in one embodiment of the invention, the function is performed by:
will cause the function f 4 (x) The transport route with the smallest value is determined as the transport route with the smallest total cost, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the costs associated with the selection of the transportation of the piece goods or the whole vehicle from the starting node i to the destination node j via the sorting node k>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
Step S308: after the corresponding weight is given to each transport route in the transport route set, comprehensively evaluating the transport route set;
in one embodiment of the present invention, a target value for achieving the objective is predetermined for each objective in steps S304-S307, respectively, to obtain the following objective vector:
F＝(f 1 0 ,f 2 0 ,f 3 0 ,f 4 0 )
setting different priority factors according to priority levels for each target, and recording as P i Where i= {1,2,3,4}, by a function
Comprehensively evaluating the transport route set, and determining the transport route with the minimum value of the function F (x) as an optimal logistics route network, wherein F i (x) Representing the ith transport route in the transport route set, f i 0 Indicating the target value corresponding to the i-th transportation route.
Step S309: and (3) carrying out target solving on F (x) of the step S308, and obtaining the required optimal object flow routing network.
The technical scheme of the embodiment of the invention is based on the feasible routing network, combines the actual transportation requirement and the service scene, flexibly and efficiently determines the optimal logistics routing network, reduces the labor cost and realizes the multi-objective function rapid planning of the whole logistics network.
The following describes an embodiment of the device of the present invention, which may be used to perform the above-described method for determining a physical distribution routing network of the present invention.
Fig. 4 schematically shows a block diagram of a determining device of a logistics routing network according to one embodiment of the present invention.
Referring to fig. 4, a determining apparatus 400 of a logistics routing network according to an embodiment of the present invention includes:
a first determining module 401, configured to determine a transportation route and a navigation distance from each node to other nodes according to the obtained location information of each node;
a generating module 402, configured to determine transport route results from each node to other nodes based on the transport route and the navigation distance, and generate a transport route set;
and a second determining module 403, configured to assign a corresponding weight to each transport route in the transport route set, and then comprehensively evaluate the transport route set to determine an optimal logistics route network.
Since each functional module of the determining device for a physical distribution routing network according to an exemplary embodiment of the present invention corresponds to a step of the exemplary embodiment of the determining method for a physical distribution routing network according to the first aspect, for details not disclosed in the embodiment of the device according to the present invention, please refer to the determining method for a physical distribution routing network according to the first aspect of the present invention.
Referring now to FIG. 5, there is illustrated a schematic diagram of a computer system 500 suitable for use in implementing an electronic device of an embodiment of the present invention. The computer system 500 of the electronic device shown in fig. 5 is only an example and should not be construed as limiting the functionality and scope of use of embodiments of the invention.
As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 505 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the system operation are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as needed so that a computer program read therefrom is mounted into the storage section 508 as needed.
In particular, according to embodiments of the present invention, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present invention 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 shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 509, and/or installed from the removable media 511. The above-described functions defined in the system of the present application are performed when the computer program is executed by a Central Processing Unit (CPU) 501.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any 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 context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. 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 flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present invention may be implemented by software, or may be implemented by hardware, and the described units may also be provided in a processor. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.
As another aspect, the present application also provides a computer-readable medium that may be contained in the electronic device described in the above embodiment; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by one of the electronic devices, cause the electronic device to implement the method of determining a logistics routing network as in the above embodiments.
For example, the electronic device described above may implement the configuration shown in fig. 1: step S110, determining the transportation route and the navigation distance from each node to other nodes according to the acquired position information of each node; step S120, based on the transport route and the navigation distance, respectively determining transport route results from each node to other nodes, and generating a transport route set; and step S130, after the corresponding weight is given to each transport route in the transport route set, comprehensively evaluating the transport route set to determine an optimal logistics route network.
It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the invention. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present invention may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, and includes several instructions to cause a computing device (may be a personal computer, a server, a touch terminal, or a network device, etc.) to perform the method according to the embodiments of the present invention.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
It is to be understood that the invention is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the invention is limited only by the appended claims.
Claims (11)
1. A method for determining a physical distribution routing network, comprising:
according to the obtained position information of each node, determining the transportation route and the navigation distance from each node to other nodes;
based on the transportation route and the navigation distance, respectively determining transportation route results from each node to other nodes, and generating a transportation route set;
after the corresponding weight is given to each transport route in the transport route set, comprehensively evaluating the transport route set to determine an optimal logistics route network;
and determining the transportation route result from each node to other nodes based on the transportation route and the navigation distance, wherein the method comprises the following steps:
forward differencing the time of each access node and the access time opened by the node to obtain each time difference value, adding the time difference values, and determining the feasible transportation route from each node to other nodes within the time allowable range by the minimum value in the obtained added value;
and determining the transportation route with highest transportation timeliness from the determined feasible transportation routes.
2. The method of determining a physical distribution routing network according to claim 1, wherein the function is:
determining the viable transport route, wherein β j Representing the time of access to the node b j Representing access opened by a nodeTime, min represents the minimum value;
by the function:
f 1 (x)＝∑ ij∈OD t ij
causing the function f to 1 (x) And determining the transport route with the minimum value as the transport route with the highest timeliness, wherein i represents a starting node, j represents a destination node, OD represents a set of feasible transport routes from each node to other nodes, and t represents the transport time of the feasible transport routes.
3. The method of determining a logistics routing network of claim 2, wherein the OD represents a set of feasible transportation routes from each node to other nodes, comprising:
constraints of the OD set include:
at least one of a straight forwarding route in which an origin node reaches a destination node, a first forwarding route in which the origin node reaches the destination node through one transit node, a second forwarding route in which the origin node reaches the destination node through two transit nodes, and a third forwarding route in which the origin node reaches the destination node through three transit nodes, and
the transportation path from each node to other nodes satisfies the hair straightening condition, and
when the transportation path from each node to other nodes is the part transportation, the freight bill quantity of the transportation path is smaller than the whole freight bill quantity set by the transportation path, and
the transportation path from each node to other nodes can only meet one transportation mode of whole vehicle transportation or part transportation.
4. The method of determining a logistics routing network of claim 2, further comprising:
and determining the transportation route with the largest number of straight sending out based on the transportation route, wherein the transportation route is determined by a function:
will cause the function f 2 (x) The maximum transport route is determined as the most straight transport route, where i denotes the start node, j denotes the destination node, and i+.j, P denotes the set including the individual nodes, x when the start node i is directly reachable to the destination node j ij =1, otherwise, x ij ＝0。
5. The method of determining a logistics routing network of claim 2, further comprising:
and determining the transportation route with the minimum sorting quantity based on the transportation route, wherein the transportation route with the minimum sorting quantity is determined by a function:
will cause the function f 3 (x) The smallest transport route is determined as the transport route with the smallest sorting number, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the number of sorting nodes k passed from the originating node i to the destination node j, +.>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
6. The method of determining a logistics routing network of claim 2, further comprising:
and determining a transportation route with the minimum total cost based on the transportation offline and the navigation distance, wherein the transportation route with the minimum total cost is determined by a function:
will cause the function f 4 (x) The transport route with the smallest value is determined as the transport route with the smallest total cost, wherein i represents the starting node, j represents the destination node, OD represents the set of feasible transport routes from each node to other nodes,representing the costs associated with the selection of the transportation of the piece goods or the whole vehicle from the starting node i to the destination node j via the sorting node k>Indicating whether the originating node i to the destination node j are reachable or not, and when reachable, the +.>When it is not reachable, the person is left->
7. The method of determining a physical distribution routing network according to claim 1, wherein before assigning a corresponding weight to each transport route in the set of transport routes, the method further comprises:
setting corresponding target values for the transport route with highest timeliness, the transport route with the largest number of straight routes, the transport route with the smallest sorting number and the transport route with the smallest total cost determined in the transport route set to obtain a target vector：Wherein f 1 0 Representing the most time-efficient transport route target value, for example>Representing the transport route target value f with the largest number of straight hairs 3 0 A transport route target value representing the smallest sorting quantity,/->The total cost is the least transportation route target value.
8. The method for determining a physical distribution route network according to claim 1, wherein after assigning a corresponding weight to each transport route in the transport route set, performing comprehensive evaluation on the transport route set to determine an optimal physical distribution route network, comprising:
setting a corresponding priority factor P according to the priority degree of each transport route in the transport route set i Where i= {1,2,3,4}, by a function
Comprehensively evaluating the transport route set, and determining the transport route with the minimum value of the function F (x) as an optimal logistics route network, wherein F i (x) Representing an ith transport route in the collection of transport routes, f i 0 Indicating the target value corresponding to the i-th transportation route.
9. A device for determining a physical distribution routing network, comprising:
the first determining module is used for determining the transportation route and the navigation distance from each node to other nodes according to the acquired position information of each node;
the generation module is used for respectively determining the transportation route results from each node to other nodes based on the transportation route and the navigation distance and generating a transportation route set; and determining the transportation route result from each node to other nodes based on the transportation route and the navigation distance, wherein the method comprises the following steps: forward differencing the time of each access node and the access time opened by the node to obtain each time difference value, adding the time difference values, and determining the feasible transportation route from each node to other nodes within the time allowable range by the minimum value in the obtained added value; determining a transportation route with highest transportation timeliness from the determined feasible transportation routes;
and the second determining module is used for comprehensively evaluating the transport route set after giving corresponding weights to the transport routes in the transport route set to determine the optimal logistics route network.
10. A computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements a method of determining a logistics routing network as claimed in any one of claims 1 to 8.
11. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs which when executed by the one or more processors cause the one or more processors to implement the method of determining a logistics routing network as claimed in any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910176740.3A CN111667085B (en) | 2019-03-08 | 2019-03-08 | Logistics routing network determining method, device, medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910176740.3A CN111667085B (en) | 2019-03-08 | 2019-03-08 | Logistics routing network determining method, device, medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111667085A CN111667085A (en) | 2020-09-15 |
| CN111667085B true CN111667085B (en) | 2024-04-09 |
Family
ID=72382191
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910176740.3A Active CN111667085B (en) | 2019-03-08 | 2019-03-08 | Logistics routing network determining method, device, medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111667085B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112183860B (en) * | 2020-09-28 | 2024-05-03 | 上海寻梦信息技术有限公司 | Method, device, electronic equipment and storage medium for dynamic routing of warehouse package |
| CN112330241B (en) * | 2020-10-13 | 2023-03-24 | 深圳市中农易讯信息技术有限公司 | Logistics visualization method, device, equipment and medium |
| CN113762573B (en) * | 2020-11-17 | 2023-11-03 | 北京京东振世信息技术有限公司 | Logistics network optimization method and device |
| CN113762866A (en) * | 2021-01-07 | 2021-12-07 | 北京京东振世信息技术有限公司 | Logistics information processing method, device and system |
| CN114154930A (en) * | 2021-11-30 | 2022-03-08 | 北京京东振世信息技术有限公司 | Method and device for determining logistics distribution network, terminal equipment and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015024639A1 (en) * | 2013-08-19 | 2015-02-26 | Amadeus S.A.S. | Ground-transportation network representation |
| CN107341633A (en) * | 2017-06-26 | 2017-11-10 | 海航创新科技研究有限公司 | Regulate and control the method and apparatus of logistics route |
| CN107918849A (en) * | 2017-10-23 | 2018-04-17 | 深圳职业技术学院 | A kind of intelligent scheduling device and method of electronic logistics van |
| CN107944598A (en) * | 2017-10-31 | 2018-04-20 | 苏宁云商集团股份有限公司 | A kind of logistics route collocation method and system |
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN109002934A (en) * | 2018-08-31 | 2018-12-14 | 华中科技大学 | A kind of newly-built logistics node correlation important indicator prediction technique of freight transport network |
| CN109272278A (en) * | 2018-10-26 | 2019-01-25 | 四川长虹电器股份有限公司 | Factory Logistics intelligent transportation system based on CRDC |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2375364A1 (en) * | 2010-04-12 | 2011-10-12 | Karlsruher Institut für Technologie | Method and system for time-dependent routing |
| US9228841B2 (en) * | 2014-06-02 | 2016-01-05 | Xerox Corporation | Methods and systems for determining routes in a navigation system |
| US20160048802A1 (en) * | 2014-08-13 | 2016-02-18 | Tianyu Luwang | Transportation planning for a regional logistics network |
-
2019
- 2019-03-08 CN CN201910176740.3A patent/CN111667085B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015024639A1 (en) * | 2013-08-19 | 2015-02-26 | Amadeus S.A.S. | Ground-transportation network representation |
| CN107341633A (en) * | 2017-06-26 | 2017-11-10 | 海航创新科技研究有限公司 | Regulate and control the method and apparatus of logistics route |
| CN107918849A (en) * | 2017-10-23 | 2018-04-17 | 深圳职业技术学院 | A kind of intelligent scheduling device and method of electronic logistics van |
| CN107944598A (en) * | 2017-10-31 | 2018-04-20 | 苏宁云商集团股份有限公司 | A kind of logistics route collocation method and system |
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN109002934A (en) * | 2018-08-31 | 2018-12-14 | 华中科技大学 | A kind of newly-built logistics node correlation important indicator prediction technique of freight transport network |
| CN109272278A (en) * | 2018-10-26 | 2019-01-25 | 四川长虹电器股份有限公司 | Factory Logistics intelligent transportation system based on CRDC |
Non-Patent Citations (8)
| Title |
|---|
| Research on loading and routing problem of finished car logistics;Zhenping Li 等;IEEE;第1-6页 * |
| 公路零担物流企业末端配送路径优化;邓红星;王玮琦;王永康;;交通科技与经济(04);第227页 * |
| 图论优化法在物流运输中的运用;袁庚;;信息与电脑(理论版)(16);第97-99页 * |
| 基于禁忌搜索带时间窗与车载约束的配送路线研究;杨艳艳;马成林;王怡菲;李丽莎;褚楚;高昆仑;;森林工程(03);第100-106页 * |
| 基于选址-运输路线的中欧班列国际运输网络优化研究;文思涵;张军;;重庆工商大学学报(自然科学版)(04);第88-96页 * |
| 战时运输风险评估模型及其路径优化研究;姜海洋;周宽久;林林;郝佳亮;郭铖;;计算机工程与应用(17);第235-242页 * |
| 推理神经网络对物流路径最优选择方法分析;鲍建成;;物流技术(23);第157-159页 * |
| 物流运输快速配送路径规划仿真;王力锋;刘双双;刘抗英;;计算机仿真(08);第342-345页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111667085A (en) | 2020-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111667085B (en) | Logistics routing network determining method, device, medium and electronic equipment | |
| Engevall et al. | The heterogeneous vehicle-routing game | |
| CN110059900B (en) | Method and device for controlling transport vehicles in a warehouse | |
| CN111428991B (en) | Method and device for determining delivery vehicles | |
| CN111950803A (en) | Logistics object delivery time prediction method and device, electronic equipment and storage medium | |
| CN110555640A (en) | Method and device for route planning | |
| Hu et al. | A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost | |
| CN111723999A (en) | Distribution route determining method, device, equipment and storage medium | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN110826951A (en) | Transportation line stowage method and device, electronic equipment and computer readable medium | |
| CN113128744A (en) | Distribution planning method and device | |
| Giménez-Palacios et al. | First-mile logistics parcel pickup: Vehicle routing with packing constraints under disruption | |
| CN111382894B (en) | Cabin booking planning method, device, equipment and storage equipment | |
| CN111308995A (en) | Method, device, medium, and electronic apparatus for scheduling transfer robot | |
| CN113255950B (en) | Method and device for optimizing logistics network | |
| CN113222205A (en) | Path planning method and device | |
| CN111428902B (en) | Method and device for determining transport route | |
| CN111860918B (en) | Distribution method and device, electronic equipment and computer readable medium | |
| CN113887844B (en) | Logistics routing network determining method and device and electronic equipment | |
| CN110321399A (en) | The method and apparatus for selecting address | |
| CN113762573B (en) | Logistics network optimization method and device | |
| Silva et al. | Pallets delivery: Two matheuristics for combined loading and routing | |
| Ibrahim et al. | Solving some variants of vehicle routing problem with Branch-and-cut and Column generation algorithms | |
| CN111738895B (en) | Multi-station passenger transport line generation method, device, medium and electronic equipment | |
| CN113379340B (en) | Order transportation route determining method and device, storage medium and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210311 Address after: 6 / F, 76 Zhichun Road, Haidian District, Beijing 100086 Applicant after: Beijing Jingdong Zhenshi Information Technology Co.,Ltd. Address before: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant before: Beijing Jingbangda Trading Co.,Ltd. Effective date of registration: 20210311 Address after: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant after: Beijing Jingbangda Trading Co.,Ltd. Address before: 100086 8th Floor, 76 Zhichun Road, Haidian District, Beijing Applicant before: BEIJING JINGDONG SHANGKE INFORMATION TECHNOLOGY Co.,Ltd. Applicant before: BEIJING JINGDONG CENTURY TRADING Co.,Ltd. |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |