CN113592282A - Article distribution method and device - Google Patents
Article distribution method and device Download PDFInfo
- Publication number
- CN113592282A CN113592282A CN202110845436.0A CN202110845436A CN113592282A CN 113592282 A CN113592282 A CN 113592282A CN 202110845436 A CN202110845436 A CN 202110845436A CN 113592282 A CN113592282 A CN 113592282A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- volume
- article
- articles
- sequence
- 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
- 238000000034 method Methods 0.000 title claims abstract description 62
- 238000009826 distribution Methods 0.000 title claims abstract description 26
- 230000008569 process Effects 0.000 claims description 25
- 238000003860 storage Methods 0.000 claims description 14
- 238000012545 processing Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012216 screening Methods 0.000 claims description 4
- 238000011068 loading method Methods 0.000 description 27
- 238000010586 diagram Methods 0.000 description 12
- 238000004891 communication Methods 0.000 description 7
- 238000007726 management method Methods 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000012163 sequencing technique Methods 0.000 description 5
- 238000004422 calculation algorithm Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000012856 packing Methods 0.000 description 3
- 230000007306 turnover Effects 0.000 description 3
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/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
-
- 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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Abstract
The invention discloses an article distribution method and device, and relates to the field of warehouse logistics. One embodiment of the method comprises: determining the total required volume of all articles in the article sequence and the first article with the highest priority, and searching a target vehicle meeting the requirement of the total required volume; acquiring the unit volume and the to-be-distributed amount of the first articles, calculating the quotient of the current available space and the unit volume of the target vehicle, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first articles loaded on the target vehicle; and updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is less than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle. According to the embodiment, the matching between the vehicle and the object is optimized according to the object volume, and the scheme of the type and the quantity of the objects corresponding to each vehicle is given, so that the possibility of the existing problems can be effectively reduced.
Description
Technical Field
The invention relates to the field of warehouse logistics, in particular to an article distribution method and device.
Background
At present, an article loading device of a van is usually used for calculating an article and vehicle distribution scheme by personal experience according to the type and volume of received articles and the type of vehicles in a warehouse. The existing article loading method mainly comprises the following steps: 1) acquiring information and types of each article in a supply list, and calculating the total volume of the articles; 2) checking the types of the vehicles available in the warehouse, and estimating the types and the quantity of the required vehicles according to the total volume matching of the articles; 3) and arranging an operator to carry out loading operation.
In the process of implementing the invention, the inventor finds that the prior art has at least the following problems:
1) the accuracy of matching the vehicle and the goods depends on human: under the loading scene of multiple article types, the problem of underestimation or overestimation of the space required by the articles is easy to occur due to different article volumes, so that the condition that the articles cannot be loaded or are smaller than the starting transport volume occurs in the actual loading operation, the unloading and the reloading are needed, and the low loading efficiency is caused;
2) depending on the skill of the truck-loading operator: the information obtained by the loading operator is a vehicle and article list of 'a plurality of articles A and a plurality of articles B … …', and the loading sequence and the placing position need to be determined by self based on personal judgment of the appearance and the weight of the articles. Therefore, for unskilled workers, the problems of low loading efficiency, poor loading quality and the like can be faced.
Disclosure of Invention
In view of this, embodiments of the present invention provide an article distribution method and apparatus, which can at least solve the problem that the prior art relies too much on the accuracy of the estimation of the type and quantity of vehicles required for articles by human and the experience of stacking articles by a loading operator.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided an article dispensing method including:
determining the total required volume of all articles in the article sequence and the first article with the highest priority, and searching a target vehicle meeting the requirement of the total required volume;
acquiring the unit volume and the to-be-distributed amount of the first article, calculating the quotient of the current available space of the target vehicle and the unit volume, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first articles loaded on the target vehicle;
and updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is less than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle.
Optionally, the selecting other articles from the sequence of articles that have remaining available space available for loading until the remaining available space is less than the unit volume of any article includes:
acquiring a second item with the second priority from the item sequence, and determining the unit volume and the to-be-distributed amount of the second item;
calculating a quotient of the remaining available space and the unit volume of the second item, taking the quotient or the to-be-dispensed amount with a smaller value as the number of the second item loaded on the target vehicle, and updating the remaining available space of the target vehicle;
the above process is repeated until the remaining available space of the target vehicle is less than the unit volume of any item.
Optionally, the target vehicle is located in a vehicle sequence, and the vehicle sequence corresponds to the same route as the item sequence;
the searching for the target vehicle meeting the total required volume requirement comprises:
determining a first vehicle with the highest priority in the vehicle sequence, and judging whether the total required volume is larger than or equal to the minimum start-up volume of the first vehicle;
and if so, taking the first vehicle as a target vehicle, otherwise, continuously comparing the size relationship between the total required volume and the minimum start-up volume of other vehicles according to the sequence of the vehicles in the vehicle sequence until the target vehicle is found.
Optionally, after obtaining the objects and the quantity that can be loaded by the target vehicle, the method further includes:
determining a total demand volume for remaining items in the sequence of items, and finding a second vehicle from the remaining vehicles in the sequence of vehicles having a total demand volume greater than or equal to a minimum pick-up volume;
repeating the process of calculating the loadable articles and the quantity until the remaining available space of the second vehicle is less than the unit volume of any remaining articles, so as to obtain the loadable articles and the quantity of the second vehicle;
the above item and vehicle matching process is repeated until the total required volume of the remaining items is less than the minimum pick-up volume of any of the remaining vehicles.
Optionally, the step of stopping until the total required volume of the remaining items is smaller than the minimum starting volume of any remaining vehicle further includes:
determining the total demand volume of the remaining articles, and searching a third vehicle with the highest current priority or the smallest difference with the total demand volume from the remaining vehicles in the vehicle sequence;
calculating a quotient of the total required volume and the minimum starting volume of the third vehicle, and judging whether the quotient is greater than or equal to a vehicle-collecting coefficient of the third vehicle;
if so, calculating a difference value between the current available space and the total required volume of the third vehicle, determining a third article with the highest sales volume in the remaining articles or the article sequence, and taking the quotient of the difference value and the unit volume of the third article as the vehicle-holding amount of the third article;
and calculating the difference value between the difference value and the vehicle-collecting volume of the third article, and repeating the processes of calculating the quotient and the vehicle-collecting volume to obtain the articles and the quantity which can be loaded by the third vehicle.
Optionally, the method further includes: forming a vehicle and route information dictionary by the information of each vehicle and the transportation route according to the transportation route information and the optional vehicle information;
and processing data in the vehicle and route dictionary by using a greedy strategy to calculate the dispatching priorities of different vehicles on the same route so as to obtain vehicle sequences on different routes.
Optionally, the method further includes: screening one or more supply orders containing the same article to generate one or more supply order data dictionaries corresponding to the quantity of the one or more supply orders according to the information of the same article in each supply order; and
generating an item data dictionary according to the attribute information of each item in the target library;
and processing the data in the supply order data dictionary and the item data dictionary by using a greedy strategy to calculate the distribution priority of each item on the same route so as to obtain the item sequence on different routes.
To achieve the above object, according to another aspect of an embodiment of the present invention, there is provided an article dispensing apparatus including:
the vehicle searching module is used for determining the total required volume of all articles in the article sequence and the first article with the highest priority, and searching a target vehicle meeting the requirement of the total required volume;
the first distribution module is used for acquiring the unit volume and the to-be-distributed amount of the first article, calculating the quotient of the current available space of the target vehicle and the unit volume, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first article loaded on the target vehicle;
and the second distribution module is used for updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is smaller than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle.
Optionally, the second allocating module is configured to:
acquiring a second item with the second priority from the item sequence, and determining the unit volume and the to-be-distributed amount of the second item;
calculating a quotient of the remaining available space and the unit volume of the second item, taking the quotient or the to-be-dispensed amount with a smaller value as the number of the second item loaded on the target vehicle, and updating the remaining available space of the target vehicle;
the above process is repeated until the remaining available space of the target vehicle is less than the unit volume of any item.
Optionally, the target vehicle is located in a vehicle sequence, and the vehicle sequence corresponds to the same route as the item sequence;
the vehicle lookup module is configured to:
determining a first vehicle with the highest priority in the vehicle sequence, and judging whether the total required volume is larger than or equal to the minimum start-up volume of the first vehicle;
and if so, taking the first vehicle as a target vehicle, otherwise, continuously comparing the size relationship between the total required volume and the minimum start-up volume of other vehicles according to the sequence of the vehicles in the vehicle sequence until the target vehicle is found.
Optionally, the system further comprises a cyclic allocation module, configured to:
determining a total demand volume for remaining items in the sequence of items, and finding a second vehicle from the remaining vehicles in the sequence of vehicles having a total demand volume greater than or equal to a minimum pick-up volume;
repeating the process of calculating the loadable articles and the quantity until the remaining available space of the second vehicle is less than the unit volume of any remaining articles, so as to obtain the loadable articles and the quantity of the second vehicle;
the above item and vehicle matching process is repeated until the total required volume of the remaining items is less than the minimum pick-up volume of any of the remaining vehicles.
Optionally, the vehicle collecting module is further included, and is configured to:
determining the total demand volume of the remaining articles, and searching a third vehicle with the highest current priority or the smallest difference with the total demand volume from the remaining vehicles in the vehicle sequence;
calculating a quotient of the total required volume and the minimum starting volume of the third vehicle, and judging whether the quotient is greater than or equal to a vehicle-collecting coefficient of the third vehicle;
if so, calculating a difference value between the current available space and the total required volume of the third vehicle, determining a third article with the highest sales volume in the remaining articles or the article sequence, and taking the quotient of the difference value and the unit volume of the third article as the vehicle-holding amount of the third article;
and calculating the difference value between the difference value and the vehicle-collecting volume of the third article, and repeating the processes of calculating the quotient and the vehicle-collecting volume to obtain the articles and the quantity which can be loaded by the third vehicle.
Optionally, the vehicle sequencing module is further included, and is configured to:
forming a vehicle and route information dictionary by the information of each vehicle and the transportation route according to the transportation route information and the optional vehicle information;
and processing data in the vehicle and route dictionary by using a greedy strategy to calculate the dispatching priorities of different vehicles on the same route so as to obtain vehicle sequences on different routes.
Optionally, the system further comprises an article sorting module, configured to:
screening one or more supply orders containing the same article to generate one or more supply order data dictionaries corresponding to the quantity of the one or more supply orders according to the information of the same article in each supply order; and
generating an item data dictionary according to the attribute information of each item in the target library;
and processing the data in the supply order data dictionary and the item data dictionary by using a greedy strategy to calculate the distribution priority of each item on the same route so as to obtain the item sequence on different routes.
To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided an article dispensing electronic device.
The electronic device of the embodiment of the invention comprises: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement any of the item distribution methods described above.
To achieve the above object, according to a further aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by a processor, implementing any of the above-mentioned item distribution methods.
According to the scheme provided by the invention, one embodiment of the invention has the following advantages or beneficial effects: the method comprises the steps of determining an item distribution priority and a vehicle dispatching priority based on a greedy strategy, providing an item loading scheme (the type and the quantity of items corresponding to vehicles) corresponding to each vehicle according to the matching of the volume and the weight optimization of the items and the vehicles, and even if the loading volume is insufficient, the loading can be carried out according to a vehicle-making mechanism, so that the possibility of the problems can be effectively reduced.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic flow chart diagram illustrating a method of dispensing items according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart diagram of an alternative method of dispensing items according to an embodiment of the present invention;
FIG. 3 is a schematic flow diagram of a particular method of dispensing items according to embodiments of the present invention;
FIG. 4 is a schematic view of the main modules of an article dispensing apparatus according to an embodiment of the present invention;
FIG. 5 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
FIG. 6 is a schematic block diagram of a computer system suitable for use with a mobile device or server implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Greedy algorithm: also known as a greedy algorithm, is an algorithm that takes the best or optimal (i.e., most favorable) selection at each step in the current state, so that it is desired to result in the best or optimal result.
Greedy strategy: greedy algorithms do not consider global optimality, but rather make only local optimal choices in the sense that the strategy for local optimal choice is called a greedy strategy. If the packing method with the highest solving value in the packing problem is adopted, the item with the highest value is selected and put into the backpack every time, and the strategy that the item with the highest value is selected and put into the backpack every time is a greedy strategy.
Before the distribution of the articles is processed, the inventory and sales information of the articles, the supply list information of the articles, the transportation line information, the optional vehicle information and the inventory information of the suppliers (used in the vehicle-collecting calculation) in the target library are obtained from four data management systems, namely an inventory and sales management system of the target library, an article and supply list management system, a supplier vehicle management system and a supplier inventory management system.
Further, a supply bill reporting system may be provided. The supply order management system is used for providing unprocessed original supply orders, the original supply orders are processed by the scheme and then are downloaded to the supply order reporting system for loading production, the original supply orders and the supply order reporting system can be combined into a system, and the system is specifically set by workers, and the scheme does not limit the system.
1) According to the item supply order information, information related to the item and the supply order is combined into a supply order data dictionary, such as unit volume of the item, ordered quantity, unit weight, supply order origin, supply order destination and surplus inventory quantity of the supplier. For example, the supply single data dictionary { ' sku _ a ' { ' order number ':500 pieces, ' unit volume ':0.1 cubic meter, ' unit weight ':1 kg, ' remaining available stock of the supplier ':999 pieces, ' origin ': Ningbo ', ' destination ': Beijing } … }.
It should be noted that the same sku may involve multiple target repositories from the supplier repository, such as sku _ a-supply 1-ningham to shanghai, sku _ a-supply 2-ningham to beijing, where multiple supply data dictionaries may be generated for the sku _ a to indicate its supply on each route.
2) According to the transportation route information and the optional vehicle information, the vehicle information is combined into a vehicle and route information dictionary, such as the maximum loading volume/weight of the vehicle, the minimum starting volume/weight, a vehicle-collecting coefficient (set by a supplier or a target library side and used for judging that when the volume of the article meets the minimum starting volume of the vehicle, the number of other articles can be additionally increased to be collected to the minimum starting volume of the vehicle), the length, the width, the height and the available quantity.
The vehicle and route dictionary { 'vehicle 1' { 'maximum load weight': 50 tons, 'maximum load volume': 86 cubic meters, 'minimum ship from volume': 45 cubic meters, 'available number': 5, 'vehicle factor': 0.8}, and 'route of transportation': Ningbo-Beijing, … }.
3) And forming an article data dictionary according to the inventory and sales information of the articles in the target library, such as the available sales quantity of the articles, historical sales data, the maximum number of pieces per order, the sales ranking level of the target library and the like. For example, the item data dictionary { 'sku _ a' { 'target library saleable number': 199 pieces, 'near 28 daily sales mean': 20 pieces, 'target library sales ranking': a, 'maximum number of word order': 785, 'turnaround threshold': 26.98} … }. The turnover threshold here refers to the turnover of each article in the target warehouse, and turnover is the accumulated quantity in the warehouse/the accumulated sales in the period of time, so as to prevent the article from being overstocked.
Referring to fig. 1, there is shown a main flow chart of an article distribution method provided by an embodiment of the present invention, including the following steps:
s101: determining the total required volume of all articles in the article sequence and the first article with the highest priority, and searching a target vehicle meeting the requirement of the total required volume;
s102: acquiring the unit volume and the to-be-distributed amount of the first article, calculating the quotient of the current available space of the target vehicle and the unit volume, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first articles loaded on the target vehicle;
s103: and updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is less than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle.
In the above embodiment, in step S101, the present embodiment calculates which items are preferentially allocated/loaded based on the data in the supply list data dictionary and the data in the item data dictionary. The priority can be determined according to greedy strategies required by the scene, such as "target library sales volume ranking is preferred," item with highest sales volume ranking is selected to be loaded first, "volume dominance is preferred," item with largest volume is selected to be loaded first, "value dominance is preferred, item with highest value is selected to be loaded first," and the like.
Furthermore, considering that the same item may be sent to different regions, the items located in the same route may be first grouped into one group, and then the assigned priority of each item in the same group is calculated according to the data in the supply list data dictionary and the data in the item data dictionary, so as to finally obtain the item sequence on each route.
And similarly, calculating which vehicles on each route are preferentially used according to the data in the vehicle and route dictionaries, so that the subsequent vehicle collecting device is convenient to operate. The priority of dispatching on each route can also be set for the vehicle sequence, such as: "vehicle load is prioritized, and the load is selected to be the largest each time".
Through the steps, the sequenced article sequence and vehicle sequence can be obtained. In addition, a storage list can be established for storing the distributed article and vehicle information, and the initial time list is empty.
And counting the total volume required by all the articles in the article sequence, and specifically calculating according to the unit volume and the to-be-distributed amount of each article. And sequentially searching vehicles with the minimum start volume less than or equal to the total required volume from the vehicle sequence.
For example, the sequence of items includes sku _ A (i.e., the first item), sku _ B (i.e., the second item), and sku _ C, and the required volumes are 33 cubic meters, 10 cubic meters, and 20 cubic meters, respectively, so that the required total volume is 63 cubic meters. The vehicle sequence comprises vehicle 1 (i.e. the first vehicle), vehicle 2 and vehicle 3, the minimum pick-up volumes being 40 cubic meters, 30 cubic meters and 20 cubic meters respectively, with priority being large vehicle first and then small vehicle second. Since 63>40, the vehicle 1 is preferred as the target vehicle. However, if the minimum pick-up volume of vehicle 1 is 65 cubic meters, then vehicle 1 is skipped and the remaining vehicles, such as vehicle 2, whose minimum pick-up volume is less than or equal to the total required volume are searched.
It should be noted that the article series and the vehicle series correspond to the same route, for example, the article series 1 is sent from Ningbo to Shanghai, the vehicle series 1 is sent from Ningbo to Beijing, and the vehicle series 2 is sent from Ningbo to Shanghai, and the vehicle series 2 is used to process the article series 1.
For step S102, the first item with the highest priority in the item sequence is determined, and assuming that the first item is sku _ a, a supply list data dictionary corresponding to the sku _ a is obtained, and then the unit volume and the to-be-allocated amount of the sku _ a are obtained according to the supply list data dictionary.
1) Assuming that the currently available space of the vehicle 1 is 40 cubic meters, the sku _ a has 11 sku _ a pieces of 3 cubic meters, and the calculation and rounding (40/3) is 13, since 13 is greater than 11, the 11 sku _ a pieces need to be loaded in the vehicle 1 in their entirety, at this time, the amount to be allocated to sku _ a becomes 0, and the remaining available space of the vehicle 1 is 40-33 cubic meters, which is 7 cubic meters. 2) However, if the current available space of the vehicle 1 is 31 cubic meters, the calculation of the rounding (31/3) is 10, and since 10<11, only 10 sku _ a pieces can be loaded in the vehicle 1, the amount to be allocated for sku _ a becomes 1 piece, and the remaining available space of the vehicle 1 is 31-30 cubic meters 1 cubic meter.
For step S103, after a target vehicle is found, the vehicle is filled as much as possible, and therefore, in the case that the target vehicle still has a remaining available space, the loading of the object is continued.
Also following the example above, 1) assuming that the second prioritized sku _ B in the item sequence is 10 pieces of 1 cubic meter per piece, when the remaining available space of the vehicle 1 is 7 cubic meters, 7 sku _ B pieces can be loaded in the vehicle 1, and 1 sku _ B piece can be allocated even if the remaining available space of the vehicle 1 is 1 cubic meter. 2) However, if the number of sku _ B is 5 and 2 cubic meters per vehicle, only 3 sku _ B pieces can be loaded in the vehicle 1 when the remaining available space of the vehicle 1 is 7 cubic meters; when the remaining available space of the vehicle 1 is 1 cubic meter, sku _ B cannot be loaded.
When the remaining available space of the vehicle 1 is not 0, the sku with the highest priority that can be loaded in the space is continuously selected until the remaining available space does not satisfy any sku, and the space utilization rate of the vehicle 1 is maximum. Outputting the items and the number of the target vehicles that can be loaded, such as [ [ 'vehicle 1', [ 'sku _ a',11 ], [ 'sku _ B',3 ], [ 'sku _ C',1 ], [, total volume of items ] ], which information can be added to the aforementioned storage list.
And then continuously counting the total required volume of the remaining articles, and searching for a second vehicle with the total required volume being larger than or equal to the minimum shipment volume from the remaining vehicles in the vehicle sequence. Assuming that vehicle 1 is loaded with 11 sku _ a, 3 sku _ B, 1 sku _ C, 2 sku _ B and 19 sku _ C of the remaining items in the vehicle sequence are 1 cubic meter each, the total required volume is 23 cubic meters, and the second vehicle is vehicle 3 since 20<23< 30. The same thing as for vehicle 1 is done at this point, and the calculation of the number and items that can be loaded by vehicle 3 is continued.
The list of items currently to be allocated, remaining available vehicles, allocated items and vehicles is updated. Further, whether articles are not distributed can be judged, if not, the code logic is ended, the distributed articles and the vehicle list are output, and if not, the judgment is continued.
The embodiment provides an article distribution method based on a greedy strategy, which optimizes matching between the vehicle and the article volume and provides an article loading scheme (type and quantity of articles corresponding to the vehicle) corresponding to each vehicle, so that the possibility of occurrence of the existing problems can be effectively reduced.
Referring to fig. 2, a flow diagram of an alternative item distribution method according to an embodiment of the present invention is shown, including the following steps:
s201: determining the total demand volume of the remaining articles, and searching a third vehicle with the highest current priority or the smallest difference with the total demand volume from the remaining vehicles in the vehicle sequence;
s202: calculating a quotient of the total required volume and the minimum starting volume of the third vehicle, and judging whether the quotient is greater than or equal to a vehicle-collecting coefficient of the third vehicle;
s203: if so, calculating a difference value between the current available space and the total required volume of the third vehicle, determining a third article with the highest sales volume in the remaining articles or the article sequence, and taking the quotient of the difference value and the unit volume of the third article as the vehicle-holding amount of the third article;
s204: and calculating the difference value between the difference value and the vehicle-collecting volume of the third article, and repeating the processes of calculating the quotient and the vehicle-collecting volume to obtain the articles and the quantity which can be loaded by the third vehicle.
In the above embodiment, in step S201, the vehicle-packing process is required when the total required volume of the remaining articles is smaller than the minimum start volume of any of the remaining vehicles. Assume that the items currently remaining in the sequence of items are sku _ D, sku _ E, with 10 sku _ D items of 1 cubic meter each and 5 sku _ E items of 1 cubic meter each, and a total required volume of 15 cubic meters. At this point, a third vehicle, such as vehicle 3, having the highest priority or the smallest difference from the 15 cubic meters is selected from the remaining vehicles in the vehicle series.
For steps S202 to S204, a vehicle-loading factor is preset for each vehicle by the supplier or the target warehouse, and is used to determine that the number of the articles can be additionally increased to be loaded to the minimum loading when the articles satisfy several percent of the minimum loading of the vehicle. Assuming that the minimum starting volume of the vehicle 3 is 20 cubic meters, the vehicle-loading factor is 80%, which means that the required total volume of the remaining articles needs to be greater than or equal to 16 cubic meters, and then the vehicle is loaded. And 15/20 is 75% and less than 80%, so the part of the goods is discarded and no longer loaded. However, if the vehicle factor of the vehicle 3 is 70%, it means that the part of the remaining articles can be loaded, but since a part of the space is not used, the part of the articles can be continuously obtained from the warehouse of the supplier to be loaded.
For example, according to the item data dictionary, a third item with the highest sales volume is obtained from the item sequence or the current remaining items, and is assumed to be sku _ D. The available capacity for sku _ D is calculated based on the difference in the currently available space and the total required volume of the vehicle 3/unit volume of sku _ D. Each item and quantity that can be loaded continues to be calculated according to the remaining available space of the vehicle 3, the unit volume of the item (sales ranking supply, which can be understood as a mastery product) of the item sequence/remaining items for which the sales volume is highest. Supplier inventory information is also typically considered, e.g., sku _ D has a pool size of 10, but only 5 remaining in the garage.
In addition, the per-item payable-the average daily sales per sku for a predetermined historical period-the available inventory of the target library-the supply order may be calculated first. For example, if sku _ a has 30 saleable days, the average daily sales in the last 28 days is 3, the target library has 30 available stocks, and the supply is 30, the total amount is 30 x 3-30-30.
The method provided by the embodiment can output skus and the number of the piled cars which need to be increased by adopting a car piling mode under the condition that the minimum starting volume of the cars does not meet the total required volume, adds the corresponding relation between the car piling cars and the corresponding number of the loaded skus into the loading distribution list, and updates the sku list to be loaded.
Referring to fig. 3, a flowchart of a specific item dispensing method according to an embodiment of the present invention is shown, including the following steps:
s301: for the item sequence and the vehicle sequence which are positioned on the same route, determining the total demand volume of all items in the item sequence and a first item with the highest priority, and searching a target vehicle meeting the requirement of the total demand volume from the vehicle sequence;
s302: acquiring the unit volume and the to-be-distributed amount of the first article, calculating the quotient of the current available space of the target vehicle and the unit volume, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first articles loaded on the target vehicle;
s303: updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is smaller than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle;
s304: determining a total demand volume for remaining items in the sequence of items, and finding a second vehicle from the remaining vehicles in the sequence of vehicles having a total demand volume greater than or equal to a minimum pick-up volume;
s305: repeating the process of calculating the loadable articles and the quantity until the remaining available space of the second vehicle is less than the unit volume of any remaining articles, so as to obtain the loadable articles and the quantity of the second vehicle;
s306: repeating the item and vehicle matching process until the total required volume of the remaining items is less than the minimum pick-up volume of any remaining vehicle;
s307: determining the total demand volume of the remaining articles, and searching a third vehicle with the highest current priority or the smallest difference with the total demand volume from the remaining vehicles in the vehicle sequence;
s308: calculating a quotient of the total required volume and the minimum starting volume of the third vehicle, and judging whether the quotient is greater than or equal to a vehicle-collecting coefficient of the third vehicle;
s309: if so, calculating a difference value between the current available space and the total required volume of the third vehicle, determining a third article with the highest sales volume in the remaining articles or the article sequence, and taking the quotient of the difference value and the unit volume of the third article as the vehicle-holding amount of the third article;
s310: and calculating the difference value between the difference value and the vehicle-collecting volume of the third article, and repeating the processes of calculating the quotient and the vehicle-collecting volume to obtain the articles and the quantity which can be loaded by the third vehicle.
Compared with the prior art, the method provided by the embodiment of the invention has at least the following beneficial effects:
1. the vehicle and goods sequencing is matched with the device mechanism for collecting the whole vehicle: based on a greedy strategy required by a scene, the priorities of the articles and the vehicles are sorted firstly, and then an article collecting mechanism is carried out, so that a scheme for efficiently distributing the landing articles and the vehicles is provided;
2. a vehicle loading mechanism: and combining the object library article sales ranking data and the available inventory data of the suppliers, and selecting the articles with the optimal sales volume to complete the vehicle according to the condition that the entire vehicle is not fully stocked with the articles, so that the influence on the object library inventory management is reduced.
Referring to fig. 4, there is shown a schematic diagram of the main modules of an article dispensing device 400 according to an embodiment of the present invention, including:
the vehicle searching module 401 is configured to determine a total required volume of all articles in the article sequence and a first article with a highest priority, and search for a target vehicle meeting the requirement of the total required volume;
a first distribution module 402, configured to obtain a unit volume and an amount to be distributed of the first item, calculate a quotient of a currently available space of the target vehicle and the unit volume, and use the quotient or the amount to be distributed with a smaller value as the number of the first item loaded on the target vehicle;
and a second allocating module 403, configured to update the remaining available space of the target vehicle, and continue to select other items from the sequence of items, which are loadable in the remaining available space, until the remaining available space is smaller than the unit volume of any item, so as to obtain the items and the quantity that can be loaded by the target vehicle.
In the apparatus for implementing the present invention, the second allocating module 403 is configured to:
acquiring a second item with the second priority from the item sequence, and determining the unit volume and the to-be-distributed amount of the second item;
calculating a quotient of the remaining available space and the unit volume of the second item, taking the quotient or the to-be-dispensed amount with a smaller value as the number of the second item loaded on the target vehicle, and updating the remaining available space of the target vehicle;
the above process is repeated until the remaining available space of the target vehicle is less than the unit volume of any item.
In the implementation device of the invention, the target vehicle is positioned in a vehicle sequence, and the vehicle sequence corresponds to the same route with the article sequence;
the vehicle search module 401 is configured to:
determining a first vehicle with the highest priority in the vehicle sequence, and judging whether the total required volume is larger than or equal to the minimum start-up volume of the first vehicle;
and if so, taking the first vehicle as a target vehicle, otherwise, continuously comparing the size relationship between the total required volume and the minimum start-up volume of other vehicles according to the sequence of the vehicles in the vehicle sequence until the target vehicle is found.
The device for implementing the invention also comprises a circulating distribution module which is used for:
determining a total demand volume for remaining items in the sequence of items, and finding a second vehicle from the remaining vehicles in the sequence of vehicles having a total demand volume greater than or equal to a minimum pick-up volume;
repeating the process of calculating the loadable articles and the quantity until the remaining available space of the second vehicle is less than the unit volume of any remaining articles, so as to obtain the loadable articles and the quantity of the second vehicle;
the above item and vehicle matching process is repeated until the total required volume of the remaining items is less than the minimum pick-up volume of any of the remaining vehicles.
The device for implementing the invention also comprises a vehicle collecting module used for:
determining the total demand volume of the remaining articles, and searching a third vehicle with the highest current priority or the smallest difference with the total demand volume from the remaining vehicles in the vehicle sequence;
calculating a quotient of the total required volume and the minimum starting volume of the third vehicle, and judging whether the quotient is greater than or equal to a vehicle-collecting coefficient of the third vehicle;
if so, calculating a difference value between the current available space and the total required volume of the third vehicle, determining a third article with the highest sales volume in the remaining articles or the article sequence, and taking the quotient of the difference value and the unit volume of the third article as the vehicle-holding amount of the third article;
and calculating the difference value between the difference value and the vehicle-collecting volume of the third article, and repeating the processes of calculating the quotient and the vehicle-collecting volume to obtain the articles and the quantity which can be loaded by the third vehicle.
The implementation device of the invention also comprises a vehicle sequencing module used for:
forming a vehicle and route information dictionary by the information of each vehicle and the transportation route according to the transportation route information and the optional vehicle information;
and processing data in the vehicle and route dictionary by using a greedy strategy to calculate the dispatching priorities of different vehicles on the same route so as to obtain vehicle sequences on different routes.
The implementation device of the invention also comprises an article sequencing module, which is used for:
screening one or more supply orders containing the same article to generate one or more supply order data dictionaries corresponding to the quantity of the one or more supply orders according to the information of the same article in each supply order; and
generating an item data dictionary according to the attribute information of each item in the target library;
and processing the data in the supply order data dictionary and the item data dictionary by using a greedy strategy to calculate the distribution priority of each item on the same route so as to obtain the item sequence on different routes.
In addition, the detailed implementation of the device in the embodiment of the present invention has been described in detail in the above method, so that the repeated description is not repeated here.
Fig. 5 shows an exemplary system architecture 500 to which embodiments of the invention may be applied, including terminal devices 501, 502, 503, a network 504 and a server 505 (by way of example only).
The terminal devices 501, 502, 503 may be various electronic devices having display screens and supporting web browsing, and are installed with various communication client applications, and users may interact with the server 505 through the network 504 using the terminal devices 501, 502, 503 to receive or send messages, and the like.
The network 504 serves to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The server 505 may be a server providing various services for performing calculation of vehicle dispatch priority, item allocation priority, how to load and how to make a ride.
It should be noted that the method provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the apparatus is generally disposed in the server 505.
It should be understood that the number of terminal devices, networks, and servers in fig. 5 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 601.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a vehicle lookup module, a first distribution module, and a second distribution module. Where the names of these modules do not in some cases constitute a limitation on the module itself, for example, the vehicle lookup module may also be described as a "target vehicle lookup module".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:
determining the total required volume of all articles in the article sequence and the first article with the highest priority, and searching a target vehicle meeting the requirement of the total required volume;
acquiring the unit volume and the to-be-distributed amount of the first article, calculating the quotient of the current available space of the target vehicle and the unit volume, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first articles loaded on the target vehicle;
and updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is less than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle.
According to the technical scheme of the embodiment of the invention, compared with the prior art, the method has the following beneficial effects:
1. the vehicle and goods sequencing is matched with the device mechanism for collecting the whole vehicle: based on a greedy strategy required by a scene, the priorities of the articles and the vehicles are sorted firstly, and then an article collecting mechanism is carried out, so that a scheme for efficiently distributing the landing articles and the vehicles is provided;
2. a vehicle loading mechanism: and combining the object library article sales ranking data and the available inventory data of the suppliers, and selecting the articles with the optimal sales volume to complete the vehicle according to the condition that the entire vehicle is not fully stocked with the articles, so that the influence on the object library inventory management is reduced.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of dispensing items, comprising:
determining the total required volume of all articles in the article sequence and the first article with the highest priority, and searching a target vehicle meeting the requirement of the total required volume;
acquiring the unit volume and the to-be-distributed amount of the first article, calculating the quotient of the current available space of the target vehicle and the unit volume, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first articles loaded on the target vehicle;
and updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is less than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle.
2. The method of claim 1, wherein said selecting other items from said sequence of items for which remaining available space is available until the remaining available space is less than a unit volume of any item comprises:
acquiring a second item with the second priority from the item sequence, and determining the unit volume and the to-be-distributed amount of the second item;
calculating a quotient of the remaining available space and the unit volume of the second item, taking the quotient or the to-be-dispensed amount with a smaller value as the number of the second item loaded on the target vehicle, and updating the remaining available space of the target vehicle;
the above process is repeated until the remaining available space of the target vehicle is less than the unit volume of any item.
3. The method of claim 1, wherein the target vehicle is located in a sequence of vehicles corresponding to the same route as the sequence of items;
the searching for the target vehicle meeting the total required volume requirement comprises:
determining a first vehicle with the highest priority in the vehicle sequence, and judging whether the total required volume is larger than or equal to the minimum start-up volume of the first vehicle;
and if so, taking the first vehicle as a target vehicle, otherwise, continuously comparing the size relationship between the total required volume and the minimum start-up volume of other vehicles according to the sequence of the vehicles in the vehicle sequence until the target vehicle is found.
4. The method of claim 3, further comprising, after said obtaining the items and quantities loadable by the target vehicle:
determining a total demand volume for remaining items in the sequence of items, and finding a second vehicle from the remaining vehicles in the sequence of vehicles having a total demand volume greater than or equal to a minimum pick-up volume;
repeating the process of calculating the loadable articles and the quantity until the remaining available space of the second vehicle is less than the unit volume of any remaining articles, so as to obtain the loadable articles and the quantity of the second vehicle;
the above item and vehicle matching process is repeated until the total required volume of the remaining items is less than the minimum pick-up volume of any of the remaining vehicles.
5. The method of claim 4, wherein said until a total required volume of remaining items is less than a minimum pick-up volume of any remaining vehicles, further comprises:
determining the total demand volume of the remaining articles, and searching a third vehicle with the highest current priority or the smallest difference with the total demand volume from the remaining vehicles in the vehicle sequence;
calculating a quotient of the total required volume and the minimum starting volume of the third vehicle, and judging whether the quotient is greater than or equal to a vehicle-collecting coefficient of the third vehicle;
if so, calculating a difference value between the current available space and the total required volume of the third vehicle, determining a third article with the highest sales volume in the remaining articles or the article sequence, and taking the quotient of the difference value and the unit volume of the third article as the vehicle-holding amount of the third article;
and calculating the difference value between the difference value and the vehicle-collecting volume of the third article, and repeating the processes of calculating the quotient and the vehicle-collecting volume to obtain the articles and the quantity which can be loaded by the third vehicle.
6. The method according to any one of claims 3-5, further comprising:
forming a vehicle and route information dictionary by the information of each vehicle and the transportation route according to the transportation route information and the optional vehicle information;
and processing data in the vehicle and route dictionary by using a greedy strategy to calculate the dispatching priorities of different vehicles on the same route so as to obtain vehicle sequences on different routes.
7. The method of claim 1, further comprising:
screening one or more supply orders containing the same article to generate one or more supply order data dictionaries corresponding to the quantity of the one or more supply orders according to the information of the same article in each supply order; and
generating an item data dictionary according to the attribute information of each item in the target library;
and processing the data in the supply order data dictionary and the item data dictionary by using a greedy strategy to calculate the distribution priority of each item on the same route so as to obtain the item sequence on different routes.
8. An article dispensing device, comprising:
the vehicle searching module is used for determining the total required volume of all articles in the article sequence and the first article with the highest priority, and searching a target vehicle meeting the requirement of the total required volume;
the first distribution module is used for acquiring the unit volume and the to-be-distributed amount of the first article, calculating the quotient of the current available space of the target vehicle and the unit volume, and taking the quotient or the to-be-distributed amount with a smaller value as the number of the first article loaded on the target vehicle;
and the second distribution module is used for updating the remaining available space of the target vehicle, and continuously selecting other articles which can be loaded in the remaining available space from the article sequence until the remaining available space is smaller than the unit volume of any article, so as to obtain the articles and the quantity which can be loaded by the target vehicle.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110845436.0A CN113592282A (en) | 2021-07-26 | 2021-07-26 | Article distribution method and device |
| PCT/CN2022/105051 WO2023005653A1 (en) | 2021-07-26 | 2022-07-12 | Article allocation method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110845436.0A CN113592282A (en) | 2021-07-26 | 2021-07-26 | Article distribution method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113592282A true CN113592282A (en) | 2021-11-02 |
Family
ID=78250216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110845436.0A Pending CN113592282A (en) | 2021-07-26 | 2021-07-26 | Article distribution method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113592282A (en) |
| WO (1) | WO2023005653A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023005653A1 (en) * | 2021-07-26 | 2023-02-02 | 北京沃东天骏信息技术有限公司 | Article allocation method and apparatus |
| CN116502753A (en) * | 2023-04-25 | 2023-07-28 | 天信达信息技术有限公司 | Method for determining loading position of article, electronic equipment and storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220129840A1 (en) * | 2020-10-26 | 2022-04-28 | Genpact Luxembourg S.À R.L | System And Method For Reinforcement-Learning Based On-Loading Optimization |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002019046A1 (en) * | 2000-08-31 | 2002-03-07 | Cosite.Com, Inc. | Centralized system and method for optimally routing and tracking articles |
| JP2003242221A (en) * | 2002-02-14 | 2003-08-29 | J & K Logistics Kk | Cargo transportation coordination system |
| CN101593321A (en) * | 2009-06-30 | 2009-12-02 | 北京交通大学 | A kind of vehicle cargo stowage and cargo loading scheme are determined device |
| CN103761635A (en) * | 2014-01-14 | 2014-04-30 | 大连理工大学 | Three-dimensional multi-box specially-structured cargo loading optimizing method |
| CN104915817A (en) * | 2015-05-26 | 2015-09-16 | 亿赞普(北京)科技有限公司 | Loading method and apparatus for container |
| CN109726863A (en) * | 2018-12-26 | 2019-05-07 | 深圳市北斗智能科技有限公司 | A kind of material-flow method and system of multiple-objection optimization |
| CN109784809A (en) * | 2019-01-10 | 2019-05-21 | 深圳市启海仓储有限公司 | Goods yard allocation management method and system |
| CN109934427A (en) * | 2017-12-15 | 2019-06-25 | 北京京东尚科信息技术有限公司 | The method and apparatus for generating article allocation plan |
| CN110189077A (en) * | 2019-05-20 | 2019-08-30 | 华南理工大学 | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint |
| CN110738374A (en) * | 2019-10-15 | 2020-01-31 | 秒针信息技术有限公司 | Method and device for assembling goods |
| CN110963319A (en) * | 2019-11-06 | 2020-04-07 | 南京大学 | Loading method considering unloading sequence |
| CN111507644A (en) * | 2020-04-30 | 2020-08-07 | 安徽大学 | Multi-point unloading constrained three-dimensional multi-container loading method |
| CN113159561A (en) * | 2021-04-15 | 2021-07-23 | 深圳依时货拉拉科技有限公司 | Freight scheduling method, computer-readable storage medium and computer equipment |
| CN113159467A (en) * | 2020-01-22 | 2021-07-23 | 北京京东振世信息技术有限公司 | Vehicle dispatching order processing method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2020166405A (en) * | 2019-03-28 | 2020-10-08 | 富士通株式会社 | Ordering information determination program, ordering information determination device, and ordering information determination method |
| CN110782208A (en) * | 2019-10-25 | 2020-02-11 | 上海燕汐软件信息科技有限公司 | Distribution task pushing method and device, electronic equipment and storage medium |
| CN113592282A (en) * | 2021-07-26 | 2021-11-02 | 北京沃东天骏信息技术有限公司 | Article distribution method and device |
-
2021
- 2021-07-26 CN CN202110845436.0A patent/CN113592282A/en active Pending
-
2022
- 2022-07-12 WO PCT/CN2022/105051 patent/WO2023005653A1/en unknown
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002019046A1 (en) * | 2000-08-31 | 2002-03-07 | Cosite.Com, Inc. | Centralized system and method for optimally routing and tracking articles |
| JP2003242221A (en) * | 2002-02-14 | 2003-08-29 | J & K Logistics Kk | Cargo transportation coordination system |
| CN101593321A (en) * | 2009-06-30 | 2009-12-02 | 北京交通大学 | A kind of vehicle cargo stowage and cargo loading scheme are determined device |
| CN103761635A (en) * | 2014-01-14 | 2014-04-30 | 大连理工大学 | Three-dimensional multi-box specially-structured cargo loading optimizing method |
| CN104915817A (en) * | 2015-05-26 | 2015-09-16 | 亿赞普(北京)科技有限公司 | Loading method and apparatus for container |
| CN109934427A (en) * | 2017-12-15 | 2019-06-25 | 北京京东尚科信息技术有限公司 | The method and apparatus for generating article allocation plan |
| CN109726863A (en) * | 2018-12-26 | 2019-05-07 | 深圳市北斗智能科技有限公司 | A kind of material-flow method and system of multiple-objection optimization |
| CN109784809A (en) * | 2019-01-10 | 2019-05-21 | 深圳市启海仓储有限公司 | Goods yard allocation management method and system |
| CN110189077A (en) * | 2019-05-20 | 2019-08-30 | 华南理工大学 | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint |
| CN110738374A (en) * | 2019-10-15 | 2020-01-31 | 秒针信息技术有限公司 | Method and device for assembling goods |
| CN110963319A (en) * | 2019-11-06 | 2020-04-07 | 南京大学 | Loading method considering unloading sequence |
| CN113159467A (en) * | 2020-01-22 | 2021-07-23 | 北京京东振世信息技术有限公司 | Vehicle dispatching order processing method and device |
| CN111507644A (en) * | 2020-04-30 | 2020-08-07 | 安徽大学 | Multi-point unloading constrained three-dimensional multi-container loading method |
| CN113159561A (en) * | 2021-04-15 | 2021-07-23 | 深圳依时货拉拉科技有限公司 | Freight scheduling method, computer-readable storage medium and computer equipment |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023005653A1 (en) * | 2021-07-26 | 2023-02-02 | 北京沃东天骏信息技术有限公司 | Article allocation method and apparatus |
| CN116502753A (en) * | 2023-04-25 | 2023-07-28 | 天信达信息技术有限公司 | Method for determining loading position of article, electronic equipment and storage medium |
| CN116502753B (en) * | 2023-04-25 | 2023-11-10 | 天信达信息技术有限公司 | Method for determining loading position of article, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023005653A1 (en) | 2023-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10535033B2 (en) | System and method of vessel scheduling for product distribution | |
| CN113592282A (en) | Article distribution method and device | |
| CN109214756B (en) | Vehicle logistics scheduling method and device, storage medium and terminal | |
| CN109840729B (en) | Method and system for positioning bin, storage medium and electronic equipment | |
| CN110390497B (en) | Article warehouse-in method and device | |
| CN111950803A (en) | Logistics object delivery time prediction method and device, electronic equipment and storage medium | |
| Wauters et al. | A decomposition approach to dual shuttle automated storage and retrieval systems | |
| CN113420928A (en) | Order scheduling method, device, equipment and storage medium | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN109934427B (en) | Method and device for generating item distribution scheme | |
| CN107203865B (en) | Order distribution method and device | |
| CN111126643B (en) | Reservation method and reservation device of platform and readable storage medium | |
| CN113650997A (en) | Method and device for positioning articles in warehouse-out process | |
| CN113222490A (en) | Inventory allocation method and device | |
| CN111210074A (en) | Order processing method, device, medium, electronic equipment and system in warehouse | |
| CN112785025A (en) | Warehouse layout method and device | |
| CN113327074B (en) | Logistics network updating method and device and logistics network structure | |
| CN111382894A (en) | Cabin booking planning method, device, equipment and storage equipment | |
| CN109559078B (en) | Vehicle scheduling method, device, equipment and storage medium | |
| CN111144602A (en) | Vehicle scheduling method and device | |
| CN111824667A (en) | Method and device for storing goods | |
| CN116586312B (en) | Goods sorting method, device, electronic equipment and readable storage medium | |
| CN111275226A (en) | Method and device for selecting and handing over freight warehouse for goods transportation equipment | |
| CN112801567B (en) | Express delivery mode selection method and device, computer equipment and storage medium | |
| CN110245897B (en) | Vehicle scheduling method and device, medium and computing equipment |
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 |