| http://www.w3.org/ns/prov#value | - Although SPEA II was shown to be computationally faster than NSGA II and SPEA II, some complicating tasks, such as possibility of existing dominated individuals in any hyperboxes, keeping a fixed number of subregions throughout the evolutionary search, and so forth, must be overcome in order to obtain satisfactory optimal designations [39, 40].Algorithm 3: A pseudocode for PESA II procedure. 3.4.
|
