Multi-Objective Simulated Annealing MOSA

The procedure used in SSA has been extended to multi-objective problems by Suppapitnarm et al. (2000). These workers used the neighborhood perturbation method of Yao et al. (1999) to create a new point around an old point. This algorithm is known as multi-objective simulated annealing (MOSA). Since a Pareto set of solutions is to be 

In the fixed-length JG adaptation, MOSA-aJG, a random number is used to identify a decision variable, p (an integer lying between 0 and Nd - ft). This is one end of the JG. The other end of the JG lies at decision variable, p + fb, where fb is the (integral) number of decision variables in the JG. The other steps are identical to those in MOSA. The details of MOSA-aJG are provided in the Appendix. 

---

Multi-Objective Simulated Annealing with the JG Adaptations (MOSA-JG/aJG see Flowchart in Fig. 4.A 1)... 

---