Layout method of circular packing problem based on inhibition search balancing property restraint
A tabu search and performance balancing technology, applied in special data processing applications, instruments, electrical digital data processing, etc.
Inactive Publication Date: 2011-03-09
NANJING UNIV OF INFORMATION SCI & TECH
View PDF0 Cites 3 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0019] The purpose of the present invention is to aim at the defect that current layout design lacks an efficient global optimization method, and propose a layout method based on a tabu search balance performance constraint for circular packing problems, which combines a tabu search algorithm, a gradient algorithm, Dichotomy and some heuristics
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0055] The layout method of the tabu search-based circular packing problem with balance performance constraints of the present invention will be further described in detail below with reference to the accompanying drawings.
[0056] 1. Read in all the circular objects to be clothed C i (Such as figure 1 Shown) the radius r i and mass m i , i=1, 2, 3,..., n, and the static imbalance δ allowed by the layout system J , where n is the number of circular objects to be clothed. Sets the upper bound on the radius of the circular container Lower bound on the radius of a circular container Let the circular container C i radius of
[0057] 2. Transform the optimization problem with balance performance constraints into an unconstrained optimization problem. The formal description of the circular packing problem with balance performance constraints in the background of space capsule layout design is as follows:
[0058] Objective function: minimizer 0 (1)
[0059] Restricti...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention discloses a layout method of circular packing problem based on inhibition search balancing property restraint, belonging to the design and research field of astrovehicle layout scheme. The method comprises the following steps: firstly, using the quasi policy and the penalty function method to convert the circular packing problem with the balancing property restraint into the optimization problem without restraint; secondly, starting from any random initial layout, using the gradient method based on self-adaptive step to perform minimization optimization calculation; in order that the calculation can effectively escape the trap of the local minimal point and avoid the circuitous search, adopting the inhibition search policy. In the process of inhibition search, releasing the inhabitation to the traditional adjacent domain or inhibiting the traditional adjacent domain, and the current rejection / reception rule are effectively improved. The method has the following advantages that: the layout has very high area utilization rate and faster speed, and the method can better realize the balancing property restraint and can be widely used for solving other layout optimizationproblem.
Description
technical field [0001] The invention belongs to the research field of spacecraft layout scheme design, and in particular relates to a layout method for a circular filling problem with balance performance constraints. Background technique [0002] The Packing problem studies the placement of multiple objects in a large space or container without overlapping each other, and it is required to improve the utilization of the space or container as much as possible. This problem has a wide range of applications in the fields of automobile industry, logistics transportation, network communication, aerospace and so on. The filling problem is divided into two-dimensional and three-dimensional problems from the dimension of the layout area; from the shape of the layout area, it is divided into circular, rectangular or arbitrary polygonal areas, etc.; from the type of objects to be laid, and It can be divided into circular, rectangular or irregular shapes, etc. Regarding the filling p...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More IPC IPC(8): G06F17/50
Inventor 刘景发李刚刘朝霞
Owner NANJING UNIV OF INFORMATION SCI & TECH