CN116308031A - Multi-warehouse inventory allocation method for shortening warehouse cargo allocation walking path - Google Patents
Multi-warehouse inventory allocation method for shortening warehouse cargo allocation walking path Download PDFInfo
- Publication number
- CN116308031A CN116308031A CN202310072891.0A CN202310072891A CN116308031A CN 116308031 A CN116308031 A CN 116308031A CN 202310072891 A CN202310072891 A CN 202310072891A CN 116308031 A CN116308031 A CN 116308031A
- Authority
- CN
- China
- Prior art keywords
- warehouse
- order
- inventory
- warehouses
- coordinate point
- 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.)
- Pending
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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Educational Administration (AREA)
- Finance (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Warehouses Or Storage Devices (AREA)
Abstract
The application relates to a multi-warehouse inventory allocation method for shortening warehouse cargo allocation walking paths, which comprises the steps of converting cargo receiving address information of orders containing a disassembly mark into target coordinate points on a preset map, wherein the storage coordinate points and cargo allocation paths of each warehouse are preset on the map; screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the form removal mark, and gathering the warehouses and the preselected warehouses to obtain a candidate warehouse set; traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between a target coordinate point corresponding to the order and a warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map; and selecting a warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, and deducting the corresponding material inventory of the target warehouse. The method has the effect of reducing the sheet disassembly cost.
Description
Technical Field
The application relates to the technical field of warehousing, in particular to a multi-warehouse inventory allocation method for shortening a warehouse cargo allocation walking path.
Background
With the expansion of supply scale, the number of warehouses is increased, so as to ensure that warehouse materials can meet the demands of customers to the greatest extent.
The same material is generally stored in the same warehouse, and as the number of warehouses increases, the material stored in a single warehouse is less and less, and the same order is required to be split to different warehouses for inventory distribution.
Disclosure of Invention
In order to reduce the bill disassembly cost, the application provides a multi-warehouse inventory allocation method for shortening the warehouse cargo allocation walking path.
In a first aspect, the present application provides a multi-warehouse inventory allocation method for shortening warehouse shipment travel paths.
The application is realized by the following technical scheme:
a multi-warehouse inventory allocation method for shortening warehouse shipment travel paths includes the steps of,
Acquiring an order containing a disassembly mark and corresponding receiving address information, and converting the receiving address information into a target coordinate point positioned on a preset map, wherein a storage coordinate point and a distribution path of each warehouse are preset on the map;
screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the form removal mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
and selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, and deducting the corresponding material inventory of the target warehouse.
The present application may be further configured in a preferred example to: based on the required materials and the required quantity information of the order, combining the inventory information of the pre-selected warehouse corresponding to the disassembly mark, the step of screening the warehouse of the same type as the pre-selected warehouse comprises,
Binding a material number uniquely corresponding to the required material;
indexing a corresponding pre-selected material inventory in the pre-selected warehouse according to the material number;
based on the pre-selected material stock, polling other warehouses for a candidate material stock corresponding to the material number;
classifying the warehouse with the to-be-selected material inventory being greater than or equal to the preselected material inventory as a warehouse of the same type as the preselected warehouse.
The present application may be further configured in a preferred example to: according to the pre-set distribution path on the map, the step of calculating the warehouse distribution walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set comprises the steps of,
judging whether the target coordinate point is positioned on the distribution path or not, wherein the distribution path is all routes collected based on routes between any two points of the transfer station coordinate point and the storage coordinate point of the laid transfer station positioned on the map;
and if the target coordinate point is positioned on the goods distribution path, selecting a route covering the target coordinate point and the storage coordinate point as a target route, and calculating the length of the target route as a warehouse goods distribution walking path.
The present application may be further configured in a preferred example to: if the target coordinate point is located outside the goods distribution path, determining a theoretical coordinate point which is closest to the target coordinate point and located on the goods distribution path;
and selecting a route covering the theoretical coordinate point and the storage coordinate point as a target route, and calculating the length of the target route as a warehouse cargo allocation walking path.
The present application may be further configured in a preferred example to: the step of acquiring the order containing the disassembly mark and the corresponding receiving address information comprises the step of acquiring the order containing the disassembly mark and the corresponding receiving address information in a batch mode;
the method further comprises the step of,
if the number of the orders is at least 2, executing a distribution task, screening the warehouses with the same type as the preselected warehouses based on the required materials and the required number information of any order and combining the inventory information of the preselected warehouses corresponding to the form splitting mark, and gathering the warehouses and the preselected warehouses to obtain a candidate warehouse set;
traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
Selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, deducting the corresponding material inventory of the target warehouse, and completing the inventory allocation of the order at the moment;
executing the allocation task again until all orders complete inventory allocation;
and predicting the association degree of each order, and matching the same scheduling strategy for the order with high association degree after the picking bin is completed.
The present application may be further configured in a preferred example to: the step of predicting the association degree of each order, and matching the same scheduling strategy for the order with high association degree after the picking bin is completed comprises the steps of,
counting the coincidence rate of each shortest warehouse cargo allocation walking path;
aggregating the orders with the coincidence rate reaching a preset threshold value to obtain an order set of the same batch;
and after the picking warehouse is completed, matching the orders in the same batch of order sets with the same delivery place.
The present application may be further configured in a preferred example to: the step of predicting the association degree of each order, and matching the same scheduling strategy for the order with high association degree after the picking bin is completed comprises the steps of,
estimating the volume of each order according to inventory allocation of the orders;
Categorizing the orders by different volume levels based on the volumes;
after the picking bin is completed, matching the same freight car for the orders with the same volume level.
The present application may be further configured in a preferred example to: the step of predicting the association degree of each order, and matching the same scheduling strategy for the order with high association degree after the picking bin is completed comprises the steps of,
screening the orders with the same target warehouse, and gathering to obtain a same warehouse order set;
and after the picking warehouse is completed, carrying out centralized delivery on the orders in the same warehouse order set.
The present application may be further configured in a preferred example to: the goods supplementing mode of the warehouse adopts autonomous periodic goods supplementing, and comprises the following steps,
acquiring the required order quantity and MOQ (metal oxide semiconductor) filling quantity;
predicting a planned order amount based on the demand order amount and the MOQ replenishment amount, wherein the planned order amount is calculated as follows,
when the goods sales unit coincides with the corresponding goods order unit, the planned order quantity= (required order quantity+moq replenishment quantity);
demand number = average sales number x sales scenario change factor x sales number change factor x (lead period x lead period factor + lead frequency) +safe inventory-current inventory-on-the-go order-unacknowledged return;
When the required order quantity < minimum order quantity, minimum order replenishment quantity = minimum order quantity-required order quantity; when the required order quantity is greater than the minimum order quantity, the minimum order replenishment quantity is 0;
secure stock quantity = average sales quantity x (delivery period/2-1);
wherein the average sales number is the average daily sales number in the statistical period, the sales scene change coefficient is constant, the adjustment range of the sales scene change coefficient is [0.1,1.9], the sales number change coefficient is sales volume trend in the statistical period, the delivery period is delivery time of the supplier, the delivery period coefficient is used for coping with delivery period variation of the supplier, the delivery period coefficient is constant, the safety stock quantity is used for coping with demand variation of the customer, the current stock quantity is available stock of the current warehouse, the in-transit order quantity is the quantity of the ordered goods which are not yet arrived before, and the unacknowledged return quantity is estimated customer return quantity.
The present application may be further configured in a preferred example to: the method also comprises the following steps of,
when the goods sales units are inconsistent with the corresponding goods ordering units, acquiring the minimum packaging quantity, wherein the minimum packaging quantity is the minimum unit quantity of the goods delivered by the suppliers;
predicting a planned order amount based on the minimum packaging amount, wherein the planned order amount is calculated as follows,
Planned order number= (demand order number/minimum package amount+moq replenishment amount) ×minimum package amount.
The present application may be further configured in a preferred example to: the warehouse is arranged according to a hierarchy and comprises a first-level warehouse for special clients, a second-level warehouse located at a specified point of a provincial area and a third-level warehouse located in a specific region;
the screening of the warehouse of the same type as the preselected warehouse further comprises,
and screening warehouses of the same type as the preselected warehouse according to the priority order of the primary warehouse, the secondary warehouse and the tertiary warehouse.
The present application may be further configured in a preferred example to: the primary bin, the secondary bin and the tertiary bin are all provided with standby bins, and the standby bins are used for supplementing deficient materials for the warehouses at the same level.
In a second aspect, the present application provides a multi-warehouse inventory allocation device for shortening a warehouse shipment travel path.
The application is realized by the following technical scheme:
a multi-warehouse inventory allocation device for shortening warehouse shipment travel paths includes,
the target coordinate point module is used for acquiring an order containing a disassembly mark and corresponding receiving address information, converting the receiving address information into target coordinate points positioned on a preset map, and presetting storage coordinate points and distribution paths of each warehouse on the map;
The screening module is used for screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the form-dismantling mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
the calculation module is used for traversing the candidate warehouse set and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
and the distribution module is used for selecting the warehouse corresponding to the shortest warehouse distribution travelling path as a target warehouse to carry out inventory distribution, and deducting the corresponding material inventory of the target warehouse.
In a third aspect, the present application provides a computer device.
The application is realized by the following technical scheme:
a computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of any one of the above multi-warehouse inventory allocation methods for shortening warehouse shipment travel paths when executing the computer program.
In a fourth aspect, the present application provides a computer-readable storage medium.
The application is realized by the following technical scheme:
a computer readable storage medium storing a computer program which when executed by a processor performs any of the steps of a multi-warehouse inventory allocation method for shortening a warehouse shipment travel path described above.
To sum up, compared with the prior art, the beneficial effects brought by the technical scheme provided by the application at least include:
the warehouse cargo allocation walking path of the order is calculated by screening warehouses of the same type as the preselected warehouse, so that the shortest warehouse cargo allocation walking path is selected, the corresponding warehouse is used as a target warehouse to carry out inventory allocation, the corresponding material inventory of the target warehouse is deducted, the real-time inventory of the warehouse is updated so as to be convenient for next allocation, the warehouse cargo allocation walking path of the order is shortest, the transportation cost is reduced, the order dismantling cost is effectively reduced, meanwhile, the timeliness of the order is faster, the customer experience is better, and the automatic decision of the low-cost cargo allocation walking path with better timeliness is realized.
Drawings
Fig. 1 is a flow chart of a multi-warehouse inventory allocation method for shortening warehouse shipment travel paths according to an exemplary embodiment of the present application.
Fig. 2 is a flowchart of a method of screening and preselecting warehouses of the same type as a warehouse for shortening a warehouse shipment travel path according to yet another exemplary embodiment of the present application.
Fig. 3 is a flowchart of a method for computing a warehouse shipment travel path for a multi-warehouse inventory allocation method for shortening the warehouse shipment travel path in accordance with another exemplary embodiment of the present application.
Fig. 4 is a flowchart of a method for multi-warehouse inventory allocation for shortening warehouse shipment travel paths according to an exemplary embodiment of the present application, where the same scheduling policy is matched for highly correlated orders.
Fig. 5 is a block diagram of a multi-warehouse inventory allocation device for shortening warehouse shipment travel paths in accordance with an exemplary embodiment of the present application.
Detailed Description
The present embodiment is merely illustrative of the present application and is not intended to be limiting, and those skilled in the art, after having read the present specification, may make modifications to the present embodiment without creative contribution as required, but is protected by patent laws within the scope of the claims of the present application.
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
In addition, the term "and/or" herein is merely an association relationship describing an association object, and means that three relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist together, and B exists alone. In this context, unless otherwise specified, the term "/" generally indicates that the associated object is an "or" relationship.
Embodiments of the present application are described in further detail below with reference to the drawings attached hereto.
The embodiment of the application provides a multi-warehouse inventory allocation method for shortening a warehouse cargo allocation walking path, and the main steps of the method are described as follows.
Acquiring an order containing a disassembly mark and corresponding receiving address information, and converting the receiving address information into a target coordinate point positioned on a preset map, wherein a storage coordinate point and a distribution path of each warehouse are preset on the map;
screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the form removal mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
Traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
and selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, and deducting the corresponding material inventory of the target warehouse.
Referring to fig. 1, specifically, S1, importing a map;
s2, pre-inputting the position information of each warehouse, and converting the position information of the warehouse into a warehouse coordinate point on the map;
s3, acquiring an order containing a disassembly mark and corresponding receiving address information, and converting the receiving address information into a target coordinate point positioned on the map;
s4, screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the order splitting mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
s5, traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
And S6, selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, and deducting the corresponding material inventory of the target warehouse.
And presetting storage coordinate points and distribution paths of each warehouse on the map by utilizing the existing map resources.
Preprocessing orders, dividing the same order into different warehouses for inventory allocation, determining corresponding pre-selected warehouses of the order, and marking a split mark.
And acquiring the order containing the disassembly mark and corresponding receiving address information. And determining a target coordinate point on the map according to the receiving address information.
Based on the information of the required materials and the required quantity of the orders, the inventory information of the pre-selected warehouse corresponding to the form dismantling mark is combined, the warehouses of the same type as the pre-selected warehouse are screened, and the screened warehouses and the pre-selected warehouses are gathered to obtain a candidate warehouse set.
Traversing the candidate warehouse set, and predicting a warehouse cargo allocation walking path between a target coordinate point corresponding to the order and a warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map.
And selecting a warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, and deducting the corresponding material inventory of the target warehouse so as to shorten the warehouse cargo allocation walking path of the order.
Referring to fig. 2, in one embodiment, S4, based on the demand materials and demand quantity information of the order, in combination with inventory information of a preselected warehouse corresponding to the split flag, the step of screening the warehouse of the same type as the preselected warehouse includes,
s41, binding a material number uniquely corresponding to the required material;
s42, indexing corresponding pre-selected material stock in the pre-selected warehouse according to the material number;
s43, based on the pre-selected material stock, polling the material stock to be selected corresponding to the material number in other warehouses;
s44, classifying the warehouse with the to-be-selected material inventory being greater than or equal to the pre-selected material inventory as a warehouse of the same type as the pre-selected warehouse.
In one embodiment, the step of calculating a warehouse shipment travel path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a shipment path preset on the map comprises,
judging whether the target coordinate point is positioned on the distribution path or not, wherein the distribution path is all routes collected based on routes between any two points of the transfer station coordinate point and the storage coordinate point of the laid transfer station positioned on the map;
And if the target coordinate point is positioned on the goods distribution path, selecting a route covering the target coordinate point and the storage coordinate point as a target route, and calculating the length of the target route as a warehouse goods distribution walking path.
Referring to fig. 3, specifically, S51, converting the relay station position information into a relay station coordinate point located on the map based on the laid out relay station position information;
s52, marking routes between any two points on the map according to the transfer station coordinate points and the storage coordinate points, and collecting all routes to form the distribution path;
s53, judging whether the target coordinate point is positioned on the distribution path;
and S541, if the target coordinate point is positioned on the distribution path, selecting a route covering the target coordinate point and the storage coordinate point as a target route, and calculating the length of the target route as a warehouse distribution walking path.
In one embodiment, the method further comprises the following steps,
s5421, if the target coordinate point is located outside the cargo allocation path, determining a theoretical coordinate point which is closest to the target coordinate point and located on the cargo allocation path;
s5422, selecting a route covering the theoretical coordinate point and the storage coordinate point as a target route, and calculating the length of the target route as a warehouse cargo allocation walking path.
Referring to fig. 4, in one embodiment, S3, the acquiring the order including the split flag and the corresponding receiving address information includes,
s31, acquiring an order containing a disassembly mark and corresponding receiving address information in a batch mode;
the method also comprises the following steps of,
if the number of the orders is at least 2, executing a distribution task, screening the warehouses with the same type as the preselected warehouses based on the required materials and the required number information of any order and combining the inventory information of the preselected warehouses corresponding to the form splitting mark, and gathering the warehouses and the preselected warehouses to obtain a candidate warehouse set;
traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, deducting the corresponding material inventory of the target warehouse, and completing the inventory allocation of the order at the moment;
executing the allocation task again until all orders complete inventory allocation;
And predicting the association degree of each order, and matching the same scheduling strategy for the orders with high association degree after the warehouse picking is completed, so as to further reduce the freight cost through centralized scheduling.
In one embodiment, the step of predicting the association degree of each order, and matching the same scheduling policy for the order with high association degree after the picking of the bin is completed includes,
s711, counting the coincidence rate of each shortest warehouse cargo allocation walking path;
s712, aggregating the orders with the coincidence rate reaching a preset threshold value to obtain an order set of the same batch;
s713, after the picking warehouse is completed, matching the same delivery places for the orders in the same batch of order sets.
In one embodiment, the step of predicting the association degree of each order, and matching the same scheduling policy for the order with high association degree after the picking of the bin is completed includes,
s721, estimating the volume of each order according to inventory allocation of the orders;
s722, classifying the orders according to different volume grades based on the volumes;
s723, after the warehouse picking is completed, matching the same freight car for the orders with the same volume level.
In one embodiment, the step of predicting the association degree of each order, and matching the same scheduling policy for the order with high association degree after the picking of the bin is completed includes,
S731, screening the orders with the same target warehouse, and gathering to obtain the same warehouse order set;
s732, after the picking warehouse is completed, carrying out centralized delivery on the orders in the same warehouse order set.
In one embodiment, the replenishment mode of the warehouse adopts autonomous periodic replenishment, comprising the following steps,
acquiring the required order quantity and MOQ (metal oxide semiconductor) filling quantity;
predicting a planned order amount based on the demand order amount and the MOQ replenishment amount, wherein the planned order amount is calculated as follows,
when the goods sales unit coincides with the corresponding goods order unit, the planned order quantity= (required order quantity+moq replenishment quantity);
demand number = average sales number x sales scenario change factor x sales number change factor x (lead period x lead period factor + lead frequency) +safe inventory-current inventory-on-the-go order-unacknowledged return;
when the required order quantity < minimum order quantity, minimum order replenishment quantity = minimum order quantity-required order quantity; when the required order quantity is greater than the minimum order quantity, the minimum order replenishment quantity is 0;
secure stock quantity = average sales quantity x (delivery period/2-1);
Wherein the average sales number is the average daily sales number in the statistical period, the sales scene change coefficient is constant, the adjustment range of the sales scene change coefficient is [0.1,1.9], the sales number change coefficient is sales volume trend in the statistical period, the delivery period is delivery time of the supplier, the delivery period coefficient is used for coping with delivery period variation of the supplier, the delivery period coefficient is constant, the safety stock quantity is used for coping with demand variation of the customer, the current stock quantity is available stock of the current warehouse, the in-transit order quantity is the quantity of the ordered goods which are not yet arrived before, and the unacknowledged return quantity is estimated customer return quantity.
In this embodiment, the average sales number is recorded through manual statistics, and the value can be adjusted according to the authority. The value range of the sales scene change coefficient is designed between [0.1,1.9], for example, the sales scene change coefficient is 1.6 in the case of large promotion. The sales scene change coefficient can be adjusted according to actual conditions. The lead time coefficient is taken to be 1.1 for coping with lead time variation of the supplier. The delivery period coefficient can be adjusted according to actual conditions. The safety stock quantity designs a plurality of constants for selection, such as the larger the safety stock quantity design under the condition of large activity promoting factors; and the smaller the design of the safe stock quantity for the out-of-season commodity. There are a number of modes of secure inventory for selection.
In one embodiment, the method further comprises the following steps,
when the goods sales units are inconsistent with the corresponding goods ordering units, acquiring the minimum packaging quantity, wherein the minimum packaging quantity is the minimum unit quantity of the goods delivered by the suppliers;
predicting a planned order amount based on the minimum packaging amount, wherein the planned order amount is calculated as follows,
planned order number= (demand order number/minimum package amount+moq replenishment amount) ×minimum package amount.
The automatic periodic replenishment is adopted, so that the inventory of each warehouse is sufficient, meanwhile, the replenishment mode increases the time dimension, smoothes the order exchange period deviation of suppliers, is beneficial to the suppliers to prepare the inventory in advance, solves the problem of shortage of the production period of the suppliers, ensures that the inventory of the warehouses can meet the demand of the order to the greatest extent, ensures the quantity of the candidate warehouses, and can be matched to the target warehouse more quickly by the inventory allocation method for shortening the inventory allocation running path of the warehouse, thereby reducing the disassembly cost; the condition of material diapause and expiration is also reduced, and material loss cost is reduced.
In one embodiment, the warehouse is arranged in a hierarchy and comprises a first-level warehouse, a second-level warehouse and a third-level warehouse, wherein the first-level warehouse is used for specially providing specified clients, the second-level warehouse is positioned at a specified point of a provincial and urban area, and the third-level warehouse is positioned in a specific region;
The screening of the warehouse of the same type as the preselected warehouse further comprises,
and screening warehouses of the same type as the preselected warehouse according to the priority order of the primary warehouse, the secondary warehouse and the tertiary warehouse.
Specifically, the first-level bin is also called a front-end bin and is used for being specially used for appointed clients, so that materials can be rapidly and accurately delivered out of a warehouse, and large clients can be better served.
The second bin is located at a designated point of the province and city, such as baoding, martial arts, guangzhou, etc. The method is generally used for traffic junction sections, and the delivery speed is high-efficiency and convenient.
The three-level bin is positioned in a specific region and can be named in a self-defining way, such as a Shendong bin, a Huabei bin and the like, and can be used as a temporary stock warehouse for a certain material to play a role in temporarily supplementing stock.
The warehouses of the same type as the preselected warehouse are screened according to the priority order of the first-level warehouse, the second-level warehouse and the third-level warehouse, the warehouses with faster shipping timeliness are preferentially matched, the warehouse is selected nearby, and the experience of customers is improved while the operation cost is reduced.
In an embodiment, the primary bin, the secondary bin and the tertiary bin are each configured with a spare bin for supplementing the same level of warehouse with starved material.
The standby bin is used as a parallel bin of the warehouses arranged at each level and is used for supplementing the deficient materials for the warehouses at the same level, plays a role in timely supplementing the stock of the deficient materials under the condition of great promotion activity or special scenes, and further ensures the stock sufficiency of each warehouse.
In summary, according to the multi-warehouse inventory allocation method for shortening the warehouse cargo allocation walking path, the warehouse of the same type as the preselected warehouse is screened, the warehouse cargo allocation walking path of an order is calculated, the shortest warehouse cargo allocation walking path is selected, the warehouse corresponding to the shortest warehouse cargo allocation walking path is used as a target warehouse to allocate inventory, the corresponding material inventory of the target warehouse is subtracted, the real-time inventory of the warehouse is updated, the next allocation is convenient, the warehouse cargo allocation walking path of the order is shortest, the transportation cost is reduced, the bill disassembly cost is effectively reduced, meanwhile, the timeliness of the order is faster, the customer experience is better, and the automatic decision of the low-cost cargo allocation walking path with better timeliness is realized.
Further, by adopting autonomous periodic replenishment, the ordering frequency and the ordering quantity of each warehouse are designed, so that the inventory of each warehouse is sufficient, the number of candidate warehouses is ensured, and the inventory allocation method for shortening the inventory allocation walking path of the warehouse can be more quickly matched with the target warehouse, thereby reducing the bill disassembly cost; the delivery warehouse of the materials corresponding to each order can be determined more quickly without changing the delivery strategy and determining the alternative warehouse again; the condition of material diapause and expiration is also reduced, and material loss cost is reduced.
Further, through arranging warehouses and being equipped with standby warehouses in a hierarchical manner, and selecting warehouse-out warehouses nearby, the bill disassembly cost and the material delivery deadline are considered, and the experience of customers is improved while the transportation cost is reduced.
It should be understood that the sequence number of each step in the foregoing embodiment does not mean that the execution sequence of each process should be determined by the function and the internal logic of each process, and should not limit the implementation process of the embodiment of the present application in any way.
Referring to fig. 5, the embodiment of the present application further provides a multi-warehouse inventory allocation device for shortening a warehouse cargo allocation travel path, where the multi-warehouse inventory allocation device for shortening a warehouse cargo allocation travel path corresponds to one of the multi-warehouse inventory allocation methods for shortening a warehouse cargo allocation travel path in the above embodiment. The multi-warehouse inventory allocation device for shortening warehouse shipment travel paths includes,
the importing module is used for importing the map;
the warehouse coordinate point module is used for pre-inputting the position information of each warehouse and converting the position information of the warehouse into a warehouse coordinate point on the map;
the target coordinate point module is used for acquiring an order containing a disassembly mark and corresponding receiving address information and converting the receiving address information into a target coordinate point positioned on the map;
The screening module is used for screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the form-dismantling mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
the calculation module is used for traversing the candidate warehouse set and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
and the distribution module is used for selecting the warehouse corresponding to the shortest warehouse distribution travelling path as a target warehouse to carry out inventory distribution, and deducting the corresponding material inventory of the target warehouse.
Specific limitations regarding a multi-warehouse inventory allocation device for shortening a warehouse shipment travel path may be found in the above description of a multi-warehouse inventory allocation method for shortening a warehouse shipment travel path, and are not described in detail herein. The modules in the multi-warehouse inventory allocation device for shortening warehouse shipment travel paths may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, which may be a server. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program, when executed by a processor, implements any of the multi-warehouse inventory allocation methods described above for shortening warehouse shipment travel paths.
In one embodiment, a computer readable storage medium is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of when executing the computer program:
s1, importing a map;
s2, pre-inputting the position information of each warehouse, and converting the position information of the warehouse into a warehouse coordinate point on the map;
S3, acquiring an order containing a disassembly mark and corresponding receiving address information, and converting the receiving address information into a target coordinate point positioned on the map;
s4, screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the order splitting mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
s5, traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
and S6, selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, and deducting the corresponding material inventory of the target warehouse.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the system is divided into different functional units or modules to perform all or part of the above-described functions.
Claims (15)
1. A multi-warehouse inventory allocation method for shortening warehouse cargo allocation travel path is characterized by comprising the following steps,
acquiring an order containing a disassembly mark and corresponding receiving address information, and converting the receiving address information into a target coordinate point positioned on a preset map, wherein a storage coordinate point and a distribution path of each warehouse are preset on the map;
screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the form removal mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
And selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, and deducting the corresponding material inventory of the target warehouse.
2. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 1, wherein the step of screening the warehouses of the same type as the preselected warehouse based on the demand material and demand quantity information of the order in combination with inventory information of the preselected warehouse corresponding to the split mark comprises,
binding a material number uniquely corresponding to the required material;
indexing a corresponding pre-selected material inventory in the pre-selected warehouse according to the material number;
based on the pre-selected material stock, polling other warehouses for a candidate material stock corresponding to the material number;
classifying the warehouse with the to-be-selected material inventory being greater than or equal to the preselected material inventory as a warehouse of the same type as the preselected warehouse.
3. The multi-warehouse inventory allocation method for shortening warehouse shipment travel paths according to claim 1, wherein the step of calculating a warehouse shipment travel path between the target coordinate point corresponding to an order and the warehouse coordinate point corresponding to a warehouse in the candidate warehouse set based on a shipment path preset on the map comprises,
Judging whether the target coordinate point is positioned on the distribution path or not, wherein the distribution path is all routes collected based on routes between any two points of the transfer station coordinate point and the storage coordinate point of the laid transfer station positioned on the map;
and if the target coordinate point is positioned on the goods distribution path, selecting a route covering the target coordinate point and the storage coordinate point as a target route, and calculating the length of the target route as a warehouse goods distribution walking path.
4. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 3, further comprising the steps of,
if the target coordinate point is located outside the goods distribution path, determining a theoretical coordinate point which is closest to the target coordinate point and located on the goods distribution path;
and selecting a route covering the theoretical coordinate point and the storage coordinate point as a target route, and calculating the length of the target route as a warehouse cargo allocation walking path.
5. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 1, wherein the acquiring the order and corresponding shipping address information including the split label includes acquiring the order and corresponding shipping address information including the split label in a batch mode;
The method further comprises the step of,
if the number of the orders is at least 2, executing a distribution task, screening the warehouses with the same type as the preselected warehouses based on the required materials and the required number information of any order and combining the inventory information of the preselected warehouses corresponding to the form splitting mark, and gathering the warehouses and the preselected warehouses to obtain a candidate warehouse set;
traversing the candidate warehouse set, and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
selecting the warehouse corresponding to the shortest warehouse cargo allocation walking path as a target warehouse to carry out inventory allocation, deducting the corresponding material inventory of the target warehouse, and completing the inventory allocation of the order at the moment;
executing the allocation task again until all orders complete inventory allocation;
and predicting the association degree of each order, and matching the same scheduling strategy for the order with high association degree after the picking bin is completed.
6. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 5, wherein the step of predicting the relevancy of each order and matching the same scheduling policy for the orders with high relevancy after the picking is completed comprises,
Counting the coincidence rate of each shortest warehouse cargo allocation walking path;
aggregating the orders with the coincidence rate reaching a preset threshold value to obtain an order set of the same batch;
and after the picking warehouse is completed, matching the orders in the same batch of order sets with the same delivery place.
7. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 5, wherein the step of predicting the relevancy of each order and matching the same scheduling policy for the orders with high relevancy after the picking is completed comprises,
estimating the volume of each order according to inventory allocation of the orders;
categorizing the orders by different volume levels based on the volumes;
after the picking bin is completed, matching the same freight car for the orders with the same volume level.
8. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 5, wherein the step of predicting the relevancy of each order and matching the same scheduling policy for the orders with high relevancy after the picking is completed comprises,
screening the orders with the same target warehouse, and gathering to obtain a same warehouse order set;
And after the picking warehouse is completed, carrying out centralized delivery on the orders in the same warehouse order set.
9. The multi-warehouse inventory allocation method for shortening the warehouse shipment travel path according to any one of claims 1-8, characterized in that the warehouse restocking mode employs autonomous periodic restocking comprising the steps of,
acquiring the required order quantity and MOQ (metal oxide semiconductor) filling quantity;
predicting a planned order amount based on the demand order amount and the MOQ replenishment amount, wherein the planned order amount is calculated as follows,
when the goods sales unit coincides with the corresponding goods order unit, the planned order quantity= (required order quantity+moq replenishment quantity);
demand number = average sales number x sales scenario change factor x sales number change factor x (lead period x lead period factor + lead frequency) +safe inventory-current inventory-on-the-go order-unacknowledged return;
when the required order quantity < minimum order quantity, minimum order replenishment quantity = minimum order quantity-required order quantity; when the required order quantity is greater than the minimum order quantity, the minimum order replenishment quantity is 0;
secure stock quantity = average sales quantity x (delivery period/2-1);
Wherein the average sales number is the average daily sales number in the statistical period, the sales scene change coefficient is constant, the adjustment range of the sales scene change coefficient is [0.1,1.9], the sales number change coefficient is sales volume trend in the statistical period, the delivery period is delivery time of the supplier, the delivery period coefficient is used for coping with delivery period variation of the supplier, the delivery period coefficient is constant, the safety stock quantity is used for coping with demand variation of the customer, the current stock quantity is available stock of the current warehouse, the in-transit order quantity is the quantity of the ordered goods which are not yet arrived before, and the unacknowledged return quantity is estimated customer return quantity.
10. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 9, further comprising the steps of,
when the goods sales units are inconsistent with the corresponding goods ordering units, acquiring the minimum packaging quantity, wherein the minimum packaging quantity is the minimum unit quantity of the goods delivered by the suppliers;
predicting a planned order amount based on the minimum packaging amount, wherein the planned order amount is calculated as follows,
planned order number= (demand order number/minimum package amount+moq replenishment amount) ×minimum package amount.
11. The multi-warehouse inventory allocation method for shortening warehouse shipment travel paths according to any one of claims 1-8, characterized in that the warehouses are arranged in a hierarchy comprising a primary warehouse dedicated to a given customer, a secondary warehouse located at a given point in a provincial area, and a tertiary warehouse located in a specific area;
the screening of the warehouse of the same type as the preselected warehouse further comprises,
and screening warehouses of the same type as the preselected warehouse according to the priority order of the primary warehouse, the secondary warehouse and the tertiary warehouse.
12. The multi-warehouse inventory allocation method for shortening a warehouse shipment travel path as claimed in claim 11, wherein the primary, secondary, and tertiary bins are each configured with a spare bin for supplementing a same level warehouse with scarce material.
13. A multi-warehouse inventory allocation device for shortening warehouse cargo allocation travel path is characterized in that the device comprises,
the target coordinate point module is used for acquiring an order containing a disassembly mark and corresponding receiving address information, converting the receiving address information into target coordinate points positioned on a preset map, and presetting storage coordinate points and distribution paths of each warehouse on the map;
The screening module is used for screening the warehouses of the same type as the preselected warehouses based on the required materials and the required quantity information of the orders and combining the inventory information of the preselected warehouses corresponding to the form-dismantling mark, and gathering the screened warehouses and the preselected warehouses to obtain a candidate warehouse set;
the calculation module is used for traversing the candidate warehouse set and calculating a warehouse cargo allocation walking path between the target coordinate point corresponding to the order and the warehouse coordinate point corresponding to the warehouse in the candidate warehouse set according to a cargo allocation path preset on the map;
and the distribution module is used for selecting the warehouse corresponding to the shortest warehouse distribution travelling path as a target warehouse to carry out inventory distribution, and deducting the corresponding material inventory of the target warehouse.
14. A computer device comprising a memory, a processor and a computer program stored on the memory, the processor executing the computer program to perform the steps of the method of any one of claims 1 to 12.
15. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the steps of the method of any one of claims 1 to 12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310072891.0A CN116308031A (en) | 2023-01-31 | 2023-01-31 | Multi-warehouse inventory allocation method for shortening warehouse cargo allocation walking path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310072891.0A CN116308031A (en) | 2023-01-31 | 2023-01-31 | Multi-warehouse inventory allocation method for shortening warehouse cargo allocation walking path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116308031A true CN116308031A (en) | 2023-06-23 |
Family
ID=86798669
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310072891.0A Pending CN116308031A (en) | 2023-01-31 | 2023-01-31 | Multi-warehouse inventory allocation method for shortening warehouse cargo allocation walking path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116308031A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116757584A (en) * | 2023-08-18 | 2023-09-15 | 四川星点网络技术有限公司 | Big data-based cargo allocation system |
| CN116823122A (en) * | 2023-08-26 | 2023-09-29 | 长沙市三知农业科技有限公司 | Agricultural and sideline product warehouse management method and system |
| CN117057705A (en) * | 2023-07-11 | 2023-11-14 | 汕尾领君科技有限公司 | Intelligent logistics management system and management method |
| CN117541022A (en) * | 2024-01-04 | 2024-02-09 | 广州拓威天海国际物流有限公司 | Method for planning picking path of international transportation bulk cargo |
| CN117910917A (en) * | 2024-03-19 | 2024-04-19 | 安徽智享云科技有限公司 | Logistics transportation process quality management system and method based on artificial intelligence |
-
2023
- 2023-01-31 CN CN202310072891.0A patent/CN116308031A/en active Pending
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117057705A (en) * | 2023-07-11 | 2023-11-14 | 汕尾领君科技有限公司 | Intelligent logistics management system and management method |
| CN117057705B (en) * | 2023-07-11 | 2024-02-13 | 汕尾领君科技有限公司 | Intelligent logistics management system and management method |
| CN116757584A (en) * | 2023-08-18 | 2023-09-15 | 四川星点网络技术有限公司 | Big data-based cargo allocation system |
| CN116757584B (en) * | 2023-08-18 | 2023-11-24 | 四川星点网络技术有限公司 | Big data-based cargo allocation system |
| CN116823122A (en) * | 2023-08-26 | 2023-09-29 | 长沙市三知农业科技有限公司 | Agricultural and sideline product warehouse management method and system |
| CN116823122B (en) * | 2023-08-26 | 2023-12-08 | 长沙市三知农业科技有限公司 | Agricultural and sideline product warehouse management method and system |
| CN117541022A (en) * | 2024-01-04 | 2024-02-09 | 广州拓威天海国际物流有限公司 | Method for planning picking path of international transportation bulk cargo |
| CN117541022B (en) * | 2024-01-04 | 2024-04-16 | 广州拓威天海国际物流有限公司 | Method for planning picking path of international transportation bulk cargo |
| CN117910917A (en) * | 2024-03-19 | 2024-04-19 | 安徽智享云科技有限公司 | Logistics transportation process quality management system and method based on artificial intelligence |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116308031A (en) | Multi-warehouse inventory allocation method for shortening warehouse cargo allocation walking path | |
| CN111033539B (en) | Robot inventory update for order-prescribed routes | |
| CN109205163B (en) | Across tunnel Multilayer shuttle car warehousing system design method, system and storage medium | |
| CN110245890B (en) | Goods sorting method and goods sorting system | |
| CN110599090B (en) | Warehouse-out management method, server and storage medium | |
| CN113420928A (en) | Order scheduling method, device, equipment and storage medium | |
| US20200364630A1 (en) | System and method for managing transportation vessels | |
| CN116308026A (en) | Automatic warehouse inventory allocation method and device | |
| CN114386720B (en) | Logistics system scheduling management method, system, terminal equipment and storage medium | |
| CN116307306B (en) | Intelligent scheduling method, device, equipment and storage medium based on big data | |
| Fung et al. | Capacity planning in supply chains of mineral resources | |
| Kush et al. | Regularities of change of the supply chain operation efficiency, depending on the parameters of the transport process | |
| CN106991544A (en) | Allot system and allot method | |
| CN114626794B (en) | Internet of things-based warehousing vertical warehouse shuttle vehicle path planning method and system | |
| CN115049342A (en) | Goods delivery control method and device and computer readable storage medium | |
| Wang et al. | Pickup and delivery of automobiles from warehouses to dealers | |
| Setamanit | Evaluation of outsourcing transportation contract using simulation and design of experiment | |
| CN113222308B (en) | Order distribution method, order distribution device, electronic equipment and storage medium | |
| CN113822634A (en) | Cold chain inventory allocation method and device, computer equipment and storage medium | |
| CN113343166A (en) | Logistics inventory management system based on discrete event simulation | |
| US11093891B1 (en) | Dynamically generating a sort zone assignment plan | |
| US9864962B1 (en) | Minimum suggested rate picking | |
| CN111652550A (en) | Method, system and equipment for intelligently searching optimal loop set | |
| CN113496364A (en) | Warehouse-out method, warehouse-out end and warehousing system | |
| Mohd Salleh et al. | Evaluation of Transportation Distance Optimization Route for Milk Run Logistics System |
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 |