CN1936937A - Heuristic car-distribution method under multiple constraint conditions - Google Patents
Heuristic car-distribution method under multiple constraint conditions Download PDFInfo
- Publication number
- CN1936937A CN1936937A CNA2005100448502A CN200510044850A CN1936937A CN 1936937 A CN1936937 A CN 1936937A CN A2005100448502 A CNA2005100448502 A CN A2005100448502A CN 200510044850 A CN200510044850 A CN 200510044850A CN 1936937 A CN1936937 A CN 1936937A
- Authority
- CN
- China
- Prior art keywords
- goods
- space
- car
- expression
- row
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Loading Or Unloading Of Vehicles (AREA)
Abstract
Introducing heuristic strategy into specific loading procedure for vehicle, the system uses 3D loading space of cabinet in maximization and high efficiency. The method includes following characters and steps: first, determining all constraint condition and processing mode in procedure of distributing cargoes; next, applying heuristic strategy for deploy vehicle; then, partitioning cabinet space of vehicle, loading sequence carried out according to descending order according to cubage of space; determining ordering and positioning rules, ordering according to descending sequence of cubage of cargo to be loaded; positioning strategy is to take corner first, that is to say that cargo to be loaded is placed on a corner in 3D space in three dimension; finally, dividing space up, loading order in sequence: left space, right space and up space.
Description
Technical field
The present invention relates to a kind ofly based on the car-distribution method under the multi-constraint condition, this car-distribution method adopts heuritic approach and is applied to the cargo distribution process of logistics carrier, to improve the utilization factor of cabinet space.
Background technology
Rise and development along with present home and abroad logistics distribution industry, the application of cargo distribution correlation technique and development are subjected to paying attention to more and more, container body loading as main means of transport also just becomes the gordian technique of logistics distribution, and becomes the inexorable trend of logistics distribution cargo loading from now on.
Three dimensions vanning technology under multiple constraint condition or cargo loading requirement is widely used under the situations such as railway loading space, automobile bodies, steamer container.Existing logistics prestowage is comparatively original for the technology that cabinet space utilizes, the level of informatization is also not high, and most loglstics enterprises also do not adopt advanced intelligent computer management system for arranging cargo on vehicle transportations.In logistics prestowage process, the personnel that normally load decide loading order, putting position arrangement of goods etc. with the personal experience.Even this prestowage personnel have accumulated rich experience through long-term practice, but be individual subjective judgement and prediction eventually, therefore in the cargo loading process, exist all multiple errors inevitably, thereby cause that the vehicle load space availability ratio is low, work efficiency is on the low side and easily cause goods to be detained, thereby elongated distribution time, so that can't ensure efficiently dispensing promptly and accurately.
Existing improvement project is to adopt heuritic approach to load.At present, in the algorithm research of bin packing, the one dimension bin packing algorithm is ripe relatively, and traditional best one dimension bin packing algorithm is FFD (First-Fit Decreasing) algorithm among the document Near-Optimal bin packing algorithms, and this algorithm is earlier with a among the L
iBy series arrangement from big to small, and then use adaptive algorithm first, its asymptotic performance ratio is 11: 9.In addition, based on the packing method of two-dimensional space, mainly be, though there is theoretical result also deeply from the real work angle.As for three-dimensional packing method, because its complicacy and difficulty are bigger, therefore rarer application process is open, mainly is based on the thought of spatial decomposition or layer.Above-mentioned car-distribution method is under the multiple complicated constraint condition of reality, and its application is very restricted, and can't really be applied to the cargo distribution process of logistics carrier.
Summary of the invention
Heuristic car-distribution method under the multi-constraint condition of the present invention, its purpose is to address the above problem with deficiency heuristic strategies is incorporated in the concrete vehicle loading process, thereby system is being satisfied on the basis of various constraint conditions, realize the three-dimensional loading space of high efficiency maximum using casing.
Heuristic car-distribution method under the described multi-constraint condition, its solution core are that heuristic strategies is incorporated into joining in the car process of three-dimensional loading space.
So-called heuritic approach also can be regarded as " knack " that we often say.The experience of life is told us, uses " knack " to find the solution problem, often can reach the purpose of getting twice the result with half the effort.This knack is from experience, and is closely related with the problem of finding the solution, although do not guarantee necessarily to prove effective, good knack usually once with spirit, in most of the cases can be dealt with problems very soon.Understand theoretically, concerning many real work tasks,, can from example set, collect the information relevant, join the finishing time of car scheme thereby reduce, and draw solution apace with solving task based on former a plurality of solution examples.
The definition of heuritic approach is:
Consider to solve certain class practical problems P, the example collection of establishing its all solutions is D
P, for each example I ∈ D
P, a corresponding stand-by set S that separates is arranged
P(I), if to any given example I ∈ D
P, algorithm A can find a stand-by disaggregation σ ∈ S
P(I), claim that then algorithm A is the heuritic approach of problem P.
Use the heuristic car-distribution method under the multi-constraint condition of above-mentioned heuritic approach, its concrete resolution policy is:
One, at first, determine all constraint conditions and processing mode thereof in the cargo distribution process;
To the constraint condition processing mode in the method, introduce different variablees exactly and put the parameters such as priority of putting grade and cargo distribution order with the supporting requirement of representing disposing way, goods respectively, the end of joining box body such as goods.
Two, secondly, use the heuristic car-distribution strategy;
1, the goods of same kind needs disposable loading, the constraint condition of same kind goods is identical, it all is identical putting the priority of putting grade and cargo distribution order as its profile, volume size, supporting requirement, the end of joining box body, the goods of disposable whole same kind, can utilize the space as far as possible, it is higher to join the car success ratio, so the goods of same kind should disposable loading.
2, when joining the box body space when discontented, should avoid the goods of three-dimensional middle part to be placed with outstanding laterally situation, in order to avoid too broken remaining space occurs.
If any the outstanding situation in middle part, then should change to outstanding goods on the three-dimensional end line and put, can utilize one section space of ragged edge like this.
As by the goods length that replaced greater than the end line surplus size, then should select other to join the car scheme.
3, ask optimum on the Width of joining the box body space (being defined as the X-direction in space), i.e. surplus size minimum on the Width is to guarantee whole three-dimensional integrity degree.
Three, once more, divide joining the box body space;
Because use the heuristic car-distribution strategy, be the settlement steps to deal that carries out concentrated loads at same type goods.As for same type goods, defining three-dimensional horizontal direction is X-axis, and longitudinal direction is a Y-axis, and short transverse is the Z axle.
Then in above-mentioned three dimensions, pack into behind a kind of goods, can produce six kinds of subspaces at most,, be defined as the A space promptly at the remaining space of X-axis horizontal direction;
At the horizontal direction of X-axis, along the remaining space of Z on axially, be defined as the B space;
Along the longitudinal direction of Y-axis, at the remaining space of the horizontal bottom of casing, be defined as the C space;
At the remaining space of Y-axis longitudinal direction, be defined as the D space;
At the longitudinal direction of Y-axis, along the remaining space of Z on axially, be defined as the E space;
Residue angle space along X-axis and Y-axis is defined as the F space.
The loading sequence of car-distribution method is to be undertaken by the order of successively decreasing of spatial volume, to increase space availability ratio.
For calculating the size of above-mentioned remaining space, and join the car scheme, then try to achieve the least residue space by following flow process by what the order of successively decreasing determined to pack into a kind of goods:
1., try to achieve theoretical length La, theoretical length La is divided by putting width, promptly with the total area
La＝Va/(Nyh×Bw+Nyv×Bl)，
Wherein, Va=Bw * Bl * N;
That is La=(Bw * Bl * N)/(Nyh * Bw+Nyv * Bl);
N, pack into the casing quantity of goods of expression;
Nxh, goods that expression is packed into laterally put the case number on X-direction;
Nyh, goods that expression is packed into laterally put the case number on Y direction;
Nyv, goods that expression is packed into vertically put the case number on Y direction;
Nxv, goods that expression is packed into vertically put the case number on X-direction;
Bw, the width of expression casing;
Bl, the length of expression casing;
2., try to achieve that the row who vertically puts counts Nxv1 and the row that laterally puts counts Nxh1;
Wherein, Nxv1=La/Bw, Nxh1=La/Bl;
3., try to achieve the casing quantity Nr=N-Nxv1 * Nyv-Nxh1 * Nyh of innage;
Just, Nr=N-(La/Bw) * Nyv-(La/Bl) * Nyh;
4., judge, determine that innage is placed in the position where of casing;
The putting position of goods remainder has following several:
V0, the expression goods is all taked vertically to put;
H0, the expression goods is all taked laterally to put;
V1, the expression goods is vertically put 1 row or several row, and remaining is laterally put;
H1, the expression goods is laterally put 1 row or several row, and remaining is vertically put.
Constraint condition for above-mentioned putting position selection mode is:
Above-mentioned all disposing ways, occupy the end line size the longest row can not surpass length limit;
Priority should be considered the integrality in space and short total length;
Adopt goods vertically to put (V0 mode), should be than the length of traverse row greater than 2 times casing length Bl;
Adopt goods laterally to put (H0 mode), newly-increased row can not surpass 2 row;
Adopt the V1 mode, if the row of traverse are discontented, perpendicular row should be longer than and walk crosswise after finishing;
Adopt the H1 mode,, walk crosswise after then finishing and to be longer than perpendicular row if the row of placing vertically are discontented.
Four, then, determine sequencing and locating rule;
Carry out sequencing according to the order that the volume of goods to be installed successively decreases;
Positioning strategy is to account for the angle strategy, is about to goods to be installed and is placed in the three-dimensional a certain angle of casing, and the heuristic car-distribution method under the multi-constraint condition of the present invention, each all with the rear portion lower left corner position of layout piece due to current arrangement space.
Five, last, carry out space segmentation;
The method that adopts three dimensions to cut apart, after a goods was being put a container, this container was divided into three spaces (removing own occupation space), is respectively left space, right space, last space.
Based on as a same reason, each subspace in stowing operation, put goods after, continued to be divided into three spaces equally, and former space disappears.
For the stability that guarantees to load, loading sequence is followed successively by left space, right space, goes up the space.
Heuristic car-distribution method under the multi-constraint condition of the present invention, its realization flow is:
Determine the constraint condition of the thing of freight, as comprise that the bearing (frangibility) of casing itself, difficulty or ease, some goods that casing is carried must be put isolation, not allowing should be too not greatly above maximum capacity amount, center of gravity and geometric centroid deviation and the goods stability of piling up or the like;
Introduce different variablees and represent that respectively supporting, the end of the disposing way of goods, goods put attributes such as grade and priority.
Load according to the order that measurement of cargo to be installed successively decreases, promptly adorn big article earlier, refill little article.Begin to put article from the lower left corner, rear portion of casing.
Join car when loading,, each goods is all used heuristic strategies to determine joining the car loading sequence at all goods by the order of the goods of packing into.
Promptly load, increase space availability ratio by the order of successively decreasing of spatial volume;
Should avoid middle outstanding situation when loading when being discontented with, in order to avoid make the space too broken;
If any the outstanding situation in centre, should change to outstanding putting on the limit, can utilize one section space of ragged edge like this;
If any limit, should be converted to alternate manner to this type of situation less than minimum dimension as far as possible;
Ask optimum at Width, safeguard the spatial integrity degree with this.
Judge whether that remaining space continues loaded with articles in addition; If any, then utilize above-mentioned heuristic strategies to continue to load; As not having, then flow process finishes.
Determine to join the car scheme in detail based on three-dimensional loading space.
Content to sum up, the advantage of the heuristic car-distribution method under the described multi-constraint condition is:
1, by using the heuristic loading under the multi-constraint condition, can solve to have now and join the scheme that the car personnel are made by its subjective factor in joining the car process, human factor is lowered minimum.
2, use this method and avoided the incoherent of space, greatly improved the space availability ratio of casing.And calculate comparatively fast, saved the loading time.
Phenomenons such as it is more convenient 3, to use this method, and repeatedly refitting, the goods of avoiding occurring goods is detained, space availability ratio is very low, waste is serious, efficiency of loading is higher.
Description of drawings
Fig. 1 uses the cabinet space exploded view that heuristic strategies is carried out prestowage;
Fig. 2 is that three dimensions is cut apart synoptic diagram;
Fig. 3 is the heuristic car-distribution method process flow diagram under the described multi-constraint condition;
Fig. 4 uses as Fig. 3 flow process to carry out the goods resulting three-dimensional Stowage Plane of casing.
Embodiment
Embodiment 1, as shown in Figures 1 to 4, the heuristic car-distribution method under the described multi-constraint condition, the flow process of joining the car loading for one group of goods is:
Determine the constraint condition of the thing of freighting, and needed casing specification of selective loading goods and quantity;
The order of successively decreasing according to volume sorts to goods.
According to the order that measurement of cargo successively decreases goods is loaded, promptly adorn big article earlier.
Heuristic strategies below utilizing when loading begins to put article from the lower left corner, rear portion of casing;
The goods disposable loading of same kind, the remaining space that loads the back generation loads according to the order that spatial volume successively decreases again;
Load the situation of giving prominence in the middle of should avoiding when being discontented with; Ask optimum at Width.
After having loaded a certain article, judge whether casing also has remaining space to be used for loading other article, if having, then continues to load according to above-mentioned heuristic rule, finishes the three-dimensional Stowage Plane of the article that draw otherwise load.
Task termination.
As shown in Figure 4, utilize the heuristic car-distribution method under the multi-constraint condition, one group of article is cased, resulting three-dimensional Stowage Plane.
Wherein, cargo loading is that the goods detail as shown in the following Table 1 in the container of 11.96m (length) * 2.35m (wide) * 2.35m (height) in specification.
Table 1 is the concrete detail of the thing of freighting;
Wherein, x0 represents the coordinate of goods on X-direction, and y0 represents the coordinate of goods on Y direction, and z0 represents the coordinate of goods on Z-direction, and by x0, y0, z0 can know the particular location of article in cabinet space.
| Title | Quantity | Deeply | Wide | High | Volume |
| 10# | 10 | 800 | 475 | 335 | 127300000 |
| 8# | 5 | 440 | 330 | 330 | 47916000 |
| 4# | 5 | 1500 | 420 | 420 | 264600000 |
| 2# | 30 | 360 | 360 | 220 | 28512000 |
| 3# | 10 | 550 | 430 | 170 | 40205000 |
| 7# | 40 | 660 | 440 | 350 | 101640000 |
| 9# | 6 | 285 | 230 | 230 | 15076000 |
| 11# | 16 | 770 | 540 | 445 | 185031000 |
| 17# | 1 | 860 | 490 | 500 | 210700000 |
| 21# | 20 | 291 | 364 | 275 | 29129000 |
| 27# | 8 | 580 | 580 | 580 | 195112000 |
| 28# | 7 | 519 | 310 | 500 | 80445000 |
| 30# | 50 | 800 | 475 | 580 | 220400000 |
| Motor | 15 | 565 | 365 | 235 | 48463000 |
| Timer | 3 | 550 | 430 | 170 | 40205000 |
| The main body machine | 400 | 430 | 390 | 660 | 110682000 |
Table 1
As shown in Figure 4, in the three-dimensional Stowage Plane of goods, with the different different goods of degree of depth representative.
By Stowage Plane, the loading personnel can load goods in an orderly manner.And the space availability ratio of goods is also higher, has reached 92.2%, and computing time was less than one minute.
The concrete car loading pattern of joining shown in following table 2, is promptly joined the laden scheme result of car.
Wherein, x0 represents the coordinate of goods on X-direction, and y0 represents the coordinate of goods on Y direction, and z0 represents the coordinate of goods on Z-direction, and by x0, y0, z0 can know the particular location of article in cabinet space.
| Title | Quantity | Deeply to | Wide to | High to | X0 | Y0 | Z0 |
| Motor | 12 | 3 | 4 | 1 | 0 | 0 | 0 |
| Motor | 3 | 1 | 3 | 1 | 1095 | 0 | 0 |
| 21# | 16 | 2 | 8 | 1 | 1460 | 0 | 0 |
| 21# | 4 | 1 | 4 | 1 | 2188 | 0 | 0 |
| The main body machine | 25 | 1 | 5 | 5 | 1460 | 0 | 275 |
| The main body machine | 15 | 1 | 3 | 5 | 2120 | 0 | 275 |
| The main body machine | 54 | 3 | 6 | 3 | 0 | 0 | 235 |
| The main body machine | 252 | 21 | 6 | 2 | 2552 | 0 | 0 |
| The main body machine | 54 | 9 | 6 | 1 | 2552 | 0 | 1320 |
| 2# | 5 | 1 | 1 | 5 | 2120 | 1890 | 275 |
| 2# | 20 | 1 | 10 | 2 | 11582 | 0 | 0 |
| 2# | 5 | 1 | 5 | 1 | 11582 | 0 | 720 |
| 4# | 5 | 1 | 5 | 1 | 6422 | 0 | 1320 |
| 30# | 4 | 1 | 4 | 1 | 6422 | 0 | 1740 |
| 30# | 2 | 1 | 2 | 1 | 7222 | 0 | 1740 |
| 30# | 32 | 4 | 4 | 2 | 7922 | 0 | 1320 |
| 11# | 3 | 1 | 3 | 1 | 11122 | 0 | 1320 |
| 10# | 2 | 1 | 2 | 1 | 11122 | 0 | 1860 |
| 10# | 4 | 1 | 2 | 2 | 11582 | 0 | 1080 |
| 10# | 4 | 1 | 4 | 1 | 2552 | 0 | 1980 |
| 7# | 1 | 1 | 1 | 1 | 7222 | 1600 | 1740 |
| 7# | 20 | 4 | 5 | 1 | 3352 | 0 | 1980 |
| 28# | 1 | 1 | 1 | 1 | 11582 | 1600 | 1080 |
| 8# | 1 | 1 | 1 | 1 | 11582 | 1600 | 1580 |
| 8# | 1 | 1 | 1 | 1 | 11122 | 1600 | 1860 |
| 8# | 1 | 1 | 1 | 1 | 2552 | 1900 | 1980 |
| 8# | 1 | 1 | 1 | 1 | 2992 | 1900 | 1980 |
| 8# | 1 | 1 | 1 | 1 | 5992 | 0 | 1980 |
| 3# | 4 | 1 | 1 | 4 | 1460 | 2150 | 275 |
| 3# | 4 | 1 | 1 | 4 | 1290 | 0 | 235 |
| 3# | 2 | 1 | 1 | 2 | 1290 | 550 | 235 |
| 9# | 1 | 1 | 1 | 1 | 11582 | 2040 | 1580 |
| 9# | 1 | 1 | 1 | 1 | 11122 | 2040 | 1860 |
| 9# | 2 | 1 | 1 | 2 | 11582 | 2119 | 1080 |
| 9# | 2 | 1 | 2 | 1 | 1095 | 1695 | 0 |
Table 2
Claims (4)
1, the heuristic car-distribution method under a kind of multi-constraint condition is characterized in that: in joining in the car process of three-dimensional loading space, the resolution policy of being taked is,
At first, determine all constraint conditions and processing mode thereof in the cargo distribution process;
Secondly, use the heuristic car-distribution strategy, need disposable loading for the goods of same kind; When joining the box body space when discontented, should avoid the goods of three-dimensional middle part to be placed with outstanding laterally situation, in order to avoid too broken remaining space occurs; If any the outstanding situation in middle part, then should change to outstanding goods on the three-dimensional end line and put; When during greater than the end line surplus size, then being selected other to join the car scheme by the goods length that replaced; Ask optimum on the Width of joining the box body space, i.e. surplus size minimum on the Width is to guarantee whole three-dimensional integrity degree;
Once more, divide joining the box body space, loading sequence is to be undertaken by the order of successively decreasing of spatial volume;
Then, determine sequencing and locating rule, carry out sequencing according to the order that the volume of goods to be installed successively decreases; Positioning strategy is to account for the angle strategy, is about to goods to be installed and is placed in the three-dimensional a certain angle of casing;
At last, carry out space segmentation, loading sequence is followed successively by left space, right space, goes up the space.
2, the heuristic car-distribution method under the multi-constraint condition according to claim 1 is characterized in that: join in the car scheme determined, determine to pack into a certain goods in proper order by successively decreasing, remaining space makes every effort to minimum behind this goods of packing into;
The casing quantity Nr that joins the innage in the car scheme, its expression formula is,
Nr=N-(La/Bw) * Nyv-(La/B1) * Nyh, wherein,
La＝(Bw×B1×N)/(Nyh×Bw+Nyv×B1)，
N, pack into the casing quantity of goods of expression;
Nxh, goods that expression is packed into laterally put the case number on X-direction;
Nyh, goods that expression is packed into laterally put the case number on Y direction;
Nyv, goods that expression is packed into vertically put the case number on Y direction;
Nxv, goods that expression is packed into vertically put the case number on X-direction;
Bw, the width of expression casing;
B1, the length of expression casing.
3, the heuristic car-distribution method under the multi-constraint condition according to claim 2 is characterized in that: for joining same a kind of goods that car loads, when determining that innage is placed in the position where of casing, determine following principle,
All disposing ways, occupy the end line size the longest row can not surpass length limit;
Priority should be considered the integrality in space and short total length;
Adopt goods vertically to put (V0 mode), should be than the length of traverse row greater than 2 times casing length B1;
Adopt goods laterally to put (H0 mode), newly-increased row can not surpass 2 row;
Adopt the V1 mode, if the row of traverse are discontented, perpendicular row should be longer than and walk crosswise after finishing;
Adopt the H1 mode,, walk crosswise after then finishing and to be longer than perpendicular row if the row of placing vertically are discontented;
Wherein, V0, the expression goods is all taked vertically to put;
H0, the expression goods is all taked laterally to put;
V1, the expression goods is vertically put 1 row or several row, and remaining is laterally put;
H1, the expression goods is laterally put 1 row or several row, and remaining is vertically put.
4, the heuristic car-distribution method under the multi-constraint condition according to claim 3 is characterized in that: its realization flow is,
Determine the constraint condition of the thing of freighting;
Introduce different variablees and represent that respectively supporting, the end of the disposing way of goods, goods put attributes such as grade and priority;
Load according to the order that measurement of cargo to be installed successively decreases, promptly adorn big article earlier, refill little article, begin to put article from the lower left corner, rear portion of casing.
Join car when loading,, each goods is all used heuristic strategies to determine joining the car loading sequence at all goods by the order of the goods of packing into;
Promptly load, increase space availability ratio by the order of successively decreasing of spatial volume;
Should avoid middle outstanding situation when loading when being discontented with, in order to avoid make the space too broken;
If any the outstanding situation in centre, should change to outstanding putting on the limit, can utilize one section space of ragged edge like this;
If any limit, should be converted to alternate manner to this type of situation less than minimum dimension as far as possible;
Ask optimum at Width, safeguard the spatial integrity degree with this;
Judge whether that remaining space continues loaded with articles in addition; If any, then utilize above-mentioned heuristic strategies to continue to load; As not having, then flow process finishes.
Determine to join the car scheme in detail based on three-dimensional loading space.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2005100448502A CN1936937A (en) | 2005-09-20 | 2005-09-20 | Heuristic car-distribution method under multiple constraint conditions |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2005100448502A CN1936937A (en) | 2005-09-20 | 2005-09-20 | Heuristic car-distribution method under multiple constraint conditions |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1936937A true CN1936937A (en) | 2007-03-28 |
Family
ID=37954432
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2005100448502A Pending CN1936937A (en) | 2005-09-20 | 2005-09-20 | Heuristic car-distribution method under multiple constraint conditions |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1936937A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103413183A (en) * | 2013-08-02 | 2013-11-27 | 四川航天系统工程研究所 | System and method for generating overall optimization scheme for substance loading of irregularly-shaped containers |
| CN104992470A (en) * | 2015-07-23 | 2015-10-21 | 大连海事大学 | Display method for graphical representation in loading instrument of bulk carrier |
| DE102017003273A1 (en) | 2016-04-19 | 2017-10-19 | Scania Cv Ab | METHOD AND CONTROL UNIT FOR LOADING A VEHICLE |
| CN107491836A (en) * | 2017-08-10 | 2017-12-19 | 上海汽车集团股份有限公司 | A kind of distribution method of order, device and electronic equipment |
| CN109615136A (en) * | 2018-12-13 | 2019-04-12 | 浙江理工大学 | A kind of container loading process optimization method based on particle-filled principle |
| CN110189077A (en) * | 2019-05-20 | 2019-08-30 | 华南理工大学 | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint |
| CN110414851A (en) * | 2019-07-31 | 2019-11-05 | 秒针信息技术有限公司 | Automatic method of loading and device |
| CN110723553A (en) * | 2019-10-23 | 2020-01-24 | 安吉智能物联技术有限公司 | Stack shape generation method based on transfer robot |
| CN111199375A (en) * | 2020-01-13 | 2020-05-26 | 江苏佳利达国际物流股份有限公司 | Intelligent logistics transportation system |
| CN112766611A (en) * | 2021-02-08 | 2021-05-07 | 日日顺供应链科技股份有限公司 | Three-dimensional loading method and device |
| CN114455340A (en) * | 2022-01-27 | 2022-05-10 | 深圳市微科创源科技有限公司 | Goods packing method, system and storage medium |
| CN114890173A (en) * | 2022-06-02 | 2022-08-12 | 未来机器人（深圳）有限公司 | Cargo loading method and device, computer equipment and storage medium |
| CN115619198A (en) * | 2022-11-28 | 2023-01-17 | 中国外运股份有限公司 | Library position moving planning method and device, electronic equipment and storage medium |
-
2005
- 2005-09-20 CN CNA2005100448502A patent/CN1936937A/en active Pending
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103413183A (en) * | 2013-08-02 | 2013-11-27 | 四川航天系统工程研究所 | System and method for generating overall optimization scheme for substance loading of irregularly-shaped containers |
| CN104992470A (en) * | 2015-07-23 | 2015-10-21 | 大连海事大学 | Display method for graphical representation in loading instrument of bulk carrier |
| CN104992470B (en) * | 2015-07-23 | 2017-07-14 | 大连海事大学 | A kind of display methods illustrated in bulk freighter safe load calculator |
| DE102017003273A1 (en) | 2016-04-19 | 2017-10-19 | Scania Cv Ab | METHOD AND CONTROL UNIT FOR LOADING A VEHICLE |
| CN107491836A (en) * | 2017-08-10 | 2017-12-19 | 上海汽车集团股份有限公司 | A kind of distribution method of order, device and electronic equipment |
| CN109615136A (en) * | 2018-12-13 | 2019-04-12 | 浙江理工大学 | A kind of container loading process optimization method based on particle-filled principle |
| CN110189077B (en) * | 2019-05-20 | 2023-06-20 | 华南理工大学 | Multi-stage vehicle-cargo matching method considering three-dimensional loading constraint |
| CN110189077A (en) * | 2019-05-20 | 2019-08-30 | 华南理工大学 | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint |
| CN110414851A (en) * | 2019-07-31 | 2019-11-05 | 秒针信息技术有限公司 | Automatic method of loading and device |
| CN110723553A (en) * | 2019-10-23 | 2020-01-24 | 安吉智能物联技术有限公司 | Stack shape generation method based on transfer robot |
| CN110723553B (en) * | 2019-10-23 | 2021-09-10 | 安吉智能物联技术有限公司 | Stack shape generation method based on transfer robot |
| CN111199375B (en) * | 2020-01-13 | 2021-01-01 | 江苏佳利达国际物流股份有限公司 | Intelligent logistics transportation system |
| CN111199375A (en) * | 2020-01-13 | 2020-05-26 | 江苏佳利达国际物流股份有限公司 | Intelligent logistics transportation system |
| CN112766611A (en) * | 2021-02-08 | 2021-05-07 | 日日顺供应链科技股份有限公司 | Three-dimensional loading method and device |
| CN114455340A (en) * | 2022-01-27 | 2022-05-10 | 深圳市微科创源科技有限公司 | Goods packing method, system and storage medium |
| CN114890173A (en) * | 2022-06-02 | 2022-08-12 | 未来机器人（深圳）有限公司 | Cargo loading method and device, computer equipment and storage medium |
| CN115619198A (en) * | 2022-11-28 | 2023-01-17 | 中国外运股份有限公司 | Library position moving planning method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1936937A (en) | Heuristic car-distribution method under multiple constraint conditions | |
| Junqueira et al. | Three-dimensional container loading models with cargo stability and load bearing constraints | |
| Terno et al. | An efficient approach for the multi-pallet loading problem | |
| CN101381033A (en) | Container loading method based on ant colony algorithm | |
| Zhu et al. | A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP | |
| Zhang et al. | A heuristic block-loading algorithm based on multi-layer search for the container loading problem | |
| Ng | Crane scheduling in container yards with inter-crane interference | |
| Liu et al. | A novel hybrid tabu search approach to container loading | |
| Egeblad et al. | Heuristics for container loading of furniture | |
| CN111598341B (en) | Power material distribution method and system based on material distribution and path optimization | |
| JP6993449B2 (en) | Delivery plan generators, systems, methods and computer readable storage media | |
| CN103761635A (en) | Three-dimensional multi-box specially-structured cargo loading optimizing method | |
| CN105279629B (en) | A kind of intelligent packaging system of optimization | |
| Han et al. | A heuristic approach to the three-dimensional cargo-loading problem | |
| Ghomri et al. | Mathematical modeling of the average retrieval time for flow-rack automated storage and retrieval systems | |
| Wang et al. | A multi-round partial beam search approach for the single container loading problem with shipment priority | |
| CN111311145A (en) | Intelligent assembling method for railway freight | |
| Moura | A model‐based heuristic to the vehicle routing and loading problem | |
| Sheng et al. | A heuristic algorithm for container loading of pallets with infill boxes | |
| Koch et al. | A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls | |
| CN111507644B (en) | Multi-point unloading constrained three-dimensional multi-container loading method | |
| He et al. | A caving degree based flake arrangement approach for the container loading problem | |
| Iwasawa et al. | A heuristic algorithm for the container loading problem with complex loading constraints | |
| Jaehn | Positioning of loading units in a transshipment yard storage area | |
| Zhou et al. | A swarm optimization algorithm for practical container loading problem |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20070328 |