id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
bracis-33628	Kohara, Debora T.; Oliveira, Gina M. B. de; Martins, Luiz G. A.	Enhancing Multiobjective Genetic Algorithms for Pharmaceutical Batch Scheduling: A Study on Partitioned Selection with Constraints and Mutation with Greedy Local Search Strategy	2024		.htm	text/html	6234	303	47	A set of non-dominated solutions, known as Pareto optimal \(P^*\), exists if no solution within the search space dominates any in \(P^*\)  It is defined as the percentage of elements of the Pareto set \(P*\) that are not contained in P. Given two sets of non-dominated solutions A and B, the set coverage metric, or Coverage of two Sets (CS), represents the percentage of elements in B that are dominated by A. Therefore, CS(A,B)=1 indicates that all solutions in B are dominated by A, while CS(A,B)=0 indicates that none of the elements in B is dominated by A [20].	cache/bracis-33628.htm	txt/bracis-33628.txt