CN112308266A - Warehouse site selection method, device, equipment and readable storage medium - Google Patents

Warehouse site selection method, device, equipment and readable storage medium Download PDF

Info

Publication number
CN112308266A
CN112308266A CN201910680917.3A CN201910680917A CN112308266A CN 112308266 A CN112308266 A CN 112308266A CN 201910680917 A CN201910680917 A CN 201910680917A CN 112308266 A CN112308266 A CN 112308266A
Authority
CN
China
Prior art keywords
bin
alternative
warehouse
order
candidate
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.)
Granted
Application number
CN201910680917.3A
Other languages
Chinese (zh)
Other versions
CN112308266B (en
Inventor
赵迎光
胡文博
周立
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN201910680917.3A priority Critical patent/CN112308266B/en
Publication of CN112308266A publication Critical patent/CN112308266A/en
Application granted granted Critical
Publication of CN112308266B publication Critical patent/CN112308266B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/043—Optimisation of two dimensional placement, e.g. cutting of clothes or wood
    • 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/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

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)
  • Accounting & Taxation (AREA)
  • Finance (AREA)

Abstract

The invention provides a warehouse site selection method, a device, equipment and a readable storage medium, wherein a plurality of alternative warehouse combinations are obtained from a first alternative warehouse set corresponding to a preset order task; acquiring a substitute bin of each alternative bin combination and a substitute delivery time limit of the substitute bin; replacing the alternative bin combination corresponding to the optimal alternative bin in the first alternative bin set by the optimal alternative bin to obtain a second alternative bin set, wherein the optimal alternative bin is a single alternative bin with the shortest time effectiveness for each alternative delivery; if the number of the warehouses in the second alternative warehouse set is less than or equal to the number of the warehouses to be determined, the addresses of the warehouses in the second alternative warehouse set are used as the optimal site selection of the warehouses to be determined, heuristic site warehouse site selection is achieved, a complex modeling process is not needed, calculation is simple, the speed and the accuracy of site selection of the warehouses are improved, and further the reliability of site selection of the warehouses is improved.

Description

Warehouse site selection method, device, equipment and readable storage medium
Technical Field
The invention relates to the technical field of warehouse logistics, in particular to a warehouse site selection method, device, equipment and readable storage medium.
Background
With the rise of online markets worldwide, online transactions provide a convenient and efficient way for customers and retailers. To support the plethora of transaction services on-line, on-line retailers need to improve the supply chain network to provide more efficient services. How to optimize warehouse site selection of a logistics system which is one of key links in a supply chain network is one of key factors for improving the logistics transportation quality and efficiency.
In the existing warehouse site selection method, the site selection of the optimal warehouse is usually carried out by a factor specific gravity method or a gravity center method. The factor-specific gravity method is to judge the importance of various influencing factors by a decision maker and estimate the location of the selected site of the warehouse. The barycenter method is to mark the coordinate points of each dispatch destination in the coordinate system to determine the relative distance of each dispatch destination. Then, according to the horizontal and vertical coordinate values of each coordinate point, the transportation rate of the position coordinates x and y with the lowest transportation cost and the distance from each coordinate point to the point are obtained, and the coordinate point with the lowest total transportation cost is obtained as the optimal warehouse site.
However, the factor-specific gravity method is a subjective judgment depending on the experience of a decision maker, and the gravity center method can only solve the problem of single-warehouse selection and is difficult to be used in the site selection scene of multiple warehouses. Therefore, the existing warehouse site selection method is not high in reliability.
Disclosure of Invention
The embodiment of the invention provides a warehouse site selection method, a warehouse site selection device, warehouse site selection equipment and a readable storage medium, wherein the efficiency and the reliability of site selection of a plurality of warehouses are improved by taking the time efficiency as a replacement basis of an alternative warehouse combination.
In a first aspect of the embodiments of the present invention, a method for location selection in a warehouse is provided, including:
acquiring a plurality of alternative bin combinations in a first alternative bin set corresponding to a preset order task;
acquiring a substitute bin of each alternative bin combination and a substitute delivery time limit of the substitute bin;
replacing the alternative bin combination corresponding to the optimal alternative bin in the first alternative bin set by the optimal alternative bin to obtain a second alternative bin set, wherein the optimal alternative bin is a single alternative bin with the shortest time effectiveness for each alternative delivery;
and if the number of the warehouses in the second alternative warehouse set is less than or equal to the number of the warehouses to be determined, taking the address of each warehouse in the second alternative warehouse set as the optimal address of the warehouse to be determined.
In a second aspect of the embodiments of the present invention, there is provided a warehouse address selection device, including:
the combination module is used for acquiring a plurality of alternative bin combinations in a first alternative bin set corresponding to a preset order task;
the processing module is used for acquiring the alternative bins of each alternative bin combination and the alternative delivery time efficiency of the alternative bins;
a replacement module, configured to replace, by an optimal replacement bin, a candidate bin combination corresponding to the optimal replacement bin in the first candidate bin set to obtain a second candidate bin set, where the optimal replacement bin is a single replacement bin with a shortest replacement delivery time;
and the judging module is used for taking the address of each warehouse in the second candidate bin set as the optimal address of the warehouse to be determined if the number of the warehouses in the second candidate bin set is less than or equal to the number of the warehouses to be determined.
In a third aspect of the embodiments of the present invention, an apparatus is provided, including: memory, a processor and a computer program stored in the memory, the processor running the computer program to perform the warehouse addressing method of the first aspect of the invention and of the various possible designs of the first aspect.
A fourth aspect of the embodiments of the present invention provides a readable storage medium, in which a computer program is stored, and the computer program is used for implementing the warehouse location method according to the first aspect of the present invention and various possible designs of the first aspect of the present invention when the computer program is executed by a processor.
According to the warehouse site selection method, the device, the equipment and the readable storage medium, a plurality of alternative warehouse combinations are obtained from a first alternative warehouse set corresponding to a preset order task; acquiring a substitute bin of each alternative bin combination and a substitute delivery time limit of the substitute bin; replacing the alternative bin combination corresponding to the optimal alternative bin in the first alternative bin set by the optimal alternative bin to obtain a second alternative bin set, wherein the optimal alternative bin is a single alternative bin with the shortest time effectiveness for each alternative delivery; if the number of the warehouses in the second alternative warehouse set is less than or equal to the number of the warehouses to be determined, the addresses of the warehouses in the second alternative warehouse set are used as the optimal site selection of the warehouses to be determined, heuristic site warehouse site selection is achieved, a complex modeling process is not needed, calculation is simple, the speed and the accuracy of site selection of the warehouses are improved, and further the reliability of site selection of the warehouses is improved.
Drawings
Fig. 1 is a schematic flow chart of a warehouse address selection method according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of another warehouse location method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a warehouse and order address location provided by an embodiment of the invention;
fig. 4 is a schematic diagram of a correspondence between alternative warehouse and order address provided in the embodiment of the present invention;
fig. 5 is a schematic diagram of a correspondence between a second candidate bin set and an order address according to an embodiment of the present invention;
fig. 6 is a schematic diagram of another corresponding relationship between the second set of candidate bins and the order address according to the embodiment of the present invention;
fig. 7 is a schematic diagram of a correspondence relationship between a second set of candidate bins and an order address according to another embodiment of the present invention;
fig. 8 is a schematic structural diagram of an address selecting device for a warehouse according to an embodiment of the present invention;
fig. 9 is a schematic diagram of a hardware structure of an apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," and the like in the description and in the claims, and in the drawings described above, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein.
It should be understood that, in various embodiments of the present invention, the sequence numbers of the processes do not mean the execution sequence, and the execution sequence of the processes should be determined by the functions and the internal logic of the processes, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
It should be understood that in the present application, "comprising" and "having" and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that, in the present invention, "a plurality" means two or more. "and/or" is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "comprises A, B and C" and "comprises A, B, C" means that all three of A, B, C comprise, "comprises A, B or C" means that one of A, B, C comprises, "comprises A, B and/or C" means that any 1 or any 2 or 3 of A, B, C comprises.
It should be understood that in the present invention, "B corresponding to a", "a corresponds to B", or "B corresponds to a" means that B is associated with a, and B can be determined from a. Determining B from a does not mean determining B from a alone, but may be determined from a and/or other information. And the matching of A and B means that the similarity of A and B is greater than or equal to a preset threshold value.
As used herein, "if" may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context.
It should be understood that in the present invention, the support relationship, which refers to the warehouse and the goods flow relationship between the warehouses, is a 1-to-many relationship. For example, the support relationship of warehouse a specifies which warehouse or warehouses the goods of warehouse a can be delivered to support.
The delivery relationship, which is the relationship between the warehouse and the order address, is a 1-to-many relationship, and specifies which order addresses are delivered by which warehouse. A delivery relationship may also be understood as a delivery scope of a warehouse, such as a list of cities that a warehouse may deliver.
The time efficiency is the proportion of the single amount of x days in the total single amount. For example, a single specific gravity of more than 90% for 3 days or the next day indicates that 90% of the satisfying efficiency is achieved.
The selectable warehouse refers to the largest selectable warehouse range when the warehouse is addressed, such as all addresses where the warehouse can be built, or a warehouse provided by a warehouse leasing company and available for leasing by users.
The alternative warehouse is a warehouse selected from the optional warehouses, for example, the part of the optional warehouses with the shortest time for the task distribution of each order in all the optional warehouses. The alternate bin is all or part of the selectable bin.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
In some application scenarios, such as a warehouse rental scenario, a customer needs to logistics transport order tasks of 6 cities, and in order to improve distribution efficiency through overall planning, 3 warehouses need to be rented to a warehouse rental company. However, in a large number of optional warehouses, how to decide which warehouse locations to rent to meet the highest delivery timeliness is an urgent problem to be solved.
In other application scenarios, there are multiple addresses where warehouses can be built, for example, but the user can only build up 3 warehouses at most due to financial budgeting or warehousing planning. Then, how to select 3 warehouses from the addresses of the multiple visible warehouses and achieve the purpose of overall optimizing the delivery timeliness is an urgent problem to be solved.
In the application scenario, if the selection is performed only by the prior experience, the deviation is likely to occur, and the time efficiency cannot reach the highest. However, if the existing center-of-gravity method suitable for site selection of a single warehouse is used for site selection of the warehouse, site selection of multiple warehouses is difficult to achieve at the same time.
In order to solve the problems existing in the existing warehouse site selection method, the invention provides a warehouse site selection method, which selects a warehouse set with optimal delivery timeliness from a large number of alternative warehouses by the combined selection and replacement of alternative warehouses, so that the reliability of warehouse site selection is improved while the calculation is simple.
Referring to fig. 1, which is a schematic flowchart of a warehouse address selecting method according to an embodiment of the present invention, an execution main body of the method shown in fig. 1 may be a software and/or hardware device, such as a terminal or a server, or a software module disposed in the terminal or the server, and the following is only to explain by taking the server as an example, but the present invention is not limited thereto. The method shown in fig. 1 includes steps S101 to S104, which are specifically as follows:
s101, acquiring a plurality of alternative bin combinations in a first alternative bin set corresponding to a preset order task.
The predetermined order task may be historical order data including an order address or an estimated order task expected to be delivered. The first choice may be to determine the first set of candidate bins according to the preset order task, so that the candidate bins in the first set of candidate bins can meet the delivery requirements of the preset order task. In some embodiments, the first set of alternative bins may be determined from preset alternative bins, such as all warehouses available for lease provided by a warehouse lease company, or all addresses where a bin may be built.
The candidate bin combination may be a combination of a plurality of candidate bins. However, in order to improve the optimization effect, preferably, each candidate bin and other candidate bins may be combined in pairs in the first candidate bin set corresponding to the preset order task to obtain a plurality of candidate bin combinations. Specifically, in an embodiment where the first candidate bin set includes a number of candidate bins, the candidate bins in the first candidate bin set are combined pairwise to obtain a combination
Figure BDA0002144754660000061
The combination of the alternative bins: { (w)i,wj) I, j ∈ a, i ≠ j }, where wiAnd wjRespectively, the ith and jth candidate bins in the first set of candidate bins.
S102, acquiring a substitute bin of each alternative bin combination and a substitute delivery time limit of the substitute bin.
It should be understood that the alternative bins of the alternative bin combination should at least be capable of complete replacement of the order tasks to be delivered by the alternative bin combination. For example, the combination of candidate bins (lan zhou bin, west ampere bin) is for delivering the city of wuluqie and chongqing. Then, if the two optional bins for distribution of wuluqie and chongqing cannot be provided, the two optional bins cannot be used as the substitute bins for the optional bin combination (lanzhou bin and sienna bin).
In some embodiments, the server may determine a combined order task of the alternative bin combination according to the order task corresponding to each alternative bin included in the alternative bin combination. The combined order task can be understood as a union of the order tasks corresponding to the alternative bin combinations. In the alternative warehouse combination (Lanzhou warehouse and Xian warehouse), the city distributed by the Lanzhou warehouse is Wuluqin, and the Wuluqin corresponds to 50 bills; the city that the xi' an storehouse corresponds to and delivers is Chongqing, and Chongqing corresponds 60 singly. Then, the get combined order task is: 50 single Wulu wood qi and 60 single Chongqing. Then, the server determines a target optional bin which meets the replacement condition of the alternative bin combination in preset optional bins. The preset optional bins are, for example, all the warehouses available for lease provided by the warehouse lease company, or all the addresses of the storehouses that can be built. In different scenarios, different alternative conditions may be introduced. If the support relationship and the delivery range are taken as examples, the server may obtain the support relationship between each of the candidate bins included in the candidate bin combination and the other candidate bins in the first candidate bin set. And the server acquires a combined order address according to the combined order task. And the server takes the optional warehouse which meets the support relationship and has the delivery range including the combined order address as a target optional warehouse which meets the replacement condition of the combination of the optional warehouses in the preset optional warehouses.
For example, each alternative combination (w) generated for the above stepsi,wj) Set W ═ W from all (n) selectable binsxX ∈ n } may be selected as an alternative (wi,wj) Target selectable bin w ofx，wxThe following conditions are satisfied:
1)wxin place of wiAnd wjAfter, wxThe original supporting relationship can be kept for the set formed by other un-replaced bins in the first alternative bin set.
2)wxCan dispense wiAnd wjThe address of the order being delivered, i.e. wxSatisfy wiAnd wjThe distribution relationship of (1).
If it is assumed that all the preset selectable bins can support each other and each selectable bin can deliver all the order addresses, all the selectable bins in the set W are target selectable bins, i.e. replacement bins for selecting a combination of selectable bins from the set W.
In the above embodiment, after the target selectable bins are determined, the server respectively obtains the delivery timeliness of each target selectable bin for the combined order task. It will be appreciated that a delivery age is calculated for the combined order task (wuluqizi 50 order and chongqing 60 order) obtained above with each target selectable bin. The calculation mode of the delivery timeliness can be understood as that the delivery timeliness of the target selectable warehouse to the order tasks on the single order address is determined firstly, and then the delivery timeliness of the order tasks on all the order addresses included in the combined order task is summed, so that the delivery timeliness of the target selectable warehouse to the combined order task is obtained. The distribution time limit of the order task corresponding to the single order address is the product of the transportation time length from the target selectable bin to the single order address and the single quantity of the order address.
In the above embodiment, after obtaining the delivery timeliness of each target selectable bin for the combined order task, the server may further use the target selectable bin with the shortest delivery timeliness as a substitute bin for the combination of the selectable bins. And taking the delivery time limit of the combined order task by the substitute warehouse as the substitute delivery time limit of the substitute warehouse.
S103, replacing the candidate bin combination corresponding to the optimal replacement bin in the first candidate bin set by the optimal replacement bin to obtain a second candidate bin set, wherein the optimal replacement bin is a single replacement bin with the shortest replacement delivery time.
When the alternative bins of the multiple alternative bin combinations are obtained in step S102, one alternative bin is obtained for each alternative bin combination, and then one of the alternative bins needs to be selected as the optimal alternative bin in the current iteration loop. In order to improve the overall delivery timeliness of the finally-addressed warehouse, the replacement warehouse with the shortest delivery timeliness is replaced as the optimal replacement warehouse in the step.
For example, a replacement silo
Figure BDA0002144754660000071
Wherein the set W ═ { W ] formed from the selectable binsxX ∈ n } selects an alternative bin combination (w)i,wj) Target selectable bin w ofx. Deliverytime is wxFor the transportation duration of the order address cities, orderNum is the order quantity of the order task corresponding to the order address. The order address cities in the above formula may be understood as an alternative bin combination (w)i,wj) The set of covered cities.
Optionally, in some embodiments with a preset age-satisfaction threshold, determining the optimal replacement bin may require ensuring that the preset age-satisfaction threshold is reached after replacement. For example, if the specific gravity of a single amount satisfying 3 days before replacement is 90% or more, it is necessary to ensure that the specific gravity is maintained at 90% or more after replacement. For example, before obtaining the second candidate warehouse set, the server may further replace the candidate warehouse combination corresponding to the optimal replacement warehouse in the first candidate warehouse set with the optimal replacement warehouse to obtain the delivery timeliness of each order task; then obtaining order time satisfaction rate according to the order quantity meeting a preset time threshold value in the distribution time corresponding to each order task and the total order quantity of the preset order tasks; and determining that the time efficiency of satisfaction of the order meets a preset time efficiency threshold. And if the time efficiency of the order does not meet the preset time efficiency meeting efficiency threshold, deleting the current optimal replacement bin from the replacement bins of the alternative bin combination, and re-determining the optimal replacement bin.
And S104, if the number of the warehouses in the second alternative warehouse set is less than or equal to the number of the warehouses to be determined, taking the address of each warehouse in the second alternative warehouse set as the optimal address of the warehouse to be determined.
Specifically, the number of warehouses in the second candidate warehouse set is less than or equal to the number of warehouses to be scheduled, which indicates that the currently obtained warehouses in the second candidate warehouse set can already deliver the preset order task, and the number of the warehouses is reduced to the expected number, so that the number of the warehouses can be reduced without performing iterative loop. And directly taking the address of the warehouse in the currently obtained second candidate warehouse set as the optimal address of the warehouse to be determined.
The embodiment provides a warehouse address selection method, which includes the steps that a plurality of candidate warehouse combinations are obtained from a first candidate warehouse set corresponding to a preset order task; acquiring a substitute bin of each alternative bin combination and a substitute delivery time limit of the substitute bin; replacing the alternative bin combination corresponding to the optimal alternative bin in the first alternative bin set by the optimal alternative bin to obtain a second alternative bin set, wherein the optimal alternative bin is a single alternative bin with the shortest time effectiveness for each alternative delivery; if the number of the warehouses in the second alternative warehouse set is less than or equal to the number of the warehouses to be determined, the addresses of the warehouses in the second alternative warehouse set are used as the optimal site selection of the warehouses to be determined, heuristic site warehouse site selection is achieved, a complex modeling process is not needed, calculation is simple, the speed and the accuracy of site selection of the warehouses are improved, and further the reliability of site selection of the warehouses is improved.
On the basis of the embodiment shown in fig. 1, before step S101, a process of acquiring the first set of candidate bins may also be included. In the embodiment shown in fig. 1 or the embodiment including obtaining the first candidate bin set, an iterative transfer step may be further included, which is exemplified and described below with reference to fig. 2 and the specific embodiment. Referring to fig. 2, which is a schematic flow chart of another warehouse address selecting method according to an embodiment of the present invention, the method shown in fig. 2 includes steps S201 to S209, specifically as follows:
s201, according to a preset order task, obtaining a plurality of order addresses and the order quantity of the order task corresponding to each order address.
For example, historical order data is used as a preset order task, and the obtained order address and the order quantity of each order address can be referred to the following table one and fig. 3. Referring to fig. 3, a schematic diagram of a warehouse and an order address location according to an embodiment of the present invention is shown. The order addresses in FIG. 3 are Beijing, Chongqing, Wulu wood Qi, Shanghai, Guangzhou and Zheng as shown in Table one. Fig. 3 illustrates the order address in circles and the warehouse in triangles. The order addresses in fig. 3 are indicated by the size of a circle indicating the size of an individual quantity, and the larger the individual quantity, the larger the area of the circle.
Watch 1
Order address Single quantity of
Beijing 10
Chongqing 60
Wuluqiqi (black-root and Chinese woodruff) 50
Shanghai province 100
Guangzhou province 20
Zhengzhou 30
S202, obtaining the distribution time limit of the preset optional warehouse to the order task corresponding to the order address.
The preset optional bins may be, for example, 6 bins as shown in fig. 3: guan 'an storehouse, Wuhan storehouse, Qingdao storehouse, xi' an storehouse, Lanzhou storehouse, Hangzhou storehouse. In the following embodiment, for the sake of simplicity of calculation, it is assumed that all 6 warehouses support each other, and each warehouse can deliver all order addresses (i.e., 6 cities shown in table one).
The server may obtain, for each order address, a transportation duration of the selectable bin corresponding to the order address. For example, for each of the 6 order addresses described above, the transit time from 6 warehouses to the order address is calculated. It should be noted that, in the embodiment limited by the support relationship or the distribution range, the number of the selectable bins corresponding to each order address may be different, and the embodiment is not limited to this example. And after 6 transportation time lengths are obtained corresponding to each order address, taking the product of the transportation time length and the single quantity of the order task corresponding to the order address as the delivery timeliness of the selectable warehouse to the order task corresponding to the order address. For example, if the single quantity corresponding to the order address beijing is 10, the transportation time length of 6 warehouses corresponding to the beijing is multiplied by 10, and the delivery timeliness corresponding to the 6 selectable warehouses of the order address beijing is obtained.
And S203, regarding the order task corresponding to each order address, and taking the selectable bin with the shortest distribution timeliness as a standby bin.
For example, for the order address Shanghai and Guangzhou, the selectable bin with the shortest delivery timeliness is the Hangzhou bin, and then the Hangzhou bin is the common alternative bin of Shanghai and Guangzhou. Fig. 4 is a schematic diagram of a correspondence between an alternative warehouse and an order address according to an embodiment of the present invention. As shown in FIG. 4, the line between the triangle and circle is used to indicate the order address corresponding to the alternate bin. For example, for order address Chongqing, the Xian warehouse is the candidate warehouse with the shortest delivery time efficiency in all the selectable warehouses; for the order address of Wulujie, Lanzhou warehouse is the warehouse with the shortest delivery time among all the optional warehouses.
S204, determining a first alternative bin set according to the alternative bins corresponding to the order tasks.
For example, in the embodiment shown in fig. 4, the first set of candidate bins is composed of 5 bins, namely, a gu-an bin, a wuhan bin, a xi-an bin, a langzhou bin and a hangzhou bin. In some embodiments, the user inputs the number of pending bins, for example, 3, and then proceeds to S205 for iterative calculation when the number of bins in the first candidate bin set is underdetermined to be greater than 3.
S205, acquiring a plurality of alternative bin combinations in a first alternative bin set corresponding to a preset order task.
For example, two-by-two combinations of currently selected 5 candidate bins are generated, in total
Figure BDA0002144754660000101
Seeds, i.e. (lanzhou storehouse, sienna storehouse); (xi' an storehouse, wuhan storehouse); (Lanzhou storehouse, Wuhan storehouse); (Guan storehouse, Hangzhou storehouse); .......
S206, acquiring the alternative bin of each alternative bin combination and the alternative delivery time limit of the alternative bin.
For each candidate bin combination generated in step S205, a warehouse that can replace two candidate bins in the candidate bin combination is selected from the set of all 6 candidate bins, for example, for the candidate bin combination (lanzhou bin, and sienna bin) in fig. 4, the sum of the age single quantity values of the 6 candidate bins to wuluqin and chongqing is calculated, respectively, and the support relationship and the delivery relationship are to be satisfied. For example, the calculation results are shown in table two below as the results of calculating the replacement bin for the alternative bin combination (lan, xi' an bin).
Watch two
Figure BDA0002144754660000102
Figure BDA0002144754660000111
As shown in table two, the optional bin sian bin is the shortest for distribution time 1350 obtained by wuloguanzil and Chongqing, so that the substitute distribution time 1350 is obtained by using the sian bin as a substitute bin of the alternative bin combination (Lanzhou bin and the sian bin). And calculating the substitute bins of other 9 alternative bin combinations and the substitute distribution time limit of the substitute bins in the same way.
For example: (xi' an storehouse, Wuhan storehouse) as the substitute storehouse, the value is 1300; (Lanzhou storehouse, Wuhan storehouse) is the xi' an storehouse, the value is 2000; (Guan storehouse, Hangzhou storehouse) as a substitute storehouse of Hangzhou storehouse with a value of 1200; .......
Comparing the replacement delivery time efficiency of the combination of 10 candidate bins in the above embodiment, for example, obtaining 1200 the shortest replacement delivery time efficiency, then the hangzhou bin is taken as the optimal replacement bin. If the corresponding alternative distribution time efficiency of a plurality of alternative storehouse combinations is the same, the alternative storehouse can be selected as the optimal alternative storehouse.
And S207, replacing the alternative bin combination corresponding to the optimal alternative bin in the first alternative bin set by the optimal alternative bin to obtain a second alternative bin set, wherein the optimal alternative bin is a single alternative bin with the shortest time for each alternative delivery.
Fig. 5 is a schematic diagram of a correspondence relationship between a second candidate bin set and an order address according to an embodiment of the present invention. In the step, alternative warehouse combinations (a Guan warehouse and a Hangzhou warehouse) are replaced by the Hangzhou warehouse, so that a second alternative warehouse set consisting of 4 warehouses is obtained. At this time, if the number of the pending warehouses input by the user is 4, the purpose of warehouse addressing is already achieved, the iterative computation can be ended, and if the number of the pending warehouses input by the user is less than 4, the iterative computation needs to be continued.
And S208, if the number of the warehouses in the second alternative warehouse set is less than or equal to the number of the warehouses to be determined, taking the address of each warehouse in the second alternative warehouse set as the optimal address of the warehouse to be determined.
S209, if the number of warehouses in the second candidate bin set is greater than the number of pending warehouses, taking the second candidate bin set as a new first candidate bin set.
After step S209 is executed, the process proceeds to step S205 (in the first candidate bin set corresponding to the preset order task, multiple candidate bin combinations are obtained).
If the number of pending warehouses is 2, after obtaining the second candidate bin set composed of 4 warehouses, step S209 proceeds to execute step S205, and a second candidate bin set composed of 3 warehouses may be obtained. Fig. 6 is a schematic diagram of another corresponding relationship between the second candidate bin set and the order address according to the embodiment of the present invention. In the second set of candidate bins shown in fig. 6, the lanzhou bin is replaced by a lanzhou bin (lanzhou bin, west ampere bin).
Continuing from step S209 to step S205, a second set of candidate bins consisting of 2 bins may be obtained. Fig. 7 is a schematic diagram of a correspondence relationship between a second candidate bin set and an order address according to another embodiment of the present invention. As shown in fig. 7, in the second candidate bin set, the west bin is used to replace the (lanzhou bin, wuhan bin), and finally, the second candidate bin set only including the west bin and the hangzhou bin is obtained, the number of the to-be-determined bins is reached to 2, the iteration is stopped, and the west bin and the hangzhou bin are output as the best addresses of the to-be-determined bins.
According to the method and the device, the iterative convergence speed is improved by acquiring the first candidate bin set with the optimal distribution timeliness, the candidate bins are reduced by continuous gradual iteration and continuous replacement, the number of the undetermined warehouses which can complete order tasks and meet the user requirements is finally obtained, and the reliability of warehouse site selection is improved.
Referring to fig. 8, which is a schematic structural diagram of a warehouse address selecting device according to an embodiment of the present invention, the warehouse address selecting device 80 shown in fig. 8 includes:
and the combination module 81 is configured to obtain a plurality of candidate bin combinations from the first candidate bin set corresponding to the preset order task.
And a processing module 82, configured to obtain a substitute bin of each candidate bin combination and a substitute delivery age of the substitute bin.
And a replacing module 83, configured to replace, by an optimal replacement bin, a combination of candidate bins corresponding to the optimal replacement bin in the first set of candidate bins, to obtain a second set of candidate bins, where the optimal replacement bin is a single replacement bin with the shortest time for each replacement delivery.
A determining module 84, configured to, if the number of the warehouses in the second candidate bin set is less than or equal to the number of the warehouses to be determined, use the address of each warehouse in the second candidate bin set as the optimal address of the warehouse to be determined.
The warehouse addressing device in the embodiment shown in fig. 8 may be correspondingly used to execute the steps executed by the server in the embodiment of the method shown in fig. 1, and the implementation principle and the technical effect are similar, which are not described herein again.
Optionally, the replacing module 83 is further configured to, after replacing the candidate bin combination corresponding to the optimal replacement bin in the first candidate bin set with the optimal replacement bin to obtain a second candidate bin set, if the number of the warehouses in the second candidate bin set is greater than the number of the warehouses to be determined, use the second candidate bin set as a new first candidate bin set, so that the combining module 81 executes the first candidate bin set corresponding to the preset order task to obtain a plurality of candidate bin combinations.
Optionally, the combining module 81 is configured to combine each candidate bin with other candidate bins in a first candidate bin set corresponding to the preset order task in pairs to obtain a plurality of candidate bin combinations.
Optionally, the replacing module 83 is further configured to replace, before the second candidate warehouse set is obtained, the candidate warehouse combination corresponding to the optimal replacement warehouse in the first candidate warehouse set with an optimal replacement warehouse, and obtain the delivery timeliness of each order task; acquiring order time satisfaction rate according to the order quantity meeting a preset time threshold value in the distribution time corresponding to each order task and the total order quantity of the preset order tasks; and determining that the time efficiency of satisfaction of the order meets a preset time efficiency threshold.
Optionally, the combination module 81 is further configured to, before acquiring a plurality of candidate bin combinations in a first candidate bin set corresponding to a preset order task, acquire a plurality of order addresses and the order quantity of the order task corresponding to each of the order addresses according to the preset order task; acquiring the distribution timeliness of a preset optional bin to the order task corresponding to the order address; for the order task corresponding to each order address, taking the selectable bin with the shortest delivery timeliness as an alternative bin; and determining a first alternative bin set according to the alternative bins corresponding to the order tasks.
Optionally, the combination module 81 is configured to, for each order address, obtain a transportation duration of the optional warehouse corresponding to the order address; and taking the product of the transportation time length and the single quantity of the order task corresponding to the order address as the delivery timeliness of the selectable bin to the order task corresponding to the order address.
Optionally, the processing module 82 is configured to determine a combined order task of the alternative bin combination according to an order task corresponding to each alternative bin included in the alternative bin combination; determining target selectable bins meeting the replacement conditions of the alternative bin combinations in preset selectable bins; respectively obtaining the distribution timeliness of each target selectable bin to the combined order task; taking the target selectable bin with the shortest delivery timeliness as a substitute bin of the selectable bin combination; and taking the delivery time limit of the substitute warehouse to the combined order task as the substitute delivery time limit of the substitute warehouse.
Optionally, the processing module 82 is configured to obtain support relationships between each candidate bin included in the candidate bin combination and other candidate bins in the first candidate bin set; acquiring a combined order address according to the combined order task; and selecting the selectable bins which meet the support relationship and the delivery range of which comprises the combined order address from preset selectable bins as target selectable bins meeting the replacement condition of the combination of the selectable bins.
Referring to fig. 9, which is a schematic diagram of a hardware structure of an apparatus according to an embodiment of the present invention, the apparatus 90 includes: a processor 91, memory 92 and computer programs; wherein
A memory 92 for storing the computer program, which may also be a flash memory (flash). The computer program is, for example, an application program, a functional module, or the like that implements the above method.
A processor 91 for executing the computer program stored in the memory to implement the steps executed by the server in the warehouse addressing method. Reference may be made in particular to the description relating to the preceding method embodiment.
Alternatively, the memory 92 may be separate or integrated with the processor 91.
When the memory 92 is a device independent of the processor 91, the apparatus may further include:
a bus 93 for connecting the memory 92 and the processor 91.
The present invention also provides a readable storage medium, in which a computer program is stored, and the computer program is used for implementing the warehouse addressing method provided by the above embodiments when being executed by a processor.
The readable storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the readable storage medium. Of course, the readable storage medium may also be an integral part of the processor. The processor and the readable storage medium may reside in an Application Specific Integrated Circuits (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the readable storage medium may also reside as discrete components in a communication device. The readable storage medium may be a read-only memory (ROM), a random-access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
The present invention also provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the apparatus may read the execution instructions from the readable storage medium, and the execution of the execution instructions by the at least one processor causes the apparatus to implement the warehouse addressing method provided by the various embodiments described above.
In the above embodiments of the apparatus, it should be understood that the Processor may be a Central Processing Unit (CPU), other general purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (11)

1. A warehouse site selection method is characterized by comprising the following steps:
acquiring a plurality of alternative bin combinations in a first alternative bin set corresponding to a preset order task;
acquiring a substitute bin of each alternative bin combination and a substitute delivery time limit of the substitute bin;
replacing the alternative bin combination corresponding to the optimal alternative bin in the first alternative bin set by the optimal alternative bin to obtain a second alternative bin set, wherein the optimal alternative bin is a single alternative bin with the shortest time effectiveness for each alternative delivery;
and if the number of the warehouses in the second alternative warehouse set is less than or equal to the number of the warehouses to be determined, taking the address of each warehouse in the second alternative warehouse set as the optimal address of the warehouse to be determined.
2. The method according to claim 1, wherein said replacing the candidate bin combination corresponding to the optimal replacement bin in the first candidate bin set with the optimal replacement bin, and obtaining a second candidate bin set, further comprises:
and if the number of the warehouses in the second candidate warehouse set is greater than the number of the warehouses to be determined, taking the second candidate warehouse set as a new first candidate warehouse set, and executing the first candidate warehouse set corresponding to the preset order task to obtain a plurality of candidate warehouse combinations.
3. The method according to claim 1, wherein the obtaining a plurality of candidate bin combinations in the first candidate bin set corresponding to the preset order task comprises:
and in a first alternative bin set corresponding to a preset order task, combining each alternative bin with other alternative bins in pairs to obtain a plurality of alternative bin combinations.
4. The method of claim 1, wherein prior to obtaining the second set of candidate bins, further comprising:
replacing the alternative bin combination corresponding to the optimal alternative bin in the first alternative bin set by the optimal alternative bin to obtain the distribution timeliness of each order task;
acquiring order time satisfaction rate according to the order quantity meeting a preset time threshold value in the distribution time corresponding to each order task and the total order quantity of the preset order tasks;
and determining that the time efficiency of satisfaction of the order meets a preset time efficiency threshold.
5. The method according to any one of claims 1 to 4, wherein before acquiring a plurality of candidate bin combinations in the first candidate bin set corresponding to the preset order task, the method further comprises:
according to a preset order task, obtaining a plurality of order addresses and the order quantity of the order task corresponding to each order address;
acquiring the distribution timeliness of a preset optional bin to the order task corresponding to the order address;
for the order task corresponding to each order address, taking the selectable bin with the shortest delivery timeliness as an alternative bin;
and determining a first alternative bin set according to the alternative bins corresponding to the order tasks.
6. The method according to claim 5, wherein the obtaining of the delivery timeliness of the preset optional warehouse for the order task corresponding to the order address comprises:
for each order address, acquiring the transportation time length of the selectable bin corresponding to the order address;
and taking the product of the transportation time length and the single quantity of the order task corresponding to the order address as the delivery timeliness of the selectable bin to the order task corresponding to the order address.
7. The method of claim 5, wherein said obtaining alternate bins for each of said alternate bin combinations and alternate delivery timeliness for said alternate bins comprises:
determining a combined order task of the alternative bin combination according to the order task corresponding to each alternative bin contained in the alternative bin combination;
determining target selectable bins meeting the replacement conditions of the alternative bin combinations in preset selectable bins;
respectively obtaining the distribution timeliness of each target selectable bin to the combined order task;
taking the target selectable bin with the shortest delivery timeliness as a substitute bin of the selectable bin combination;
and taking the delivery time limit of the substitute warehouse to the combined order task as the substitute delivery time limit of the substitute warehouse.
8. The method according to claim 7, wherein the determining, among the preset selectable bins, a target selectable bin that satisfies the replacement condition of the alternative bin combination comprises:
acquiring support relationships between the alternative bins included in the alternative bin combination and other alternative bins in the first alternative bin set;
acquiring a combined order address according to the combined order task;
and selecting the selectable bins which meet the support relationship and the delivery range of which comprises the combined order address from preset selectable bins as target selectable bins meeting the replacement condition of the combination of the selectable bins.
9. A warehouse site selection device, comprising:
the combination module is used for acquiring a plurality of alternative bin combinations in a first alternative bin set corresponding to a preset order task;
the processing module is used for acquiring the alternative bins of each alternative bin combination and the alternative delivery time efficiency of the alternative bins;
a replacement module, configured to replace, by an optimal replacement bin, a candidate bin combination corresponding to the optimal replacement bin in the first candidate bin set to obtain a second candidate bin set, where the optimal replacement bin is a single replacement bin with a shortest replacement delivery time;
and the judging module is used for taking the address of each warehouse in the second candidate bin set as the optimal address of the warehouse to be determined if the number of the warehouses in the second candidate bin set is less than or equal to the number of the warehouses to be determined.
10. An apparatus, comprising: a memory, a processor, and a computer program, the computer program being stored in the memory, the processor running the computer program to perform the warehouse addressing method of any of claims 1-8.
11. A readable storage medium having stored thereon a computer program for implementing the warehouse addressing method of any of claims 1 to 8 when executed by a processor.
CN201910680917.3A 2019-07-26 2019-07-26 Warehouse location method, warehouse location device, warehouse location equipment and readable storage medium Active CN112308266B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910680917.3A CN112308266B (en) 2019-07-26 2019-07-26 Warehouse location method, warehouse location device, warehouse location equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910680917.3A CN112308266B (en) 2019-07-26 2019-07-26 Warehouse location method, warehouse location device, warehouse location equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN112308266A true CN112308266A (en) 2021-02-02
CN112308266B CN112308266B (en) 2023-11-03

Family

ID=74328766

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910680917.3A Active CN112308266B (en) 2019-07-26 2019-07-26 Warehouse location method, warehouse location device, warehouse location equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN112308266B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023160479A1 (en) * 2022-02-24 2023-08-31 北京沃东天骏信息技术有限公司 Warehouse determination method, apparatus, and device

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016206556A1 (en) * 2015-06-25 2016-12-29 阿里巴巴集团控股有限公司 Method of processing warehouse resource information and providing inventory information and device utilizing same
CN106815700A (en) * 2015-12-02 2017-06-09 阿里巴巴集团控股有限公司 Logistics information processing method and processing device
CN107292547A (en) * 2016-03-31 2017-10-24 阿里巴巴集团控股有限公司 For the system of the method, device and the logistics distribution that determine logistics distribution
CN107527146A (en) * 2017-08-23 2017-12-29 北京惠赢天下网络技术有限公司 A kind of processing method of cargo transaction information, device, and system
CN108241911A (en) * 2018-01-30 2018-07-03 合肥工业大学 A kind of Site Selection Method of Distribution Center for optimization algorithm of being looked for food based on bacterium
US20190026691A1 (en) * 2016-03-31 2019-01-24 Cainiao Smart Logistics Holding Limited Method, apparatus, and system for scheduling logistic resources
CN109544279A (en) * 2018-11-05 2019-03-29 广州大学 The commodity adaption system and method quickly delivered towards order
CN109636002A (en) * 2018-11-13 2019-04-16 深圳大学 A kind of site selecting method and system of the Cold Chain Logistics home-delivery center based on goods damage

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016206556A1 (en) * 2015-06-25 2016-12-29 阿里巴巴集团控股有限公司 Method of processing warehouse resource information and providing inventory information and device utilizing same
CN106815700A (en) * 2015-12-02 2017-06-09 阿里巴巴集团控股有限公司 Logistics information processing method and processing device
CN107292547A (en) * 2016-03-31 2017-10-24 阿里巴巴集团控股有限公司 For the system of the method, device and the logistics distribution that determine logistics distribution
US20190026691A1 (en) * 2016-03-31 2019-01-24 Cainiao Smart Logistics Holding Limited Method, apparatus, and system for scheduling logistic resources
CN107527146A (en) * 2017-08-23 2017-12-29 北京惠赢天下网络技术有限公司 A kind of processing method of cargo transaction information, device, and system
CN108241911A (en) * 2018-01-30 2018-07-03 合肥工业大学 A kind of Site Selection Method of Distribution Center for optimization algorithm of being looked for food based on bacterium
CN109544279A (en) * 2018-11-05 2019-03-29 广州大学 The commodity adaption system and method quickly delivered towards order
CN109636002A (en) * 2018-11-13 2019-04-16 深圳大学 A kind of site selecting method and system of the Cold Chain Logistics home-delivery center based on goods damage

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
MAHTAB HAJGHASEM，AMIR ABBAS SHOJAIE: ""Optimal Routing in Supply Chain Aimed at Minimizing Vehicle Cost and Supply"", 《PROCEDIA ECONOMICS AND FINANCE 》, pages 79 - 80 *
吴佑波;陶熠;: ""多级配送方式下铁路运输CPD仓库选址优化研究"", 《铁道运输与经济》, no. 09 *
张延亮等: ""无约束条件仓库选址问题的数值求解"", 《科技视界》 *
徐荣;: ""既有铁路货运站向城市配送中心转型研究"", 《甘肃科技》, no. 02 *
杨立;: ""仓库选址问题的一种混合算法"", 长春师范学院学报, no. 02 *
王占中等: ""带时间成本及运价折扣的多仓库选址模型"", 《长安大学学报（自然科学版）》 *
许艳萍;朱霞;吴玉钏;: ""甬商所仓储选址问题研究"", 《浙江万里学院学报》, no. 06 *
魏雅楠;赵刚;: ""基于免疫算法的电网物资仓库布点优化研究"", 《云南电力技术》, no. 06 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023160479A1 (en) * 2022-02-24 2023-08-31 北京沃东天骏信息技术有限公司 Warehouse determination method, apparatus, and device

Also Published As

Publication number Publication date
CN112308266B (en) 2023-11-03

Similar Documents

Publication Publication Date Title
US11854062B2 (en) Order fulfillment system having dynamic routing
CN106779910B (en) Distribution order distribution method and device
WO2018188476A1 (en) Method and device for optimizing combination of orders
CN110097203A (en) Inventory's dispatching method, inventory's dispatching device and computer readable storage medium
CN109359759A (en) Intelligence divides storehouse method, equipment and computer readable storage medium
CN106447470A (en) Delivery order distribution method and delivery order distribution device
CN109961247B (en) Method and device for generating article storage information
CN110633928A (en) Commodity inverse matching decision method and device
CN109886776A (en) A kind of one-stop electric business management method and system of Community-oriented retail service
CN112215546A (en) Object page generation method, device, equipment and storage medium
CN114091993A (en) Warehouse site selection method, device, equipment and storage medium
CN111260288B (en) Order management method, device, medium and electronic equipment
CN112308677A (en) Commodity dispatch single dialing method, device, equipment and readable storage medium
CN116109252A (en) Warehouse replenishment management method and device, warehouse management system and storage medium
CN111680951A (en) Order combination processing method and device
CN112308266A (en) Warehouse site selection method, device, equipment and readable storage medium
CN113469615A (en) Order allocation method, device, equipment and storage medium
CN108898340A (en) The calculation method and system of logistics freight charges
CN113650997B (en) Article warehouse-out positioning method and device
CN111882257B (en) Method and device for modifying delivery address
CN113222308B (en) Order distribution method, order distribution device, electronic equipment and storage medium
CN112036706A (en) Logistics channel preferred allocation method, device, equipment and storage medium
CN113222490A (en) Inventory allocation method and device
CN111210074A (en) Order processing method, device, medium, electronic equipment and system in warehouse
CN116128408A (en) Intelligent replenishment method, system and computer readable medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant