CN106503951A - Goods packing method and device - Google Patents
Goods packing method and device Download PDFInfo
- Publication number
- CN106503951A CN106503951A CN201610997330.1A CN201610997330A CN106503951A CN 106503951 A CN106503951 A CN 106503951A CN 201610997330 A CN201610997330 A CN 201610997330A CN 106503951 A CN106503951 A CN 106503951A
- Authority
- CN
- China
- Prior art keywords
- goods
- summit
- vanning
- initial
- color rendering
- 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 100
- 238000012856 packing Methods 0.000 title claims abstract description 16
- 238000009877 rendering Methods 0.000 claims abstract description 104
- 239000003086 colorant Substances 0.000 claims abstract description 55
- 230000008569 process Effects 0.000 claims abstract description 40
- 238000004040 coloring Methods 0.000 claims description 101
- 230000009471 action Effects 0.000 claims description 12
- 238000003780 insertion Methods 0.000 claims description 6
- 230000037431 insertion Effects 0.000 claims description 6
- 238000010186 staining Methods 0.000 claims description 6
- BWHLPLXXIDYSNW-UHFFFAOYSA-N ketorolac tromethamine Chemical compound OCC(N)(CO)CO.OC(=O)C1CCN2C1=CC=C2C(=O)C1=CC=CC=C1 BWHLPLXXIDYSNW-UHFFFAOYSA-N 0.000 abstract description 20
- 230000000875 corresponding effect Effects 0.000 description 60
- 238000004422 calculation algorithm Methods 0.000 description 27
- 238000010586 diagram Methods 0.000 description 8
- 239000011159 matrix material Substances 0.000 description 6
- 239000003016 pheromone Substances 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 125000004122 cyclic group Chemical class 0.000 description 3
- 238000004080 punching Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000009795 derivation Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 241000257303 Hymenoptera Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 235000013305 food Nutrition 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/206—Drawing of charts or graphs
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Human Resources & Organizations (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
Abstract
The present invention provides a kind of goods packing method and device, and wherein method includes：Goods conflict relationship non-directed graph is set up according to the conflict relationship between each goods to be cased；From figure, each summit begins stepping through goods conflict relationship non-directed graph respectively, in each ergodic process, each summit is coloured according to the annexation between each summit, is traveled through corresponding color rendering intent every time；The color rendering intent minimum using number of colors is selected in corresponding color rendering intent is traveled through every time, feasible vanning scheme is determined according to using the minimum color rendering intent of number of colors；Final vanning scheme is determined according to feasible vanning scheme and predetermined initial vanning scheme, goods vanning is carried out according to final vanning scheme.Goods packing method and device in embodiment of the present invention solution throughway when BPPC problems are solved is simply clear, and complexity is low, it is easy to accomplish, it is possible to increase solution efficiency, and then goods boxing efficiency is improved, solve the problems, such as that goods boxing efficiency is relatively low.
Description
Technical field
The present invention relates to logistlcs technology field, in particular to a kind of goods packing method and device.
Background technology
When logistics field carries out goods vanning, exist with conflict relationship for food, medicine or dangerous material and other items
Bin packing (Bin Packing Problem with Conflicts, BPPC), the problem are embodied in presence conflict and close
The article of system can not be installed in same container, and the problem can be represented by following model.
Assume that goods set and container set are respectively I={ 1,2 ..., n } and H={ 1,2 ..., n }, goods in BPPC problems
The weight of thing i is wi, the list of corresponding conflict goods is Li, the maximum capacity unification of each container is C.Model is corresponding
Decision variable is comprising following two：
The integer programming model of BPPC problems can be described as follows[2]：
Correlation technique first obtains goods list, then to each goods in goods list when goods vanning is carried out
BPPC problems are solved, and the goods for obtaining there will be conflict relationship is not positioned over the loading strategy in same container, then root
Goods vanning is carried out according to the loading strategy.However, correlation technique belongs to Mathematical Planning mostly for the derivation algorithm of BPPC problems
Method, implements extremely complex, and the computational efficiency when problem scale is larger is very low, causes goods dress in correlation technique
Case is less efficient.
Content of the invention
In view of this, it is an object of the invention to provide a kind of goods packing method and device, are imitated with improving goods vanning
Rate.
In a first aspect, embodiments providing a kind of goods packing method, methods described includes：According to be cased
Conflict relationship between each goods sets up goods conflict relationship non-directed graph, each top in the goods conflict relationship non-directed graph
, there is line segment connection between two goods of conflict relationship in point each described goods corresponding；Respectively from summit each described
The goods conflict relationship non-directed graph is begun stepping through, in each ergodic process, is closed according to the connection between each described summit
System is coloured to summit each described, is traveled through corresponding color rendering intent every time, in the color rendering intent, be there is connection and is closed
Two vertex colorings of system are different colours, and two vertex colorings that there is no annexation are same color；?
Travel through every time, according to using number of colors most
Few color rendering intent determines feasible vanning scheme；If the container quantity used by the feasible vanning scheme is less than in advance really
The container quantity used by fixed initial vanning scheme, then update the initial vanning scheme according to the feasible vanning scheme,
Otherwise, retain the initial vanning scheme；Circulation executes the action of the above-mentioned traversal goods conflict relationship non-directed graph to more
Newly described initial vanning scheme or the action of the reservation initial vanning scheme, until it reaches preset loop threshold value, are up to
The described initial vanning scheme obtained after the preset loop threshold value as final vanning scheme, according to the final vanning scheme
Carry out goods vanning.
In conjunction with a first aspect, embodiments provide first aspect the first possible embodiment, wherein, described
The goods conflict relationship non-directed graph is begun stepping through respectively from summit each described, in each ergodic process, according to each institute
The annexation that states between summit is coloured to summit each described, is traveled through corresponding color rendering intent every time, including：Point
Each described summit is not coloured as starting point to current starting point；Determine the target of the current starting point traversal
The representative points are coloured by summit according to the annexation between the current starting point and the representative points；Will
The impact point goes to representative points and determines that step cycle is executed, until each described summit is equal as the current starting point
Coloring, obtains when time corresponding color rendering intent of traversal；Each described starting point for remaining, repeats above-mentioned initial Point Coloring, mesh
Mark summit determines, representative points coloring process, until being traveled through corresponding color rendering intent every time.
The first possible embodiment in conjunction with first aspect, embodiments provides second possibility of first aspect
Embodiment, wherein, the representative points for determining current starting point traversal, according to the current starting point with described
Annexation between representative points is coloured to the representative points, including：Calculate and be transferred to by the current starting point
The probability on remaining each summit, selects the summit of the maximum probability as representative points；If the representative points
There is no annexation between the current starting point, then select with the current starting point identical color to the target
Summit is coloured, and otherwise, selects the color of original highest priority to colour the representative points.
In conjunction with a first aspect, embodiments provide first aspect the third possible embodiment, wherein, described
Feasible vanning scheme is determined according to using the minimum color rendering intent of number of colors, including：Minimum using number of colors
In the color rendering intent, using the set of corresponding for the vertex set of same color goods as the goods collection that there is no conflict relationship
Close, obtain multiple goods set, for goods set each described, carry out according to the descending order of goods weight
Goods is cased；For multiple containers that goods set each described is used, utilization rate is selected in each container for having used most
The low container, will select the container in goods be inserted in the unselected container, repeat container select and
Goods insertion process, until during the goods in the container for selecting cannot be entirely insertable to the unselected container；Will be per
Each described container that the individual goods set is used is recorded with the assembly relation between corresponding goods, used as use
The corresponding feasible vanning scheme of the minimum color rendering intent of number of colors.
In conjunction with a first aspect, embodiments provide the 4th kind of possible embodiment of first aspect, wherein, described
Initial vanning scheme is determined by procedure below：According to each described degree of vertex value in the goods conflict relationship non-directed graph
And the annexation between each described summit is coloured to summit each described, initial color rendering intent is obtained, described initial
In color rendering intent, the summit that there is no annexation is same color, and the summit that there is annexation is different colours；According to institute
State initial color rendering intent and determine initial vanning scheme.
In conjunction with the 4th kind of possible embodiment of first aspect, the 5th kind of possibility of first aspect is embodiments provided
Embodiment, wherein, described according to each described degree of vertex value and each institute in the goods conflict relationship non-directed graph
The annexation that states between summit is coloured to summit each described, obtains initial color rendering intent, including：Selectance numerical value is most
The high summit, to select the summit colour, by coloring after the summit be included into coloring vertex set, described
Coloring vertex set is initially empty set；According to each summit and each described summit uncoloured in the coloring vertex set
Between annexation each described summit uncoloured is classified, by with described coloring vertex set in each summit
There is no a class summit of annexation as vertex set is not connected to, will exist with the summit in the coloring vertex set
One class summit of annexation is used as connection vertex set；It is not connected to select in vertex set and the connection vertex set described
A most summit of abutment points quantity in conjunction, adopts with identical color in summit described in number of degrees value highest to described in selection
Summit is coloured, and is gone to above-mentioned summit and is included into actuation cycle execution, until the vertex set that is not connected to is for sky；Described
Connection vertex set is not space-time, and the actuation cycle for going to summit described in above-mentioned selectance numerical value highest is executed, until institute
There is summit to be colored, using the coloring case on each summit as initial color rendering intent.
Second aspect, embodiments provides a kind of goods boxing apparatus, and described device includes：Non-directed graph sets up mould
Block, for setting up goods conflict relationship non-directed graph, the goods conflict according to the conflict relationship between each goods to be cased
, there is line segment between two goods of conflict relationship and connect in each vertex correspondence in relation non-directed graph each described goods
Connect；Traversal staining module, for beginning stepping through the goods conflict relationship non-directed graph from summit each described respectively, at each time
During going through, summit each described is coloured according to the annexation between each described summit, it is right to be traveled through every time
The color rendering intent that answers, in the color rendering intent, two vertex colorings that there is annexation are different colours, there is no company
Two vertex colorings for connecing relation are same color；Scheme determining module, for traveling through corresponding color rendering intent every time
The middle color rendering intent for selecting to use number of colors minimum, can according to being determined using the minimum color rendering intent of number of colors
Luggage case scheme；Scheme update module, if be less than for the container quantity used by the feasible vanning scheme predetermined
The container quantity used by initial vanning scheme, then update the initial vanning scheme according to the feasible vanning scheme, otherwise,
Retain the initial vanning scheme；Vanning module, executes the above-mentioned traversal goods conflict relationship non-directed graph for circulating
Action is to the action for updating the initial vanning scheme or the reservation initial vanning scheme, until it reaches preset loop threshold
Value, the described initial vanning scheme obtained after being up to the preset loop threshold value as final vanning scheme, according to described most
Whole vanning scheme carries out goods vanning.
In conjunction with second aspect, second aspect the first possible embodiment is embodiments provided, wherein, described
Traversal staining module includes：First sub-module, for respectively using each described summit as starting point, to current starting point
Coloured；Second sub-module, for determining the representative points of current starting point traversal, according to the current starting
Annexation between point and the representative points is coloured to the representative points；Submodule is redirected, for by the mesh
Punctuate goes to representative points and determines that step cycle is executed, until each described summit colours, obtain as the current starting point
To when time corresponding color rendering intent of traversal；Repeat submodule, for each described starting point for remaining, repeat above-mentioned starting point
Coloring, representative points determine, representative points coloring process, until being traveled through corresponding color rendering intent every time.
In conjunction with second aspect, second possible embodiment of second aspect is embodiments provided, wherein, described
Scheme determining module includes：Initial vanning submodule, in the color rendering intent minimum using number of colors, will be identical
The corresponding goods set of the vertex set of color obtains multiple goods collection as the goods set that there is no conflict relationship
Close, for goods set each described, goods vanning is carried out according to the descending order of goods weight；Goods inserts submodule
Block, for the multiple containers used for goods set each described, selects utilization rate in each container for having used minimum
The container, will select the container in goods be inserted in the unselected container, repeat container select and goods
Thing insertion process, until during the goods in the container for selecting cannot be entirely insertable to the unselected container；Record
Module, for the assembly relation record between each described container for using each described goods set and corresponding goods
Get off, as using the corresponding feasible vanning scheme of the minimum color rendering intent of number of colors.
In conjunction with second aspect, second aspect the third possible embodiment is embodiments provided, wherein, described
Device also includes：Initial vanning scheme determining module, for according to each described summit in the goods conflict relationship non-directed graph
Number of degrees value and each summit between annexation summit each described is coloured, obtain initial color rendering intent,
In the initial color rendering intent, the summit that there is no annexation is same color, and the summit that there is annexation is different face
Color, determines initial vanning scheme according to the initial color rendering intent.
In the embodiment of the present invention, the conflict relationship between multiple goods is represented by goods conflict relationship non-directed graph, profit
The goods that the goods that there is conflict relationship is distinguished with the mode of vertex coloring and there is no conflict relationship, with predetermined initial
Vanning scheme is boundary value, determines optimum vanning scheme, carry out goods according to final vanning scheme by the way of loop iteration
Vanning.Method in due to the embodiment of the present invention solve BPPC problems when, by solution procedure be converted to goods conflict relationship without
The loop iteration of foundation, vertex coloring and feasible vanning scheme to figure, is solving in this solution mode and correlation technique
The mathematic programming methods adopted during BPPC problems are compared, and solution throughway is more simple clear, and solving complexity is low, more easily
Realize, solution efficiency can be improved by the method and device in the embodiment of the present invention therefore, and then improve goods boxing efficiency,
Solve the problems, such as that goods boxing efficiency is relatively low in correlation technique.
For enabling the above objects, features and advantages of the present invention to become apparent, preferred embodiment cited below particularly, and coordinate
Appended accompanying drawing, is described in detail below.
Description of the drawings
In order to be illustrated more clearly that the technical scheme of the embodiment of the present invention, below by to be used attached needed for embodiment
Figure is briefly described, it will be appreciated that the following drawings illustrate only certain embodiments of the present invention, and it is right to be therefore not construed as
The restriction of scope, for those of ordinary skill in the art, on the premise of not paying creative work, can be with according to this
A little accompanying drawings obtain other related accompanying drawings.
Fig. 1 is the schematic flow sheet of goods packing method provided in an embodiment of the present invention；
Fig. 2 is the schematic diagram of goods conflict relationship non-directed graph provided in an embodiment of the present invention；
Fig. 3 is the coloring schematic diagram of the goods conflict relationship figure shown in Fig. 2 provided in an embodiment of the present invention；
Fig. 4 is the goods set schematic diagram of corresponding Fig. 2 provided in an embodiment of the present invention；
Fig. 5 is the module composition schematic diagram of goods boxing apparatus provided in an embodiment of the present invention.
Specific embodiment
Purpose, technical scheme and advantage for making the embodiment of the present invention is clearer, below in conjunction with the embodiment of the present invention
Middle accompanying drawing, to the embodiment of the present invention in technical scheme be clearly and completely described, it is clear that described embodiment is only
It is a part of embodiment of the invention, rather than whole embodiments.The present invention generally described and illustrated in accompanying drawing herein is real
The component for applying example can be arranged and be designed with a variety of configurations.Therefore, below to the present invention's that provides in the accompanying drawings
The detailed description of embodiment is not intended to limit the scope of claimed invention, but is merely representative of the selected reality of the present invention
Apply example.It is based on embodiments of the invention, the institute obtained on the premise of creative work is not made by those skilled in the art
There is other embodiment, belong to the scope of protection of the invention.
Consider that correlation technique belongs to mathematic programming methods mostly for the derivation algorithm of BPPC problems, implement very
Complexity, and the computational efficiency when problem scale is larger is very low, causes goods boxing efficiency in correlation technique relatively low, the present invention
A kind of goods packing method and device is provided, is specifically described with reference to embodiment.
Fig. 1 is the schematic flow sheet of goods packing method provided in an embodiment of the present invention, as shown in figure 1, the method includes
Following steps：
Step S102, sets up goods conflict relationship non-directed graph, goods according to the conflict relationship between each goods to be cased
, there is line segment connection between two goods of conflict relationship in each vertex correspondence each goods in thing conflict relationship non-directed graph；
Step S104, begins stepping through goods conflict relationship non-directed graph, in each ergodic process, root from each summit respectively
Each summit is coloured according to the annexation between each summit, traveled through corresponding color rendering intent every time, the coloring
In scheme, two vertex colorings that there is annexation are different colours, and two vertex colorings that there is no annexation are same
One color；
Step S106, selects the color rendering intent minimum using number of colors, root in corresponding color rendering intent is traveled through every time
Feasible vanning scheme is determined according to using the minimum color rendering intent of number of colors；
Step S108, if the container quantity used by the feasible vanning scheme is less than predetermined initial vanning scheme institute
The container quantity for using, then update initial vanning scheme according to the feasible vanning scheme, otherwise, retains initial vanning scheme；
Step S110, circulation execute the action of above-mentioned traversal goods conflict relationship non-directed graph to the initial vanning scheme of renewal
Or retaining the action of initial vanning scheme, until it reaches preset loop threshold value, obtained after being up to preset loop threshold value are first
Beginning vanning scheme carries out goods vanning as final vanning scheme according to final vanning scheme.
In the embodiment of the present invention, the conflict relationship between multiple goods is represented by goods conflict relationship non-directed graph, profit
The goods that the goods that there is conflict relationship is distinguished with the mode of vertex coloring and there is no conflict relationship, with predetermined initial
Vanning scheme is boundary value, determines optimum vanning scheme, carry out goods according to final vanning scheme by the way of loop iteration
Vanning.Method in due to the embodiment of the present invention solve BPPC problems when, by solution procedure be converted to goods conflict relationship without
The loop iteration of foundation, vertex coloring and feasible vanning scheme to figure, is solving in this solution mode and correlation technique
The mathematic programming methods adopted during BPPC problems are compared, and solution throughway is more simple clear, and solving complexity is low, more easily
Realize, solution efficiency can be improved by the method in the embodiment of the present invention therefore, and then improve goods boxing efficiency, solve phase
The relatively low problem of goods boxing efficiency in the technology of pass.
In above-mentioned steps S102, goods conflict relationship is set up according to the conflict relationship between each goods to be cased undirected
Figure, in the goods conflict relationship non-directed graph, there is line segment between two goods of conflict relationship in one goods of each vertex correspondence
Connection, is not connected between two goods that there is no conflict relationship.Wherein, two goods that there is conflict relationship are referred to and cannot be filled
Enter two goods of same container, the classification of such as two pieces goods determines that this two pieces goods has conflict relationship, it is impossible to load same
There is conflict relationship in one container, the gross weight that and for example the weight sum of two pieces goods can be born, this two pieces goods more than container,
Same container cannot be loaded, and for example, the volume sum of two pieces goods more than the cumulative volume that container can bear, deposit by this two pieces goods
In conflict relationship, it is impossible to load same container.
In a kind of specific embodiment, obtain goods list, in goods list record need each goods for being cased and
Each goods to be cased is mapped to a undirected graph structure G=according to goods list by the conflict relationship between each goods
On (V, E), each vertex correspondence each goods in the figure in vertex set V, between the corresponding goods in each bar side in line set E
Conflict relationship, that is, exist between the corresponding summit of two pieces goods of conflict relationship by a nonoriented edge connection, this non-directed graph G
=(V, E) is above-mentioned goods conflict relationship non-directed graph.Wherein, the conflict relationship between goods includes the conflict of goods itself
Relation, the such as classification by goods A and goods B determine that goods A and goods B can not be placed in same container, also include according to goods
Conflict relationship between the goods that case weight determines, such as to any two pieces goods i, j, if wi+wj>C, then this two pieces goods it
Between there is conflict relationship, it is impossible to be placed in same container, wherein, wi、wjGoods i is represented, the weight of j, C represent the power of container
Weight, weight here can be the parameters such as volume, weight.
During computer is realized, the vertex type in goods conflict relationship non-directed graph G=(V, E) is needed comprising multiple
Attribute, in addition to summit is numbered, in addition it is also necessary to numbering, weight including vertex correspondence goods, conflict goods list, work as in figure G
In number of degrees value and the summit whether be colored.For any vertex v ∈ V, corresponding property value is described as follows.
V ← (vertexIndex, cargoIndex, weight, conflictList, degree, colored), therein
Whether property value is followed successively by summit numbering, CN, goods weight, conflict relationship, number of degrees value, is colored.
Conflict relationship in figure G is represented by non-directed graph adjacency matrix, is designated as conflictGraph, for any
Two summit i, j ∈ V, if there is (i, j) ∈ E, then, conflictGraph [i] [j]=1；Otherwise, conflictGraph [i]
[j]=0.It is a undirected simple graph in view of goods conflict relationship non-directed graph, corresponding adjacency matrix is necessarily based on main diagonal
Line is symmetrical, when therefore storing to which in the middle of the computer, can only record the part of its lower triangle.In addition, being based on
ConflictGraph matrixes, can conveniently draw the list of conflict goods and its number of degrees value in figure G on each summit, be easy to
Subsequent algorithm reads and calls.
Fig. 2 is the schematic diagram of goods conflict relationship non-directed graph provided in an embodiment of the present invention, as shown in Fig. 2 the goods punching
Tip out system non-directed graph includes 1,2,3,4,5 five goods, and table 1 below is the goods list of corresponding Fig. 2, each goods in Fig. 2
Conflict relationship is as shown in table 1.
Table 1
| Current cargo | Conflict goods |
| 1 | 2、4 |
| 2 | 1、5 |
| 3 | 5 |
| 4 | 1 |
| 5 | 2、3 |
By step S102, the conflict relationship of each goods and each goods can be showed by the form of non-directed graph,
It is to solve for obtaining multiple standing cargo collection due to solving BPPC the name of the games, the goods that each standing cargo is concentrated does not have punching
Tip out system, this are consistent completely with the Vertex Coloring Model in non-directed graph, therefore after step S102, in addition it is also necessary to by step S104
Each summit in goods conflict relationship non-directed graph is coloured, colouring results are the corresponding top of goods that there is conflict relationship
For different colours, the corresponding summit of goods that there is no conflict relationship is same color to point, so as to pass through vertex color opposite vertexes
Make a distinction with goods, obtain multiple standing cargo collection, the goods that standing cargo is concentrated does not have conflict relationship, Neng Goufang each other
Put in same container.
In above-mentioned steps S104, each summit from goods conflict relationship non-directed graph begins stepping through goods conflict relationship respectively
Non-directed graph, by taking a summit as an example, begins stepping through goods conflict relationship non-directed graph from a summit, in ergodic process, to all
Summit is coloured, and is obtained a color rendering intent, is carried out according to this, respectively from each summit begin stepping through goods conflict relationship without
After terminating to figure, multiple color rendering intents can be obtained, the quantity of color rendering intent is identical with summit quantity.In ergodic process, in order to
Ensure to obtain multiple standing cargo collection, set two vertex colorings that there is annexation and there is connection pass as different colours, not
Two vertex colorings of system are same color, so that the corresponding summit of the goods that there is conflict relationship is different colours, no
The corresponding summit of goods that there is conflict relationship is same color, makes a distinction so as to pass through vertex color opposite vertexes and goods,
Obtain multiple standing cargo collection.
In above-mentioned steps S104, goods conflict relationship non-directed graph is begun stepping through from each summit respectively, traversed every time
Cheng Zhong, colours to each summit according to the annexation between each summit, is traveled through corresponding color rendering intent every time,
Specific implementation can be：
Each summit is coloured to current starting point by step S1041 respectively as starting point.
Available colors list is provided with the present embodiment, includes multiple face for vertex coloring in the available colors list
Color, each color have corresponding priority, when colouring to current starting point, preferably from excellent in available colors list
First level highest color is coloured to current starting point.
Step S1042, determines the representative points of current starting point traversal, according between current starting point and representative points
Annexation is coloured to representative points.
After to current starting point coloring, it is thus necessary to determine that the representative points of current starting point traversal, namely current starting point
The next summit for needing coloring, in the present embodiment, calculates the probability for being transferred to remaining each summit by current starting point, selects
The summit of maximum probability is used as representative points.After determining representative points, according to the connection between current starting point and representative points
Relation pair representative points are coloured, and specifically, if there is no annexation between representative points and current starting point, are selected
Representative points are coloured with current starting point identical color, otherwise, select the color of original highest priority
Representative points are coloured.
When there is no annexation between representative points and current starting point, the corresponding goods of representative points being described and is worked as
There is no conflict relationship in the corresponding goods of front starting point, in the case of this kind, the corresponding goods of representative points and current starting point pair
The goods that answers can be placed in same container, therefore select to carry out representative points with current starting point identical color
Color, when there is annexation between representative points and current starting point, illustrates the corresponding goods of representative points and current starting
There is conflict relationship in the corresponding goods of point, in the case of this kind, the corresponding goods of representative points and the corresponding goods of current starting point
Cannot be placed on and in same container, therefore select the color of original highest priority to carry out representative points.
Step S1043, using impact point as current starting point, goes to representative points and determines that step cycle is executed, until each
Individual summit colours, and obtains when time corresponding color rendering intent of traversal.
After to representative points coloring, using representative points as current starting point, go to the circulation of step S1042 and execute, determine
Representative points, repeat step S1042 and step S1043, until each summit colours in goods conflict relationship non-directed graph,
So far complete once to travel through, currently traveled through corresponding color rendering intent.
Step S1044, for remaining each starting point, repeats above-mentioned initial Point Coloring, representative points determination, representative points
Coloring process, until traveled through corresponding color rendering intent every time.
By step S1041 to step S1043, whole goods conflict relationship can be traveled through from a starting point undirected
Figure, to all vertex colorings in ergodic process, obtains a color rendering intent, for remaining each starting point, in addition it is also necessary to respectively
From remaining, each starting point travels through whole goods conflict relationship non-directed graph, until being traveled through corresponding coloring side every time
Case.
By step S104, multiple color rendering intents can be obtained, the quantity of color rendering intent is identical with summit quantity.Fig. 3 is
The coloring schematic diagram of the goods conflict relationship figure shown in Fig. 2 provided in an embodiment of the present invention, as shown in figure 3, goods 2,3,4 is coloured
(represented with horizontal line in figure) into same color, goods 1 and 5 is colored as same color.
After step s 104, in addition it is also necessary to execution step S106, from travel through every time in corresponding color rendering intent select use
The minimum color rendering intent of number of colors, determines the corresponding feasible vanning scheme of the color rendering intent minimum using number of colors.
In above-mentioned steps S106, preferably feasible according to being determined using the minimum color rendering intent of number of colors in the following manner
Vanning scheme：
Step S1061, in the color rendering intent minimum using number of colors, by corresponding for the vertex set of same color goods
Thing set obtains multiple goods set as the goods set that there is no conflict relationship, for each goods set, according to goods
The descending order of thing weight carries out goods vanning.
Due to there is no conflict relationship between the goods of color identical vertex correspondence, therefore by the vertex set of same color
Corresponding goods set is closed as the goods set that there is no conflict relationship, so as to obtain multiple goods set, for any one
Individual goods set, carries out goods vanning according to the descending order of goods weight.
Fig. 4 is the goods set schematic diagram of corresponding Fig. 2 provided in an embodiment of the present invention, as shown in figure 4, goods 2,3,4 is
One goods set, goods 1 and 5 are a goods set.
Specifically, for a goods set without conflict relationship, which is carried out according to the descending order of weight
Sequence, obtains goods list.First empty container is opened, the goods list after sequence is sequenced through, by the goods in goods list
Thing loads in the container, when the Weighted residue in first container is not less than the goods weight for traversing, the goods is loaded
In the container, otherwise, the goods is skipped, continues to travel through other goods, in goods list after once traveling through, it is understood that there may be
Some goods could not load in first container, now open second empty container, according to mode before according to goods weight
Each goods is traveled through one by one, until goods all to be put into container.
It should be noted that goods weight referred herein and container weight, wherein weight can be the ginseng such as volume, weight
Number.
Step S1062, for multiple containers that each goods set is used, selects to utilize in each container for having used
The minimum container of rate, the goods in the container of selection is inserted in unselected container, is repeated container and is selected and goods insertion
Process, until during the goods in the container for selecting cannot be entirely insertable to unselected container.
For the goods set after the completion of a vanning, which can use multiple containers under normal circumstances, in order to improve each
The utilization rate of container, reduces container usage quantity, in the step, for the goods set after the completion of a vanning, selects to make
The minimum container of utilization rate in each container, an i.e. goods gross weight goods minimum with the ratio of container maximum load
Case, is inserted in unselected container by adapting to the goods in container of the bin packing algorithm by selection first, if it is possible to will choosing
During goods in the container that selects is entirely insertable to unselected container, then container quantity subtracts one, and repeat used each
The minimum container of Selection utilization rate in container, repeats goods insertion process, until the goods in the container for selecting cannot be complete
Portion is inserted in unselected container, if during cannot be entirely insertable the goods in the container of selection to unselected container,
Then container quantity is constant.
Step S1063, the assembly relation note between each container that each goods set is used and corresponding goods
Record is got off, used as using the corresponding feasible vanning scheme of the minimum color rendering intent of number of colors.
Used container quantity can also be recorded in feasible vanning scheme, by step S1062 in adaptation first dress
Case algorithm can reduce container quantity.
The embodiment of the present invention generate feasible vanning scheme when, based on " large cargo is preferentially cased " and " intensive vanning " two
Item heuristic strategies are improved to adapting to bin packing algorithm first, it is possible to increase the utilization rate of container, reduce container usage quantity.
Previously generated initial vanning scheme in the embodiment of the present invention, this initially the scheme of casing be that finally vanning scheme is asked
Solution border, after feasible vanning scheme is determined, executes above-mentioned steps S108, the container number used by the feasible vanning scheme of comparison
Amount and the initially container quantity used by vanning scheme, if the container quantity used by feasible vanning scheme is less than predetermined
The container quantity used by initial vanning scheme, then the content update of scheme of initially being cased is feasible vanning scheme, if feasible
The container quantity used no less than predetermined initial vanning scheme by the container quantity used by vanning scheme, then keep just
The content of beginning vanning scheme is constant.
The core thinking of the present invention is to repeat to carry out the summit of goods conflict relationship non-directed graph in preset loop threshold value
Coloring, so as to iteration is initially cased scheme, therefore the embodiment of the present invention also needs to execute above-mentioned step S110, step S110
In, circulation step S104 is to step S106, until it reaches preset loop threshold value, such as 100 times, obtains after being up to preset loop threshold value
The initial vanning scheme for arriving carries out goods vanning as final vanning scheme according to final vanning scheme.
The determination process of initial vanning scheme is additionally provided in the embodiment of the present invention, specifically, according to goods conflict relationship
Annexation in non-directed graph between each degree of vertex value and each summit is coloured to each summit, is obtained initial
Color scheme, in initial color rendering intent, the summit that there is no annexation is same color, and the summit that there is annexation is difference
Color；Initial vanning scheme is determined according to initial color rendering intent.
Further, the embodiment of the present invention generates initial color rendering intent by procedure below：
(1) selectance numerical value highest summit, to select summit colour, by coloring after summit be included into coloring top
Point set, coloring vertex set are initially empty set；
(2) according to the annexation between each summit and uncoloured each summit in coloring vertex set to not
Each summit of color is classified, and the class summit that there is no annexation with each summit coloured in vertex set is made
For being not connected to vertex set, will there is a class summit of annexation as being connected vertex set with the summit in coloring vertex set
Close；
(3) be not connected to summits most with abutment points quantity in vertex set is connected be selected in vertex set, adopting
With colouring to the summit for selecting with number of degrees value highest summit identical color, go to above-mentioned summit and be included into actuation cycle
Execute, until being not connected to vertex set for sky；
(4) it is not space-time in connection vertex set, the actuation cycle for going to above-mentioned selectance numerical value highest summit holds
OK, until all summits are colored, using the coloring case on each summit as initial color rendering intent.
Specifically, when initial color rendering intent is generated, selectance numerical value highest summit is entered to number of degrees value highest summit
Row coloring, it is preferred to use the untapped color of highest priority is coloured to number of degrees value highest summit, by coloring after
Coloring vertex set is included on summit, and coloring vertex set is initially empty set, and now coloring vertex set includes a summit, i.e.,
Number of degrees value highest summit.
Remaining each summit uncoloured is classified according to the annexation between each summit, obtain being not connected to collect
Close and articulation set, be not connected to collect the set for being combined into the summit for not having annexation with number of degrees value highest summit, articulation set
It is the set on the summit that there is annexation with number of degrees value highest summit, selects in vertex set is not connected to and be connected summit
A most summit of abutment points quantity in set, summit and the number of degrees value highest summit due to being not connected in vertex set do not have
There is annexation, therefore using colouring to the summit for selecting with number of degrees value highest summit identical color.
Go to above-mentioned summit and be included into actuation cycle execution, coloring vertex set is included on the summit, and is repartitioned not
Connection vertex set and connection vertex set, and continue to select vertex coloring in vertex set is not connected to, so circulation is held
OK, until being not connected to vertex set for sky.
As, in this cyclic process, there is no annexation with the summit for colouring in the summit for selecting every time, therefore
When vertex set is not connected to for space-time, the summit coloured in vertex set is same color, therefore passes through the cyclic process energy
An independent vertex set is accessed, between the summit in the vertex set, there is no annexation.
If connection vertex set is not space-time, the actuation cycle for going to above-mentioned selectance numerical value highest summit is held
OK, coloured on connection vertex set selectance numerical value highest summit, so circulated, until all summits are colored,
Using the coloring case on each summit as initial color rendering intent.
In the embodiment of the present invention, the thought adopted when initial color rendering intent is obtained is the top for ceaselessly selecting and colouring
There is no the summit of annexation in point, be space-time when vertex set is not connected to, it becomes possible to obtain an independent vertex set, should
Summit in vertex set is same color, if connection vertex set is not sky, the process between repeating, until all tops
Point is colored.
In the embodiment of the present invention, determined in the process and above-mentioned steps S106 of initial vanning scheme according to initial color rendering intent
Consistent according to the process for determining feasible vanning scheme using the minimum color rendering intent of number of colors, namely adopt identical method root
Initial vanning scheme is determined according to initial color rendering intent, determine feasible vanning side according to using the minimum color rendering intent of number of colors
Case, is repeated no more here.
In a specific embodiment of the invention, ant group algorithm can be adopted to generate initial color rendering intent, and realize walking
Rapid S104 and step S110, scheme of finally being cased, detailed process are as follows.
1st, ant group algorithm parameter initialization
Ant group algorithm parameter mainly includes color value list, using color value list, ant quantity, greatest iteration time
Number, Pheromone Matrix, heuristic greedy method, eight contents of optimum vanning scheme and weight parameter.
CL：Color value list, according to the minimum chromatic number theorem in Combinational Mathematics, goods conflict relationship non-directed graph G=(V, E)
Middle degree of vertex maximum is Δ (G), then meet χ (G)≤Δ (G)+1 to scheming the minimum chromatic number value used when G is coloured, therefore,
Color value list can be initialized to CL={ 1,2 ..., Δ (G)+1 }.In color value list CL, the subscript of color value is less,
Priority is higher.
UCL：During vertex coloring, used color value list is initialized as sky.
antNum：Ant quantity in ant group algorithm, at the beginning of for goods conflict relationship non-directed graph G=(V, E), ant quantity
Beginning turns to | V |.
maxIterNum：The maximum iteration time of ant group algorithm, is initialized as 100 times.
(τij)n×n：The Pheromone Matrix of ant group algorithm, its implication refer to ant opposite vertexes viAfter completing shading operations, connect
Get off opposite vertexes vjThe possibility size for being coloured, under original state, (τij)n×nIn each element be initialized as 1, wherein
I, j are summit numbering.
(ηij)n×CL：The heuristic greedy method of ant group algorithm, its are meant that finger using color value j opposite vertexes viColoured
Evaluation result.It is initialized asDuring vertex coloring, a kind of color value, the number of heuristic greedy method is often increased newly
Value is also adjusted therewith.
bestPackingSolution：The optimum vanning scheme that record current time has drawn, is initialized as sky.
In addition, the weight parameter in ant group algorithm mainly includes pheromones weight (α), heuristic greedy method weight (β) and letter
Breath element volatilization weight (ρ) three class, sets it to α=β=1 and ρ=0.5 during initialization.
2nd, initial vanning scheme is generated by greedy selection strategy
Step1：Define key data structure.
CV：The vertex list for colouring is completed, sky is initialized as；
UCV：It is not colored, and there is no the vertex list of conflict relationship with each summit in CV, is initialized as goods punching
Vertex set V in tip out system non-directed graph G；
UCV'：It is not colored, and there is the vertex list of conflict relationship with some of CV summit, is initialized as sky.
Step2：Based on the adjacency matrix conflictGraph of goods conflict relationship non-directed graph G, by formulaCalculate arbitrary vertex viThe number of degrees value of ∈ V, and result of calculation is assigned to viDegree attributes.
Step3：The maximum summit of the number of degrees is chosen from the vertex set V of goods conflict relationship non-directed graph GFrom a minimum color of subscript in color value list CL to vmaxColoring, and pass through vmax
Colored attributes be marked, then the color for being used is added in UCL.
Step4：By vmaxCV is inserted into, and u ∈ UCV and (u, v is met by allmax) summit of ∈ E is transferred to from UCV
In the middle of UCV'.
Step5：Judge whether UCV is empty, if UCV non-NULLs, choose from UCV most with UCV' abutment points quantity
One vertex v 'max, which is coloured and by v 'maxIt is added in CV, then will be all with v ' in the middle of UCVmaxAdjacent summit
It is transferred in the middle of UCV'.
Step6：If UCV is that sky, all summits in current CV constitute independent sets of figure G, record is corresponding
Color value after emptied.
Step7：Branch condition judgement is carried out, if UCV' non-NULLs, summit therein is transferred completely in the middle of UCV, and
Go to Step2；Otherwise, algorithm terminates, output vertex color rendering intent.
Based on the initial color rendering intent that above-mentioned algorithm is obtained, by way of in above-mentioned steps S106, according to initial coloring
Scheme determines initial vanning scheme, so as to obtain an initial feasible solution of BPPC models, and is assigned to
bestPackingSolution.
3rd, goods conflict relationship non-directed graph is iterated over, scheme of finally being cased.
Step1：By way of the random pathfinding of ant, before each iteration starts, antNum ant is corresponded
Each summit being randomly placed on figure G on, ant quantity is identical with summit quantity, and be goods conflict relationship non-directed graph G
On each summit safeguard an available color value list availableColorList, under original state
AvailableColorList=CL.
Step2：For the vertex v that ant k is currently located, subscript is chosen from its corresponding availableColorList
The minimum color value opposite vertexes v of value is coloured, and to other summits pair in goods conflict relationship non-directed graph G adjacent with v
The availableColorList for answering is updated, and therefrom leaves out the color value for just having used.
Step3：Remaining does not colour the state transition probability between summit in figure G to calculate current vertexComputing formula
As follows, wherein, i, j represent the summit that ant is currently located and the summit that any one has not visited respectively.
Represent the vertex set that ant k had been accessed
Step4：Choose the maximum summit of state transition probability value, if the summit with redirect before summit be connected, select
In availableColorList, the minimum color of original subscript is coloured to the summit, and is updated used
Color value list UCL, and simultaneously update the heuristic greedy method of ant group algorithm, otherwise, summit identical face before selecting and redirecting
Color is coloured to the summit；
Step5：If also having, in figure G, the summit not being colored, jump to Step3 and proceed to redirect coloring.
Step6：For other ants, summit access and coloring is carried out using above-mentioned steps Step2 to step Step5, directly
Access to every ant and complete figure G, coloured to scheming each summit in G, so far, multiple coloring sides can be obtained
Case, the quantity of color rendering intent and the quantity of ant, namely the quantity on summit is identical.
Step7：One group of minimum color rendering intent of number of colors used in current iteration is chosen, is generated based on the color rendering intent
Feasible vanning scheme, generating process obtain a feasible solution of BPPC models as shown in above-mentioned step S106, and by the feasible solution
It is compared with bestPackingSolution, will be assigned to using the less scheme of container quantity
BestPackingSolution is preserved.And iterations is added one.
Step8：Branch condition judgement is carried out, if iterations is more than maxIterNum, terminates ant group algorithm, output
bestPackingSolution；Otherwise, Step9 is executed.
Step9：Global renewal is carried out to the Pheromone Matrix of ant group algorithm, computing formula is as follows.
Wherein, ρ ∈ (0,1) be pheromones volatilization weight,Be ant k during current iteration to optimum coloring side
The contribution margin of case, its computing formula are as follows：
MinColorNum represents minimum color value quantity of the ant group algorithm used in current iteration process.
Step10：Each search parameter of every ant is reset, and jumps to Step1 and start next round iteration.
The coloring process in the embodiment of the present invention and vanning schemes generation process are realized using ant algorithm, it is possible to increase
The solution efficiency of BPPC algorithms, improves article boxing efficiency, and the modeling for same problems and solution provides reference.From above-mentioned reality
Apply example to draw, the embodiment of the present invention is operated for the decoupling that BPPC problems are capable of effectively problem of implementation solution procedure, in conjunction with
Vanning planning algorithm after improvement, finally can effectively try to achieve the approximate optimal solution of problem.It is experimentally confirmed, the present invention is implemented
Example can realize Efficient Solution to the example of different goods scales and conflict density.
Corresponding above-mentioned goods packing method, the embodiment of the present invention additionally provide a kind of goods boxing apparatus, and Fig. 5 is this
The module composition schematic diagram of the goods boxing apparatus that bright embodiment is provided, as shown in figure 5, the device includes：
Non-directed graph sets up module 51, for setting up goods conflict pass according to the conflict relationship between each goods to be cased
It is non-directed graph, each vertex correspondence in the goods conflict relationship non-directed graph each described goods has the two of conflict relationship
Line segment connection between the individual goods；
Traversal staining module 52, for beginning stepping through the goods conflict relationship non-directed graph from summit each described respectively,
In each ergodic process, summit each described is coloured according to the annexation between each described summit, obtained every
The corresponding color rendering intent of secondary traversal, in the color rendering intent, two vertex colorings that there is annexation are different colours,
Two vertex colorings that there is no annexation are same color；
Scheme determining module 53, for selecting using the minimum institute of number of colors being traveled through in corresponding color rendering intent every time
Color rendering intent is stated, and feasible vanning scheme is determined according to using the minimum color rendering intent of number of colors；
Scheme update module 54, if be less than for the container quantity used by the feasible vanning scheme predetermined first
The container quantity used by beginning vanning scheme, then update the initial vanning scheme according to the feasible vanning scheme, otherwise, protects
Stay the initial vanning scheme；
Vanning module 55, for circulating the action for executing the above-mentioned traversal goods conflict relationship non-directed graph to updating
State initial vanning scheme or retain the action of the initial vanning scheme, until it reaches preset loop threshold value, be up to described
The described initial vanning scheme obtained after preset loop threshold value is carried out according to the final vanning scheme as final vanning scheme
Goods is cased.
In the embodiment of the present invention, the conflict relationship between multiple goods is represented by goods conflict relationship non-directed graph, profit
The goods that the goods that there is conflict relationship is distinguished with the mode of vertex coloring and there is no conflict relationship, with predetermined initial
Vanning scheme is boundary value, determines optimum vanning scheme, carry out goods according to final vanning scheme by the way of loop iteration
Vanning.Method in due to the embodiment of the present invention solve BPPC problems when, by solution procedure be converted to goods conflict relationship without
The loop iteration of foundation, vertex coloring and feasible vanning scheme to figure, is solving in this solution mode and correlation technique
The mathematic programming methods adopted during BPPC problems are compared, and solution throughway is more simple clear, and solving complexity is low, more easily
Realize, solution efficiency can be improved by the device in the embodiment of the present invention therefore, and then improve goods boxing efficiency, solve phase
The relatively low problem of goods boxing efficiency in the technology of pass.
Above-mentioned traversal staining module 52 includes：
First sub-module, for respectively using each described summit as starting point, colouring to current starting point；
Second sub-module, for determining the representative points of current starting point traversal, according to the current starting point with described
Annexation between representative points is coloured to the representative points；Redirect submodule, for using the impact point as
The current starting point, goes to representative points and determines that step cycle is executed, until each described summit colours, obtains when secondary time
Go through corresponding color rendering intent；Repeat submodule, for each described starting point for remaining, repeat above-mentioned initial Point Coloring, mesh
Mark summit determines, representative points coloring process, until being traveled through corresponding color rendering intent every time.
Specifically, second sub-module specifically for：Calculate by the current starting point be transferred to remaining each described in
The probability on summit, selects the summit of the maximum probability as representative points；If the representative points with described current
There is no annexation between initial point, then select to carry out the representative points with the current starting point identical color
Color, otherwise, selects the color of original highest priority to colour the representative points.
Such scheme determining module 53 includes：Initial vanning submodule, for using number of colors minimum described in
In color scheme, using the set of corresponding for the vertex set of same color goods as the goods set that there is no conflict relationship, obtain
Multiple goods set, for goods set each described, carry out goods dress according to the descending order of goods weight
Case；Goods inserts submodule, for the multiple containers used for goods set each described, selects each goods for having used
The minimum container of utilization rate in case, the goods in the container that will be selected are inserted in the unselected container, weight
Multiple container is selected and goods insertion process, until the goods in the container for selecting cannot be entirely insertable to unselected described
In container；Record sub module, between each described container for using each described goods set and corresponding goods
Assembly relation record, as using the corresponding feasible vanning scheme of the minimum color rendering intent of number of colors.
Further, the device in the embodiment of the present invention also includes：
Initial vanning scheme determining module, for the degree according to each summit in the goods conflict relationship non-directed graph
Annexation between numerical value and each summit is coloured to summit each described, obtains initial color rendering intent, described
In initial color rendering intent, the summit that there is no annexation is same color, and the summit that there is annexation is different colours, root
Initial vanning scheme is determined according to the initial color rendering intent.
The initial vanning scheme determining module includes：First choice submodule, for pushing up described in selectance numerical value highest
Point, to select the summit colour, by coloring after the summit be included into coloring vertex set, the coloring vertex set
Conjunction is initially empty set；Classification submodule, for according to each summit in the coloring vertex set and each institute uncoloured
The annexation that states between summit is classified to each described summit uncoloured, by with described coloring vertex set in each
There is no a class summit of annexation as being not connected to vertex set in individual summit, by with the coloring vertex set in top
There is a class summit of annexation as connection vertex set in point；Second selects submodule, for being not connected to summit described
Select in set and described connection vertex set in a most summit of abutment points quantity, using with described in number of degrees value highest
Summit identical color is coloured to the summit for selecting, and is gone to above-mentioned summit and is included into actuation cycle execution, until institute
State vertex set is not connected to for sky；Cyclic submodule block, for being not space-time in the connection vertex set, goes to above-mentioned selection
The actuation cycle on summit described in number of degrees value highest is executed, until all summits are colored, by the coloring on each summit
Situation is used as initial color rendering intent.
In a specific embodiment of the invention, the device in the embodiment of the present invention can be realized using ant group algorithm,
Detailed process is repeated no more here with described in aforesaid method.The coloring in the embodiment of the present invention is realized using ant algorithm
Journey and vanning schemes generation process, it is possible to increase the solution efficiency of BPPC algorithms, improve article boxing efficiency, and are same problems
Modeling and solve provide reference.Can draw from above-described embodiment, the embodiment of the present invention can be effectively real for BPPC problems
The decoupling operation of existing problem solving process, in conjunction with improvement after vanning planning algorithm, finally can effectively try to achieve the approximate of problem
Optimal solution.It is experimentally confirmed, the embodiment of the present invention can be realized efficiently asking to the example of different goods scales and conflict density
Solution.
The goods boxing apparatus provided by the embodiment of the present invention for the specific hardware on equipment or can be installed on equipment
On software or firmware etc..The device provided by the embodiment of the present invention, its realize technique effect and the aforementioned side of principle and generation
Method embodiment is identical, is brief description, and device embodiment part does not refer to part, refers in corresponding in preceding method embodiment
Hold.Those skilled in the art can be understood that, for convenience and simplicity of description, system described above, device
With the specific work process of unit, the corresponding process in said method embodiment is may be referred to, be will not be described here.
In embodiment provided by the present invention, it should be understood that disclosed apparatus and method, other sides can be passed through
Formula is realized.Device embodiment described above is only that schematically for example, the division of the unit, only one kind are patrolled
Volume function is divided, and can have other dividing mode when actually realizing, and for example, multiple units or component can in conjunction with or can
To be integrated into another system, or some features can be ignored, or not execute.Another, shown or discussed each other
Coupling or direct-coupling or communication connection can be INDIRECT COUPLING or communication link by some communication interfaces, device or unit
Connect, can be electrical, mechanical or other forms.
The unit that illustrates as separating component can be or may not be physically separate, aobvious as unit
The part for showing can be or may not be physical location, you can be located at a place, or can also be distributed to multiple
On NE.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in the embodiment that the present invention is provided can be integrated in a processing unit, also may be used
Being that unit is individually physically present, it is also possible to which two or more units are integrated in a unit.
If the function is realized using in the form of SFU software functional unit and as independent production marketing or when using, can be with
It is stored in a computer read/write memory medium.Such understanding is based on, technical scheme is substantially in other words
The part contributed by prior art or the part of the technical scheme can be embodied in the form of software product, the meter
Calculation machine software product is stored in a storage medium, is used including some instructions so that a computer equipment (can be individual
People's computer, server, or network equipment etc.) execute all or part of step of each embodiment methods described of the invention.
And aforesaid storage medium includes：USB flash disk, portable hard drive, read-only storage (ROM, Read-Only Memory), arbitrary access are deposited
Reservoir (RAM, Random Access Memory), magnetic disc or CD etc. are various can be with the medium of store program codes.
It should be noted that：Similar label and letter represent similar terms in following accompanying drawing, therefore, once a certain Xiang Yi
It is defined in individual accompanying drawing, then in subsequent accompanying drawing which further need not be defined and be explained, additionally, term " the
One ", " second ", " the 3rd " etc. are only used for distinguishing description, and it is not intended that indicating or hint relative importance.
Finally it should be noted that：Embodiment described above, the only specific embodiment of the present invention, in order to illustrate the present invention
Technical scheme, rather than a limitation, protection scope of the present invention is not limited thereto, although with reference to the foregoing embodiments to this
Bright be described in detail, it will be understood by those within the art that：Any those familiar with the art
The invention discloses technical scope in, which still can be modified to the technical scheme described in previous embodiment or can be light
Change is readily conceivable that, or equivalent is carried out to which part technical characteristic；And these modifications, change or replacement, do not make
The essence of appropriate technical solution departs from the spirit and scope of embodiment of the present invention technical scheme.The protection in the present invention should all be covered
Within the scope of.Therefore, protection scope of the present invention described should be defined by scope of the claims.
Claims (10)
1. a kind of goods packing method, it is characterised in that methods described includes：
Goods conflict relationship non-directed graph, the goods conflict relationship are set up according to the conflict relationship between each goods to be cased
, there is line segment connection between two goods of conflict relationship in each vertex correspondence in non-directed graph each described goods；
The goods conflict relationship non-directed graph is begun stepping through respectively from summit each described, in each ergodic process, according to each
Annexation between the individual summit is coloured to summit each described, is traveled through corresponding color rendering intent, institute every time
State in color rendering intent, two vertex colorings that there is annexation are different colours, there are no two institutes of annexation
Vertex coloring is stated for same color；
Select in corresponding color rendering intent is traveled through every time using the minimum color rendering intent of number of colors, according to using color
The color rendering intent of minimum number determines feasible vanning scheme；
If the container used less than predetermined initial vanning scheme by the container quantity used by the feasible vanning scheme
Quantity, then update the initial vanning scheme according to the feasible vanning scheme, otherwise, retains the initial vanning scheme；
Circulation execute the action of the above-mentioned traversal goods conflict relationship non-directed graph to update the initial vanning scheme or
Retain the action of the initial vanning scheme, until it reaches preset loop threshold value, obtain after being up to the preset loop threshold value
Described initial vanning scheme as final vanning scheme, carry out goods vanning according to the final vanning scheme.
2. method according to claim 1, it is characterised in that described begin stepping through the goods from summit each described respectively
Thing conflict relationship non-directed graph, in each ergodic process, according to the annexation between each described summit to top each described
Point is coloured, and is traveled through corresponding color rendering intent every time, including：
Respectively each described summit is coloured as starting point to current starting point；
Determine the representative points of the current starting point traversal, according to the company between the current starting point and the representative points
Connect representative points described in relation pair to be coloured；
Using the impact point as the current starting point, go to representative points and determine that step cycle is executed, until described in each
Summit colours, and obtains when time corresponding color rendering intent of traversal；
Each described starting point for remaining, repeats above-mentioned initial Point Coloring, representative points determination, representative points coloring process,
Until being traveled through corresponding color rendering intent every time.
3. method according to claim 2, it is characterised in that the target top of the determination current starting point traversal
The representative points are coloured by point according to the annexation between the current starting point and the representative points, including：
Calculate the probability that remaining each summit is transferred to by the current starting point, select the top of the maximum probability
Point is used as representative points；
If there is no annexation between the representative points and the current starting point, select and the current starting point phase
Same color is coloured to the representative points, otherwise, selects the color of original highest priority to the target
Summit is coloured.
4. method according to claim 1, it is characterised in that described according to using the minimum coloring side of number of colors
Case determines feasible vanning scheme, including：
In using the minimum color rendering intent of number of colors, using the set of corresponding for the vertex set of same color goods as
There is no the goods set of conflict relationship, obtain multiple goods set, for goods set each described, according to goods
The descending order of weight carries out goods vanning；
For multiple containers that goods set each described is used, the minimum institute of utilization rate in each container for having used is selected
Container is stated, the goods in the container that will be selected is inserted in the unselected container, repeat container and select to insert with goods
Enter process, until during the goods in the container for selecting cannot be entirely insertable to the unselected container；
Each described container that each described goods set is used is recorded with the assembly relation between corresponding goods,
As using the corresponding feasible vanning scheme of the minimum color rendering intent of number of colors.
5. method according to claim 1, it is characterised in that the initial vanning scheme is determined by procedure below：
According to the connection in the goods conflict relationship non-directed graph between each described degree of vertex value and each summit
Each described summit of relation pair is coloured, and is obtained initial color rendering intent, in the initial color rendering intent, be there is no annexation
Summit be same color, exist annexation summit be different colours；
Initial vanning scheme is determined according to the initial color rendering intent.
6. method according to claim 5, it is characterised in that described according in the goods conflict relationship non-directed graph each
Annexation between the degree of vertex value and each summit is coloured to summit each described, is obtained initial
Color scheme, including：
Summit described in selectance numerical value highest, to select the summit colour, by coloring after the summit be included into
Coloring vertex set, the coloring vertex set are initially empty set；
According to the annexation between each summit and each described summit uncoloured in the coloring vertex set to not
Each described summit of coloring is classified, and will there is no annexation with each summit in the coloring vertex set
To there is a class summit of annexation with the summit coloured in vertex set as vertex set is not connected in one class summit
As connection vertex set；
It is not connected in vertex set select and a most summit of abutment points quantity in the connection vertex set described, adopts
With colouring to the summit for selecting with identical color in summit described in number of degrees value highest, go to above-mentioned summit and be included into
Actuation cycle is executed, until the vertex set that is not connected to is for sky；
It is not space-time in the connection vertex set, the actuation cycle for going to summit described in above-mentioned selectance numerical value highest is held
OK, until all summits are colored, using the coloring case on each summit as initial color rendering intent.
7. a kind of goods boxing apparatus, it is characterised in that described device includes：
Non-directed graph sets up module, undirected for setting up goods conflict relationship according to the conflict relationship between each goods to be cased
Figure, each vertex correspondence in the goods conflict relationship non-directed graph each described goods are present described in two of conflict relationship
Line segment connection between goods；
Traversal staining module, for beginning stepping through the goods conflict relationship non-directed graph from summit each described respectively, each
In ergodic process, summit each described is coloured according to the annexation between each described summit, traveled through every time
Corresponding color rendering intent, in the color rendering intent, two vertex colorings that there is annexation are different colours, do not exist
Two vertex colorings of annexation are same color；
Scheme determining module, for selecting using the minimum coloring of number of colors being traveled through in corresponding color rendering intent every time
Scheme, determines feasible vanning scheme according to using the minimum color rendering intent of number of colors；
Scheme update module, if be less than predetermined initial vanning for the container quantity used by the feasible vanning scheme
The container quantity used by scheme, then update the initial vanning scheme according to the feasible vanning scheme, otherwise, retains described
Initial vanning scheme；
Vanning module, described initial to updating for circulating the action for executing the above-mentioned traversal goods conflict relationship non-directed graph
Vanning scheme or the action of the reservation initial vanning scheme, until it reaches preset loop threshold value, are up to described presetting and follow
The described initial vanning scheme obtained after ring threshold value carries out goods dress as final vanning scheme according to the final vanning scheme
Case.
8. device according to claim 7, it is characterised in that the traversal staining module includes：
First sub-module, for respectively using each described summit as starting point, colouring to current starting point；
Second sub-module, for determining the representative points of current starting point traversal, according to the current starting point with
Annexation between the representative points is coloured to the representative points；
Submodule is redirected, determines that step cycle is held for the impact point, as the current starting point, is gone to representative points
OK, until each described summit colours, obtain when time corresponding color rendering intent of traversal；
Repeat submodule, for each described starting point for remaining, repeat above-mentioned initial Point Coloring, representative points determination, mesh
Mark vertex coloring process, until traveled through corresponding color rendering intent every time.
9. device according to claim 7, it is characterised in that the scheme determining module includes：
Initial vanning submodule, in the color rendering intent minimum using number of colors, by the vertex set of same color
Corresponding goods set is closed as the goods set that there is no conflict relationship, multiple goods set is obtained, for each institute
Goods set is stated, and goods vanning is carried out according to the descending order of goods weight；
Goods inserts submodule, for the multiple containers used for goods set each described, select to have used each
The minimum container of utilization rate in container, the goods in the container that will be selected are inserted in the unselected container,
Repeat container to select and goods insertion process, until the goods in the container for selecting cannot be entirely insertable to unselected institute
State in container；
Record sub module, for the dress between each described container for using each described goods set and corresponding goods
Get off with relation record, as using the corresponding feasible vanning scheme of the minimum color rendering intent of number of colors.
10. device according to claim 7, it is characterised in that described device also includes：
Initial vanning scheme determining module, for according to each described degree of vertex value in the goods conflict relationship non-directed graph
And the annexation between each described summit is coloured to summit each described, initial color rendering intent is obtained, described initial
In color rendering intent, the summit that there is no annexation is same color, and the summit that there is annexation is different colours, according to institute
State initial color rendering intent and determine initial vanning scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610997330.1A CN106503951A (en) | 2016-11-11 | 2016-11-11 | Goods packing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610997330.1A CN106503951A (en) | 2016-11-11 | 2016-11-11 | Goods packing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106503951A true CN106503951A (en) | 2017-03-15 |
Family
ID=58324179
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610997330.1A Pending CN106503951A (en) | 2016-11-11 | 2016-11-11 | Goods packing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106503951A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110494873A (en) * | 2017-09-04 | 2019-11-22 | 帕诺特克科学研究室 | For optimizing the method and system of positioning of the article at least one box |
| CN111047100A (en) * | 2019-12-17 | 2020-04-21 | 广东工业大学 | Method and system for packing logistics containers |
| CN111553636A (en) * | 2020-04-28 | 2020-08-18 | 成都米风感知科技有限公司 | Logistics tracking and tracing method, device and system based on UCL and storage medium |
| CN113672395A (en) * | 2021-10-22 | 2021-11-19 | 北京人人云图信息技术有限公司 | Task allocation device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2916268A1 (en) * | 2014-03-05 | 2015-09-09 | Fujitsu Limited | A computer-implemented k-shortest path finding method |
| CN104915817A (en) * | 2015-05-26 | 2015-09-16 | 亿赞普(北京)科技有限公司 | Loading method and apparatus for container |
-
2016
- 2016-11-11 CN CN201610997330.1A patent/CN106503951A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2916268A1 (en) * | 2014-03-05 | 2015-09-09 | Fujitsu Limited | A computer-implemented k-shortest path finding method |
| CN104915817A (en) * | 2015-05-26 | 2015-09-16 | 亿赞普(北京)科技有限公司 | Loading method and apparatus for container |
Non-Patent Citations (2)
| Title |
|---|
| YUAN YE 等: "An Improved ACO Algorithm for the Bin Packing Problem with Conflicts Based on Graph Coloring Model", 《2014 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (21TH)》 * |
| 元 野 等: "带冲突关系装箱问题的启发式求解算法", 《运筹与管理》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110494873A (en) * | 2017-09-04 | 2019-11-22 | 帕诺特克科学研究室 | For optimizing the method and system of positioning of the article at least one box |
| CN110494873B (en) * | 2017-09-04 | 2023-11-21 | 帕诺特克科学研究室 | Method and system for optimizing the positioning of items in at least one box |
| CN111047100A (en) * | 2019-12-17 | 2020-04-21 | 广东工业大学 | Method and system for packing logistics containers |
| CN111047100B (en) * | 2019-12-17 | 2020-10-09 | 广东工业大学 | Method and system for packing logistics containers |
| CN111553636A (en) * | 2020-04-28 | 2020-08-18 | 成都米风感知科技有限公司 | Logistics tracking and tracing method, device and system based on UCL and storage medium |
| CN113672395A (en) * | 2021-10-22 | 2021-11-19 | 北京人人云图信息技术有限公司 | Task allocation device |
| CN113672395B (en) * | 2021-10-22 | 2022-02-11 | 北京人人云图信息技术有限公司 | Task allocation device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106503951A (en) | Goods packing method and device | |
| CN103455841B (en) | Based on improving ant group algorithm and the container loading method of heuritic approach | |
| CN104680237A (en) | Three-dimensional encasement novel genetic algorithm model under multi-constrain condition | |
| CN109447317A (en) | A kind of warehouse shortest path first method based on more people picking simultaneously | |
| CN109359739A (en) | Stacked combination method, apparatus, equipment and storage medium based on genetic algorithm | |
| CN107977756B (en) | Ternary tree planning calculation method for solving three-dimensional packing problem | |
| CN107870964A (en) | A kind of sentence sort method and system applied to answer emerging system | |
| CN106033547A (en) | Color matching evaluation method and device, and dress collocation recommendation method and device | |
| CN106447186B (en) | The method and device that transporting equipment task is distributed in a kind of intelligent storage | |
| CN107330214A (en) | Spatial configuration optimal method based on discretization Yu heuristic evolution algorithm | |
| CN107392307A (en) | The Forecasting Methodology of parallelization time series data | |
| CN105550746A (en) | Training method and training device of machine learning model | |
| CN110046845A (en) | A kind of place vehicle loading method and Load System | |
| CN103473617A (en) | Three-dimensional packing overall optimization method and system for putting multiple goods and materials into multi-specification packets | |
| CN109214756A (en) | Based on ant group algorithm and the complete vehicle logistics dispatching method and device of hierarchy optimization, storage medium, terminal | |
| CN106683110A (en) | User terminal and object tracking method and device thereof | |
| CN107103441A (en) | Power Material sorting technique based on Self-Organizing Feature Maps | |
| CN103246941A (en) | Scheduling method for export container wharf pile-up space | |
| CN106952324A (en) | The parallel overlap-add procedure device and method of vector polygon rasterizing | |
| CN103886375A (en) | Resource scheduling optimization method based on binary space partitioning tree | |
| CN107688865A (en) | Identify the method and apparatus of potential high consumption user in online game | |
| CN106503092A (en) | A kind of method using multidimensional technique construction Spatial Multi-Dimensional degree search tree | |
| CN109993205A (en) | Time Series Forecasting Methods, device, readable storage medium storing program for executing and electronic equipment | |
| CN110348126A (en) | Steel mill's stockpile position layout optimization method, system, equipment and storage medium | |
| CN113570025A (en) | E-commerce storage center goods space distribution method based on discrete particle swarm algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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: 20170315 |
|
| RJ01 | Rejection of invention patent application after publication |