CN105480737A - Three-dimensional encasement scheme generating method based on three-step dynamic programming - Google Patents
Three-dimensional encasement scheme generating method based on three-step dynamic programming Download PDFInfo
- Publication number
- CN105480737A CN105480737A CN201510602432.4A CN201510602432A CN105480737A CN 105480737 A CN105480737 A CN 105480737A CN 201510602432 A CN201510602432 A CN 201510602432A CN 105480737 A CN105480737 A CN 105480737A
- Authority
- CN
- China
- Prior art keywords
- bar
- container
- knapsack
- layer
- dimensional
- 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.)
- Granted
Links
Abstract
The invention provides a three-dimensional encasement scheme generating method based on a three-step dynamic programming. A three-dimensional encasement problem is decomposed into three 01 knapsack problems which are conducted in sequence. The generating process of a three-dimensional encasement scheme is converted into a solution of the three 01 knapsack problems. According to the three-dimensional encasement scheme generating method based on the three-step dynamic programming, compared with existing methods, the encasement rate and the encasement scheme generating speed are improved; the container space use rate is further increased through the three-dimensional encasement scheme generating method, the container freight cost is reduced, and the corporate profits are increased.
Description
Technical field
The present invention relates to three-dimensional packing method art field, specifically, relate to the three-dimensional vanning scheme generation method based on three step dynamic programmings.
Background technology
Three-Dimensional Packing Problem is the problem often run at containerable cargo shipment, closed cargo vehicle shipping industry, and research Three-Dimensional Packing Problem can help corporate client to improve freight container capacity utilization, reduces freight cost, improves shipping profit.
Three-Dimensional Packing Problem belongs to typical NP-Hard problem, solves difficulty large.Solve at present Three-Dimensional Packing Problem mainly based on strategy of building a wall, build heap strategy, compartition strategy and Quasi-human strategy etc.
In such scheme, main adopt heuritic approach exhaustive vanning scheme in finite space, per cent pack is not high, and operation time is on computers longer.
Summary of the invention
In order to solve three-dimensional vanning technical field Problems existing at present, the invention provides the three-dimensional vanning scheme generation method based on three step dynamic programmings, its concrete technical scheme is as follows:
Based on the three-dimensional vanning scheme generation method of three step dynamic programmings, Three-Dimensional Packing Problem is decomposed into three 01 knapsack problems performed sequentially, the generative process of scheme of three-dimensional being cased is converted to solving of three 01 knapsack problems, specifically carries out according to the following steps:
The length, width and height size of step one, reading rectangular shape container, read all the length, width and height size and the placement direction constraint that are housed to the cuboid chest of container, whether whether whether placement direction constraint comprises: allow length upwards to place, allow width upwards to place, allow highly upwards to place;
Step 2, with the height of rectangular tank for knapsack capacity, be the goods set being housed to knapsack to be housed to the chest set of container, with the weight that may be of a size of each goods of each chest in container height direction, with selected chest volume be knapsack goods total value, solve this 01 knapsack problem, all chests being housed to container are combined into multiple excellent bar, obtain excellent bar set;
Step 3, with the width of rectangular tank for knapsack capacity, take all excellent bar generated in step 2 as the goods set being housed to knapsack, with the weight that may be of a size of each goods of each excellent bar in container width direction, with selected excellent bar volume sum for knapsack goods total value, solve this 01 knapsack problem, excellent bars all in excellent bar set are combined into multiple excellent layer, obtain excellent layer set;
Step 4, with the length of rectangular tank for knapsack capacity, with all excellent layer generated in step 3 for being housed to the goods set of knapsack, be of a size of the weight of each goods in container length direction with each excellent layer, with selected excellent layer volume sum for knapsack goods total value, solve this 01 knapsack problem, according to excellent layers all in excellent layer set, generate an excellent case, thus obtain a three-dimensional vanning scheme;
Step 5, the 3D figure providing three-dimensional vanning scheme show, and vanning schemes generation terminates.
Wherein, in step 2, each chest must be less than given value in the size of container length direction and Width; Utilize dynamic programming method to solve 01 knapsack problem and obtain a chest set, claim this chest set to be excellent bar;
Often generate an excellent bar, from the chest set being housed to container, just remove all chests comprised in this excellent bar; And then generate new excellent bar by solving 01 knapsack problem, then from the chest set being housed to container, remove all chests comprised in new excellent bar, circulation solves 01 knapsack problem, till all chests being housed to container all form excellent bar;
In each excellent bar, all chests are placed along container height direction, the width of excellent bar to equal in excellent bar all chests in the maxim of container width direction size, the length of excellent bar to equal in excellent bar all chests in the maxim of container length direction size, the height of excellent bar equal all chests in excellent bar container height direction size and, the volume of excellent bar equal all chest volumes in this excellent bar and.
Further, in step 3,
Each excellent bar, in container length direction size, utilizes dynamic programming method to solve 01 knapsack problem and obtains an excellent bar set, claim this excellent bar set to be excellent layer;
Often generate an excellent layer, in all excellent bar just generated from step 2, remove all excellent bar comprised in this excellent layer; And then generate new excellent layer by solving 01 knapsack problem, the more all excellent bar comprised in new excellent layer is removed from all excellent bar that step 2 generates, circulation solves 01 knapsack problem, till all excellent bar of step 2 generation all forms excellent layer;
In each excellent layer, all excellent bars are placed along container width direction, the width of excellent layer equal all excellent bars in excellent layer container width direction size and, the length of excellent layer to equal in excellent layer all excellent bars in the maxim of container length direction size, the volume of excellent layer equal all excellent bar volumes in this excellent layer and.
Further, in step 4,
Utilize dynamic programming method to solve 01 knapsack problem and obtain an excellent layer set, claim this excellent layer set to be excellent case; All excellent layer in excellent case is placed along container length direction; Namely an excellent case is a three-dimensional vanning scheme.
Three-dimensional based on three step dynamic programmings vanning scheme generation method provided by the present invention, has the following advantages:
First: relative to existing method, improve per cent pack and vanning schemes generation speed;
Second: adopt method of the present invention, further increase container space degree of utilization, reduce containerized shipment cost, add enterprise profit.
Accompanying drawing explanation
Fig. 1 is the three-dimensional vanning scheme generation system configuration diagram based on three step dynamic programmings;
Fig. 2 is the three-dimensional vanning schemes generation flow process based on three step dynamic programmings;
Fig. 3 is the 3D figure of the three-dimensional vanning scheme that embodiment of the present invention certification testing exports.
Detailed description of the invention
Below in conjunction with accompanying drawing and embodiments of the invention, the vanning of the three-dimensional based on three step dynamic programmings scheme generation method of the present invention is described in further detail.
Based on the three-dimensional vanning scheme generation method of three step dynamic programmings, Three-Dimensional Packing Problem is decomposed into three 01 knapsack problems performed sequentially, the generative process of scheme of three-dimensional being cased is converted to solving of three 01 knapsack problems, specifically carries out according to the following steps:
The length, width and height size of step one, reading rectangular shape container, read all the length, width and height size and the placement direction constraint that are housed to the cuboid chest of container, whether whether whether placement direction constraint comprises: allow length upwards to place, allow width upwards to place, allow highly upwards to place;
Step 2, with the height of rectangular tank for knapsack capacity, be the goods set being housed to knapsack to be housed to the chest set of container, with the weight that may be of a size of each goods of each chest in container height direction, with selected chest volume be knapsack goods total value, solve this 01 knapsack problem, all chests being housed to container are combined into multiple excellent bar, obtain excellent bar set;
Each chest must be less than given value in the size of container length direction and Width; Utilize dynamic programming method to solve 01 knapsack problem and obtain a chest set, claim this chest set to be excellent bar;
Often generate an excellent bar, from the chest set being housed to container, just remove all chests comprised in this excellent bar; And then generate new excellent bar by solving 01 knapsack problem, then from the chest set being housed to container, remove all chests comprised in new excellent bar, circulation solves 01 knapsack problem, till all chests being housed to container all form excellent bar;
In each excellent bar, all chests are placed along container height direction, the width of excellent bar to equal in excellent bar all chests in the maxim of container width direction size, the length of excellent bar to equal in excellent bar all chests in the maxim of container length direction size, the height of excellent bar equal all chests in excellent bar container height direction size and, the volume of excellent bar equal all chest volumes in this excellent bar and.
Step 3, with the width of rectangular tank for knapsack capacity, take all excellent bar generated in step 2 as the goods set being housed to knapsack, with the weight that may be of a size of each goods of each excellent bar in container width direction, with selected excellent bar volume sum for knapsack goods total value, solve this 01 knapsack problem, excellent bars all in excellent bar set are combined into multiple excellent layer, obtain excellent layer set;
Each excellent bar, in container length direction size, utilizes dynamic programming method to solve 01 knapsack problem and obtains an excellent bar set, claim this excellent bar set to be excellent layer;
Often generate an excellent layer, in all excellent bar just generated from step 2, remove all excellent bar comprised in this excellent layer; And then generate new excellent layer by solving 01 knapsack problem, the more all excellent bar comprised in new excellent layer is removed from all excellent bar that step 2 generates, circulation solves 01 knapsack problem, till all excellent bar of step 2 generation all forms excellent layer;
In each excellent layer, all excellent bars are placed along container width direction, the width of excellent layer equal all excellent bars in excellent layer container width direction size and, the length of excellent layer to equal in excellent layer all excellent bars in the maxim of container length direction size, the volume of excellent layer equal all excellent bar volumes in this excellent layer and.
Step 4, with the length of rectangular tank for knapsack capacity, with all excellent layer generated in step 3 for being housed to the goods set of knapsack, be of a size of the weight of each goods in container length direction with each excellent layer, with selected excellent layer volume sum for knapsack goods total value, solve this 01 knapsack problem, according to excellent layers all in excellent layer set, generate an excellent case, thus obtain a three-dimensional vanning scheme;
Utilize dynamic programming method to solve 01 knapsack problem and obtain an excellent layer set, claim this excellent layer set to be excellent case; All excellent layer in excellent case is placed along container length direction; Namely an excellent case is a three-dimensional vanning scheme.
Step 5, the 3D figure providing three-dimensional vanning scheme show, and vanning schemes generation terminates.
As shown in Figure 1, three-dimensional vanning scheme generation system based on three step dynamic programmings is divided into three parts: 1. container and chest Data Enter module 1, realizes container length, width and height Data Enter function, chest length, width and height Data Enter function and placement direction constraint information input function; 2. three-dimensional vanning schemes generation module 2, realizes the three-dimensional vanning scheme automatic generation function based on three step dynamic programmings; 3. three-dimensional vanning scheme 3D display module 3, shows three-dimensional vanning scheme in 3D mode.
Composition graphs 1, each module of three-dimensional vanning scheme generation system based on three step dynamic programmings realizes details and intermodule relation is as follows:
Container and chest Data Enter module 1 provide the typing interface of container length, width and height information for user, provide the typing interface of chest length, width and height information and placing direction constraint information.
Three-dimensional vanning schemes generation module 2 obtains length, width and height information and the putting position constraint information of container and chest from container and chest Data Enter module 1, generate three-dimensional vanning scheme.
Three-dimensional vanning scheme 3D display module 3 obtains three-dimensional vanning scheme from three-dimensional vanning schemes generation module 2, utilizes 3D technology to show vanning scheme.
Embodiment 1:
In order to verify the reliability of method of the present invention, method of the present invention realized by computer software simulation, as shown in Figure 1, this software comprises container and chest Data Enter module, three-dimensional vanning schemes generation module, three-dimensional vanning scheme 3D display module.Its carrying out practically process is as shown in Figure 2:
The length, width and height size of step 1, reading rectangular shape container, read all be housed to the cuboid chest of container length, width and height size and placement direction constraint, whether whether whether placement direction constraint comprise and allow length upwards to place, allow width upwards to place, allow highly upwards to place;
Step 2, all chests being housed to container are combined into multiple excellent bar, obtain excellent bar set;
Step 3, excellent bars all in excellent bar set are combined into multiple excellent layer, obtain excellent layer set;
Step 4, generate an excellent case according to excellent layers all in excellent layer set, thus obtain a three-dimensional vanning scheme;
Step 5, the 3D figure providing three-dimensional vanning scheme show, and vanning schemes generation terminates.
In order to verify three-dimensional vanning scheme generation method based on three step dynamic programmings and the feasibility of system, have employed following case information.
Information of container:
| Length | Width | Highly |
| 600 | 240 | 225 |
Chest information:
As shown in Figure 3, warp improves 10% with comparison of casing by artificial experience, vanning value to method of the present invention operation result on the computer systems, for user provides cost savings, improves boxing efficiency.
Above embodiment is only one of them embodiment chosen of the present invention, and all equalizations done according to the present patent application the scope of the claims change and modify, and all should belong to the covering scope of patent of the present invention.
Claims (4)
1. based on the three-dimensional vanning scheme generation method of three step dynamic programmings, it is characterized in that: Three-Dimensional Packing Problem is decomposed into three 01 knapsack problems performed sequentially, the generative process of scheme of three-dimensional being cased is converted to solving of three 01 knapsack problems, specifically carries out according to the following steps:
The length, width and height size of step one, reading rectangular shape container, read all the length, width and height size and the placement direction constraint that are housed to the cuboid chest of container, whether whether whether placement direction constraint comprises: allow length upwards to place, allow width upwards to place, allow highly upwards to place;
Step 2, with the height of rectangular tank for knapsack capacity, be the goods set being housed to knapsack to be housed to the chest set of container, with the weight that may be of a size of each goods of each chest in container height direction, with selected chest volume be knapsack goods total value, solve this 01 knapsack problem, all chests being housed to container are combined into multiple excellent bar, obtain excellent bar set;
Step 3, with the width of rectangular tank for knapsack capacity, take all excellent bar generated in step 2 as the goods set being housed to knapsack, with the weight that may be of a size of each goods of each excellent bar in container width direction, with selected excellent bar volume sum for knapsack goods total value, solve this 01 knapsack problem, excellent bars all in excellent bar set are combined into multiple excellent layer, obtain excellent layer set;
Step 4, with the length of rectangular tank for knapsack capacity, with all excellent layer generated in step 3 for being housed to the goods set of knapsack, be of a size of the weight of each goods in container length direction with each excellent layer, with selected excellent layer volume sum for knapsack goods total value, solve this 01 knapsack problem, according to excellent layers all in excellent layer set, generate an excellent case, thus obtain a three-dimensional vanning scheme;
Step 5, the 3D figure providing three-dimensional vanning scheme show, and vanning schemes generation terminates.
2. the vanning of the three-dimensional based on three step dynamic programmings scheme generation method according to claim 1, is characterized in that:
In step 2, each chest must be less than given value in the size of container length direction and Width; Utilize dynamic programming method to solve 01 knapsack problem and obtain a chest set, claim this chest set to be excellent bar;
Often generate an excellent bar, from the chest set being housed to container, just remove all chests comprised in this excellent bar; And then generate new excellent bar by solving 01 knapsack problem, then from the chest set being housed to container, remove all chests comprised in new excellent bar, circulation solves 01 knapsack problem, till all chests being housed to container all form excellent bar;
In each excellent bar, all chests are placed along container height direction, the width of excellent bar to equal in excellent bar all chests in the maxim of container width direction size, the length of excellent bar to equal in excellent bar all chests in the maxim of container length direction size, the height of excellent bar equal all chests in excellent bar container height direction size and, the volume of excellent bar equal all chest volumes in this excellent bar and.
3. the vanning of the three-dimensional based on three step dynamic programmings scheme generation method according to claim 2, is characterized in that: in step 3,
Each excellent bar, in container length direction size, utilizes dynamic programming method to solve 01 knapsack problem and obtains an excellent bar set, claim this excellent bar set to be excellent layer;
Often generate an excellent layer, in all excellent bar just generated from step 2, remove all excellent bar comprised in this excellent layer; And then generate new excellent layer by solving 01 knapsack problem, the more all excellent bar comprised in new excellent layer is removed from all excellent bar that step 2 generates, circulation solves 01 knapsack problem, till all excellent bar of step 2 generation all forms excellent layer;
In each excellent layer, all excellent bars are placed along container width direction, the width of excellent layer equal all excellent bars in excellent layer container width direction size and, the length of excellent layer to equal in excellent layer all excellent bars in the maxim of container length direction size, the volume of excellent layer equal all excellent bar volumes in this excellent layer and.
4. the vanning of the three-dimensional based on three step dynamic programmings scheme generation method according to claim 3, is characterized in that: in step 4,
Utilize dynamic programming method to solve 01 knapsack problem and obtain an excellent layer set, claim this excellent layer set to be excellent case; All excellent layer in excellent case is placed along container length direction; Namely an excellent case is a three-dimensional vanning scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510602432.4A CN105480737B (en) | 2015-09-21 | 2015-09-21 | Three-dimensional vanning scheme generation method based on three step Dynamic Programmings |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510602432.4A CN105480737B (en) | 2015-09-21 | 2015-09-21 | Three-dimensional vanning scheme generation method based on three step Dynamic Programmings |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105480737A true CN105480737A (en) | 2016-04-13 |
| CN105480737B CN105480737B (en) | 2018-01-19 |
Family
ID=55668085
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510602432.4A Active CN105480737B (en) | 2015-09-21 | 2015-09-21 | Three-dimensional vanning scheme generation method based on three step Dynamic Programmings |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105480737B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107145158A (en) * | 2017-07-03 | 2017-09-08 | 青岛智能产业技术研究院 | Rotor wing unmanned aerial vehicle, its land extremely processing unit and processing method |
| CN109163687A (en) * | 2018-08-16 | 2019-01-08 | 武汉纺织大学 | Packing case method for determining dimension and determining device |
| CN111860837A (en) * | 2020-07-20 | 2020-10-30 | 上海汽车集团股份有限公司 | Method and device for processing boxing problem and computer readable storage medium |
| CN112517410A (en) * | 2020-10-30 | 2021-03-19 | 平潭综合实验区百汉国际贸易有限公司 | Loading and sorting equipment for logistics storage and working method thereof |
| CN112815941A (en) * | 2019-11-18 | 2021-05-18 | 北京京邦达贸易有限公司 | Goods picking path planning method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN2175210Y (en) * | 1993-07-02 | 1994-08-24 | 黄瑞荣 | Loading and unloading equipment of wheel and rail type |
| CN1137475A (en) * | 1995-06-08 | 1996-12-11 | 翁陆雄 | Unloading method for bottom plate split packing box and its mechanism |
| CN1362356A (en) * | 2000-12-28 | 2002-08-07 | 丰田钢铁中心株式会社 | Apparatus for carrying articles of container, carrying in and carrying out method and tray thereof |
| JP2007161478A (en) * | 2005-12-16 | 2007-06-28 | Sanei Niyaku Kikai Kk | Movable platform of forklift for container |
| KR20070111657A (en) * | 2006-05-18 | 2007-11-22 | 동아대학교 산학협력단 | A platform apparatus loading and unloading a container |
-
2015
- 2015-09-21 CN CN201510602432.4A patent/CN105480737B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN2175210Y (en) * | 1993-07-02 | 1994-08-24 | 黄瑞荣 | Loading and unloading equipment of wheel and rail type |
| CN1137475A (en) * | 1995-06-08 | 1996-12-11 | 翁陆雄 | Unloading method for bottom plate split packing box and its mechanism |
| CN1362356A (en) * | 2000-12-28 | 2002-08-07 | 丰田钢铁中心株式会社 | Apparatus for carrying articles of container, carrying in and carrying out method and tray thereof |
| JP2007161478A (en) * | 2005-12-16 | 2007-06-28 | Sanei Niyaku Kikai Kk | Movable platform of forklift for container |
| KR20070111657A (en) * | 2006-05-18 | 2007-11-22 | 동아대학교 산학협력단 | A platform apparatus loading and unloading a container |
Non-Patent Citations (1)
| Title |
|---|
| 刘胜: "求解三维装箱问题的启发式正交二叉树搜索算法", 《计算机学报》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107145158A (en) * | 2017-07-03 | 2017-09-08 | 青岛智能产业技术研究院 | Rotor wing unmanned aerial vehicle, its land extremely processing unit and processing method |
| CN107145158B (en) * | 2017-07-03 | 2021-01-08 | 青岛智能产业技术研究院 | Rotor unmanned aerial vehicle, and abnormal landing processing device and processing method thereof |
| CN109163687A (en) * | 2018-08-16 | 2019-01-08 | 武汉纺织大学 | Packing case method for determining dimension and determining device |
| CN109163687B (en) * | 2018-08-16 | 2020-08-18 | 武汉纺织大学 | Method and device for determining size of packing box |
| CN112815941A (en) * | 2019-11-18 | 2021-05-18 | 北京京邦达贸易有限公司 | Goods picking path planning method, device, equipment and storage medium |
| CN111860837A (en) * | 2020-07-20 | 2020-10-30 | 上海汽车集团股份有限公司 | Method and device for processing boxing problem and computer readable storage medium |
| CN112517410A (en) * | 2020-10-30 | 2021-03-19 | 平潭综合实验区百汉国际贸易有限公司 | Loading and sorting equipment for logistics storage and working method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105480737B (en) | 2018-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105480737A (en) | Three-dimensional encasement scheme generating method based on three-step dynamic programming | |
| He et al. | Enhanced linearized reduced-order models for subsurface flow simulation | |
| US8959135B2 (en) | Data structure for tiling and packetizing a sparse matrix | |
| CN103246941B (en) | Space scheduling method stored up by a kind of Containers For Export harbour | |
| CN105279629A (en) | Optimized intelligent packaging system | |
| WO2013024485A3 (en) | Methods and systems of managing a distributed replica based storage | |
| Ushakumari | On (s, S) inventory system with random lead time and repeated demands | |
| CN104504468A (en) | Three-dimensional box loading method based on three-dimensional moving mode sequence and memetic algorithm | |
| CN104118626B (en) | Modular universal box for material circulation structure | |
| CN109190169A (en) | A kind of golden numerical method of Three-dimensional Time Domain electromagnetism hybridization time-discontinuous gal the Liao Dynasty | |
| CN110404965A (en) | Consider the method and model system of non-scale order specification hot rolled steel plate group plate flexible and slab designing | |
| Vidal-Carreras et al. | Economic lot scheduling with deliberated and controlled coproduction | |
| CN102799750B (en) | Method for quickly generating common side and non-common sides of geometry surface triangle | |
| CN101339635A (en) | Method, system and equipment for determining material demand plan and obtaining material low level code | |
| CN105824991A (en) | Aerospace application collaborative design oriented cloud platform and resource allocation method | |
| CN109684517A (en) | A kind of historical data storage method, reading/writing method, storage device and equipment | |
| CN109829078A (en) | A kind of data processing method and device of raster data | |
| CN105027098B (en) | Disturbed between mitigation unit | |
| CN101980190A (en) | Method and device for quickly putting service data into base | |
| Panagiotopoulos et al. | A group-based space-filling design of experiments algorithm | |
| CN105205854A (en) | Data center 3D modeling method and device | |
| CA2797233A1 (en) | Process entity graphs | |
| CN104537035A (en) | Data fusion application system and method | |
| Hekmat et al. | Extraction of macroscopic and microscopic adjoint concepts using a lattice Boltzmann method and discrete adjoint approach | |
| CN102841933B (en) | Method and device for writing raster data and method for reading raster data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |