Algorithm Sequence

The algorithm processes each splice, sorted by name, in the following sequence:

Step	Sequence Action
1	If the splice is not re-positionable or has no wires, the algorithm logs a message in the Output Window and does not process this splice.
2	The algorithm selects the candidate nodes: Find the end nodes (if center strip are wires present, only common nodes on the center strip wires will be considered as candidate nodes). Find the intermediate nodes (considering through-nodes if specified).
3	The algorithm selects the candidate bundles (all bundles attached to the candidate nodes).
4	The algorithm processes each candidate bundle (sorted in name order): Start with the end nodes and compute offsets considering all the constraints from all the objects in the design at these end nodes. Candidate locations = start node + start node offset and end node - end node offset. Consider whether any reference node constraints of objects on that bundle are violated, and adjust the start and end candidate positions accordingly. If valid Candidate Position Example 1 are found, Splice Cost Calculation Methods. Note In case of a tie, the start node splice is reported as optimal. Check if a new lower cost solution is found (ties are ignored).
5	If no valid position is found or if the optimal position found is the same as the current position of the splice then a message is logged.
6	If a new optimal position is found then the splice is moved to the new location.
7	Note If another object is already present at this location, update the new splice position to be at “zero distance” from this object.

Candidate Position

The candidate position is utilized by the Splice Cost Calculation Methods. The following examples show how the Splice Optimization Algorithm calculates the candidate positions.

Candidate Position Example 1

Figure 177 shows an example where candidate splice positions are calculated by the Splice Optimization Algorithm taking into account various constraints.

Figure 177: Candidate Positions Example

The Splice Optimization Algorithm has calculated the possible locations for the splice as follows:

• Wire end, intermediate and through nodes: Wire1 = C10; Wire2 = C20; Wire3 = C30, J10

• Candidate Nodes: C10, C20, C30, J10

• Candidate bundles containing candidate nodes: BUN1, BUN2, BUN3

• Candidate Positions for Splice = X

Candidate Position Example 2 - Center Stripped Wire

Figure 177 shows an example which includes a center stripped wire, where candidate splice positions have been calculated by the Splice Optimization Algorithm taking into account various constraints.

Figure 178: Candidate Positions - Center Strip Wire

The Splice Optimization Algorithm has calculated the possible locations for the splice as follows:

• Wire end, intermediate and through nodes, only center strip wire considered: Wire4 = C10, J10, C30

• Candidate Nodes: C10, C30, J10

• Candidate bundles containing candidate nodes: BUN1, BUN3

• Candidate Positions for Splice = X

Parent Topic:

Splice Optimization Algorithm

Capital Harness Designer User Guide, 2512

Unpublished work. © 2025 Siemens