CN111274757B - Implementation method for automatic layout of electromechanical product multi-branch cable assembly based on multi-objective optimization - Google Patents
Implementation method for automatic layout of electromechanical product multi-branch cable assembly based on multi-objective optimization Download PDFInfo
- Publication number
- CN111274757B CN111274757B CN202010061023.9A CN202010061023A CN111274757B CN 111274757 B CN111274757 B CN 111274757B CN 202010061023 A CN202010061023 A CN 202010061023A CN 111274757 B CN111274757 B CN 111274757B
- Authority
- CN
- China
- Prior art keywords
- cable
- layout
- cable assembly
- particle
- path
- 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.)
- Active
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 39
- 238000000034 method Methods 0.000 title claims abstract description 19
- 239000002245 particle Substances 0.000 claims abstract description 55
- 238000013461 design Methods 0.000 claims abstract description 12
- 238000000354 decomposition reaction Methods 0.000 claims abstract description 4
- 239000013598 vector Substances 0.000 claims description 9
- 230000000704 physical effect Effects 0.000 claims description 7
- NUFBIAUZAMHTSP-UHFFFAOYSA-N 3-(n-morpholino)-2-hydroxypropanesulfonic acid Chemical compound OS(=O)(=O)CC(O)CN1CCOCC1 NUFBIAUZAMHTSP-UHFFFAOYSA-N 0.000 claims description 5
- 238000005452 bending Methods 0.000 claims description 5
- 238000011161 development Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 claims description 4
- 238000005070 sampling Methods 0.000 claims description 4
- 238000012545 processing Methods 0.000 claims description 2
- 238000010845 search algorithm Methods 0.000 claims description 2
- 230000004888 barrier function Effects 0.000 claims 1
- 238000010276 construction Methods 0.000 abstract description 2
- 238000009826 distribution Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000006116 polymerization reaction Methods 0.000 description 2
- 125000000174 L-prolyl group Chemical group [H]N1C([H])([H])C([H])([H])C([H])([H])[C@@]1([H])C(*)=O 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000000712 assembly Effects 0.000 description 1
- 238000000429 assembly Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011960 computer-aided design Methods 0.000 description 1
- 230000006698 induction Effects 0.000 description 1
- 238000011900 installation process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 210000005036 nerve Anatomy 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 230000002792 vascular Effects 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The implementation method of the automatic layout of the electromechanical product multi-branch cable assembly based on multi-objective optimization is characterized by comprising the following steps: a plurality of optimization targets and constraint conditions of the multi-target layout of the cable assembly are determined according to the requirements. And carrying out discretization pretreatment on the cable laying space. The multi-objective layout problem of the cable is solved by using a multi-objective particle swarm optimization algorithm based on decomposition, a cable component layout scheme solution set meeting a plurality of objectives can be obtained, and construction and assembly of a geometric model of the cable component can be completed. The invention can provide a group of optimal wiring schemes meeting Pareto criteria through one operation, and can be used for decision selection by different demands of designers. The implementation of the invention can effectively improve the wiring design efficiency and quality of the electromechanical product and lighten the working strength of designers.
Description
Technical Field
The invention relates to a computer aided design and artificial intelligence technology, in particular to an electromechanical product cable wiring technology, and specifically relates to a method for realizing automatic layout of an electromechanical product multi-branch cable assembly based on multi-objective optimization.
Background
Cables are "vascular nerves" of mechatronic devices for energy delivery and signal control of electrical components and are used in large numbers in complex electromechanical products such as aerospace, vehicles, electronics, boats, etc., unreasonable cable arrangements not only destroy the stability of the system but also damage the electrical components, resulting in increased product failure rates, e.g., the united states general company concludes that 50% of failures in engine out-of-air parking events are due to pipeline, cable and sensor damage. The cables of the complex electromechanical products are mostly bundled cable components, the cable layout design relates to a plurality of optimization targets and a plurality of engineering constraints, and a plurality of different layout schemes exist, but most intelligent optimization algorithms aim at the problem of single-target layout optimization of double-end single cables, the length of the cables is singly used as the optimization target, the traditional mode of combining engineering experience and path search is adopted to obtain the cable layout with unique scheme, the consideration of factors such as manufacturability and assembly difficulty of the cable components is lacked, and the reasonable consideration of the total weight, manufacturability and assembly difficulty of the cable components and the like has great significance and necessity for shortening the production research and development period of the electromechanical products.
Disclosure of Invention
The invention aims to solve the problem of difficulty in multi-objective layout of an electromechanical product cable assembly, and discloses a multi-objective optimization-based implementation method for automatic layout of an electromechanical product multi-branch cable assembly, which aims to solve the problem of multi-objective layout of the electromechanical product cable assembly.
The technical scheme of the invention is as follows:
the implementation method of the automatic layout of the electromechanical product multi-branch cable assembly based on multi-objective optimization is characterized by comprising the following steps of:
(1) Inputting information of each port, wiring relation and physical attribute of each core wire of the cable component to be designed for electric connection;
(2) Determining a plurality of optimization targets and constraint conditions of the layout design of the cable assembly according to engineering requirements of the wiring design, recording the number of the optimization targets as M, and setting an optimization function f of a layout scheme m (x) M=1, 2, …, M, x is a cable component layout scheme, wherein the smaller the respective optimization objective function value is, the better the layout scheme is;
(3) Based on the structural design three-dimensional geometric model of the electromechanical product, carrying out discrete pretreatment on the cable laying space, and generating a cable laying space expressed by the discrete space model;
(4) Carrying out optimization solution on the layout of the cable assembly by using a multi-objective particle swarm optimization algorithm (MOPSO/D) based on decomposition, initializing an initial solution by using the discrete cable laying space generated in the step (2), processing optimization constraint, generating a series of non-dominant cable layout schemes, and storing the cable layout schemes by using XML format respectively;
(5) And selecting a cable layout meeting the requirements, reading a corresponding XML file in a CAD environment, automatically generating a cable assembly geometric model by using a secondary development interface, and assembling the cable assembly geometric model into the electromechanical product geometric model.
In the step (1), each port information comprises a space position and a plugging vector direction; the wiring relation is a wiring meter or a wiring diagram of electrical connection; the physical properties of each core include core cross-sectional shape, size, and linear density.
In the step (2), the total weight of the cable assembly, the main road ratio of the bundling section and the open space on the cable assembly laying path are selected as optimization targets, and the objective functions are f respectively 1 (x)、f 2 (x) And f 3 (x) Calculated according to the following formula:
f 1 (x)＝G B +G S
wherein G is B 、G S The total weight of the binding section and the non-binding section;
wherein n is the number of strapping segments; l (L) i Is the length of the strapping segment; n (N) i The number of cables contained for the bundling section; ρ j The j-th cable density in the bundling section;
wherein n is the number of non-bundled segments; l (L) i Is the length of the non-strapping segment; ρ i The i-th cable density;
wherein the method comprises the steps ofThe report is the main road duty ratio of the binding section; n is the number of strapping segments; l (L) i Length of the ith binding section; n (N) i The number of cables in the ith bundling section;
wherein Openness is an open space on the cable assembly laying path; n is the number of nodes on the cable assembly cabling path; v (V) i Is the open space volume around the node;
the requirements of path adherence, avoidance of high temperature and strong electromagnetic area, port extension length and minimum bending radius of the cable are taken as constraint conditions.
In the step (3), the cable laying space expressed by the discrete space model comprises information such as discrete unit positions, topological relations among the discrete units, space attributes of the discrete units and the like. Wherein the spatial attributes include information of whether the object is an obstacle, temperature, electromagnetic intensity, openness, etc.
In the step (4), the specific flow of optimizing and solving the cable layout based on the MOPSO/D algorithm is as follows:
the first step: initializing;
step 1.1, generating W uniform weight vectors according to a target number m and a sampling step length H;
step 1.2, calculating Euclidean distance between weight vectors of the sub-problems, and selecting the minimum B sub-problems as neighbors;
and 1.3, encoding the particles by using the number of branch points and the space position according to the cable wiring table, randomly generating W particles, and initializing the particle speed. For each particle, first, a path between a wiring end point and a branching point and a path between branching points are generated using a path search algorithm; then, constructing a minimum spanning tree of branch points, and traversing a path from the searching wiring endpoint to the nearest branch point; finally, the core wires passing through each branch section are determined according to the wiring relation, the diameter, the linear density and other attributes of the branch sections are calculated according to the core wire attributes, so that the layout scheme of the whole wire harness is generated, and the layout scheme is adoptedCalculating a target value f (p i )＝(f 1 (p i ),f 2 (p i ),…,f m (p i ))，i＝1,2,…,W；；
Step 1.4 initializing reference Point z * ；
Step 1.5 setting the locally and globally optimal particles of the particles as particles themselves, i.e. pbest i ＝gbest i ＝p i ；
And a second step of: population evolution;
step 2.1, calculating the speed and the position of the particle i, and calculating each target value of the new position of the particle;
step 2.2 according to particle p i Is a target value f (p) i ) Updating reference points
Step 2.3 updating particle p i If the new position is better than the previous position, setting pbest i ＝p i Otherwise, the original local optimal position pbest is reserved i ；
Step 2.4 use of particle p i Updating the global optimal position of the neighbor particle for particle p i Neighbor particle p b Global optimum position gbest of (a) b If p i As neighbor p b Is better than the global optimum, then set the gbest b ＝p i Otherwise, not updating the global optimal position of the neighbor;
and 2.5, judging whether an evolution termination condition is met, if so, respectively storing the global optimal solution of the population and the related physical attributes of the corresponding cable layout into an XML file, stopping the population evolution, and if not, continuing the second step.
In the step (5), the geometric model of the cable assembly is generated and assembled as follows:
the first step: reading a cable layout XML file, and reconstructing to obtain physical properties such as diameter, linear density, minimum bending radius, looseness and the like of each branch section in the cable and a discrete path point set of each branch section;
and a second step of: according to the CAD secondary development interface, setting physical properties of each branch section of the cable, fitting according to a sample bar curve according to discrete path points of each branch section to generate a continuous path of each branch section of the cable assembly, and creating and generating a geometric model of each branch section;
and a third step of: and setting an assembly coordinate system of the cable assembly according to the positions of all the ports, and completing the assembly of the cable geometric model to the electromechanical product geometric model.
The beneficial effects of the invention are as follows:
the invention provides a method for realizing multi-branch cable assembly automatic layout of an electromechanical product based on multi-objective optimization aiming at the automatic design of the multi-objective layout of the cable assembly of the electromechanical product. A plurality of optimization targets and constraint conditions of the multi-target layout of the cable assembly are determined according to the requirements. And carrying out discretization pretreatment on the cable laying space. The multi-objective layout problem of the cable is solved by using a multi-objective particle swarm optimization algorithm based on decomposition, a cable component layout scheme solution set meeting a plurality of objectives can be obtained, and construction and assembly of a geometric model of the cable component can be completed. The invention can provide a group of optimal wiring schemes meeting Pareto criteria through one operation, and can be used for decision selection by different demands of designers. The implementation of the invention can effectively improve the wiring design efficiency and quality of the electromechanical product and lighten the working strength of designers.
Drawings
Fig. 1 is a schematic diagram of a typical electromechanical product space structure and terminal distribution.
FIG. 2 is a flow chart of an implementation of an automatic layout of an electromechanical product multi-drop cable assembly based on multi-objective optimization.
Fig. 3 is a diagram of a multi-objective layout of an electromechanical product cable assembly.
Table 1 is a wiring chart for an electromechanical product.
Table 2 is the discrete spatial data after preprocessing.
Detailed Description
The following detailed description of the invention is presented in conjunction with the accompanying drawings to provide a better understanding of the invention to those skilled in the art.
As shown in fig. 1-3, tables 1-2.
Input conditions of the implementation method of the automatic layout of the multi-branch cable assembly of the electromechanical product based on multi-objective optimization are the mechanical structure of the electromechanical product, the spatial position of the wiring terminal, the normal vector direction of the connector and the electric wiring meter. As shown in fig. 1 and table 1.
Table 1 electromechanical product wiring meter
The multi-target particle swarm algorithm suitable for the layout design of the cable assembly is obtained through the fixed-length particle coding based on the decomposed multi-target particle swarm algorithm, so that the layout optimization of the cable assembly and the creation and assembly of the cable geometric model in the electromechanical product are realized.
FIG. 2 is a flow chart of an implementation of the automatic layout of multiple drop cable assemblies of the electromechanical product based on multi-objective optimization of the present invention. The method comprises the following specific steps:
the first step: determining a plurality of optimization targets and constraint conditions of the layout design of the cable assembly, recording the number of the optimization targets as 3, and setting an optimization function f of a layout scheme m (x) The smaller the optimized objective function value, the better the layout scheme, m=1, 2, 3. Three indexes of the total weight of the cable assembly, the main road occupation ratio of the bundling section and the open space on the laying path of the cable assembly are selected as optimization targets, x is set as a cable assembly layout scheme, and the objective functions are respectively f 1 (x)、f 2 (x) And f 3 (x) Calculated according to the following formula:
f 1 (x)＝G B +G S
wherein G is B 、G S For the total weight of the binding section and the non-binding section；
Wherein n is the number of strapping segments; l (L) i Is the length of the strapping segment; n (N) i The number of cables contained for the bundling section; ρ j The line density of the j-th cable in the bundling section;
wherein n is the number of non-bundled segments; l (L) i Is the length of the non-strapping segment; ρ i The linear density of the ith cable;
the project is the main road duty ratio of the binding section; n is the number of strapping segments; l (L) i Length of the ith binding section; n (N) i The number of cables in the ith bundling section;
wherein Openness is an open space on the cable assembly laying path; n is the number of nodes on the cable assembly cabling path; v (V) i Is the open space volume around the node.
The requirements of path adherence, avoidance of high temperature and strong electromagnetic area, port extension length and minimum bending radius of the cable are taken as constraint conditions. Path adherence h (x) =0, whereas h (x) +.0; the path does not pass through the high temperature region T (x) =0, whereas T (x) +.0; the path does not pass through the strong electromagnetic area E (x) =0, whereas E (x) +.0; the port extension length satisfies the requirement N (x) =0, whereas N (x) noteq0; b (x) is greater than or equal to b min The minimum bend radius requirement is met for the path.
And a second step of: firstly, constructing an AABB bounding box CAD model of an assembly body according to a geometric model of the assembly body of the electromechanical product, and carrying out Boolean subtraction operation on the bounding box model by combining the distribution of the parts of the product. The cable laying space excluding the obstacle area can be obtained, and the discrete units in the laying space can be obtained by performing the bulk grid discretization pretreatment on the space. In the actual cable installation process, the cable structure and the path have different manufacturability requirements, for example, some electromechanical products require the cable to avoid a heat source, and some electromechanical products require to avoid electromagnetic interference or require to be fixed along the inner wall, etc. Adding cabling related process attributes to the discrete space results in the pre-processed discrete space data shown in table 2.
TABLE 2 discrete spatial data after pretreatment
Wherein the id represents a unique identifier of the discrete unit, through which the corresponding discrete unit can be retrieved; the geometry column represents discrete spatial geometrical properties, wherein only spatial coordinate information (x, y, z) of the discrete unit center point is needed; the Craft column represents the process attributes of the discrete space, and the corresponding volume, T, E, A represents the space volume (mm 3 ) Equivalent temperature (K), equivalent magnetic induction (10) -3 T) and adherence information (0 represents unit adherence); the morphology column indicates the identity of adjacent cells around the discrete cell, where-1 represents null.
And a third step of: the specific solving process after the MOPSO/D algorithm reads the discrete laying space is as follows:
(1) The sampling number 10 is set to generate a sampling point set U with a step size of 0.1, u= {0,0.1,0.2, …,1}. According to the target spatial dimension m=3, 45 weight vectors uniformly distributed in space are generated.
(2) The euclidean distance between 45 sub-problem weight vectors is calculated, and the smallest 20 sub-problems are selected as neighbors.
(3) According to the cable connection table shown in Table 1, the number of connection terminals is 10, and the number of branch points is at most 8The particles may be described as a code of fixed length 25. Particles P i Coded form P i ＝(k,x 1 ,y 1 ,z 1 ,x 2 ,y 2 ,z 2 ,…,x k ,y k ,z k ,x k+1 ,y k+1 ,z k+1 ,…,x 8 ,y 8 ,z 8 ) K is the number of branch points that make up the cable structure, and the remaining 8-k are potential branch points that do not participate in making up the cable structure but may participate in making up the cable structure in iterative updating of the algorithm. Randomly generating 45 particles, wherein the initial particle speed is 0, and for each particle, firstly, adding a cable constraint condition into a path searching algorithm, and generating a path between a wiring endpoint and a branching point and a path between branching points by using the path searching algorithm; then, constructing a minimum tree of branch points, and further determining a path from a wiring end point to the branch point; finally, the core wire attribute of the binding section is determined according to the wiring relation, and the target value f (p) of the particle is calculated i )＝(f 1 (p i ),f 2 (p i ),f 3 (p i ))，i＝1,2,…,45。
(4) The initial reference point is a larger number, z * ＝(1e+10,1e+10,1e+10)。
(5) Setting the locally and globally optimal particles of the individual particles as particles themselves, i.e. pbest i ＝gbest i ＝p i ，i＝1,2,…,45。
(6) Calculating the velocity and position of the particle i, calculating each target value of the new position of the particle, f (p i )＝(f 1 (p i ),f 2 (p i ),f 3 (p i ))，i＝1,2,…,45。
(7) According to particle p i Is a target value f (p) i ) Updating reference pointsFor each target component f j (p i ) If->Set->
(8) Updating particle p i Is defined as a locally optimal position of the lens. If the new position is better than the previous locally optimal position, comparison is performed using chebyshev polymerization, i.e. g TCH (p i |λ i )≤g TCH (pbest i |λ i ) Then set pbest i ＝p i Otherwise, the original local optimal position pbest is reserved i 。
(9) Using particles p i And updating the global optimal position of the neighbor particles. For particle p i Neighbor particle p b Global optimum position gbest of (a) b If p i As neighbor p b Is better globally, compared using chebyshev polymerization, i.e. g TCH (p i |λ i )≤g TCH (gbest b |λ b ) Then set gbest b ＝p i Otherwise, the global optimal position of the neighbor is not updated.
(10) Judging whether an evolution termination condition is met, if so, storing the global optimal solution of the population and the related physical attributes of the corresponding cable layout into XML, stopping the population evolution, and otherwise, continuing the step (6).
Fourth step: the MFC framework of VS2012 was used to develop a program plug-in for generating a cable assembly geometry model using the secondary development interface Pro/Toolkit of computer aided design software creo3.0. The program plug-in is automatically loaded on the Creo3.0 software platform, the cable layout XML file is read, the cable layout scheme and the physical properties thereof are reconstructed, and the program automatically builds the geometric model of the cable assembly. The overall coordinate system of the geometrical model of the electromechanical product assembly body is selected to finish the assembly of the cable assembly shown in fig. 3, the space is limited, and only a plurality of layout schemes are randomly selected from the final overall optimal file for display.
The invention is not related in part to the same as or can be practiced with the prior art.
Claims (6)
1. The implementation method of the automatic layout of the electromechanical product multi-branch cable assembly based on multi-objective optimization is characterized by comprising the following steps of:
(1) Inputting information of each port, wiring relation and physical attribute of each core wire of the cable component to be designed for electric connection;
(2) Determining a plurality of optimization targets and constraint conditions of the layout design of the cable assembly according to engineering requirements of the wiring design, recording the number of the optimization targets as M, and setting an optimization function f of a layout scheme m (x) M=1, 2, …, M, x is the cable assembly layout scheme;
(3) Based on the structural design three-dimensional geometric model of the electromechanical product, carrying out discrete pretreatment on the cable laying space, and generating a cable laying space expressed by the discrete space model;
(4) Carrying out optimization solution on the layout of the cable assembly by using a multi-objective particle swarm optimization algorithm (MOPSO/D) based on decomposition, initializing an initial solution by using the discrete cable laying space generated in the step (2), processing optimization constraint, generating a series of non-dominant cable layout schemes, and storing the cable layout schemes by using XML format respectively;
(5) Selecting a cable layout meeting the requirements, reading a corresponding XML file in a CAD environment, automatically generating a cable assembly geometric model by using a secondary development interface, and assembling the cable assembly geometric model into an electromechanical product geometric model;
in the step (2), the total weight of the cable assembly, the main road ratio of the bundling section and the open space on the laying path of the cable assembly are taken as optimization targets, and the objective functions are f respectively 1 (x)、f 2 (x) And f 3 (x) Calculated according to the following formula:
f 1 (x)＝G B +G S
wherein G is B 、G S The total weight of the binding section and the non-binding section;
wherein n is the number of strapping segments; l (L) i Is the length of the strapping segment; n (N) i The number of cables contained for the bundling section; ρ j The line density of the j-th cable in the bundling section;
wherein n is the number of non-bundled segments; l (L) i Is the length of the non-strapping segment; ρ i The linear density of the ith cable;
the project is the main road duty ratio of the binding section; n is the number of strapping segments; l (L) i Length of the ith binding section; n (N) i The number of cables in the ith bundling section;
wherein Openness is an open space on the cable assembly laying path; n is the number of nodes on the cable assembly cabling path; v (V) i Is the open space volume around the node.
2. The method according to claim 1, characterized in that: in the step (1), each port information comprises a space position and a plugging vector direction; the wiring relation is a wiring meter or a wiring diagram of electrical connection; the physical properties of each core include core cross-sectional shape, size, and linear density.
3. The method according to claim 1, characterized in that: in the step (2), the requirements of path adherence, avoidance of high-temperature and strong electromagnetic areas, port extension length and minimum bending radius of the cable are taken as constraint conditions.
4. The method according to claim 1, characterized in that: in the step (3), the cable laying space expressed by the discrete space model comprises discrete unit positions, topological relations among the discrete units and space attribute information of the discrete units; wherein the spatial attributes include whether the barrier, temperature, electromagnetic intensity, and openness information.
5. The method according to claim 1, characterized in that: in the step (4), the specific flow of optimizing and solving the cable layout based on the MOPSO/D algorithm is as follows:
the first step: initializing;
step 1.1, generating W uniform weight vectors according to a target number m and a sampling step length H;
step 1.2, calculating Euclidean distance between weight vectors of the sub-problems, and selecting the minimum B sub-problems as neighbors;
step 1.3, encoding particles by using the number of branch points and the space position according to a cable wiring table, randomly generating W particles, and initializing the particle speed; for each particle, first, a path between a wiring end point and a branching point and a path between branching points are generated using a path search algorithm; then, constructing a minimum spanning tree of branch points, and traversing a path from the searching wiring endpoint to the nearest branch point; finally, the core wires passing through each branch section are determined according to the wiring relation, the diameter and linear density properties of the branch sections are calculated according to the core wire properties, so that a layout scheme of the whole wire harness is generated, and the target value f (p) of the particles is calculated according to the scheme i )＝(f 1 (p i ),f 2 (p i ),…,f m (p i ))，i＝1,2,…,W；
Step 1.4 initializing reference Point z * ；
Step 1.5 setting the locally and globally optimal particles of the particles as particles themselves, i.e. pbest i ＝gbest i ＝p i ；
And a second step of: population evolution;
step 2.1, calculating the speed and the position of the particle i, and calculating each target value of the new position of the particle;
step 2.2 according to particle p i Target value of (2)f(p i ) Updating reference points
Step 2.3 updating particle p i If the new position is better than the previous position, setting pbest i ＝p i Otherwise, the original local optimal position pbest is reserved i ；
Step 2.4 use of particle p i Updating the global optimal position of the neighbor particle for particle p i Neighbor particle p b Global optimum position gbest of (a) b If p i As neighbor p b Is better than the global optimum, then set the gbest b ＝p i Otherwise, not updating the global optimal position of the neighbor;
and 2.5, judging whether an evolution termination condition is met, if so, respectively storing the global optimal solution of the population and the diameter and linear density physical properties of each branch section of the cable layout corresponding to the global optimal solution of the population into an XML file, stopping population evolution, and if not, continuing the second step.
6. The method according to claim 1, characterized in that: in the step (5), the geometric model of the cable assembly is generated and assembled as follows:
the first step: reading a cable layout XML file, and reconstructing to obtain the diameter, the linear density, the minimum bending radius and the physical attribute of looseness of each branch section in the cable and a discrete path point set of each branch section;
and a second step of: according to the CAD secondary development interface, setting physical properties of each branch section of the cable, fitting according to a sample bar curve according to discrete path points of each branch section to generate a continuous path of each branch section of the cable assembly, and creating and generating a geometric model of each branch section;
and a third step of: and setting an assembly coordinate system of the cable assembly according to the positions of all the ports, and completing the assembly of the cable geometric model to the electromechanical product geometric model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010061023.9A CN111274757B (en) | 2020-01-19 | 2020-01-19 | Implementation method for automatic layout of electromechanical product multi-branch cable assembly based on multi-objective optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010061023.9A CN111274757B (en) | 2020-01-19 | 2020-01-19 | Implementation method for automatic layout of electromechanical product multi-branch cable assembly based on multi-objective optimization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111274757A CN111274757A (en) | 2020-06-12 |
| CN111274757B true CN111274757B (en) | 2024-01-26 |
Family
ID=71001781
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010061023.9A Active CN111274757B (en) | 2020-01-19 | 2020-01-19 | Implementation method for automatic layout of electromechanical product multi-branch cable assembly based on multi-objective optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111274757B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111859591B (en) * | 2020-07-22 | 2024-06-04 | 成都蓉软科技有限公司 | Automatic layout method and device for wires and cables |
| CN112115675B (en) * | 2020-09-21 | 2022-09-16 | 长春理工大学 | Complex wire harness tooling plate design system |
| FR3114894B1 (en) * | 2020-10-05 | 2023-11-24 | Leoni Wiring Systems France | Method for determining an optimized spatial configuration of electrical wiring |
| CN112906170B (en) * | 2021-01-29 | 2024-07-09 | 奇瑞汽车股份有限公司 | Method and device for rapidly calculating optimal position of wire harness diagram wire contact |
| CN112906082B (en) * | 2021-02-07 | 2024-02-27 | 南京航空航天大学 | Automatic generation method of MBD model of cable assembly |
| CN114488785B (en) * | 2021-08-09 | 2023-11-14 | 宁波大学 | MFC actuator track tracking method |
| CN113987718B (en) * | 2021-11-17 | 2022-06-03 | 中国矿业大学 | Product change scheme design method based on multi-objective particle swarm optimization |
| CN115329710B (en) * | 2022-08-26 | 2023-08-29 | 苏州大学 | Heat pipe constraint assembly layout optimization method based on genetic algorithm |
| CN115471143A (en) * | 2022-11-10 | 2022-12-13 | 中铁第一勘察设计院集团有限公司 | Method and system for arranging indoor equipment of railway communication machinery and storage medium thereof |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109871592A (en) * | 2019-01-25 | 2019-06-11 | 南京航空航天大学 | A kind of spatial discretization model towards electronic product cable laying layout optimization |
-
2020
- 2020-01-19 CN CN202010061023.9A patent/CN111274757B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109871592A (en) * | 2019-01-25 | 2019-06-11 | 南京航空航天大学 | A kind of spatial discretization model towards electronic product cable laying layout optimization |
Non-Patent Citations (3)
| Title |
|---|
| 复杂机电产品线缆敷设若干关键技术研究;王发麟;《中国优秀博士学位论文全文数据库》;第30-46、91-119页 * |
| 机电产品管路自动敷设的粒子群算法;付宜利;封海波;孙建勋;李荣;马玉林;;机械工程学报(11);全文 * |
| 航空发动机复杂约束空间内管路敷设技术;王成恩;柳强;白晓兰;王健熙;李明;;计算机集成制造系统(11);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111274757A (en) | 2020-06-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111274757B (en) | Implementation method for automatic layout of electromechanical product multi-branch cable assembly based on multi-objective optimization | |
| Niu et al. | Ship Pipe Routing Design Using NSGA‐II and Coevolutionary Algorithm | |
| CN104699899B (en) | A kind of ship pipeline path optimization design method | |
| CN107256441B (en) | Power distribution network planning construction scheme design method based on non-dominated sorting genetic algorithm | |
| CN109063381B (en) | Automobile wire harness process design method and system based on CAD platform | |
| CN116207739B (en) | Optimal scheduling method and device for power distribution network, computer equipment and storage medium | |
| CN104679947A (en) | Automatic generation method of cable component optimizing structure of mechanical and electrical product | |
| Conru et al. | Computational support for interactive cable harness routing and design | |
| CN111426323B (en) | Routing planning method and device for inspection robot | |
| Wu et al. | Improved ant colony optimization algorithm and its application to solve pipe routing design | |
| CN109193756A (en) | A kind of scene decoupling dynamic economic dispatch model solution method of wind power integration system | |
| Zhao et al. | Multi-branch cable harness layout design based on genetic algorithm with probabilistic roadmap method | |
| Lin et al. | A multi-objective cooperative particle swarm optimization based on hybrid dimensions for ship pipe route design | |
| Kim et al. | Automatic design system for generating routing layout of tubes, hoses, and cable harnesses in a commercial truck | |
| CN114896746A (en) | Topology optimization method for current collection system of offshore wind farm | |
| KR101722393B1 (en) | Method of selecting position for offshore substation in the wind power plant and method of designing for power grid design in the wind power plant | |
| EP3667523A1 (en) | Method of determining a three-dimensional layout of electrical connections of an electric component | |
| Thantulage | Ant colony optimization based simulation of 3D automatic hose/pipe routing | |
| Ma et al. | Improved genetic algorithm based on K-Means to solve path planning problem | |
| CN117874975A (en) | Method for evaluating cable laying design quality and realizing check based on 3DE secondary development | |
| CN117350000A (en) | Frequency division power transmission planning model solving method based on self-adaptive heuristic algorithm | |
| Karlsson et al. | Automatic cable harness layout routing in a customizable 3D environment | |
| CN116611600A (en) | Planning method for material distribution path of assembly workshop | |
| Liu et al. | Integrated optimization of pipe routing and clamp layout for aeroengine using improved moalo | |
| Li | HYBRID OPTIMIZATION ALGORITHM FOR CABLE DESIGN OF ELECTROMECHANICAL PRODUCTS BASED ON A* AND GENETIC ALGORITHM |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |