CN112101645A - Multi-place multi-bin selection method, multi-place multi-bin selection system and multi-bin selection device - Google Patents
Multi-place multi-bin selection method, multi-place multi-bin selection system and multi-bin selection device Download PDFInfo
- Publication number
- CN112101645A CN112101645A CN202010902135.2A CN202010902135A CN112101645A CN 112101645 A CN112101645 A CN 112101645A CN 202010902135 A CN202010902135 A CN 202010902135A CN 112101645 A CN112101645 A CN 112101645A
- Authority
- CN
- China
- Prior art keywords
- warehouse
- order
- cost
- carrier
- combination
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock 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
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a multi-place multi-bin selection method, a bin selection system and a bin selection device, wherein in the bin selection method, an SKU-warehouse matrix is generated according to the stock condition; then, generating a multi-branch tree skillfully; then, all warehouse combinations meeting the inventory are obtained through traversing the tree; comprehensively sequencing the timeliness, the cost and the commodity marking condition: and calculating the timeliness, the cost and the commodity marking condition of all the combinations obtained by the matching algorithm, and then sequencing according to the requirement to obtain the optimal result.
Description
Technical Field
The invention relates to the field of warehouse logistics, in particular to a multi-place multi-bin selecting method, a multi-place multi-bin selecting system and a multi-bin selecting device.
Background
With the development of the internet industry, more and more users select online shopping, which requires sufficient support for the warehousing and logistics industry, wherein, in order to facilitate goods distribution, goods are stored in warehouses in various regions, and after receiving order information, a server selects warehouses according to the goods in the order, so that workers can conveniently take and distribute the goods, wherein how to select the goods distribution warehouses according to the order greatly affects the warehousing and operation costs.
The existing warehouse selection scheme is based on the combined dimension consideration of the quantity of warehouses of the same commodity in different warehouses. There is no comprehensive consideration of shipping time/cost costs to be incurred in front of a multi-site multi-warehouse selected warehouse; furthermore, the method can not cope with high transportation cost and slow aging of remote destinations.
Disclosure of Invention
The invention aims to provide a multi-place multi-bin selecting method, a multi-place multi-bin selecting system and a multi-bin selecting device, which can reduce the cost and improve the time efficiency.
In order to achieve the purpose, the invention provides the following scheme:
a multi-place multi-bin binning method, comprising:
s1, obtaining order information; the order information includes: customer shipping address, purchase item and purchase quantity;
s2, determining N warehouse combinations to be selected based on the order information; the warehouse combination to be selected is a set of warehouses to be selected which can meet order conditions; outputting warehouse information contained in the selected warehouse combination;
s3, combining the order information and the N warehouses to be selected as input conditions of a warehouse selection algorithm;
and S4, the warehouse selection algorithm sorts according to the time effect/cost/commodity marking condition and outputs the warehouse combination to be selected.
Optionally, the bin selection algorithm includes the following steps:
s3-1, inputting the order information and the N combinations of the warehouses to be selected as basic data;
s3-2, initializing a commodity-warehouse matrix, wherein the number of the satisfied targets in all the warehouses is 1, and the number of the satisfied targets in all the warehouses is not 0;
s3-3, constructing a multi-dimensional tree array, and selecting an array element with the value of 1 as a node;
s3-4, traversing the multi-dimensional tree array, and selecting all warehouse combinations meeting order conditions;
s3-5, calculating the time efficiency and cost of each warehouse combination and the marking condition of the commodity, and outputting;
and S3-6, carrying out priority ranking according to the aging and the cost of the obtained warehouse combination and the marking condition of the commodities.
Optionally, in step S3-5, the algorithm for calculating the cost of the warehouse combination is as follows:
making the basic parameters and the additional parameters of the order as input conditions of a cost algorithm;
judging the tail-end delivery warehouse through the order basic parameters and the order additional parameters, judging whether the three-party carrier can directly send the order according to the standard rate matching maintained by the contract, and if the order can be directly sent, taking the starting warehouse as the tail-end delivery warehouse; if the order can not be sent directly, judging whether the destination of the order is in the self-operation carrier delivery range, if the destination of the order is not in the self-operation carrier delivery range, performing a three-level address traversal cycle from district-city-province through the destination of the order, and searching a warehouse address matched with the destination of the order as an end delivery warehouse;
after the whole route is determined, matching the rates of all carriers by screening the scheduling rules according to the origin, destination, weight and volume of each section, selecting all carriers meeting the route, and calculating the comprehensive cost of each carrier;
the total cost of the warehouse portfolio is derived by adding up the combined costs for each carrier.
Optionally, the combined cost of the carriers is equal to the warehousing cost plus the mining threshold cost; the warehouse operation cost is warehouse operation cost, and the threshold collecting cost is comprehensive cost for delivering goods to the selected warehouse by the supplier.
Optionally, the whole-course route is determined through the segmentation rule, after the end delivery bin is determined, the user sets whether the transfer is needed between the warehouses through personalized configuration, and if the transfer is not needed, the segmentation is not performed by default.
Optionally, in step S3-5, the aging algorithm for the warehouse combination is calculated as follows:
taking the order basic parameter information and the order additional parameters as input conditions of the aging algorithm;
matching directly-issued carriers through order basic parameters and order additional parameters, and acquiring corresponding timeliness; if the order cannot be sent directly, whether the destination of the order is in the self-operation carrier delivery range is judged, if the destination of the order is in the self-operation carrier delivery range, the warehouse to which the self-operation carrier belongs is used as the tail end delivery warehouse of the destination, if the destination of the order is not in the self-operation carrier delivery range, the three-level address traversal loop from district to city to province is carried out through the destination of the order, and the address of the warehouse matched with the destination of the order is searched to be used as the tail end delivery warehouse;
after the whole route is determined, the time effectiveness of each carrier is matched according to the origin, the destination, the weight and the volume of each section through screening of a scheduling rule, all carriers meeting the route are selected, and the comprehensive time effectiveness of each carrier is calculated;
and judging whether buffering time is needed between carriers, and accumulating the comprehensive aging and the buffering time of each carrier end to obtain the total aging of the warehouse combination.
Optionally, the buffering time is 1 day, and if the acquisition deadline of the next carrier is earlier than the estimated arrival time of the previous carrier, the buffering time is added between the two carriers.
Optionally, the comprehensive aging of the carrier is equal to the transportation aging plus the threshold time effective value; the transportation time limit is the time limit of transportation between two warehouses, and the threshold time limit is the time limit of delivery of the supplier to the selected warehouse.
The invention additionally provides a multi-place multi-bin sorting system, comprising:
the order information acquisition module is used for acquiring order information;
the warehouse combination module to be selected is used for determining N warehouse combinations to be selected based on the order information; the warehouse combination to be selected is a set of warehouses to be selected which can meet order conditions; outputting warehouse information contained in the selected warehouse combination;
the input condition determining module of the warehouse selection algorithm is used for combining the order information and the N warehouses to be selected as the input conditions of the warehouse selection algorithm;
and the to-be-selected warehouse combination determining module is used for sequencing and outputting the to-be-selected warehouse combination according to the time effect/cost/commodity marking condition by adopting a bin selection algorithm.
The invention additionally provides a multi-place multi-bin selection device, which comprises:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the above-described method.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the scheme of the invention can select the least warehouse under the condition of one product with a plurality of warehouses based on the optimal timeliness or the optimal cost, thereby achieving the least package number and the less order-dismantling principle, obtaining the least warehouse delivery, and selecting a more optimal warehouse or warehouse combination according to the specific inventory and the spot inventory based on the commodity marking. The method can be used for judging whether the target address is available for shipment after purchase by adding the acquisition threshold value under the conditions that the corresponding destination meets the existing goods but the freight cost is high and the timeliness is slow, and can be used for achieving a scheme of lower cost and quicker timeliness by selecting the mode of approaching purchase.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without inventive exercise.
FIG. 1 is a flow chart of a multi-bin and multi-bin selection method according to an embodiment of the present invention;
FIG. 2 is a flow chart of the steps of a bin selection algorithm according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a traversal of a multi-dimensional tree array according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a multi-bin selecting system according to an embodiment of the present invention.
Detailed Description
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 invention aims to provide a multi-place multi-bin selecting method, a multi-place multi-bin selecting system and a multi-bin selecting device, which can reduce the cost and improve the time efficiency.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
Fig. 1 is a flow chart of a multi-bin and multi-bin selecting method according to an embodiment of the present invention, as shown in fig. 1, the method includes:
s1, obtaining order information; the order information includes: customer shipping address, purchase item and purchase quantity.
S2, determining the warehouse combination to be selected: determining N warehouse combinations to be selected based on the order information; the warehouse combination to be selected is a set of warehouses to be selected which can meet order conditions; and outputting warehouse information contained in the selected warehouse combination.
The warehouse information comprises inventory quantity of the order related articles of the warehouse in the warehouse contained in the warehouse combination, which reaches the spot goods threshold value, and marked commodity information in the warehouse, wherein marking can be expanded at will: for example, with or without a flag, the warehouse can have a pick threshold for picking items associated with a buy order, the threshold being: the quantity/preset coefficient, such as 100 customer demands, normally meets 100 available inventory, namely reaches the threshold; the threshold value may be set to be greater than or equal to 50% in proportion, that is, the threshold value is reached; the threshold value is used for indicating the exclusive inventory quantity, the comprehensive delivery time length and the comprehensive expense of delivering goods to the selected bin which are purchased by the supplier, and the threshold value is not the commodity cost.
Further, the warehouse combination comprises a single warehouse which can meet the order condition, a plurality of warehouses which can meet the order condition and a plurality of warehouses which can meet the purchase condition.
S3, determining input conditions: and combining the order information and the N warehouses to be selected as input conditions of a warehouse selection algorithm.
S4, sequencing output: and the warehouse selection algorithm sorts according to the aging/cost/commodity marking condition and outputs the warehouse combination to be selected.
As shown in fig. 2, the bin selection algorithm includes the following steps:
s3-1, inputting basic data, and inputting the combination of the order information and the N warehouses to be selected as the basic data;
s3-2, initializing a commodity-warehouse matrix, wherein the number of the satisfied targets in all the warehouses is 1, and the number of the satisfied targets in all the warehouses is not 0; as shown in table 1:
s3-3, constructing a multi-dimensional tree array, as shown in FIG. 3, selecting an array element with a value of 1 as a node, wherein the purpose is to select a warehouse which can meet order conditions;
s3-4, traversing the multi-dimensional tree array, and selecting all warehouse combinations meeting order conditions; as in fig. 3, { (warehouse 1, warehouse 2), (warehouse 1, warehouse 2, warehouse 3), (warehouse 2, warehouse 3) } generates 3 warehouse combinations;
s3-5, calculating the time efficiency and cost of each warehouse combination and the marking condition of the commodity, and outputting;
and S3-6, carrying out priority ranking according to the aging and the cost of the obtained warehouse combination and the marking condition of the commodities.
In step S3-5, the algorithm for calculating the cost of the warehouse combination is as follows: making the basic parameters and the additional parameters of the order as input conditions of a cost algorithm; such as: the additional parameters of the origin, the destination, the material name and the quantity can be used as conditions for refining the algorithm, such as: contraband, cargo value, weight restrictions, volume restrictions, refrigerated goods, frozen goods, batteries, service levels, and the like.
Judging the tail-end delivery warehouse through the order basic parameters and the order additional parameters, judging whether the three-party carrier can directly send the order according to the standard rate matching maintained by the contract, and if the order can be directly sent, taking the starting warehouse as the tail-end delivery warehouse; if the order can not be sent directly, judging whether the destination of the order is in the self-operation carrier delivery range, if the destination of the order is not in the self-operation carrier delivery range, performing a three-level address traversal cycle from district-city-province through the destination of the order, and searching a warehouse address matched with the destination of the order as an end delivery warehouse;
specifically, when judging whether the destination of the order is in the self-operation carrier delivery range, judging whether the order is in the electronic fence by analyzing the longitude and latitude of the destination and combining the electronic fence in the self-operation delivery range.
After the whole route is determined, matching the rates of all carriers by screening the scheduling rules according to the origin, destination, weight and volume of each section, selecting all carriers meeting the route, and calculating the comprehensive cost of each carrier;
specifically, the system executes an order combination algorithm in a specified period to reduce the transportation cost, when an order is issued, a user can set a calculation period to create an order wave, the order in the wave takes a closing time in the previous day as a starting time, the current time as an ending time, the order capable of being combined is circularly calculated, the condition capable of being combined can be configured by self, and when the order meets the combination condition and the order state allows the combination, the system combines a rule field by calculating the total weight and the volume. And after the order combination is successful, carrying out cost optimal calculation by the combined order.
Specifically, the whole-course route is determined through the segmentation rule, after the tail end delivery bin is determined, a user can set whether the transfer is needed between the warehouses through personalized configuration, and if the transfer is not needed, the segmentation is not performed by default.
The total cost of the warehouse portfolio is derived by adding up the combined costs for each carrier.
Specifically, the comprehensive cost of the carrier is equal to the warehouse transportation cost plus the threshold collection cost, the warehouse transportation cost is the warehouse operation cost, and the threshold collection cost is the comprehensive cost for delivering goods to the selected warehouse in terms of business.
After the parameter consideration calculation of the mining threshold cost of the adjacent bin is added, the combination of the bins with high cost far away can be ranked to the combination with low shipping cost of the adjacent bin after the adjacent bin is purchased, and the more preferable selection is achieved. The formula is as follows: the combined total cost is the combined cost of warehouse 1 + the combined cost of warehouse 2 + the combined cost of warehouse N ….
As in fig. 3:
three combinations
(warehouse 1, warehouse 2) total cost ═ U
(warehouse 1, warehouse 2, warehouse 3) the combined total cost of two is V,
(warehouse 2, warehouse 3) Combined Total cost of three W
When U > V > W, the total cost of W is lowest, and the top of the sorting queue is used as the default preference.
Specifically, in step S3-5, the aging algorithm for the warehouse combination is calculated as follows: taking the order basic parameter information and the order additional parameters as input conditions of the aging algorithm; such as: origin, destination, material name, quantity; additional parameters may be used as conditions for refining the algorithm, such as: contraband, cargo value, weight restrictions, volume restrictions, refrigerated goods, frozen goods, batteries, service levels, and the like.
Matching directly-issued carriers through order basic parameters and order additional parameters, and acquiring corresponding timeliness; or the order can not be sent directly, whether the destination of the order is in the self-operation carrier delivery range or not is judged, if the destination of the order is in the self-operation carrier delivery range, the warehouse to which the self-operation carrier belongs can be used as the tail end delivery warehouse of the destination, if the destination of the order is not in the self-operation carrier delivery range, the three-level address is subjected to region-city-province traversal circulation through the destination of the order, and the address of the warehouse matched with the destination of the order is searched to be used as the tail end delivery warehouse;
after the whole route is determined, the time effectiveness of each carrier is matched according to the origin, the destination, the weight and the volume of each section through screening of a scheduling rule, all carriers meeting the route are selected, and the comprehensive time effectiveness of each carrier is calculated;
and judging whether buffering time is needed between carriers, and accumulating the comprehensive aging and the buffering time of each carrier end to obtain the total aging of the warehouse combination.
The user may manually select the time/cost optimized result. Default combinations of the two with top ranking may also be set.
The total age of the warehouse combination is the delivery client total age of warehouse 1 + delivery client total age of warehouse 2 + delivery client total age of warehouse N + ….
As shown in fig. 3, the total time of delivery to the customer, which is the combination of (warehouse 1, warehouse 2) — X
(warehouse 1, warehouse 2, warehouse 3) the total time period for delivery to the customer of the combination two is Y,
(warehouse 2, warehouse 3) } combination III of total time efficiency Z of delivery to client
When X is larger than Y and larger than Z, the total aging of Z is lowest, and the top of the sorting queue is used as the default first choice.
Preferably, the buffering time is 1 day, and if the acquisition deadline of the next carrier is earlier than the expected arrival time of the previous carrier, the buffering time is added between the two carriers.
Such as: the aging of the carrier A to the no-tin stage is 2D19, the latest predicted arrival time is 19:00, the carrier of the no-tin stage has the collection deadline of 18:00 and the aging is 1D18, and the whole aging is as follows: 2D19+1D18+1 ═ 4D.
Specifically, the comprehensive aging of the carrier is equal to the transportation aging plus the threshold time effective value, the transportation aging is the aging of the transportation between the two warehouses, and the threshold time effective value is the aging of the delivery of the supplier to the selected warehouse.
Under the condition of one product with multiple bins, the following general theorem of the industry is met by a large number of examples:
the distance of the shipping bin from the target shipping address is selected to be proportional to the cost, i.e., the cost increases the further the distance.
The number of the selected spot shipment bins is in direct proportion to the number of the generated split packages, namely, the more the delivery bins are, the more the split packages are.
When all combinations are selected that have the lowest combined cost, the combination with the least number of shipping bins closest to the customer may be preferentially selected.
After the parameter of the purchasing threshold value of the adjacent warehouse is considered and calculated, the warehouse combination with high cost far away can be arranged after the combination of the adjacent warehouse for delivering goods after the adjacent warehouse is purchased, and the cost are considered under the condition of reducing the time efficiency.
After the queue combination with the lowest cost and the shortest aging is obtained, the system sets default, selects the optimal combination with the same combination and the highest sequencing from top to bottom in the two queues of cost-aging, and can give consideration to both cost and aging. And the selected warehouse combination can be carried out according to the cost/time effectiveness by a preset client in advance, so that the warehouse selection is completed, and the selected warehouse information is output.
As shown in fig. 4, the present invention provides a multi-place multi-bin sorting system, comprising:
an order information obtaining module 201, configured to obtain order information;
a warehouse to be selected combination module 202, configured to determine N warehouse combinations to be selected based on the order information; the warehouse combination to be selected is a set of warehouses to be selected which can meet order conditions; outputting warehouse information contained in the selected warehouse combination;
an input condition determining module 203 of the warehouse selection algorithm, configured to combine the order information and the N warehouses to be selected as input conditions of the warehouse selection algorithm;
and the to-be-selected warehouse combination determining module 204 is used for sorting and outputting the to-be-selected warehouse combination according to the timeliness/cost/commodity marking conditions by adopting a warehouse selection algorithm.
The invention also provides a multi-place multi-bin selecting device, which comprises:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the above-described method.
The invention relates to a multi-place multi-bin selection method, a bin selection system and a bin selection device, wherein in the bin selection method, an SKU-warehouse matrix is generated according to the stock condition; then, generating a multi-branch tree skillfully; then, all warehouse combinations meeting the inventory are obtained through traversing the tree; comprehensively sequencing the timeliness, the cost and the commodity marking condition: and calculating the timeliness, the cost and the commodity marking condition of all the combinations obtained by the matching algorithm, and then sequencing according to the requirement to obtain the optimal result.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present invention have been described herein using specific examples, which are provided only to help understand the method and the core concept of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.
Claims (10)
1. A multi-place multi-bin sorting method, the method comprising:
s1, obtaining order information; the order information includes: customer shipping address, purchase item and purchase quantity;
s2, determining N warehouse combinations to be selected based on the order information; the warehouse combination to be selected is a set of warehouses to be selected which can meet order conditions; outputting warehouse information contained in the selected warehouse combination;
s3, combining the order information and the N warehouses to be selected as input conditions of a warehouse selection algorithm;
and S4, the warehouse selection algorithm sorts according to the time effect/cost/commodity marking condition and outputs the warehouse combination to be selected.
2. A multi-place multi-bin binning method according to claim 1, wherein said binning algorithm comprises the steps of:
s3-1, inputting the order information and the N combinations of the warehouses to be selected as basic data;
s3-2, initializing a commodity-warehouse matrix, wherein the number of the satisfied targets in all the warehouses is 1, and the number of the satisfied targets in all the warehouses is not 0;
s3-3, constructing a multi-dimensional tree array, and selecting an array element with the value of 1 as a node;
s3-4, traversing the multi-dimensional tree array, and selecting all warehouse combinations meeting order conditions;
s3-5, calculating the time efficiency and cost of each warehouse combination and the marking condition of the commodity, and outputting;
and S3-6, carrying out priority ranking according to the aging and the cost of the obtained warehouse combination and the marking condition of the commodities.
3. The method for selecting multiple warehouse locations and multiple warehouse locations according to claim 2, wherein in step S3-5, the algorithm for calculating the cost of warehouse combination is as follows:
making the basic parameters and the additional parameters of the order as input conditions of a cost algorithm;
judging the tail-end delivery warehouse through the order basic parameters and the order additional parameters, judging whether the three-party carrier can directly send the order according to the standard rate matching maintained by the contract, and if the order can be directly sent, taking the starting warehouse as the tail-end delivery warehouse; if the order can not be sent directly, judging whether the destination of the order is in the self-operation carrier delivery range, if the destination of the order is not in the self-operation carrier delivery range, performing a three-level address traversal cycle from district-city-province through the destination of the order, and searching a warehouse address matched with the destination of the order as an end delivery warehouse;
after the whole route is determined, matching the rates of all carriers by screening the scheduling rules according to the origin, destination, weight and volume of each section, selecting all carriers meeting the route, and calculating the comprehensive cost of each carrier;
the total cost of the warehouse portfolio is derived by adding up the combined costs for each carrier.
4. The method of claim 3, wherein the carrier's combined cost equals the warehouse shipping cost plus the threshold cost; the warehouse operation cost is warehouse operation cost, and the threshold collecting cost is comprehensive cost for delivering goods to the selected warehouse by the supplier.
5. The method as claimed in claim 3, wherein the whole route is determined by a segmentation rule, after determining the end delivery bin, the user sets whether there is a need for transfer between the warehouses by a personalized configuration, and if there is no need, the warehouse is not segmented by default.
6. The method for selecting multiple bins according to claim 2, wherein in step S3-5, the aging algorithm for calculating the bin combination is as follows:
taking the order basic parameter information and the order additional parameters as input conditions of the aging algorithm;
matching directly-issued carriers through order basic parameters and order additional parameters, and acquiring corresponding timeliness; if the order cannot be sent directly, whether the destination of the order is in the self-operation carrier delivery range is judged, if the destination of the order is in the self-operation carrier delivery range, the warehouse to which the self-operation carrier belongs is used as the tail end delivery warehouse of the destination, if the destination of the order is not in the self-operation carrier delivery range, the three-level address traversal loop from district to city to province is carried out through the destination of the order, and the address of the warehouse matched with the destination of the order is searched to be used as the tail end delivery warehouse;
after the whole route is determined, the time effectiveness of each carrier is matched according to the origin, the destination, the weight and the volume of each section through screening of a scheduling rule, all carriers meeting the route are selected, and the comprehensive time effectiveness of each carrier is calculated;
and judging whether buffering time is needed between carriers, and accumulating the comprehensive aging and the buffering time of each carrier end to obtain the total aging of the warehouse combination.
7. The method of claim 6, wherein the buffering time is 1 day, and the buffering time is added between the next carrier and the previous carrier if the estimated arrival time of the previous carrier is earlier than the blanket deadline of the next carrier.
8. The method of claim 6, wherein the carrier's aggregate age equals the shipping age plus the threshold time effective value; the transportation time limit is the time limit of transportation between two warehouses, and the threshold time limit is the time limit of delivery of the supplier to the selected warehouse.
9. A multi-location multi-bin binning system, comprising:
the order information acquisition module is used for acquiring order information;
the warehouse combination module to be selected is used for determining N warehouse combinations to be selected based on the order information; the warehouse combination to be selected is a set of warehouses to be selected which can meet order conditions; outputting warehouse information contained in the selected warehouse combination;
the input condition determining module of the warehouse selection algorithm is used for combining the order information and the N warehouses to be selected as the input conditions of the warehouse selection algorithm;
and the to-be-selected warehouse combination determining module is used for sequencing and outputting the to-be-selected warehouse combination according to the time effect/cost/commodity marking condition by adopting a bin selection algorithm.
10. A multi-location multi-bin sorting device, the device comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010902135.2A CN112101645A (en) | 2020-09-01 | 2020-09-01 | Multi-place multi-bin selection method, multi-place multi-bin selection system and multi-bin selection device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010902135.2A CN112101645A (en) | 2020-09-01 | 2020-09-01 | Multi-place multi-bin selection method, multi-place multi-bin selection system and multi-bin selection device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112101645A true CN112101645A (en) | 2020-12-18 |
Family
ID=73757219
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010902135.2A Pending CN112101645A (en) | 2020-09-01 | 2020-09-01 | Multi-place multi-bin selection method, multi-place multi-bin selection system and multi-bin selection device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112101645A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112700046A (en) * | 2020-12-31 | 2021-04-23 | 深圳琼景科技有限公司 | Intelligent warehouse-dividing packaging method and device, computer equipment and storage medium |
| CN112884544A (en) * | 2021-01-29 | 2021-06-01 | 北京睿利众屹软件有限公司 | Automatic order allocation method, device, equipment and storage medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004168433A (en) * | 2002-11-15 | 2004-06-17 | Nec Fielding Ltd | System, method, and program for order-receiving and selling commodity |
| CN104732368A (en) * | 2015-03-25 | 2015-06-24 | 广州天图物流有限公司 | Order route system and method |
| CN105354633A (en) * | 2015-10-26 | 2016-02-24 | 努比亚技术有限公司 | Transportation route calculation system and method |
| 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 |
| CN107464082A (en) * | 2017-08-23 | 2017-12-12 | 北京惠赢天下网络技术有限公司 | The processing method and server of a kind of trading order form |
| CN109359759A (en) * | 2018-08-07 | 2019-02-19 | 深圳市易达云科技有限公司 | Intelligence divides storehouse method, equipment and computer readable storage medium |
| CN109544279A (en) * | 2018-11-05 | 2019-03-29 | 广州大学 | The commodity adaption system and method quickly delivered towards order |
| CN109544056A (en) * | 2018-10-12 | 2019-03-29 | 广州快批信息科技有限公司 | A kind of automatic cargo allocation method, electronic equipment and storage medium |
| CN109816294A (en) * | 2017-11-22 | 2019-05-28 | 上海德启信息科技有限公司 | A kind of determination method and apparatus of shipping room |
| CN110633820A (en) * | 2018-06-25 | 2019-12-31 | 北京京东振世信息技术有限公司 | Warehouse address recommendation method and device and computer readable storage medium |
-
2020
- 2020-09-01 CN CN202010902135.2A patent/CN112101645A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004168433A (en) * | 2002-11-15 | 2004-06-17 | Nec Fielding Ltd | System, method, and program for order-receiving and selling commodity |
| CN104732368A (en) * | 2015-03-25 | 2015-06-24 | 广州天图物流有限公司 | Order route system and method |
| CN105354633A (en) * | 2015-10-26 | 2016-02-24 | 努比亚技术有限公司 | Transportation route calculation system and method |
| 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 |
| CN107464082A (en) * | 2017-08-23 | 2017-12-12 | 北京惠赢天下网络技术有限公司 | The processing method and server of a kind of trading order form |
| CN109816294A (en) * | 2017-11-22 | 2019-05-28 | 上海德启信息科技有限公司 | A kind of determination method and apparatus of shipping room |
| CN110633820A (en) * | 2018-06-25 | 2019-12-31 | 北京京东振世信息技术有限公司 | Warehouse address recommendation method and device and computer readable storage medium |
| CN109359759A (en) * | 2018-08-07 | 2019-02-19 | 深圳市易达云科技有限公司 | Intelligence divides storehouse method, equipment and computer readable storage medium |
| CN109544056A (en) * | 2018-10-12 | 2019-03-29 | 广州快批信息科技有限公司 | A kind of automatic cargo allocation method, electronic equipment and storage medium |
| CN109544279A (en) * | 2018-11-05 | 2019-03-29 | 广州大学 | The commodity adaption system and method quickly delivered towards order |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112700046A (en) * | 2020-12-31 | 2021-04-23 | 深圳琼景科技有限公司 | Intelligent warehouse-dividing packaging method and device, computer equipment and storage medium |
| CN112884544A (en) * | 2021-01-29 | 2021-06-01 | 北京睿利众屹软件有限公司 | Automatic order allocation method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Coelho et al. | The inventory-routing problem with transshipment | |
| US7979359B1 (en) | System and method for selectively applying an item sortation process | |
| Kreng et al. | The benefits of a cross-docking delivery strategy: a supply chain collaboration approach | |
| CN110659839A (en) | Intelligent logistics stowage scheduling method | |
| CN112101645A (en) | Multi-place multi-bin selection method, multi-place multi-bin selection system and multi-bin selection device | |
| CN110084471A (en) | Sort dispatching method, device, warehousing system and readable storage medium storing program for executing | |
| CN107944807B (en) | Logistics management system | |
| Orjuela-Castro et al. | Last mile logistics in mega-cities for perishable fruits | |
| Low et al. | Integration of production scheduling and delivery in two echelon supply chain | |
| CN110390497A (en) | Article storage method and device | |
| Hajiaghaei-Keshteli et al. | Addressing the freight consolidation and containerization problem by recent and hybridized meta-heuristic algorithms | |
| CN110060013B (en) | Method and device for processing orders to be distributed | |
| CN114462946A (en) | FBA (file system based) order purchase, sales, head stock and freight management system and method | |
| US20180341913A1 (en) | Reducing the environmental effects of shipments of goods | |
| CN111626800A (en) | Commodity order processing method and device | |
| CN113222490A (en) | Inventory allocation method and device | |
| CN115222340A (en) | Goods scheduling management method based on intelligent warehousing and related device | |
| CN111667208B (en) | Method, device, equipment and medium for controlling storage of articles | |
| US11093891B1 (en) | Dynamically generating a sort zone assignment plan | |
| Helmberg et al. | A case study of joint online truck scheduling and inventory management for multiple warehouses | |
| CN113554380A (en) | Method and device for positioning articles in warehouse-out process | |
| Chen | Online Integrated Production and Distribution Scheduling: Review and Extensions | |
| Farsi et al. | Simultaneous Pricing, Routing, and Inventory Control for Perishable Goods in a Two-echelon Supply Chain | |
| CN114620402B (en) | Information processing method, device, equipment and storage medium | |
| US11755994B2 (en) | Determining pick pallet build operations and pick sequencing |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201218 |