CN109948985A - Intelligent packing method, equipment and calculating are readable storage medium - Google Patents
Intelligent packing method, equipment and calculating are readable storage medium Download PDFInfo
- Publication number
- CN109948985A CN109948985A CN201910218616.9A CN201910218616A CN109948985A CN 109948985 A CN109948985 A CN 109948985A CN 201910218616 A CN201910218616 A CN 201910218616A CN 109948985 A CN109948985 A CN 109948985A
- Authority
- CN
- China
- Prior art keywords
- vanning
- scheme
- binplanlist
- list
- binplan
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention discloses a kind of intelligent packing method, equipment and calculates i.e. readable storage medium, and the intelligent packing method includes: that container space is divided into multiple first subspace Bin by setting scheme；Cargo to be installed is packed into multiple first subspace Bin according to set algorithm, to obtain the first son vanning option b inPlan of each first subspace Bin, and obtain the first vanning list BinPlanList [0 ... N] of all first BinPlan；The matching vanning scheme in the container space is obtained according to first vanning list BinPlanList [0 ... N].The present invention has reduction intelligence vanning required resource when calculating vanning scheme, improves the effect of computational efficiency.
Description
Technical field
The present invention relates to logistics field, in particular to intelligent packing method, equipment and calculating are readable storage medium.
Background technique
It in logistics sort process, needs for chest to be packed into container, then transport to different places.In this process
In, if the chest in container can be positioned to more compact, higher economic effect can be obtained.In order to case
Preceding to obtain reasonable vanning sequence, the virtual algorithm that would generally be used at present includes two major classes: (one) uses and artificially lays down a regulation
Heuristic search algorithm (two) the optimization algorithm such as genetic algorithm that is regarded as nonlinear optimization to solve, calculated with deep learning
Method.
But when using above two algorithm, it is larger usually to encounter container volume, caused by option it is too many, lead
Primary calculating is caused, very large computing resource is needed, the acquisition of once vanning scheme could be completed.So as to cause existing dress
The computational efficiency of case scheme calculation method is lower.
Summary of the invention
The main object of the present invention is to provide intelligent packing method, equipment and calculates i.e. readable storage medium, it is intended to reduce
Intelligence vanning required resource when calculating vanning scheme, improves computational efficiency.
To achieve the above object, a kind of intelligent packing method proposed by the present invention, cases for cargo, the intelligence vanning
Method includes:
Container space is divided into multiple first subspace Bin by setting scheme；
Cargo to be installed is packed into multiple first subspace Bin according to set algorithm, to obtain each described
The first son vanning option b inPlan of one subspace Bin, and obtain the first vanning list of all first BinPlan
BinPlanList[0…N]；
The matching vanning scheme in the container space is obtained according to first vanning list BinPlanList [0 ... N].
Optionally, that the container space is obtained according to first vanning list BinPlanList [0 ... N]
Include: with vanning scheme
Splicing Concatenation is carried out according to first vanning list BinPlanList [0 ... N], first is obtained and spells
It is hinged with case scheme Concatenation (BinPlan plans)；
It is less than or equal in the size of first splicing vanning scheme Concatenation (BinPlan plans) described
When the size in container space, then using first splicing vanning scheme Concatenation (BinPlan plans) as matching
Vanning scheme.
Optionally, that the container space is obtained according to first vanning list BinPlanList [0 ... N]
With vanning scheme further include:
It is greater than the container in the size of first splicing vanning scheme Concatenation (BinPlan plans)
When the size in space, then the first son vanning option b inPlan in first vanning list BinPlanList [0 ... N] is pressed
Merge is merged according to setting scheme, to obtain the second sub- vanning scheme MergedBinPlan, and the second vanning of acquisition
List MergedBinPlanList [0 ... N]；
Splicing Concatenation is carried out according to second vanning list MergedBinPlanList [0 ... N], is obtained
Second splicing vanning scheme MergedConcatenation (BinPlan plans)；
Be less than in the size of second splicing vanning scheme MergedConcatenation (BinPlan plans) etc.
When the size in the container space, then with the second splicing vanning scheme MergedConcatenation (BinPlan
Plans) as matching vanning scheme.
Optionally, the first sub- vanning scheme in first vanning list BinPlanList [0 ... N]
BinPlan merges Merge according to setting scheme, to obtain the second sub- vanning scheme MergedBinPlan, and acquisition
Second vanning list MergedBinPlanList [0 ... N], comprising:
The first subspace and first for obtaining any two the first son vanning option b inPlan includes cargo, by two first
Subspace is combined to obtain the second subspace BBin, and is included cargo for described first according to the set algorithm and be packed into
To resulting second subspace BBin is combined, to obtain the second sub- vanning scheme MergedBinPlan；
By multiple second sub- the second vanning of vanning scheme MergedBinPlan composition lists
MergedBinPlanList[0…N]。
Optionally, the first sub- vanning scheme in first vanning list BinPlanList [0 ... N]
BinPlan merges Merge according to setting scheme, to obtain the second sub- vanning scheme MergedBinPlan, and acquisition
Second vanning list MergedBinPlanList [0 ... N], comprising:
It constructs two-dimensional matrix Rewards [N] [N], wherein the type of each element is the first son vanning option b inPlan,
Wherein subscript i, j (0≤i, j < N) enable the two-dimensional matrix Rewards [i] [j] be equal to the first sub- vanning side if i is equal to j
Case BinPlanList [i] otherwise enables the two-dimensional matrix Rewards [i] [j] be equal to the second sub- vanning scheme Merge
(BinPlanList[i],BinPlanList[j])；Wherein, merging the specified two first sub- vanning schemes of Merge
First subspace of (BinPlanList [i], BinPlanList [j]) and first is when including cargo, by two first subspaces into
Row combination includes cargo for described first according to the set algorithm and is packed into combination institute to obtain the second subspace BBin
The the second subspace BBin obtained, to obtain the second sub- vanning scheme obtained from merging specified two first sub- vanning schemes
Merged(BinPlanList[i],BinPlanList[j])；
The two-dimensional matrix Rewards [N] [N] obtained after being solved according to traversal, and solve the two-dimensional matrix Rewards
The reward value of each element in [N] [N]；
According to the reward value, high reward value collection partition, the element of the high reward value collection partition are obtained
Type is Rewards [i] [j]；
The high reward value collection partition is corresponded to the element in the two-dimensional matrix Rewards [N] [N] to take out, group
At the second final son vanning list MergedBinPlanList [0 ... N].
Optionally, the reward value is vanning compactness.
Optionally, that the container space is obtained according to first vanning list BinPlanList [0 ... N]
With vanning scheme further include:
It is greater than original in the size of second splicing vanning scheme MergedConcatenation (BinPlan plans)
When the size in container space, then second splicing vanning scheme MergedConcatenation (BinPlan plans) is judged
Reward value whether be higher than it is described first splicing vanning scheme Concatenation (BinPlan plans)；
If it is determined that then being reported for less than or equal to first splicing vanning scheme Concatenation (BinPlan plans)
It accuses mistake and stops；
If it is determined that then being carried out down for greater than first splicing vanning scheme Concatenation (BinPlan plans)
An iteration, for obtaining the third splicing dress for merging Merge again to the second sub- vanning scheme MergedBinPlan and obtaining
Case scheme.
Optionally, described container space is divided into multiple first subspace Bin by setting scheme to include:
Container space is divided into multiple first subspace Bin along the length dimension of setting.
The present invention also provides a kind of intelligent boxing apparatus, the intelligence boxing apparatus includes reservoir and processor；Institute
It states reservoir and stores cargo screening sequence；
The processor is for executing the cargo screening sequence, to the step of executing above-mentioned cargo screening technique.
The present invention also provides a kind of computer readable storage medium, stored on the computer readable storage medium available in stock
Object screening sequence is realized when the cargo screening sequence is executed by processor such as the step of above-mentioned cargo screening technique.
It is empty to be divided into multiple first sons first at work by intelligence packing method provided by the present invention for container space
Between Bin.Then it is individually answered for every one first subspace Bin, to obtain the first son of each first subspace Bin
Case option b inPlan.Finally, then to the first vanning list BinPlanList [0 ... N] obtained proper treatment is carried out, i.e.,
Matching vanning scheme needed for can get final vanning.It, can be by one to intelligence packing method provided by the present embodiment
Biggish computing unit, cutting are that multiple lesser computing units are calculated again.To on the one hand to calculate large space dress
The calculating threshold of case scheme reduces, so that the performance requirement threshold for calculating large space vanning scheme is greatly reduced；On the other hand, when
It obtains the calculated result of all lesser computing units and then each small computing unit is handled, so as to
The vanning scheme of large space is obtained, therefore the process can also be instantly available the coarse answer being not optimised；Or it can also be into
The calculated result of each small computing unit of one-step optimization, thus the more preferably answer after being optimized, therefore the calculation process
It is also adaptable strong, the strong effect of upgradability.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
The structure shown according to these attached drawings obtains other attached drawings.
Fig. 1 is the flow chart of the intelligent packing method first embodiment of the present invention；
Fig. 2 is the flow chart of the intelligent packing method second embodiment of the present invention；
Fig. 3 is the flow chart of the intelligent packing method 3rd embodiment of the present invention；
Fig. 4 is the flow chart of the intelligent packing method fourth embodiment of the present invention；
Fig. 5 is the flow chart of the present invention the 5th embodiment of intelligent packing method；
Fig. 6 is the flow chart of the intelligent packing method sixth embodiment of the present invention.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.
Embodiment one
A kind of intelligent packing method is present embodiments provided, is cased for cargo.
Fig. 1 is please referred to, the intelligence packing method includes:
Container space is divided into multiple first subspace Bin by setting scheme by step S101；
Cargo to be installed is packed into multiple first subspace Bin by step S102 according to set algorithm, every to obtain
The first son vanning option b inPlan of the one first subspace Bin, and obtain the first vanning of all first BinPlan
List BinPlanList [0 ... N]；
Step S103 obtains the matching in the container space according to first vanning list BinPlanList [0 ... N]
Vanning scheme.
In the present embodiment, space division is carried out according to the spatial information for the container being obtained ahead of time first, i.e., by container
Space is divided into multiple first subspace Bin by setting scheme.Wherein, it when being divided container space, can incite somebody to action
Container space is divided according to the ranks of rule, can also be divided according to splitting scheme is prestored.After division,
The space of container can be divided with one-dimensional square, for example, 1 layer of 1 row N column-shaped；Or it is divided using two-dimensional directional, such as one layer of N row
N column-shaped；It can also be divided using three-dimensional, such as N row N column N stratiform.After the container space is divided, each
Space is respectively the first subspace Bin of different numbers, and record is in systems.
In the present embodiment, multiple first subspace Bin are obtained and then according to set algorithm by cargo to be installed dividing
It is packed into multiple first subspace Bin, to obtain the first sub- vanning scheme of each first subspace Bin
BinPlan, and obtain the first vanning list BinPlanList [0 ... N] of all first BinPlan.Wherein, pre-defined algorithm
It can be any intelligent algorithm that can be loaded the goods into container, and this algorithm is had the ability cargo to be installed compactly
It fills in certain space, such as intelligently fills Tetris, and the multirow that do not leave a blank that can gather together enough as far as possible.Therefore, pass through
The set algorithm one by one cases to each first subspace Bin, more compactly by each the first subspace
Bin is filled, and is recorded as the first son vanning option b inPlan corresponding to the Bin of first subspace.Described first sub- vanning side
It include the " loaded " position of each cargo, direction of cargo etc. information, so that it is determined that each cargo is definite in case BinPlan
State.When calculating finishes all first subspace Bin, then the first all son vanning option b inPlan can be obtained, then
The first all son vanning option b inPlan is counted again, obtains the first vanning list BinPlanList [0 ... N], with
Data call is carried out convenient for subsequent calculating process.
It cases list BinPlanList [0 ... N] and then obtaining described first according to the first vanning list
BinPlanList [0 ... N] obtains the matching vanning scheme in the container space.Wherein, by the first vanning list
BinPlanList [0 ... N] is handled, and can be obtained the matching vanning scheme in the required container space.Simplest place
Reason scheme, such as: all schemes of the first vanning list BinPlanList [0 ... N] directly add up, and are no longer carried out
Any adjustment, then the cumulative data that obtain can be used as matching vanning scheme.Then notify external manipulator according to the matching
Vanning scheme loads cargo to be installed to the container.It is, of course, also possible to by the first vanning list BinPlanList
The local data of [0 ... N] optimizes, to obtain more compact vanning scheme, is then re-used as final matching vanning side
Case.
From the foregoing, it will be observed that container space is divided into more by intelligence packing method provided by the present embodiment first at work
A first subspace Bin.Then it is individually answered for every one first subspace Bin, to obtain each first subspace
The first son vanning option b inPlan of Bin.Finally, then to the first vanning list BinPlanList [0 ... N] obtained it carries out
Proper treatment, matching vanning scheme needed for can be obtained final vanning.Thus intelligence packing method provided by the present embodiment,
It can be that multiple lesser computing units are calculated again by a biggish computing unit, cutting.To on the one hand make to succeed in one's scheme
The computing resource threshold for calculating large space vanning scheme reduces, so that the performance requirement threshold for calculating large space vanning scheme substantially drops
It is low；On the other hand, it is carried out when the calculated result for obtaining all lesser computing units and then to each small computing unit
Processing, it is hereby achieved that the vanning scheme of large space, therefore the process can also be instantly available the coarse answer being not optimised,
Have the effect of high-efficient；Or the calculated result of each small computing unit can also be advanced optimized, to be optimized
More preferably answer afterwards, therefore the calculation process is also adaptable strong, the strong effect of upgradability.
Embodiment two
A kind of intelligent packing method is present embodiments provided, the present embodiment is based on above-described embodiment, to wherein step
It is described in detail.It is specific as follows:
Fig. 2 is please referred to, it is described that the container space is obtained according to first vanning list BinPlanList [0 ... N]
Matching vanning scheme includes:
Step S201 carries out splicing Concatenation according to first vanning list BinPlanList [0 ... N],
Obtain the first splicing vanning scheme Concatenation (BinPlan plans)；
Step S202 is less than in the size of first splicing vanning scheme Concatenation (BinPlan plans)
Equal to the container space size when, then with it is described first splicing vanning scheme Concatenation (BinPlan plans)
As matching vanning scheme.
Other steps of the present embodiment are same as the previously described embodiments, specifically may refer to above-described embodiment, specifically no longer superfluous
It states.
In the present embodiment, it cases list BinPlanList [0 ... N] in acquisition first and then is filled according to described first
Case list BinPlanList [0 ... N] carries out splicing Concatenation, obtains the first splicing vanning scheme
Concatenation(BinPlan plans).Wherein, by all first son vanning option b inPlan in institute's cutting dimension
Physics connect and be known as Concatenation (splicing), result is one bigger first to splice vanning scheme
Concatenation(BinPlan plans)。
In the present embodiment, after vanning scheme Concatenation (BinPlan plans) is spliced in acquisition first,
It is empty to be less than or equal to the container in the size of first splicing vanning scheme Concatenation (BinPlan plans) again
Between size when, then using it is described first splicing vanning scheme Concatenation (BinPlan plans) as match vanning side
Case.Wherein, size generally includes three dimensions i.e. length, width and height, and therefore, the size on three directions of length, width and height is calculated, if
It is then qualification without departing from the size in container space.Certainly, in other embodiments, one of dimension can also be only measured,
That is length.It is i.e. when length is less than the length in container space, then not qualified.If the first splicing vanning scheme
Concatenation (BinPlan plans) is qualified, then as matching vanning scheme.
In the present embodiment, final evaluation link is increased, so as to avoid directly cumulative the first splicing of acquisition dress
Case scheme Concatenation (BinPlan plans) is limited beyond the size in container space, and leads to automatic boxing failure
It happens.
Embodiment three
A kind of intelligent packing method is present embodiments provided, the present embodiment is based on above-described embodiment, to wherein step
It is described in detail.It is specific as follows:
Fig. 3 is please referred to, it is described that the container space is obtained according to first vanning list BinPlanList [0 ... N]
Match vanning scheme further include:
Step S301 is greater than in the size of first splicing vanning scheme Concatenation (BinPlan plans)
When the size in the container space, then to the first sub- vanning scheme in first vanning list BinPlanList [0 ... N]
BinPlan merges Merge according to setting scheme, to obtain the second sub- vanning scheme MergedBinPlan, and acquisition
Second vanning list MergedBinPlanList [0 ... N]；
Step S302 is spliced according to second vanning list MergedBinPlanList [0 ... N]
Concatenation obtains the second splicing vanning scheme MergedConcatenation (BinPlan plans)；
Step S303, in the ruler of second splicing vanning scheme MergedConcatenation (BinPlan plans)
When the very little size less than or equal to the container space, then with the second splicing vanning scheme MergedConcatenation
(BinPlan plans) is as matching vanning scheme.
Other steps of the present embodiment are same as the previously described embodiments, specifically may refer to above-described embodiment, specifically no longer superfluous
It states.
In the present embodiment, when obtain it is described first splicing vanning scheme Concatenation (BinPlan plans),
And it is greater than the container space in the size of first splicing vanning scheme Concatenation (BinPlan plans)
Size when, then to the first son vanning option b inPlan in first vanning list BinPlanList [0 ... N] according to setting
Determine scheme and merge Merge, to obtain the second sub- vanning scheme MergedBinPlan, and acquisition the second vanning list
MergedBinPlanList[0…N].Wherein, for the splicing of two or more the first son vannings option b inPlan
Concatenation, and commission algorithm A cases again to wherein cargo again, and this process is known as Merge (merging),
It as a result is a second new sub- vanning scheme MergedBinPlan.Algorithm A can be before set algorithm, can also be with
It is using other algorithms.Certainly, after merging merge, a second sub- vanning scheme MergedBinPlan's obtained
Size or length when size the first two the first son vanning option b inPlan that perhaps length should be less than is directly cumulative.Into
One step, Merge is merged to multiple groups the first son vanning option b inPlan, to obtain the multiple second sub- vanning schemes
MergedBinPlan.And these multiple second sub- vanning scheme MergedBinPlan then constitute the second new vanning list
MergedBinPlanList[0…N]。
In the present embodiment, in the vanning of acquisition second list MergedBinPlanList [0 ... N] and then according to described
Second vanning list MergedBinPlanList [0 ... N] carries out splicing Concatenation, obtains the second splicing vanning scheme
MergedConcatenation(BinPlan plans).Wherein, the second all sub- vanning scheme MergedBinPlan is existed
Physics in institute's cutting dimension, which connects, is known as Concatenation (splicing), and result is a second bigger splicing vanning side
Case MergedConcatenation (BinPlan plans).
In the present embodiment, it is obtaining then again in the second splicing vanning scheme MergedConcatenation
When the size of (BinPlan plans) is less than or equal to the size in the container space, then with the second splicing vanning scheme
MergedConcatenation (BinPlan plans) is as matching vanning scheme.
From the foregoing, it will be observed that intelligence packing method provided by the present embodiment, by the first vanning list BinPlanList
[0 ... N] merges merge operation, so as to merge two or three small spaces, to obtain bigger
Then its internal cargo is cased again, so that the vanning of the bigger subspace is more compact, is reached by subspace
Optimize the effect of vanning.It follows that obtaining the second splicing vanning scheme by the bigger subspace splicing after optimizing
MergedConcatenation (BinPlan plans), can be more compact, more meets the demand of vanning, thus more maximum probability at
For final matching vanning scheme.
Example IV
A kind of intelligent packing method is present embodiments provided, the present embodiment is based on above-described embodiment, to wherein step
It is described in detail.It is specific as follows:
Please refer to Fig. 4, the first sub- vanning scheme in first vanning list BinPlanList [0 ... N]
BinPlan merges Merge according to setting scheme, to obtain the second sub- vanning scheme MergedBinPlan, and acquisition
Second vanning list MergedBinPlanList [0 ... N], comprising:
Step S401, the first subspace and first for obtaining any two the first son vanning option b inPlan include cargo,
Two first subspaces are combined to obtain the second subspace BBin, and is included according to the set algorithm by described first
Cargo is packed into resulting second subspace BBin is combined, to obtain the second sub- vanning scheme MergedBinPlan；
Step S402, by multiple second sub- the second vanning of vanning scheme MergedBinPlan composition lists
MergedBinPlanList[0…N]。
Other steps of the present embodiment are same as the previously described embodiments, specifically may refer to above-described embodiment, specifically no longer superfluous
It states.
In the present embodiment, during merging merge, obtain any two the first son vanning option b inPlan's
First subspace and first includes cargo, two first subspaces is combined to obtain the second subspace BBin, and according to
The set algorithm includes cargo for described first and is packed into resulting second subspace BBin is combined, to obtain the second son dress
Case scheme MergedBinPlan.Wherein, the first son of any two vanning its physical location of option b inPlan can be space phase
Even, it is separated to be also possible to space.When re-starting vanning, then can case two first sons option b inPlan
In the cargo that includes redistributed.In general, after entrusting the set algorithm, cargo can be loaded after casing again
It obtains more compact.For example, if two spaces merge into a continuous space when space is connected, then it is described to include cargo again
It cases into the continuous space；It is described to include cargo and cased again into the discontinuous space if space is not attached to.It should
Set algorithm can be using the algorithm cased based on Monte Carlo tree.
Embodiment five
A kind of intelligent packing method is present embodiments provided, the present embodiment is based on 3rd embodiment, to wherein step
It is described in detail.It is specific as follows:
Please refer to Fig. 5, the first sub- vanning scheme in first vanning list BinPlanList [0 ... N]
BinPlan merges Merge according to setting scheme, to obtain the second sub- vanning scheme MergedBinPlan, and acquisition
Second vanning list MergedBinPlanList [0 ... N], comprising:
Step S501 is constructed two-dimensional matrix Rewards [N] [N], wherein the type of each element is the first sub- vanning scheme
BinPlan, wherein subscript i, j (0≤i, j < N) enable the two-dimensional matrix Rewards [i] [j] be equal to first if i is equal to j
Son vanning option b inPlanList [i] otherwise enables the two-dimensional matrix Rewards [i] [j] be equal to the second sub- vanning scheme
Merge(BinPlanList[i],BinPlanList[j])；Wherein, step S502 is merging the specified two first sons dress of Merge
First subspace of case scheme (BinPlanList [i], BinPlanList [j]) and first is when including cargo, by two first sons
Space is combined to obtain the second subspace BBin, and according to the set algorithm by described first include cargo be packed into
Resulting second subspace BBin is combined, to obtain the second sub- vanning side obtained from merging specified two first sub- vanning schemes
Case Merged (BinPlanList [i], BinPlanList [j])；
Step S503, the two-dimensional matrix Rewards [N] [N] obtained after being solved according to traversal, and solve the Two-Dimensional Moment
The reward value of each element in battle array Rewards [N] [N]；
Step S504 obtains high reward value collection partition, the high reward value collection according to the reward value
The element type of partition is Rewards [i] [j]；
The high reward value collection partition is corresponded to the member in the two-dimensional matrix Rewards [N] [N] by step S505
Element takes out, and forms the second final son vanning list MergedBinPlanList [0 ... N].
Other steps of the present embodiment are identical as above-mentioned 3rd embodiment, specifically may refer to above-described embodiment, specifically not
It repeats again.
In the present embodiment, merge merge by carrying out traversal to the first vanning list BinPlanList [0 ... N], so
Result is recorded in two-dimensional matrix Rewards [N] [N] afterwards, finally according to the reward value in two-dimensional matrix Rewards [N] [N],
To obtain the highest a set of Merge Scenarios of reward value.
Intelligence packing method provided by the present embodiment, the scheme merged at random in above-described embodiment relatively, then this implementation
Example is using merging of having ready conditions, so that the amalgamation result obtained is more excellent, it being capable of the more maximum probability acquisition matching vanning scheme.
Specifically, the reward value is vanning compactness, after the specific method for calculating compactness can splice according to cargo
Length value judge that, if length value is longer, compactness is lower.And if length value is shorter, compactness is higher.
Embodiment six
A kind of intelligent packing method is present embodiments provided, the present embodiment can be right based on above-mentioned any embodiment
Wherein step is described in detail.It is specific as follows:
Fig. 6 is please referred to, it is described that the container space is obtained according to first vanning list BinPlanList [0 ... N]
Match vanning scheme further include:
Step S601, in the ruler of second splicing vanning scheme MergedConcatenation (BinPlan plans)
When the very little size for being greater than former container space, then the second splicing vanning scheme MergedConcatenation is judged
Whether the reward value of (BinPlan plans) is higher than the first splicing vanning scheme Concatenation (BinPlan
plans)；
Step S602, if it is determined that for less than or equal to the first splicing vanning scheme Concatenation (BinPlan
Plans), then report mistake and stop；
Step S603, if it is determined that for greater than the first splicing vanning scheme Concatenation (BinPlan
Plans), then carry out next iteration, Merge merged again to the second sub- vanning scheme MergedBinPlan for obtaining and
The third of acquisition splices vanning scheme.
Other steps of the present embodiment are same as the previously described embodiments, specifically may refer to above-described embodiment, specifically no longer superfluous
It states.
Intelligence packing method provided by the present embodiment, is able to carry out and merges iteration more times, so as to so continuous that mention
High reward value, that is, the compactness cased.If reward value cannot be improved, reported an error and stopped.Therefore, the present embodiment institute
The intelligent packing method of offer, is able to carry out successive ignition, so that problem-solving ability is stronger.
Embodiment seven
A kind of intelligent packing method is present embodiments provided, the present embodiment can be right based on above-mentioned any embodiment
Wherein step is described in detail.It is specific as follows:
It is described container space is divided into multiple first subspace Bin by setting scheme to include:
Container space is divided into multiple first subspace Bin along the length dimension of setting.Wherein, along container space
Dimension direction, such as length direction, width direction or short transverse, mark multiple subspaces.And container space is existed
Length in selected cutting dimension is simply referred as length, i.e., the origin of above-mentioned " dividing by the length of setting ".The present embodiment
Other steps are same as the previously described embodiments, specifically may refer to above-described embodiment, specifically repeat no more.It is rewarded in subsequent calculating
During value, then corresponding reward value can be obtained with the length of length, i.e. the longer reward value of length is lower, otherwise more
It is high.
Embodiment eight
Present embodiments provide a kind of intelligent boxing apparatus.
The intelligence boxing apparatus includes reservoir and processor；The reservoir stores cargo screening sequence；
The processor is for executing the cargo screening sequence, to execute following steps:
Container space is divided into multiple first subspace Bin by setting scheme by step S101；
Cargo to be installed is packed into multiple first subspace Bin by step S102 according to set algorithm, every to obtain
The first son vanning option b inPlan of the one first subspace Bin, and obtain the first vanning of all first BinPlan
List BinPlanList [0 ... N]；
Step S103 obtains the matching in the container space according to first vanning list BinPlanList [0 ... N]
Vanning scheme.
Intelligence boxing apparatus provided by the present embodiment, due to using the complete of above-mentioned intelligent packing method first embodiment
Portion's technical characteristic, therefore whole beneficial effect possessed by the first embodiment also with above-mentioned intelligent packing method, specifically may be used
With referring to above-described embodiment, details are not described herein.In addition, the improvement of the other embodiments of above-mentioned intelligent packing method can also be with
For the present embodiment, above-described embodiment specifically may refer to, details are not described herein.
Embodiment nine
Present embodiments provide a kind of computer readable storage medium.
Cargo screening sequence is stored on the computer readable storage medium, the cargo screening sequence is held by processor
Following steps are realized when row.
Container space is divided into multiple first subspace Bin by setting scheme by step S101；
Cargo to be installed is packed into multiple first subspace Bin by step S102 according to set algorithm, every to obtain
The first son vanning option b inPlan of the one first subspace Bin, and obtain the first vanning of all first BinPlan
List BinPlanList [0 ... N]；
Step S103 obtains the matching in the container space according to first vanning list BinPlanList [0 ... N]
Vanning scheme.
Computer readable storage medium provided by the present embodiment is implemented due to using above-mentioned intelligent packing method first
The all technical features of example, therefore whole beneficial effect possessed by the first embodiment also with above-mentioned intelligent packing method,
Specifically it may refer to above-described embodiment, details are not described herein.In addition, the improvement of the other embodiments of above-mentioned intelligent packing method
It can be used for the present embodiment, specifically may refer to above-described embodiment, details are not described herein.
It should be noted that, in this document, the terms "include", "comprise" or its any other variant are intended to non-row
His property includes, so that the process, method, article or the device that include a series of elements not only include those elements, and
And further include other elements that are not explicitly listed, or further include for this process, method, article or device institute it is intrinsic
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including being somebody's turn to do
There is also other identical elements in the process, method of element, article or device.
The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on this understanding, technical solution of the present invention substantially in other words does the prior art
The part contributed out can be embodied in the form of software products, which is stored in a storage medium
In (such as ROM/RAM, magnetic disk, CD), including some instructions are used so that a terminal (can be mobile phone, computer, service
Device, air conditioner or network equipment etc.) execute method described in each embodiment of the present invention.
The embodiment of the present invention is described with above attached drawing, but the invention is not limited to above-mentioned specific
Embodiment, the above mentioned embodiment is only schematical, rather than restrictive, those skilled in the art
Under the inspiration of the present invention, without breaking away from the scope protected by the purposes and claims of the present invention, it can also make very much
Form, all of these belong to the protection of the present invention.
Claims (10)
1. it is a kind of intelligence packing method, for cargo case, which is characterized in that it is described intelligence packing method include:
Container space is divided into multiple first subspace Bin by setting scheme；
Cargo to be installed is packed into multiple first subspace Bin according to set algorithm, to obtain each first son
The first son vanning option b inPlan of space B in, and obtain the first vanning list of all first BinPlan
BinPlanList[0…N]；
The matching vanning scheme in the container space is obtained according to first vanning list BinPlanList [0 ... N].
2. intelligence packing method as described in claim 1, which is characterized in that described according to the first vanning list
The matching vanning scheme that BinPlanList [0 ... N] obtains the container space includes:
Splicing Concatenation is carried out according to first vanning list BinPlanList [0 ... N], obtains the first splicing dress
Case scheme Concatenation (BinPlan plans)；
It is less than or equal to the container in the size of first splicing vanning scheme Concatenation (BinPlan plans)
When the size in space, then case using first splicing vanning scheme Concatenation (BinPlan plans) as matching
Scheme.
3. intelligence packing method as claimed in claim 2, which is characterized in that described according to the first vanning list
BinPlanList [0 ... N] obtains the matching vanning scheme in the container space further include:
It is greater than the container space in the size of first splicing vanning scheme Concatenation (BinPlan plans)
Size when, then to the first son vanning option b inPlan in first vanning list BinPlanList [0 ... N] according to setting
Determine scheme and merge Merge, to obtain the second sub- vanning scheme MergedBinPlan, and acquisition the second vanning list
MergedBinPlanList[0…N]；
Splicing Concatenation is carried out according to second vanning list MergedBinPlanList [0 ... N], obtains second
Splice vanning scheme MergedConcatenation (BinPlan plans)；
It is less than or equal to institute in the size of second splicing vanning scheme MergedConcatenation (BinPlan plans)
When stating the size in container space, then with second splicing vanning scheme MergedConcatenation (BinPlan plans)
As matching vanning scheme.
4. intelligence packing method as claimed in claim 3, which is characterized in that described to the first vanning list
The first son vanning option b inPlan in BinPlanList [0 ... N] merges Merge according to setting scheme, to obtain
Second sub- vanning scheme MergedBinPlan, and obtain the second vanning list MergedBinPlanList [0 ... N], comprising:
The first subspace and first for obtaining any two the first son vanning option b inPlan includes cargo, and two first sons are empty
Between be combined to obtain the second subspace BBin, and cargo is included for described first according to the set algorithm and is packed into group
Resulting second subspace BBin is closed, to obtain the second sub- vanning scheme MergedBinPlan；
By multiple second sub- the second vanning of vanning scheme MergedBinPlan composition list MergedBinPlanList
[0…N]。
5. intelligence packing method as claimed in claim 3, which is characterized in that described to the first vanning list
The first son vanning option b inPlan in BinPlanList [0 ... N] merges Merge according to setting scheme, to obtain
Second sub- vanning scheme MergedBinPlan, and obtain the second vanning list MergedBinPlanList [0 ... N], comprising:
It constructs two-dimensional matrix Rewards [N] [N], wherein the type of each element is the first son vanning option b inPlan, wherein
Subscript i, j (0≤i, j < N) enable the two-dimensional matrix Rewards [i] [j] be equal to the first sub- vanning scheme if i is equal to j
BinPlanList [i] otherwise enables the two-dimensional matrix Rewards [i] [j] be equal to the second sub- vanning scheme Merge
(BinPlanList[i],BinPlanList[j])；Wherein,
Specify the first son of two first sub- vanning schemes (BinPlanList [i], BinPlanList [j]) empty merging Merge
Between and first when including cargo, two first subspaces are combined to obtain the second subspace BBin, and is set according to described
Determine algorithm and include cargo for described first to be packed into combining resulting second subspace BBin, merges specified two first to obtain
Second sub- vanning scheme Merged (BinPlanList [i], BinPlanList [j]) obtained from sub- vanning scheme；
The two-dimensional matrix Rewards [N] [N] obtained after being solved according to traversal, and solve the two-dimensional matrix Rewards [N]
The reward value of each element in [N]；
According to the reward value, high reward value collection partition, the element type of the high reward value collection partition are obtained
For Rewards [i] [j]；
The high reward value collection partition is corresponded to the element in the two-dimensional matrix Rewards [N] [N] to take out, composition is most
The second whole son vanning list MergedBinPlanList [0 ... N].
6. intelligence packing method as claimed in claim 5, which is characterized in that the reward value is vanning compactness.
7. intelligence packing method as claimed in claim 3, which is characterized in that described according to the first vanning list
BinPlanList [0 ... N] obtains the matching vanning scheme in the container space further include:
It is greater than former container in the size of second splicing vanning scheme MergedConcatenation (BinPlan plans)
When the size in space, then the prize of second splicing vanning scheme MergedConcatenation (BinPlan plans) is judged
Encourage whether value is higher than first splicing vanning scheme Concatenation (BinPlan plans)；
If it is determined that then reporting mistake for less than or equal to first splicing vanning scheme Concatenation (BinPlan plans)
It misses and stops；
If it is determined that then being carried out next time for greater than first splicing vanning scheme Concatenation (BinPlan plans)
Iteration splices vanning side for obtaining the third for merging Merge again to the second sub- vanning scheme MergedBinPlan and obtaining
Case.
8. intelligence packing method as described in any one of claim 1 to 7, which is characterized in that described that setting is pressed in container space
Scheme is divided into multiple first subspace Bin
Container space is divided into multiple first subspace Bin along the length dimension of setting.
9. a kind of intelligence boxing apparatus, which is characterized in that the intelligence boxing apparatus includes reservoir and processor；The storage
Device stores cargo screening sequence；
The processor is for executing the cargo screening sequence, to execute the described in any item goods of the claims 1 to 8
The step of object screening technique.
10. a kind of computer readable storage medium, which is characterized in that be stored with cargo sieve on the computer readable storage medium
Program is selected, the cargo screening sequence realizes cargo screening side as claimed in any one of claims 1 to 8 when being executed by processor
The step of method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910218616.9A CN109948985A (en) | 2019-03-21 | 2019-03-21 | Intelligent packing method, equipment and calculating are readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910218616.9A CN109948985A (en) | 2019-03-21 | 2019-03-21 | Intelligent packing method, equipment and calculating are readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109948985A true CN109948985A (en) | 2019-06-28 |
Family
ID=67010550
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910218616.9A Pending CN109948985A (en) | 2019-03-21 | 2019-03-21 | Intelligent packing method, equipment and calculating are readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109948985A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030110102A1 (en) * | 2001-05-29 | 2003-06-12 | Chen-Fu Chien | Method for goods arrangement and its system |
| CN103870893A (en) * | 2014-04-09 | 2014-06-18 | 沈阳工业大学 | Optimization method for solving encasement problem under multiple weight restrictions based on three-dimensional space |
| CN105279629A (en) * | 2015-09-30 | 2016-01-27 | 上海东源计算机自动化工程有限公司 | Optimized intelligent packaging system |
| CN109447311A (en) * | 2018-09-13 | 2019-03-08 | 深圳市递四方信息科技有限公司 | Adaptation packing method, device, equipment and storage medium based on genetic algorithm |
-
2019
- 2019-03-21 CN CN201910218616.9A patent/CN109948985A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030110102A1 (en) * | 2001-05-29 | 2003-06-12 | Chen-Fu Chien | Method for goods arrangement and its system |
| CN103870893A (en) * | 2014-04-09 | 2014-06-18 | 沈阳工业大学 | Optimization method for solving encasement problem under multiple weight restrictions based on three-dimensional space |
| CN105279629A (en) * | 2015-09-30 | 2016-01-27 | 上海东源计算机自动化工程有限公司 | Optimized intelligent packaging system |
| CN109447311A (en) * | 2018-09-13 | 2019-03-08 | 深圳市递四方信息科技有限公司 | Adaptation packing method, device, equipment and storage medium based on genetic algorithm |
Non-Patent Citations (3)
| Title |
|---|
| 易向阳 等: "基于五块模式的单一矩形件排样算法", 《图学学报》 * |
| 陈德良 等: "三维装箱问题的模型与改进遗传算法", 《数学的实践与认识》 * |
| 靳志宏: "《物流调度与协调》", 31 December 2008 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10019693B2 (en) | Warehouse rack space optimization | |
| US10567494B2 (en) | Data processing system, computing node, and data processing method | |
| CN108510095B (en) | Method and device for determining goods picking path | |
| Zachariadis et al. | The pallet-packing vehicle routing problem | |
| CN104915817A (en) | Loading method and apparatus for container | |
| CN104079960B (en) | File recommendation method and device | |
| Vasiljevic et al. | Handling ties in heuristics for the permutation flow shop scheduling problem | |
| Gheith et al. | Solving the container pre-marshalling problem using variable length genetic algorithms | |
| GB2524952A (en) | A method of packing containers | |
| Nguyen et al. | A genetic programming based hyper-heuristic approach for combinatorial optimisation | |
| WO2021058578A1 (en) | Fast sparse neural networks | |
| CN108038142A (en) | Realize method, electronic device and the storage medium of multistage linking combobox | |
| US8682808B2 (en) | Method and apparatus for processing logistic information | |
| CN117035374B (en) | Force cooperative scheduling method, system and medium for coping with emergency | |
| CN109948985A (en) | Intelligent packing method, equipment and calculating are readable storage medium | |
| Nouhi et al. | Chaotic Charged System Search with a Feasible‐Based Method for Constraint Optimization Problems | |
| CN107507020B (en) | Method for obtaining network propagation influence competitive advantage maximization | |
| CN111144796A (en) | Method and device for generating tally information | |
| Rosenfeld | Optimal retrieval in puzzle‐based storage with heuristic search and tabulation | |
| CN113448876A (en) | Service testing method, device, computer equipment and storage medium | |
| CN114647818A (en) | Method and device for determining matrix operation result, storage medium and electronic device | |
| JP2020029330A (en) | Deployment number determination apparatus and deployment number determination method | |
| CN110598182A (en) | Information prediction method and related equipment | |
| Patterson et al. | Towards automatic design of factorio blueprints | |
| CN113946255B (en) | Operation method and device of list view control and electronic 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190628 |
|
| RJ01 | Rejection of invention patent application after publication |