Bond Energy Algorithm

McCormick, Schweitzer, & White (1972) developed an interchange-clustering algorithm called as the bond energy algorithm (BEA). The BEA discovers to form by minimizing the measure of effectiveness. It is defined as follows:

BEA Algorithm

Step 1

Set j = 1. Choose one of the columns arbitrarily.

Step 2

Set each of the remaining n-j columns, one at a time, for each of j + 1 position, and compute each column's contribution to the ME.

Put the column that specified the largest incremental contribution to the ME in its best position.

Enhance j by 1 and repeat the preceding steps till j = n.

Step 3

While all the columns have been placed, repeat the process for the rows.