Sequence change Assignment Help

In Process Planning Problem, Application Of Simulated Annealing Algorithm - Sequence change

Sequence change

Two OpMs are randomly chosen and their locations in the plan are exchanged.

Step 1

Randomly generate a feasible plan (OpM1; OpM2; . . . ; OpMn), named as the current plan.

Step 2

Begin from the initial temperature T = T0.


Step 2.1

Generate a random change to the current-plan; assume temp-plan be the plan after the change.

Step 2.2

Check to confirm that temp-plan is valid. Or else, go back to Step 2.1.

Step 2.3

Determine the costs of current-plan as E1 and temp-plan as E2.

If E2 < E1

Let temp-plan be current-plan;//assume E2 as E1


                        Randomly generate X (0 < X < 1)

If x < e(E1 - E2)/T  //if condition

Let temp-plan be current-plan;


Let current-plan remain unchanged;

End if

   End if

Step 2.4

Do again steps 2.1- 2.4 till termination criterion is satisfied.

Step 2.5

Decrease the temperature to a new T.


                  Programme no.4: Implementation of SA Algorithm in Process Planning Problem

Expertsmind’s world class education services

We at offer email based assignment help – homework help and projects assistance from k-12 academic level to college and university level and management and engineering studies. Our experts are helping students in their studies and they offer instant tutoring assistance giving their best practiced knowledge and spreading their world class education services through e-Learning program.

- Quality assignment help assistance 24x7 hrs
- Best qualified tutor’s network
- Time on delivery
- Quality assurance before delivery
- 100% originality and fresh work