The Implementation Procedure

The implementation of the CLONALG on the underlying problem is described by the given procedure:

Basic Structure of CLONALG for Machine loading problem:

Some Terminologies

CLONALG: (P⁰⁰_nmM,n,f,Cs,I,u,,, δ)

P_n⁰ = Population set of antibodies along with population size n

P_n⁰ = {a₁⁰,a₂⁰,a₃⁰,............,a_k⁰,....a_n⁰};; here a_k is the k set in i^th generation

M^t_m = memory set of antibodies with memory size m in t^th generation

f = fitness value; Cs = Constraints; l = String length;

 u = Updation limit; δ = Step size; T = Termination criteria;

 Pseudo Code

Initialize* P_n⁰

Set M_m⁰ # 0;

While (t! = gen_max)

Evaluate {Pt , Ag} ;

P_s^t  = Select { P_s^t , s}; ∀s ≤ n

/*based on fitness value s antibodies are selected from population */

P_cl^t # Cloning (P_s^t ) ;

/*Selected antibodies are cloned as per Section --*/

P_hm^t = Hyper-mutae(P_cl^t)**

/* cloned antibodies are hyper-mutated employing the Parallel mutation as per Section --*/

Evaluate {P_hm^t , Ag ) ;

/*calculate the hyper-mutated antibodies*/

P_b^t    # Best (P_hm^t ) ;

/*Select b best antibodies from hyper-mutated antibodies*/

t tt - 1

M^t_m = Update {P_b^t , M^t-1_m }

µ = M^t_m - { M^t_m ∩M^t-1_m }

/* μ = No. of new antibodies entered into Memory set in i^th iteration*/

If (µ > d)

end

end if

The Solution Obtained

Resolving the undertaken machine loading problem along with CLONALG yields result as represented below:

Optimal Job sequence            :           J₁, J₇, J₃, J₄, J₅, J₆, J₂, J₈

System Unbalance      :                      14

Throughput     :                                  48

Jobs Rejected  :                                  J₂, J₆ and J₈

Normalized Objective

Function value :                                 0.796354.

The optimal job sequence as acquired by the CLONALG shown above. The minimum system imbalance is found to be 14 and the maximum throughput acquired is 48. The objective function value described in the result is acquired after normalizing for enumeration cause. The result is observed via coding the abovementioned algorithm in C++ language and run on a P4 processor.