id	sid	tid	token	lemma	pos
gra-84	1	1	1	1	NUM
gra-84	1	2	introduction	introduction	NOUN
gra-84	1	3	for	for	ADP
gra-84	1	4	multi	multi	ADJ
gra-84	1	5	-	-	ADJ
gra-84	1	6	objective	objective	ADJ
gra-84	1	7	optimization	optimization	NOUN
gra-84	1	8	problems	problem	NOUN
gra-84	1	9	(	(	PUNCT
gra-84	1	10	mops	mop	NOUN
gra-84	1	11	)	)	PUNCT
gra-84	1	12	,	,	PUNCT
gra-84	1	13	it	it	PRON
gra-84	1	14	is	be	AUX
gra-84	1	15	necessary	necessary	ADJ
gra-84	1	16	to	to	PART
gra-84	1	17	optimize	optimize	VERB
gra-84	1	18	many	many	ADJ
gra-84	1	19	conicting	conicte	VERB
gra-84	1	20	problems	problem	NOUN
gra-84	1	21	concurrently	concurrently	ADV
gra-84	1	22	so	so	SCONJ
gra-84	1	23	as	as	SCONJ
gra-84	1	24	to	to	PART
gra-84	1	25	achieve	achieve	VERB
gra-84	1	26	the	the	DET
gra-84	1	27	best	good	ADJ
gra-84	1	28	overall	overall	ADJ
gra-84	1	29	effect	effect	NOUN
gra-84	1	30	.	.	PUNCT
gra-84	2	1	owing	owe	VERB
gra-84	2	2	to	to	ADP
gra-84	2	3	the	the	DET
gra-84	2	4	contradiction	contradiction	NOUN
gra-84	2	5	of	of	ADP
gra-84	2	6	objectives	objective	NOUN
gra-84	2	7	,	,	PUNCT
gra-84	2	8	there	there	PRON
gra-84	2	9	is	be	VERB
gra-84	2	10	usually	usually	ADV
gra-84	2	11	to	to	ADP
gra-84	2	12	single	single	ADJ
gra-84	2	13	optimal	optimal	ADJ
gra-84	2	14	solution	solution	NOUN
gra-84	2	15	but	but	CCONJ
gra-84	2	16	a	a	DET
gra-84	2	17	set	set	NOUN
gra-84	2	18	of	of	ADP
gra-84	2	19	solutions，called	solutions，calle	VERB
gra-84	2	20	the	the	DET
gra-84	2	21	pareto	pareto	NOUN
gra-84	2	22	set	set	NOUN
gra-84	2	23	.	.	PUNCT
gra-84	3	1	in	in	ADP
gra-84	3	2	the	the	DET
gra-84	3	3	real	real	ADJ
gra-84	3	4	world	world	NOUN
gra-84	3	5	,	,	PUNCT
gra-84	3	6	it	it	PRON
gra-84	3	7	is	be	AUX
gra-84	3	8	not	not	PART
gra-84	3	9	uncommon	uncommon	ADJ
gra-84	3	10	to	to	PART
gra-84	3	11	face	face	VERB
gra-84	3	12	multiple	multiple	ADJ
gra-84	3	13	objectives	objective	NOUN
gra-84	3	14	simultaneously	simultaneously	ADV
gra-84	3	15	,	,	PUNCT
gra-84	3	16	such	such	ADJ
gra-84	3	17	as	as	ADP
gra-84	3	18	water	water	NOUN
gra-84	3	19	resource	resource	NOUN
gra-84	3	20	engineering	engineering	NOUN
gra-84	3	21	[	[	X
gra-84	3	22	1	1	NUM
gra-84	3	23	]	]	PUNCT
gra-84	3	24	,	,	PUNCT
gra-84	3	25	industrial	industrial	ADJ
gra-84	3	26	scheduling	scheduling	NOUN
gra-84	3	27	problem	problem	NOUN
gra-84	3	28	[	[	X
gra-84	3	29	2	2	NUM
gra-84	3	30	]	]	PUNCT
gra-84	3	31	,	,	PUNCT
gra-84	3	32	control	control	NOUN
gra-84	3	33	system	system	NOUN
gra-84	3	34	design	design	NOUN
gra-84	3	35	[	[	X
gra-84	3	36	3	3	NUM
gra-84	3	37	]	]	PUNCT
gra-84	3	38	and	and	CCONJ
gra-84	3	39	so	so	ADV
gra-84	3	40	on	on	ADP
gra-84	3	41	[	[	PUNCT
gra-84	3	42	4	4	NUM
gra-84	3	43	]	]	PUNCT
gra-84	3	44	.	.	PUNCT
gra-84	4	1	evolutionary	evolutionary	ADJ
gra-84	4	2	algorithms	algorithm	NOUN
gra-84	4	3	(	(	PUNCT
gra-84	4	4	eas	ea	NOUN
gra-84	4	5	)	)	PUNCT
gra-84	4	6	are	be	AUX
gra-84	4	7	considered	consider	VERB
gra-84	4	8	to	to	PART
gra-84	4	9	be	be	AUX
gra-84	4	10	very	very	ADV
gra-84	4	11	suitable	suitable	ADJ
gra-84	4	12	for	for	ADP
gra-84	4	13	mops	mop	NOUN
gra-84	4	14	because	because	SCONJ
gra-84	4	15	of	of	ADP
gra-84	4	16	their	their	PRON
gra-84	4	17	population	population	NOUN
gra-84	4	18	-	-	PUNCT
gra-84	4	19	based	base	VERB
gra-84	4	20	characteristics	characteristic	NOUN
gra-84	4	21	and	and	CCONJ
gra-84	4	22	the	the	DET
gra-84	4	23	approximation	approximation	NOUN
gra-84	4	24	of	of	ADP
gra-84	4	25	pareto	pareto	ADJ
gra-84	4	26	sets	set	NOUN
gra-84	4	27	can	can	AUX
gra-84	4	28	be	be	AUX
gra-84	4	29	obtained	obtain	VERB
gra-84	4	30	in	in	ADP
gra-84	4	31	a	a	DET
gra-84	4	32	single	single	ADJ
gra-84	4	33	run	run	NOUN
gra-84	4	34	.	.	PUNCT
gra-84	5	1	in	in	ADP
gra-84	5	2	the	the	DET
gra-84	5	3	past	past	ADJ
gra-84	5	4	decades	decade	NOUN
gra-84	5	5	,	,	PUNCT
gra-84	5	6	many	many	ADJ
gra-84	5	7	multiobjective	multiobjective	ADJ
gra-84	5	8	evolutionary	evolutionary	ADJ
gra-84	5	9	algorithms	algorithm	NOUN
gra-84	5	10	(	(	PUNCT
gra-84	5	11	moeas	moea	NOUN
gra-84	5	12	)	)	PUNCT
gra-84	5	13	have	have	AUX
gra-84	5	14	been	be	AUX
gra-84	5	15	proposed	propose	VERB
gra-84	5	16	.	.	PUNCT
gra-84	6	1	multi	multi	ADJ
gra-84	6	2	-	-	ADJ
gra-84	6	3	objective	objective	ADJ
gra-84	6	4	evolutionary	evolutionary	ADJ
gra-84	6	5	optimization	optimization	NOUN
gra-84	6	6	algorithms	algorithm	NOUN
gra-84	6	7	can	can	AUX
gra-84	6	8	be	be	AUX
gra-84	6	9	roughly	roughly	ADV
gra-84	6	10	divided	divide	VERB
gra-84	6	11	into	into	ADP
gra-84	6	12	three	three	NUM
gra-84	6	13	categories	category	NOUN
gra-84	6	14	.	.	PUNCT
gra-84	7	1	many	many	ADJ
gra-84	7	2	multi	multi	ADJ
gra-84	7	3	-	-	ADJ
gra-84	7	4	objective	objective	ADJ
gra-84	7	5	optimization	optimization	NOUN
gra-84	7	6	algorithms	algorithm	NOUN
gra-84	7	7	based	base	VERB
gra-84	7	8	on	on	ADP
gra-84	7	9	pareto	pareto	ADJ
gra-84	7	10	dominance	dominance	NOUN
gra-84	7	11	,	,	PUNCT
gra-84	7	12	e.g.	e.g.	ADV
gra-84	7	13	,	,	PUNCT
gra-84	7	14	strength	strength	NOUN
gra-84	7	15	pareto	pareto	VERB
gra-84	7	16	evolutionary	evolutionary	ADJ
gra-84	7	17	algorithm	algorithm	NOUN
gra-84	8	1	[	[	X
gra-84	8	2	5	5	NUM
gra-84	8	3	,	,	PUNCT
gra-84	8	4	6	6	NUM
gra-84	8	5	]	]	PUNCT
gra-84	8	6	and	and	CCONJ
gra-84	8	7	nondominated	nondominate	VERB
gra-84	8	8	sorting	sort	VERB
gra-84	8	9	genetic	genetic	ADJ
gra-84	8	10	algorithm	algorithm	NOUN
gra-84	9	1	[	[	X
gra-84	9	2	7	7	NUM
gra-84	9	3	,	,	PUNCT
gra-84	9	4	8	8	NUM
gra-84	9	5	]	]	PUNCT
gra-84	9	6	.	.	PUNCT
gra-84	10	1	these	these	DET
gra-84	10	2	algorithms	algorithm	NOUN
gra-84	10	3	use	use	VERB
gra-84	10	4	the	the	DET
gra-84	10	5	dominant	dominant	ADJ
gra-84	10	6	relation	relation	NOUN
gra-84	10	7	of	of	ADP
gra-84	10	8	solutions	solution	NOUN
gra-84	10	9	as	as	ADP
gra-84	10	10	the	the	DET
gra-84	10	11	rst	rst	PROPN
gra-84	10	12	selection	selection	NOUN
gra-84	10	13	condition	condition	NOUN
gra-84	10	14	to	to	PART
gra-84	10	15	ensure	ensure	VERB
gra-84	10	16	the	the	DET
gra-84	10	17	selection	selection	NOUN
gra-84	10	18	of	of	ADP
gra-84	10	19	convergent	convergent	NOUN
gra-84	10	20	pareto	pareto	ADJ
gra-84	10	21	solution	solution	NOUN
gra-84	10	22	sets	set	NOUN
gra-84	10	23	.	.	PUNCT
gra-84	11	1	then	then	ADV
gra-84	11	2	,	,	PUNCT
gra-84	11	3	the	the	DET
gra-84	11	4	second	second	ADJ
gra-84	11	5	selection	selection	NOUN
gra-84	11	6	strategy	strategy	NOUN
gra-84	11	7	is	be	AUX
gra-84	11	8	adopted	adopt	VERB
gra-84	11	9	to	to	PART
gra-84	11	10	ensure	ensure	VERB
gra-84	11	11	the	the	DET
gra-84	11	12	diversity	diversity	NOUN
gra-84	11	13	of	of	ADP
gra-84	11	14	solution	solution	NOUN
gra-84	11	15	sets	set	NOUN
gra-84	11	16	.	.	PUNCT
gra-84	12	1	unlike	unlike	ADP
gra-84	12	2	dominance	dominance	NOUN
gra-84	12	3	-	-	PUNCT
gra-84	12	4	based	base	VERB
gra-84	12	5	moeas	moea	NOUN
gra-84	12	6	,	,	PUNCT
gra-84	12	7	indicator	indicator	NOUN
gra-84	12	8	-	-	PUNCT
gra-84	12	9	based	base	VERB
gra-84	12	10	evolutionary	evolutionary	ADJ
gra-84	12	11	algorithms	algorithm	NOUN
gra-84	12	12	(	(	PUNCT
gra-84	12	13	ibeas	ibeas	ADJ
gra-84	12	14	)	)	PUNCT
gra-84	13	1	[	[	X
gra-84	13	2	9	9	NUM
gra-84	13	3	]	]	PUNCT
gra-84	13	4	is	be	AUX
gra-84	13	5	also	also	ADV
gra-84	13	6	popular	popular	ADJ
gra-84	13	7	,	,	PUNCT
gra-84	13	8	e.g.	e.g.	ADV
gra-84	13	9	,	,	PUNCT
gra-84	13	10	hypervolume	hypervolume	NOUN
gra-84	13	11	indicator	indicator	NOUN
gra-84	14	1	[	[	X
gra-84	14	2	10	10	NUM
gra-84	14	3	]	]	PUNCT
gra-84	14	4	,	,	PUNCT
gra-84	14	5	r2	r2	PROPN
gra-84	14	6	indicator	indicator	NOUN
gra-84	14	7	[	[	X
gra-84	14	8	11	11	NUM
gra-84	14	9	]	]	PUNCT
gra-84	14	10	.	.	PUNCT
gra-84	15	1	indicator	indicator	NOUN
gra-84	15	2	parameters	parameter	NOUN
gra-84	15	3	are	be	AUX
gra-84	15	4	used	use	VERB
gra-84	15	5	to	to	PART
gra-84	15	6	solve	solve	VERB
gra-84	15	7	convergence	convergence	NOUN
gra-84	15	8	and	and	CCONJ
gra-84	15	9	distributed	distribute	VERB
gra-84	15	10	performance	performance	NOUN
gra-84	15	11	problems	problem	NOUN
gra-84	15	12	of	of	ADP
gra-84	15	13	solution	solution	NOUN
gra-84	15	14	sets	set	NOUN
gra-84	15	15	.	.	PUNCT
gra-84	16	1	different	different	ADJ
gra-84	16	2	from	from	ADP
gra-84	16	3	the	the	DET
gra-84	16	4	rst	rst	PROPN
gra-84	16	5	two	two	NUM
gra-84	16	6	kinds	kind	NOUN
gra-84	16	7	of	of	ADP
gra-84	16	8	multi	multi	ADJ
gra-84	16	9	-	-	ADJ
gra-84	16	10	objective	objective	ADJ
gra-84	16	11	evolutionary	evolutionary	ADJ
gra-84	16	12	algorithms	algorithm	NOUN
gra-84	16	13	,	,	PUNCT
gra-84	16	14	decomposition	decomposition	NOUN
gra-84	16	15	-	-	PUNCT
gra-84	16	16	based	base	VERB
gra-84	16	17	multi	multi	ADJ
gra-84	16	18	-	-	ADJ
gra-84	16	19	objective	objective	ADJ
gra-84	16	20	evolutionary	evolutionary	ADJ
gra-84	16	21	algorithms	algorithm	NOUN
gra-84	16	22	are	be	AUX
gra-84	16	23	proposed	propose	VERB
gra-84	16	24	.	.	PUNCT
gra-84	17	1	a	a	DET
gra-84	17	2	typical	typical	ADJ
gra-84	17	3	algorithm	algorithm	NOUN
gra-84	17	4	is	be	AUX
gra-84	17	5	moea	moea	NOUN
gra-84	17	6	/	/	SYM
gra-84	17	7	d	d	NOUN
gra-84	17	8	algorithm	algorithm	NOUN
gra-84	18	1	[	[	X
gra-84	18	2	12	12	NUM
gra-84	18	3	]	]	PUNCT
gra-84	18	4	,	,	PUNCT
gra-84	18	5	in	in	ADP
gra-84	18	6	addition	addition	NOUN
gra-84	18	7	,	,	PUNCT
gra-84	18	8	there	there	PRON
gra-84	18	9	are	be	VERB
gra-84	18	10	a	a	DET
gra-84	18	11	great	great	ADJ
gra-84	18	12	many	many	ADJ
gra-84	18	13	of	of	ADP
gra-84	18	14	variants	variant	NOUN
gra-84	18	15	algorithms	algorithm	NOUN
gra-84	18	16	,	,	PUNCT
gra-84	18	17	e.g.	e.g.	ADV
gra-84	18	18	,	,	PUNCT
gra-84	18	19	[	[	X
gra-84	18	20	13	13	NUM
gra-84	18	21	,	,	PUNCT
gra-84	18	22	14	14	NUM
gra-84	18	23	]	]	PUNCT
gra-84	18	24	.	.	PUNCT
gra-84	19	1	the	the	DET
gra-84	19	2	moea	moea	NOUN
gra-84	19	3	/	/	SYM
gra-84	19	4	d	d	NOUN
gra-84	19	5	algorithm	algorithm	NOUN
gra-84	19	6	converts	convert	VERB
gra-84	19	7	the	the	DET
gra-84	19	8	multiobjective	multiobjective	ADJ
gra-84	19	9	optimization	optimization	NOUN
gra-84	19	10	problem	problem	NOUN
gra-84	19	11	into	into	ADP
gra-84	19	12	a	a	DET
gra-84	19	13	scalar	scalar	ADJ
gra-84	19	14	subproblem	subproblem	NOUN
gra-84	19	15	and	and	CCONJ
gra-84	19	16	obtains	obtain	VERB
gra-84	19	17	the	the	DET
gra-84	19	18	value	value	NOUN
gra-84	19	19	of	of	ADP
gra-84	19	20	the	the	DET
gra-84	19	21	decomposed	decompose	VERB
gra-84	19	22	single	single	ADJ
gra-84	19	23	objective	objective	ADJ
gra-84	19	24	function	function	NOUN
gra-84	19	25	.	.	PUNCT
gra-84	20	1	and	and	CCONJ
gra-84	20	2	this	this	DET
gra-84	20	3	algorithm	algorithm	NOUN
gra-84	20	4	has	have	AUX
gra-84	20	5	been	be	AUX
gra-84	20	6	demonstrated	demonstrate	VERB
gra-84	20	7	efcient	efcient	ADJ
gra-84	20	8	in	in	ADP
gra-84	20	9	solving	solve	VERB
gra-84	20	10	mops	mop	NOUN
gra-84	20	11	.	.	PUNCT
gra-84	21	1	generally	generally	ADV
gra-84	21	2	speaking	speak	VERB
gra-84	21	3	,	,	PUNCT
gra-84	21	4	these	these	DET
gra-84	21	5	algorithms	algorithm	NOUN
gra-84	21	6	have	have	VERB
gra-84	21	7	two	two	NUM
gra-84	21	8	common	common	ADJ
gra-84	21	9	but	but	CCONJ
gra-84	21	10	often	often	ADV
gra-84	21	11	contradictory	contradictory	ADJ
gra-84	21	12	goals	goal	NOUN
gra-84	21	13	:	:	PUNCT
gra-84	21	14	minimizing	minimize	VERB
gra-84	21	15	the	the	DET
gra-84	21	16	distance	distance	NOUN
gra-84	21	17	of	of	ADP
gra-84	21	18	solutions	solution	NOUN
gra-84	21	19	to	to	ADP
gra-84	21	20	the	the	DET
gra-84	21	21	optimal	optimal	ADJ
gra-84	21	22	frontier	frontier	NOUN
gra-84	21	23	and	and	CCONJ
gra-84	21	24	maximizing	maximize	VERB
gra-84	21	25	the	the	DET
gra-84	21	26	distribution	distribution	NOUN
gra-84	21	27	of	of	ADP
gra-84	21	28	solutions	solution	NOUN
gra-84	21	29	at	at	ADP
gra-84	21	30	the	the	DET
gra-84	21	31	optimal	optimal	ADJ
gra-84	21	32	frontier	frontier	NOUN
gra-84	21	33	.	.	PUNCT
gra-84	22	1	although	although	SCONJ
gra-84	22	2	moea	moea	NOUN
gra-84	22	3	/	/	SYM
gra-84	22	4	d	d	NOUN
gra-84	22	5	algorithm	algorithm	NOUN
gra-84	22	6	can	can	AUX
gra-84	22	7	get	get	VERB
gra-84	22	8	good	good	ADJ
gra-84	22	9	pareto	pareto	ADJ
gra-84	22	10	frontier	frontier	NOUN
gra-84	22	11	.	.	PUNCT
gra-84	23	1	however	however	ADV
gra-84	23	2	,	,	PUNCT
gra-84	23	3	when	when	SCONJ
gra-84	23	4	the	the	DET
gra-84	23	5	number	number	NOUN
gra-84	23	6	of	of	ADP
gra-84	23	7	non	non	ADJ
gra-84	23	8	-	-	ADJ
gra-84	23	9	dominated	dominated	ADJ
gra-84	23	10	solutions	solution	NOUN
gra-84	23	11	is	be	AUX
gra-84	23	12	more	more	ADJ
gra-84	23	13	than	than	ADP
gra-84	23	14	the	the	DET
gra-84	23	15	number	number	NOUN
gra-84	23	16	of	of	ADP
gra-84	23	17	selected	select	VERB
gra-84	23	18	solutions	solution	NOUN
gra-84	23	19	,	,	PUNCT
gra-84	23	20	more	more	ADJ
gra-84	23	21	than	than	SCONJ
gra-84	23	22	the	the	DET
gra-84	23	23	number	number	NOUN
gra-84	23	24	of	of	ADP
gra-84	23	25	solutions	solution	NOUN
gra-84	23	26	will	will	AUX
gra-84	23	27	be	be	AUX
gra-84	23	28	deleted	delete	VERB
gra-84	23	29	randomly	randomly	ADV
gra-84	23	30	.	.	PUNCT
gra-84	24	1	this	this	PRON
gra-84	24	2	is	be	AUX
gra-84	24	3	not	not	PART
gra-84	24	4	conducive	conducive	ADJ
gra-84	24	5	to	to	ADP
gra-84	24	6	preserving	preserve	VERB
gra-84	24	7	the	the	DET
gra-84	24	8	best	good	ADJ
gra-84	24	9	individuals	individual	NOUN
gra-84	24	10	,	,	PUNCT
gra-84	24	11	and	and	CCONJ
gra-84	24	12	will	will	AUX
gra-84	24	13	reduce	reduce	VERB
gra-84	24	14	the	the	DET
gra-84	24	15	convergence	convergence	NOUN
gra-84	24	16	of	of	ADP
gra-84	24	17	the	the	DET
gra-84	24	18	solution	solution	NOUN
gra-84	24	19	.	.	PUNCT
gra-84	25	1	in	in	ADP
gra-84	25	2	order	order	NOUN
gra-84	25	3	to	to	PART
gra-84	25	4	solve	solve	VERB
gra-84	25	5	the	the	DET
gra-84	25	6	above	above	ADJ
gra-84	25	7	problems	problem	NOUN
gra-84	25	8	,	,	PUNCT
gra-84	25	9	we	we	PRON
gra-84	25	10	adopt	adopt	VERB
gra-84	25	11	different	different	ADJ
gra-84	25	12	deletion	deletion	NOUN
gra-84	25	13	strategies	strategy	NOUN
gra-84	25	14	to	to	PART
gra-84	25	15	increase	increase	VERB
gra-84	25	16	the	the	DET
gra-84	25	17	convergence	convergence	NOUN
gra-84	25	18	and	and	CCONJ
gra-84	25	19	diversity	diversity	NOUN
gra-84	25	20	of	of	ADP
gra-84	25	21	the	the	DET
gra-84	25	22	nal	nal	ADJ
gra-84	25	23	approximate	approximate	ADJ
gra-84	25	24	pareto	pareto	ADJ
gra-84	25	25	frontier	frontier	NOUN
gra-84	25	26	.	.	PUNCT
gra-84	26	1	at	at	ADP
gra-84	26	2	the	the	DET
gra-84	26	3	same	same	ADJ
gra-84	26	4	time	time	NOUN
gra-84	26	5	,	,	PUNCT
gra-84	26	6	for	for	ADP
gra-84	26	7	the	the	DET
gra-84	26	8	operation	operation	NOUN
gra-84	26	9	that	that	PRON
gra-84	26	10	moea	moea	VERB
gra-84	26	11	/	/	SYM
gra-84	26	12	d	d	NOUN
gra-84	26	13	offspring	offspring	NOUN
gra-84	26	14	may	may	AUX
gra-84	26	15	replace	replace	VERB
gra-84	26	16	more	more	ADJ
gra-84	26	17	than	than	ADP
gra-84	26	18	one	one	NUM
gra-84	26	19	parent	parent	NOUN
gra-84	26	20	,	,	PUNCT
gra-84	26	21	this	this	DET
gra-84	26	22	paper	paper	NOUN
gra-84	26	23	adopts	adopt	VERB
gra-84	26	24	the	the	DET
gra-84	26	25	strategy	strategy	NOUN
gra-84	26	26	of	of	ADP
gra-84	26	27	rst	rst	PROPN
gra-84	26	28	substitution	substitution	NOUN
gra-84	26	29	and	and	CCONJ
gra-84	26	30	stop	stop	VERB
gra-84	26	31	[	[	X
gra-84	26	32	14	14	NUM
gra-84	26	33	]	]	PUNCT
gra-84	26	34	.	.	PUNCT
gra-84	27	1	the	the	DET
gra-84	27	2	rest	rest	NOUN
gra-84	27	3	of	of	ADP
gra-84	27	4	this	this	DET
gra-84	27	5	paper	paper	NOUN
gra-84	27	6	is	be	AUX
gra-84	27	7	organized	organize	VERB
gra-84	27	8	as	as	SCONJ
gra-84	27	9	follows	follow	VERB
gra-84	27	10	.	.	PUNCT
gra-84	28	1	section	section	NOUN
gra-84	28	2	2	2	NUM
gra-84	28	3	briey	briey	NOUN
gra-84	28	4	reviews	review	VERB
gra-84	28	5	the	the	DET
gra-84	28	6	related	related	ADJ
gra-84	28	7	basic	basic	ADJ
gra-84	28	8	concepts	concept	NOUN
gra-84	28	9	and	and	CCONJ
gra-84	28	10	the	the	DET
gra-84	28	11	moea	moea	NOUN
gra-84	28	12	/	/	SYM
gra-84	28	13	d	d	NOUN
gra-84	28	14	algorithm	algorithm	NOUN
gra-84	28	15	.	.	PUNCT
gra-84	29	1	in	in	ADP
gra-84	29	2	section	section	NOUN
gra-84	29	3	3	3	NUM
gra-84	29	4	,	,	PUNCT
gra-84	29	5	the	the	DET
gra-84	29	6	strategy	strategy	NOUN
gra-84	29	7	of	of	ADP
gra-84	29	8	differentiated	differentiated	ADJ
gra-84	29	9	deletion	deletion	NOUN
gra-84	29	10	and	and	CCONJ
gra-84	29	11	the	the	DET
gra-84	29	12	improved	improved	ADJ
gra-84	29	13	algorithm	algorithm	NOUN
gra-84	29	14	of	of	ADP
gra-84	29	15	moea	moea	NOUN
gra-84	29	16	/	/	SYM
gra-84	29	17	d	d	NOUN
gra-84	29	18	-	-	PUNCT
gra-84	29	19	dfs	dfs	NOUN
gra-84	29	20	are	be	AUX
gra-84	29	21	introduced	introduce	VERB
gra-84	29	22	concisely	concisely	ADV
gra-84	29	23	.	.	PUNCT
gra-84	30	1	section	section	NOUN
gra-84	30	2	4	4	NUM
gra-84	30	3	shows	show	VERB
gra-84	30	4	the	the	DET
gra-84	30	5	results	result	NOUN
gra-84	30	6	and	and	CCONJ
gra-84	30	7	analysis	analysis	NOUN
gra-84	30	8	of	of	ADP
gra-84	30	9	the	the	DET
gra-84	30	10	proposed	propose	VERB
gra-84	30	11	algorithm	algorithm	NOUN
gra-84	30	12	.	.	PUNCT
gra-84	31	1	section	section	NOUN
gra-84	31	2	5	5	NUM
gra-84	31	3	concludes	conclude	VERB
gra-84	31	4	this	this	DET
gra-84	31	5	paper	paper	NOUN
gra-84	31	6	with	with	ADP
gra-84	31	7	a	a	DET
gra-84	31	8	summary	summary	NOUN
gra-84	31	9	.	.	PUNCT
gra-84	32	1	2	2	NUM
gra-84	32	2	preliminaries	preliminary	NOUN
gra-84	32	3	and	and	CCONJ
gra-84	32	4	background	background	NOUN
gra-84	32	5	2.1	2.1	NUM
gra-84	32	6	.	.	PUNCT
gra-84	32	7	basic	basic	ADJ
gra-84	32	8	concepts	concept	NOUN
gra-84	32	9	generality	generality	NOUN
gra-84	32	10	,	,	PUNCT
gra-84	32	11	an	an	DET
gra-84	32	12	mop	mop	NOUN
gra-84	32	13	maybe	maybe	ADV
gra-84	32	14	stated	state	VERB
gra-84	32	15	as	as	ADP
gra-84	32	16	minimization	minimization	NOUN
gra-84	32	17	problem	problem	NOUN
gra-84	32	18	and	and	CCONJ
gra-84	32	19	dened	dene	VERB
gra-84	32	20	as	as	SCONJ
gra-84	32	21	follows	follow	VERB
gra-84	32	22	:	:	PUNCT
gra-84	32	23	(	(	PUNCT
gra-84	32	24	1)where	1)where	NUM
gra-84	32	25	x	x	PUNCT
gra-84	32	26	denotes	denote	VERB
gra-84	32	27	a	a	DET
gra-84	32	28	solution	solution	NOUN
gra-84	32	29	vector	vector	NOUN
gra-84	32	30	in	in	ADP
gra-84	32	31	the	the	DET
gra-84	32	32	feasible	feasible	ADJ
gra-84	32	33	solution	solution	NOUN
gra-84	32	34	space	space	NOUN
gra-84	32	35	ω	ω	PROPN
gra-84	32	36	,	,	PUNCT
gra-84	32	37	and	and	CCONJ
gra-84	32	38	f	f	PROPN
gra-84	32	39	(	(	PUNCT
gra-84	32	40	i	i	NOUN
gra-84	32	41	=	=	NOUN
gra-84	32	42	1	1	NUM
gra-84	32	43	,	,	PUNCT
gra-84	32	44	2	2	NUM
gra-84	32	45	,	,	PUNCT
gra-84	32	46	…	…	PUNCT
gra-84	32	47	,	,	PUNCT
gra-84	32	48	m	m	VERB
gra-84	32	49	)	)	PUNCT
gra-84	32	50	is	be	AUX
gra-84	32	51	the	the	DET
gra-84	32	52	ith	ith	PROPN
gra-84	32	53	objective	objective	NOUN
gra-84	32	54	to	to	PART
gra-84	32	55	be	be	AUX
gra-84	32	56	i	i	PRON
gra-84	32	57	minimized	minimize	VERB
gra-84	32	58	.	.	PUNCT
gra-84	33	1	then	then	ADV
gra-84	33	2	,	,	PUNCT
gra-84	33	3	basic	basic	ADJ
gra-84	33	4	concepts	concept	NOUN
gra-84	33	5	used	use	VERB
gra-84	33	6	in	in	ADP
gra-84	33	7	multi	multi	ADJ
gra-84	33	8	-	-	ADJ
gra-84	33	9	objective	objective	ADJ
gra-84	33	10	optimization	optimization	NOUN
gra-84	33	11	problem	problem	NOUN
gra-84	33	12	will	will	AUX
gra-84	33	13	be	be	AUX
gra-84	33	14	briey	briey	ADJ
gra-84	33	15	introduce	introduce	ADJ
gra-84	33	16	.	.	PUNCT
gra-84	34	1	denition	denition	NOUN
gra-84	34	2	1	1	NUM
gra-84	34	3	:	:	PUNCT
gra-84	34	4	iff	iff	PROPN
gra-84	34	5	i	i	PRON
gra-84	34	6	{	{	PUNCT
gra-84	34	7	1	1	NUM
gra-84	34	8	,	,	PUNCT
gra-84	34	9	2	2	NUM
gra-84	34	10	,	,	PUNCT
gra-84	34	11	…	…	PUNCT
gra-84	34	12	,	,	PUNCT
gra-84	34	13	m	m	VERB
gra-84	34	14	}	}	PUNCT
gra-84	34	15	,	,	PUNCT
gra-84	34	16	f	f	PROPN
gra-84	34	17	(	(	PUNCT
gra-84	34	18	u	u	NOUN
gra-84	34	19	)	)	PUNCT
gra-84	34	20	≤	≤	NUM
gra-84	34	21	f	f	X
gra-84	34	22	(	(	PUNCT
gra-84	34	23	v	v	NOUN
gra-84	34	24	)	)	PUNCT
gra-84	34	25	,	,	PUNCT
gra-84	34	26	and	and	CCONJ
gra-84	34	27	j	j	PROPN
gra-84	34	28	{	{	PUNCT
gra-84	34	29	1	1	NUM
gra-84	34	30	,	,	PUNCT
gra-84	34	31	2	2	NUM
gra-84	34	32	,	,	PUNCT
gra-84	34	33	…	…	PUNCT
gra-84	34	34	,	,	PUNCT
gra-84	34	35	m	m	VERB
gra-84	34	36	}	}	PUNCT
gra-84	34	37	,	,	PUNCT
gra-84	34	38	f	f	PROPN
gra-84	34	39	(	(	PUNCT
gra-84	34	40	u	u	NOUN
gra-84	34	41	)	)	PUNCT
gra-84	35	1	i	i	PRON
gra-84	35	2	i	i	PRON
gra-84	36	1	i	i	PRON
gra-84	36	2	<	<	X
gra-84	36	3	f	f	X
gra-84	36	4	(	(	PUNCT
gra-84	36	5	v	v	NOUN
gra-84	36	6	)	)	PUNCT
gra-84	36	7	.	.	PUNCT
gra-84	37	1	in	in	ADP
gra-84	37	2	this	this	DET
gra-84	37	3	case	case	NOUN
gra-84	37	4	,	,	PUNCT
gra-84	37	5	vector	vector	NOUN
gra-84	37	6	u	u	NOUN
gra-84	37	7	is	be	AUX
gra-84	37	8	said	say	VERB
gra-84	37	9	to	to	PART
gra-84	37	10	dominate	dominate	VERB
gra-84	37	11	another	another	DET
gra-84	37	12	vector	vector	NOUN
gra-84	37	13	i	i	PRON
gra-84	37	14	v	v	NOUN
gra-84	37	15	,	,	PUNCT
gra-84	37	16	denoted	denote	VERB
gra-84	37	17	by	by	ADP
gra-84	37	18	.	.	PUNCT
gra-84	38	1	u	u	PRON
gra-84	38	2	p	p	NOUN
gra-84	38	3	v	v	NUM
gra-84	38	4	denition	denition	NOUN
gra-84	38	5	2	2	NUM
gra-84	38	6	:	:	PUNCT
gra-84	38	7	,	,	PUNCT
gra-84	38	8	the	the	DET
gra-84	38	9	decision	decision	NOUN
gra-84	38	10	vector	vector	NOUN
gra-84	38	11	x*î	x*î	PROPN
gra-84	38	12	ω	ω	PROPN
gra-84	38	13	is	be	AUX
gra-84	38	14	the	the	DET
gra-84	38	15	iff,*xxx$îw	iff,*xxx$îw	NOUN
gra-84	38	16	/	/	SYM
gra-84	38	17	p	p	NOUN
gra-84	38	18	pareto	pareto	VERB
gra-84	38	19	optimal	optimal	ADJ
gra-84	38	20	.	.	PUNCT
gra-84	39	1	denition	denition	NOUN
gra-84	39	2	3	3	NUM
gra-84	39	3	:	:	PUNCT
gra-84	39	4	the	the	DET
gra-84	39	5	pareto	pareto	ADJ
gra-84	39	6	optimal	optimal	ADJ
gra-84	39	7	set	set	NOUN
gra-84	39	8	,	,	PUNCT
gra-84	39	9	ps	ps	PROPN
gra-84	39	10	,	,	PUNCT
gra-84	39	11	is	be	AUX
gra-84	39	12	the	the	DET
gra-84	39	13	non	non	ADJ
gra-84	39	14	-	-	ADJ
gra-84	39	15	dominated	dominate	VERB
gra-84	39	16	solution	solution	NOUN
gra-84	39	17	set	set	VERB
gra-84	39	18	.	.	PUNCT
gra-84	40	1	denition	denition	NOUN
gra-84	40	2	4	4	NUM
gra-84	40	3	:	:	PUNCT
gra-84	40	4	the	the	DET
gra-84	40	5	pareto	pareto	ADJ
gra-84	40	6	frontier	frontier	NOUN
gra-84	40	7	,	,	PUNCT
gra-84	40	8	pf	pf	PROPN
gra-84	40	9	,	,	PUNCT
gra-84	40	10	is	be	AUX
gra-84	40	11	the	the	DET
gra-84	40	12	objective	objective	ADJ
gra-84	40	13	function	function	NOUN
gra-84	40	14	of	of	ADP
gra-84	40	15	the	the	DET
gra-84	40	16	non	non	ADJ
gra-84	40	17	-	-	ADJ
gra-84	40	18	dominated	dominated	ADJ
gra-84	40	19	solutions	solution	NOUN
gra-84	40	20	.	.	PUNCT
gra-84	41	1	2.2	2.2	NUM
gra-84	41	2	.	.	PUNCT
gra-84	41	3	introduce	introduce	NOUN
gra-84	41	4	of	of	ADP
gra-84	41	5	moea	moea	NOUN
gra-84	41	6	/	/	SYM
gra-84	42	1	d	d	NOUN
gra-84	42	2	in	in	ADP
gra-84	42	3	the	the	DET
gra-84	42	4	paper	paper	NOUN
gra-84	42	5	of	of	ADP
gra-84	42	6	moea	moea	NOUN
gra-84	42	7	/	/	SYM
gra-84	42	8	d	d	NOUN
gra-84	42	9	algorithm	algorithm	NOUN
gra-84	42	10	,	,	PUNCT
gra-84	42	11	three	three	NUM
gra-84	42	12	based	base	VERB
gra-84	42	13	on	on	ADP
gra-84	42	14	decomposition	decomposition	NOUN
gra-84	42	15	approaches	approach	NOUN
gra-84	42	16	are	be	AUX
gra-84	42	17	introduced	introduce	VERB
gra-84	42	18	.	.	PUNCT
gra-84	43	1	it	it	PRON
gra-84	43	2	includes	include	VERB
gra-84	43	3	chebyshev	chebyshev	PROPN
gra-84	43	4	decomposi	decomposi	PROPN
gra-84	43	5	t	t	PROPN
gra-84	43	6	ion	ion	NOUN
gra-84	43	7	approach	approach	NOUN
gra-84	43	8	,	,	PUNCT
gra-84	43	9	and	and	CCONJ
gra-84	43	10	has	have	VERB
gra-84	43	11	a	a	DET
gra-84	43	12	corresponding	corresponding	ADJ
gra-84	43	13	weight	weight	NOUN
gra-84	43	14	vector	vector	NOUN
gra-84	43	15	for	for	ADP
gra-84	43	16	any	any	DET
gra-84	43	17	pareto	pareto	ADJ
gra-84	43	18	optimal	optimal	ADJ
gra-84	43	19	solution	solution	NOUN
gra-84	43	20	.	.	PUNCT
gra-84	44	1	therefore	therefore	ADV
gra-84	44	2	,	,	PUNCT
gra-84	44	3	different	different	ADJ
gra-84	44	4	pareto	pareto	ADJ
gra-84	44	5	optimal	optimal	ADJ
gra-84	44	6	solutions	solution	NOUN
gra-84	44	7	can	can	AUX
gra-84	44	8	be	be	AUX
gra-84	44	9	obtained	obtain	VERB
gra-84	44	10	by	by	ADP
gra-84	44	11	altering	alter	VERB
gra-84	44	12	the	the	DET
gra-84	44	13	weight	weight	NOUN
gra-84	44	14	vector	vector	NOUN
gra-84	44	15	.	.	PUNCT
gra-84	45	1	the	the	DET
gra-84	45	2	process	process	NOUN
gra-84	45	3	of	of	ADP
gra-84	45	4	moea	moea	NOUN
gra-84	45	5	/	/	SYM
gra-84	45	6	d	d	NOUN
gra-84	45	7	algorithm	algorithm	NOUN
gra-84	45	8	is	be	AUX
gra-84	45	9	as	as	SCONJ
gra-84	45	10	follows	follow	VERB
gra-84	45	11	:	:	PUNCT
gra-84	45	12	in	in	ADP
gra-84	45	13	the	the	DET
gra-84	45	14	initialization	initialization	NOUN
gra-84	45	15	part	part	NOUN
gra-84	45	16	,	,	PUNCT
gra-84	45	17	the	the	DET
gra-84	45	18	population	population	NOUN
gra-84	45	19	p	p	NOUN
gra-84	45	20	with	with	ADP
gra-84	45	21	the	the	DET
gra-84	45	22	scale	scale	NOUN
gra-84	45	23	of	of	ADP
gra-84	45	24	n	n	NUM
gra-84	45	25	is	be	AUX
gra-84	45	26	generated	generate	VERB
gra-84	45	27	randomly	randomly	ADV
gra-84	45	28	,	,	PUNCT
gra-84	45	29	and	and	CCONJ
gra-84	45	30	the	the	DET
gra-84	45	31	weight	weight	NOUN
gra-84	45	32	vector	vector	NOUN
gra-84	45	33	λ	λ	PROPN
gra-84	45	34	,	,	PUNCT
gra-84	45	35	…	…	PUNCT
gra-84	45	36	,	,	PUNCT
gra-84	45	37	λ	λ	NOUN
gra-84	45	38	are	be	AUX
gra-84	45	39	1	1	NUM
gra-84	45	40	n	n	PRON
gra-84	45	41	uniformly	uniformly	ADV
gra-84	45	42	distributed	distribute	VERB
gra-84	45	43	.	.	PUNCT
gra-84	46	1	meanwhile	meanwhile	ADV
gra-84	46	2	,	,	PUNCT
gra-84	46	3	the	the	DET
gra-84	46	4	nearest	near	ADJ
gra-84	46	5	t	t	NOUN
gra-84	46	6	individuals	individual	NOUN
gra-84	46	7	of	of	ADP
gra-84	46	8	each	each	DET
gra-84	46	9	individual	individual	NOUN
gra-84	46	10	can	can	AUX
gra-84	46	11	be	be	AUX
gra-84	46	12	obtained	obtain	VERB
gra-84	46	13	by	by	ADP
gra-84	46	14	euclidean	euclidean	ADJ
gra-84	46	15	distance	distance	NOUN
gra-84	46	16	,	,	PUNCT
gra-84	46	17	and	and	CCONJ
gra-84	46	18	multi	multi	ADJ
gra-84	46	19	-	-	ADJ
gra-84	46	20	objective	objective	ADJ
gra-84	46	21	optimization	optimization	NOUN
gra-84	46	22	decomposition	decomposition	NOUN
gra-84	46	23	algorithm	algorithm	NOUN
gra-84	46	24	based	base	VERB
gra-84	46	25	on	on	ADP
gra-84	46	26	differentiated	differentiated	ADJ
gra-84	46	27	selection	selection	NOUN
gra-84	46	28	strategy	strategy	NOUN
gra-84	46	29	original	original	ADJ
gra-84	46	30	research	research	NOUN
gra-84	46	31	paper	paper	NOUN
gra-84	46	32	yan	yan	PROPN
gra-84	46	33	xiaofan	xiaofan	PROPN
gra-84	47	1	college	college	PROPN
gra-84	47	2	of	of	ADP
gra-84	47	3	computer	computer	NOUN
gra-84	47	4	science	science	NOUN
gra-84	47	5	and	and	CCONJ
gra-84	47	6	technology	technology	NOUN
gra-84	47	7	,	,	PUNCT
gra-84	47	8	tianjin	tianjin	PROPN
gra-84	47	9	polytechnic	polytechnic	PROPN
gra-84	47	10	university	university	PROPN
gra-84	47	11	,	,	PUNCT
gra-84	47	12	tianjin	tianjin	PROPN
gra-84	47	13	,	,	PUNCT
gra-84	47	14	300387	300387	NUM
gra-84	47	15	,	,	PUNCT
gra-84	47	16	china	china	PROPN
gra-84	47	17	x	x	SYM
gra-84	48	1	127gjra	127gjra	PROPN
gra-84	48	2	global	global	ADJ
gra-84	48	3	journal	journal	NOUN
gra-84	48	4	for	for	ADP
gra-84	48	5	research	research	NOUN
gra-84	48	6	analysis	analysis	NOUN
gra-84	48	7	computer	computer	NOUN
gra-84	48	8	science	science	NOUN
gra-84	48	9	decomposition	decomposition	NOUN
gra-84	48	10	-	-	PUNCT
gra-84	48	11	based	base	VERB
gra-84	48	12	multi	multi	ADJ
gra-84	48	13	-	-	ADJ
gra-84	48	14	objective	objective	ADJ
gra-84	48	15	evolutionary	evolutionary	ADJ
gra-84	48	16	algorithm	algorithm	NOUN
gra-84	48	17	can	can	AUX
gra-84	48	18	obtain	obtain	VERB
gra-84	48	19	effective	effective	ADJ
gra-84	48	20	solution	solution	NOUN
gra-84	48	21	sets	set	NOUN
gra-84	48	22	for	for	ADP
gra-84	48	23	solving	solve	VERB
gra-84	48	24	multi	multi	ADJ
gra-84	48	25	-	-	ADJ
gra-84	48	26	objective	objective	ADJ
gra-84	48	27	optimization	optimization	NOUN
gra-84	48	28	problems	problem	NOUN
gra-84	48	29	.	.	PUNCT
gra-84	49	1	however	however	ADV
gra-84	49	2	,	,	PUNCT
gra-84	49	3	the	the	DET
gra-84	49	4	random	random	ADJ
gra-84	49	5	way	way	NOUN
gra-84	49	6	of	of	ADP
gra-84	49	7	selecting	select	VERB
gra-84	49	8	individuals	individual	NOUN
gra-84	49	9	is	be	AUX
gra-84	49	10	not	not	PART
gra-84	49	11	conducive	conducive	ADJ
gra-84	49	12	to	to	ADP
gra-84	49	13	the	the	DET
gra-84	49	14	preservation	preservation	NOUN
gra-84	49	15	of	of	ADP
gra-84	49	16	good	good	ADJ
gra-84	49	17	solutions	solution	NOUN
gra-84	49	18	and	and	CCONJ
gra-84	49	19	reduces	reduce	VERB
gra-84	49	20	the	the	DET
gra-84	49	21	convergence	convergence	NOUN
gra-84	49	22	speed	speed	NOUN
gra-84	49	23	of	of	ADP
gra-84	49	24	the	the	DET
gra-84	49	25	algorithm	algorithm	NOUN
gra-84	49	26	.	.	PUNCT
gra-84	50	1	in	in	ADP
gra-84	50	2	order	order	NOUN
gra-84	50	3	to	to	PART
gra-84	50	4	solve	solve	VERB
gra-84	50	5	this	this	DET
gra-84	50	6	problem	problem	NOUN
gra-84	50	7	,	,	PUNCT
gra-84	50	8	a	a	DET
gra-84	50	9	multiobjective	multiobjective	ADJ
gra-84	50	10	optimization	optimization	NOUN
gra-84	50	11	decomposition	decomposition	NOUN
gra-84	50	12	algorithm	algorithm	NOUN
gra-84	50	13	based	base	VERB
gra-84	50	14	on	on	ADP
gra-84	50	15	differentiated	differentiated	ADJ
gra-84	50	16	selection	selection	NOUN
gra-84	50	17	strategy	strategy	NOUN
gra-84	50	18	(	(	PUNCT
gra-84	50	19	moea	moea	NOUN
gra-84	50	20	/	/	SYM
gra-84	51	1	d	d	NOUN
gra-84	51	2	-	-	PUNCT
gra-84	51	3	dfs	dfs	NOUN
gra-84	51	4	)	)	PUNCT
gra-84	51	5	is	be	AUX
gra-84	51	6	proposed	propose	VERB
gra-84	51	7	.	.	PUNCT
gra-84	52	1	the	the	DET
gra-84	52	2	differentiated	differentiated	ADJ
gra-84	52	3	selection	selection	NOUN
gra-84	52	4	strategy	strategy	NOUN
gra-84	52	5	adopted	adopt	VERB
gra-84	52	6	by	by	ADP
gra-84	52	7	the	the	DET
gra-84	52	8	algorithm	algorithm	NOUN
gra-84	52	9	is	be	AUX
gra-84	52	10	to	to	PART
gra-84	52	11	select	select	VERB
gra-84	52	12	the	the	DET
gra-84	52	13	non	non	ADJ
gra-84	52	14	-	-	ADJ
gra-84	52	15	dominant	dominant	ADJ
gra-84	52	16	solution	solution	NOUN
gra-84	52	17	from	from	ADP
gra-84	52	18	population	population	NOUN
gra-84	52	19	,	,	PUNCT
gra-84	52	20	using	use	VERB
gra-84	52	21	the	the	DET
gra-84	52	22	method	method	NOUN
gra-84	52	23	of	of	ADP
gra-84	52	24	individual	individual	ADJ
gra-84	52	25	selection	selection	NOUN
gra-84	52	26	in	in	ADP
gra-84	52	27	nsga	nsga	NOUN
gra-84	52	28	-	-	PUNCT
gra-84	52	29	ii	ii	NOUN
gra-84	52	30	.	.	PUNCT
gra-84	53	1	meanwhile	meanwhile	ADV
gra-84	53	2	,	,	PUNCT
gra-84	53	3	the	the	DET
gra-84	53	4	strategy	strategy	NOUN
gra-84	53	5	of	of	ADP
gra-84	53	6	rst	rst	PROPN
gra-84	53	7	substitution	substitution	NOUN
gra-84	53	8	and	and	CCONJ
gra-84	53	9	stopping	stopping	NOUN
gra-84	53	10	is	be	AUX
gra-84	53	11	adopted	adopt	VERB
gra-84	53	12	when	when	SCONJ
gra-84	53	13	the	the	DET
gra-84	53	14	offspring	offspring	NOUN
gra-84	53	15	replace	replace	NOUN
gra-84	53	16	parent	parent	NOUN
gra-84	53	17	.	.	PUNCT
gra-84	54	1	it	it	PRON
gra-84	54	2	is	be	AUX
gra-84	54	3	conducive	conducive	ADJ
gra-84	54	4	to	to	ADP
gra-84	54	5	enhancing	enhance	VERB
gra-84	54	6	the	the	DET
gra-84	54	7	diversity	diversity	NOUN
gra-84	54	8	of	of	ADP
gra-84	54	9	the	the	DET
gra-84	54	10	population	population	NOUN
gra-84	54	11	.	.	PUNCT
gra-84	55	1	the	the	DET
gra-84	55	2	experimental	experimental	ADJ
gra-84	55	3	results	result	NOUN
gra-84	55	4	of	of	ADP
gra-84	55	5	zdt	zdt	PROPN
gra-84	55	6	test	test	NOUN
gra-84	55	7	function	function	NOUN
gra-84	55	8	shows	show	VERB
gra-84	55	9	that	that	SCONJ
gra-84	55	10	the	the	DET
gra-84	55	11	algorithm	algorithm	NOUN
gra-84	55	12	is	be	AUX
gra-84	55	13	superior	superior	ADJ
gra-84	55	14	to	to	ADP
gra-84	55	15	other	other	ADJ
gra-84	55	16	algorithm	algorithm	NOUN
gra-84	55	17	in	in	ADP
gra-84	55	18	convergence	convergence	NOUN
gra-84	55	19	and	and	CCONJ
gra-84	55	20	diversity	diversity	NOUN
gra-84	55	21	,	,	PUNCT
gra-84	55	22	and	and	CCONJ
gra-84	55	23	has	have	VERB
gra-84	55	24	certain	certain	ADJ
gra-84	55	25	advantages	advantage	NOUN
gra-84	55	26	in	in	ADP
gra-84	55	27	solving	solve	VERB
gra-84	55	28	performance	performance	NOUN
gra-84	55	29	.	.	PUNCT
gra-84	56	1	abstract	abstract	ADJ
gra-84	56	2	keywords	keyword	NOUN
gra-84	56	3	:	:	PUNCT
gra-84	56	4	decomposition	decomposition	NOUN
gra-84	56	5	-	-	PUNCT
gra-84	56	6	based	base	VERB
gra-84	56	7	;	;	PUNCT
gra-84	56	8	multi	multi	ADJ
gra-84	56	9	-	-	ADJ
gra-84	56	10	objective	objective	ADJ
gra-84	56	11	;	;	PUNCT
gra-84	56	12	genetic	genetic	ADJ
gra-84	56	13	operator	operator	NOUN
gra-84	56	14	;	;	PUNCT
gra-84	56	15	selection	selection	NOUN
gra-84	56	16	strategy	strategy	NOUN
gra-84	56	17	.	.	PUNCT
gra-84	57	1	volume-8	volume-8	NUM
gra-84	57	2	,	,	PUNCT
gra-84	57	3	issue-9	issue-9	NUM
gra-84	57	4	,	,	PUNCT
gra-84	57	5	september-2019	september-2019	ADJ
gra-84	57	6	•	•	NUM
gra-84	57	7	print	print	NOUN
gra-84	57	8	issn	issn	PROPN
gra-84	57	9	no	no	NOUN
gra-84	57	10	.	.	PROPN
gra-84	58	1	2277	2277	NUM
gra-84	58	2	8160	8160	NUM
gra-84	58	3	•	•	NOUN
gra-84	58	4	doi	doi	NOUN
gra-84	58	5	:	:	PUNCT
gra-84	58	6	10.36106	10.36106	NUM
gra-84	58	7	/	/	SYM
gra-84	58	8	gjra	gjra	NOUN
gra-84	58	9	128	128	NUM
gra-84	58	10	x	x	NOUN
gra-84	58	11	gjra	gjra	PROPN
gra-84	58	12	global	global	ADJ
gra-84	58	13	journal	journal	PROPN
gra-84	58	14	for	for	ADP
gra-84	58	15	research	research	NOUN
gra-84	58	16	analysis	analysis	NOUN
gra-84	58	17	the	the	DET
gra-84	58	18	nearest	near	ADJ
gra-84	58	19	t	t	PROPN
gra-84	58	20	neighborhood	neighborhood	NOUN
gra-84	58	21	individuals	individual	NOUN
gra-84	58	22	of	of	ADP
gra-84	58	23	each	each	DET
gra-84	58	24	individual	individual	NOUN
gra-84	58	25	can	can	AUX
gra-84	58	26	be	be	AUX
gra-84	58	27	obtained	obtain	VERB
gra-84	58	28	.	.	PUNCT
gra-84	59	1	then	then	ADV
gra-84	59	2	,	,	PUNCT
gra-84	59	3	the	the	DET
gra-84	59	4	objective	objective	ADJ
gra-84	59	5	function	function	NOUN
gra-84	59	6	value	value	NOUN
gra-84	59	7	of	of	ADP
gra-84	59	8	each	each	DET
gra-84	59	9	individual	individual	NOUN
gra-84	59	10	and	and	CCONJ
gra-84	59	11	the	the	DET
gra-84	59	12	ideal	ideal	ADJ
gra-84	59	13	point	point	NOUN
gra-84	59	14	z	z	NOUN
gra-84	59	15	of	of	ADP
gra-84	59	16	the	the	DET
gra-84	59	17	population	population	NOUN
gra-84	59	18	are	be	AUX
gra-84	59	19	obtained	obtain	VERB
gra-84	59	20	.	.	PUNCT
gra-84	60	1	the	the	DET
gra-84	60	2	non	non	ADJ
gra-84	60	3	-	-	ADJ
gra-84	60	4	dominant	dominant	ADJ
gra-84	60	5	solution	solution	NOUN
gra-84	60	6	in	in	ADP
gra-84	60	7	the	the	DET
gra-84	60	8	population	population	NOUN
gra-84	60	9	is	be	AUX
gra-84	60	10	called	call	VERB
gra-84	60	11	elite	elite	ADJ
gra-84	60	12	population	population	NOUN
gra-84	60	13	ep	ep	PROPN
gra-84	60	14	.	.	PUNCT
gra-84	61	1	in	in	ADP
gra-84	61	2	the	the	DET
gra-84	61	3	update	update	NOUN
gra-84	61	4	part	part	NOUN
gra-84	61	5	,	,	PUNCT
gra-84	61	6	the	the	DET
gra-84	61	7	paternal	paternal	ADJ
gra-84	61	8	population	population	NOUN
gra-84	61	9	generates	generate	VERB
gra-84	61	10	the	the	DET
gra-84	61	11	offspring	offspring	NOUN
gra-84	61	12	population	population	NOUN
gra-84	61	13	p	p	NOUN
gra-84	61	14	by	by	ADP
gra-84	61	15	genetic	genetic	ADJ
gra-84	61	16	operators	operator	NOUN
gra-84	61	17	.	.	PUNCT
gra-84	62	1	two	two	NUM
gra-84	62	2	paternal	paternal	ADJ
gra-84	62	3	individuals	individual	NOUN
gra-84	62	4	are	be	AUX
gra-84	62	5	randomly	randomly	ADV
gra-84	62	6	selected	select	VERB
gra-84	62	7	from	from	ADP
gra-84	62	8	their	their	PRON
gra-84	62	9	neighborhoods	neighborhood	NOUN
gra-84	62	10	.	.	PUNCT
gra-84	63	1	then	then	ADV
gra-84	63	2	,	,	PUNCT
gra-84	63	3	using	use	VERB
gra-84	63	4	simulated	simulated	ADJ
gra-84	63	5	binary	binary	NOUN
gra-84	63	6	crossover	crossover	NOUN
gra-84	63	7	(	(	PUNCT
gra-84	63	8	sbx	sbx	NOUN
gra-84	63	9	)	)	PUNCT
gra-84	63	10	and	and	CCONJ
gra-84	63	11	polynomial	polynomial	ADJ
gra-84	63	12	mutation	mutation	NOUN
gra-84	63	13	operation	operation	NOUN
gra-84	63	14	(	(	PUNCT
gra-84	63	15	pm	pm	NOUN
gra-84	63	16	)	)	PUNCT
gra-84	63	17	to	to	PART
gra-84	63	18	generate	generate	VERB
gra-84	63	19	offspring	offspring	NOUN
gra-84	63	20	.	.	PUNCT
gra-84	64	1	the	the	DET
gra-84	64	2	offspring	offspring	NOUN
gra-84	64	3	individual	individual	NOUN
gra-84	64	4	are	be	AUX
gra-84	64	5	compared	compare	VERB
gra-84	64	6	with	with	ADP
gra-84	64	7	the	the	DET
gra-84	64	8	individuals	individual	NOUN
gra-84	64	9	in	in	ADP
gra-84	64	10	the	the	DET
gra-84	64	11	neighborhood	neighborhood	NOUN
gra-84	64	12	of	of	ADP
gra-84	64	13	the	the	DET
gra-84	64	14	paternal	paternal	ADJ
gra-84	64	15	generation	generation	NOUN
gra-84	64	16	.	.	PUNCT
gra-84	65	1	when	when	SCONJ
gra-84	65	2	the	the	DET
gra-84	65	3	offspring	offspring	NOUN
gra-84	65	4	individuals	individual	NOUN
gra-84	65	5	are	be	AUX
gra-84	65	6	superior	superior	ADJ
gra-84	65	7	to	to	ADP
gra-84	65	8	the	the	DET
gra-84	65	9	paternal	paternal	ADJ
gra-84	65	10	individuals	individual	NOUN
gra-84	65	11	,	,	PUNCT
gra-84	65	12	the	the	DET
gra-84	65	13	offspring	offspring	NOUN
gra-84	65	14	individuals	individual	NOUN
gra-84	65	15	replace	replace	VERB
gra-84	65	16	the	the	DET
gra-84	65	17	paternal	paternal	ADJ
gra-84	65	18	.	.	PUNCT
gra-84	66	1	the	the	DET
gra-84	66	2	ideal	ideal	ADJ
gra-84	66	3	point	point	NOUN
gra-84	66	4	is	be	AUX
gra-84	66	5	updated	update	VERB
gra-84	66	6	and	and	CCONJ
gra-84	66	7	the	the	DET
gra-84	66	8	non	non	ADJ
gra-84	66	9	-	-	ADJ
gra-84	66	10	dominant	dominant	ADJ
gra-84	66	11	solution	solution	NOUN
gra-84	66	12	set	set	VERB
gra-84	66	13	ep	ep	PROPN
gra-84	66	14	in	in	ADP
gra-84	66	15	the	the	DET
gra-84	66	16	updated	update	VERB
gra-84	66	17	population	population	NOUN
gra-84	66	18	is	be	AUX
gra-84	66	19	selected	select	VERB
gra-84	66	20	.	.	PUNCT
gra-84	67	1	combining	combine	VERB
gra-84	67	2	ep	ep	PROPN
gra-84	67	3	and	and	CCONJ
gra-84	67	4	ep	ep	PROPN
gra-84	67	5	,	,	PUNCT
gra-84	67	6	the	the	DET
gra-84	67	7	nal	nal	ADJ
gra-84	67	8	nondominant	nondominant	ADJ
gra-84	67	9	solution	solution	NOUN
gra-84	67	10	set	set	VERB
gra-84	67	11	is	be	AUX
gra-84	67	12	selected	select	VERB
gra-84	67	13	.	.	PUNCT
gra-84	68	1	the	the	DET
gra-84	68	2	update	update	NOUN
gra-84	68	3	part	part	NOUN
gra-84	68	4	is	be	AUX
gra-84	68	5	iterated	iterate	VERB
gra-84	68	6	until	until	SCONJ
gra-84	68	7	the	the	DET
gra-84	68	8	stop	stop	NOUN
gra-84	68	9	condition	condition	NOUN
gra-84	68	10	is	be	AUX
gra-84	68	11	satised	satised	PROPN
gra-84	68	12	,	,	PUNCT
gra-84	68	13	and	and	CCONJ
gra-84	68	14	then	then	ADV
gra-84	68	15	the	the	DET
gra-84	68	16	nal	nal	ADJ
gra-84	68	17	ep	ep	PROPN
gra-84	68	18	is	be	AUX
gra-84	68	19	obtained	obtain	VERB
gra-84	68	20	.	.	PUNCT
gra-84	69	1	since	since	SCONJ
gra-84	69	2	in	in	ADP
gra-84	69	3	the	the	DET
gra-84	69	4	update	update	NOUN
gra-84	69	5	section	section	NOUN
gra-84	69	6	,	,	PUNCT
gra-84	69	7	one	one	NUM
gra-84	69	8	offspring	offspring	NOUN
gra-84	69	9	may	may	AUX
gra-84	69	10	replace	replace	VERB
gra-84	69	11	more	more	ADJ
gra-84	69	12	than	than	ADP
gra-84	69	13	one	one	NUM
gra-84	69	14	parent	parent	NOUN
gra-84	69	15	,	,	PUNCT
gra-84	69	16	which	which	PRON
gra-84	69	17	will	will	AUX
gra-84	69	18	reduce	reduce	VERB
gra-84	69	19	the	the	DET
gra-84	69	20	diversity	diversity	NOUN
gra-84	69	21	of	of	ADP
gra-84	69	22	the	the	DET
gra-84	69	23	population	population	NOUN
gra-84	69	24	.	.	PUNCT
gra-84	70	1	in	in	ADP
gra-84	70	2	this	this	DET
gra-84	70	3	paper	paper	NOUN
gra-84	70	4	,	,	PUNCT
gra-84	70	5	we	we	PRON
gra-84	70	6	adopt	adopt	VERB
gra-84	70	7	the	the	DET
gra-84	70	8	replacement	replacement	NOUN
gra-84	70	9	operation	operation	NOUN
gra-84	70	10	of	of	ADP
gra-84	70	11	rst	rst	PROPN
gra-84	70	12	substitution	substitution	NOUN
gra-84	70	13	and	and	CCONJ
gra-84	70	14	stop	stop	NOUN
gra-84	70	15	.	.	PUNCT
gra-84	71	1	3	3	NUM
gra-84	71	2	proposed	propose	VERB
gra-84	71	3	algorithm	algorithm	NOUN
gra-84	71	4	in	in	ADP
gra-84	71	5	this	this	DET
gra-84	71	6	section	section	NOUN
gra-84	71	7	,	,	PUNCT
gra-84	71	8	the	the	DET
gra-84	71	9	proposed	propose	VERB
gra-84	71	10	-	-	PUNCT
gra-84	71	11	deposition	deposition	NOUN
gra-84	71	12	-	-	PUNCT
gra-84	71	13	based	base	VERB
gra-84	71	14	multiobjective	multiobjective	ADJ
gra-84	71	15	evolutionary	evolutionary	ADJ
gra-84	71	16	algorithm	algorithm	NOUN
gra-84	71	17	with	with	ADP
gra-84	71	18	differential	differential	ADJ
gra-84	71	19	selection	selection	NOUN
gra-84	71	20	strategy	strategy	NOUN
gra-84	71	21	(	(	PUNCT
gra-84	71	22	moea	moea	NOUN
gra-84	71	23	/	/	SYM
gra-84	71	24	d	d	NOUN
gra-84	71	25	-	-	PUNCT
gra-84	71	26	dfs	dfs	NOUN
gra-84	71	27	)	)	PUNCT
gra-84	71	28	will	will	AUX
gra-84	71	29	be	be	AUX
gra-84	71	30	introduced	introduce	VERB
gra-84	71	31	in	in	ADP
gra-84	71	32	detail	detail	NOUN
gra-84	71	33	.	.	PUNCT
gra-84	72	1	algorithm	algorithm	NOUN
gra-84	72	2	1	1	NUM
gra-84	72	3	:	:	PUNCT
gra-84	72	4	moea	moea	NOUN
gra-84	72	5	/	/	SYM
gra-84	72	6	d	d	ADJ
gra-84	72	7	-	-	PUNCT
gra-84	72	8	dfs	dfs	ADJ
gra-84	72	9	input	input	NOUN
gra-84	72	10	:	:	PUNCT
gra-84	72	11	n	n	CCONJ
gra-84	72	12	:	:	PUNCT
gra-84	72	13	population	population	NOUN
gra-84	72	14	size	size	NOUN
gra-84	72	15	;	;	PUNCT
gra-84	72	16	t	t	PROPN
gra-84	72	17	:	:	PUNCT
gra-84	72	18	the	the	DET
gra-84	72	19	number	number	NOUN
gra-84	72	20	of	of	ADP
gra-84	72	21	the	the	DET
gra-84	72	22	weight	weight	NOUN
gra-84	72	23	vectors	vector	NOUN
gra-84	72	24	in	in	ADP
gra-84	72	25	the	the	DET
gra-84	72	26	neighborhood	neighborhood	NOUN
gra-84	72	27	of	of	ADP
gra-84	72	28	each	each	DET
gra-84	72	29	weight	weight	NOUN
gra-84	72	30	vector	vector	NOUN
gra-84	72	31	.	.	PUNCT
gra-84	73	1	output	output	NOUN
gra-84	73	2	:	:	PUNCT
gra-84	73	3	ep	ep	PROPN
gra-84	73	4	:	:	PUNCT
gra-84	73	5	elite	elite	ADJ
gra-84	73	6	population	population	NOUN
gra-84	73	7	.	.	PUNCT
gra-84	74	1	1	1	X
gra-84	74	2	.	.	X
gra-84	74	3	generate	generate	VERB
gra-84	74	4	an	an	DET
gra-84	74	5	initial	initial	ADJ
gra-84	74	6	population	population	NOUN
gra-84	74	7	p	p	NOUN
gra-84	74	8	randomly	randomly	ADV
gra-84	74	9	.	.	PUNCT
gra-84	75	1	2	2	X
gra-84	75	2	.	.	X
gra-84	75	3	generate	generate	VERB
gra-84	75	4	a	a	DET
gra-84	75	5	uniform	uniform	ADJ
gra-84	75	6	spread	spread	NOUN
gra-84	75	7	of	of	ADP
gra-84	75	8	n	n	PRON
gra-84	75	9	weight	weight	NOUN
gra-84	75	10	vectors	vector	NOUN
gra-84	75	11	λ	λ	PROPN
gra-84	75	12	,	,	PUNCT
gra-84	75	13	…	…	PUNCT
gra-84	75	14	,	,	PUNCT
gra-84	75	15	λ	λ	X
gra-84	75	16	.1	.1	NUM
gra-84	75	17	n	n	CCONJ
gra-84	75	18	3	3	NUM
gra-84	75	19	.	.	PUNCT
gra-84	76	1	work	work	VERB
gra-84	76	2	out	out	ADP
gra-84	76	3	the	the	DET
gra-84	76	4	t	t	PROPN
gra-84	76	5	closet	closet	NOUN
gra-84	76	6	weight	weight	NOUN
gra-84	76	7	vectors	vector	NOUN
gra-84	76	8	to	to	ADP
gra-84	76	9	each	each	DET
gra-84	76	10	weight	weight	NOUN
gra-84	76	11	vector	vector	NOUN
gra-84	76	12	.	.	PUNCT
gra-84	77	1	for	for	ADP
gra-84	77	2	each	each	DET
gra-84	77	3	i=	i=	PROPN
gra-84	77	4	1	1	NUM
gra-84	77	5	,	,	PUNCT
gra-84	77	6	…	…	PUNCT
gra-84	77	7	,	,	PUNCT
gra-84	77	8	n	n	CCONJ
gra-84	77	9	,	,	PUNCT
gra-84	77	10	set	set	VERB
gra-84	77	11	b(i	b(i	NOUN
gra-84	77	12	)	)	PUNCT
gra-84	78	1	=	=	PRON
gra-84	78	2	{	{	PUNCT
gra-84	78	3	b	b	PROPN
gra-84	78	4	,	,	PUNCT
gra-84	78	5	…	…	PUNCT
gra-84	78	6	,	,	PUNCT
gra-84	78	7	b	b	NOUN
gra-84	78	8	}	}	PUNCT
gra-84	78	9	,	,	PUNCT
gra-84	78	10	where	where	SCONJ
gra-84	78	11	λ	λ	PROPN
gra-84	78	12	,	,	PUNCT
gra-84	78	13	…	…	PUNCT
gra-84	78	14	,	,	PUNCT
gra-84	78	15	λ1	λ1	PROPN
gra-84	78	16	t	t	PROPN
gra-84	78	17	b1	b1	NOUN
gra-84	78	18	bt	bt	PROPN
gra-84	78	19	are	be	AUX
gra-84	78	20	the	the	DET
gra-84	78	21	t	t	PROPN
gra-84	78	22	closest	close	ADJ
gra-84	78	23	weight	weight	NOUN
gra-84	78	24	vectors	vector	NOUN
gra-84	78	25	to	to	ADP
gra-84	78	26	λi	λi	ADP
gra-84	78	27	4	4	NUM
gra-84	78	28	.	.	PUNCT
gra-84	78	29	initialize	initialize	VERB
gra-84	78	30	the	the	DET
gra-84	78	31	ideal	ideal	ADJ
gra-84	78	32	point	point	NOUN
gra-84	78	33	z	z	NOUN
gra-84	78	34	*	*	NOUN
gra-84	78	35	.	.	PROPN
gra-84	79	1	5	5	X
gra-84	79	2	.	.	X
gra-84	79	3	initialize	initialize	VERB
gra-84	79	4	the	the	DET
gra-84	79	5	elite	elite	ADJ
gra-84	79	6	population	population	NOUN
gra-84	79	7	(	(	PUNCT
gra-84	79	8	ep	ep	PROPN
gra-84	79	9	)	)	PUNCT
gra-84	79	10	6	6	NUM
gra-84	79	11	.	.	PUNCT
gra-84	80	1	while	while	SCONJ
gra-84	80	2	the	the	DET
gra-84	80	3	termination	termination	NOUN
gra-84	80	4	criterion	criterion	NOUN
gra-84	80	5	is	be	AUX
gra-84	80	6	not	not	PART
gra-84	80	7	satised	satised	PROPN
gra-84	80	8	do	do	AUX
gra-84	80	9	7	7	NUM
gra-84	80	10	.	.	PUNCT
gra-84	81	1	for	for	ADP
gra-84	81	2	i	i	PRON
gra-84	81	3	=	=	NOUN
gra-84	81	4	1	1	NUM
gra-84	81	5	,	,	PUNCT
gra-84	81	6	…	…	PUNCT
gra-84	81	7	,	,	PUNCT
gra-84	81	8	n	n	DET
gra-84	81	9	8	8	NUM
gra-84	81	10	.	.	PUNCT
gra-84	82	1	r	r	NOUN
gra-84	82	2	andomly	andomly	NOUN
gra-84	82	3	select	select	VERB
gra-84	82	4	two	two	NUM
gra-84	82	5	indexes	index	NOUN
gra-84	82	6	k	k	PROPN
gra-84	82	7	,	,	PUNCT
gra-84	82	8	l	l	NOUN
gra-84	82	9	from	from	ADP
gra-84	82	10	b(i	b(i	NOUN
gra-84	82	11	)	)	PUNCT
gra-84	82	12	,	,	PUNCT
gra-84	82	13	and	and	CCONJ
gra-84	82	14	generate	generate	VERB
gra-84	82	15	a	a	DET
gra-84	82	16	new	new	ADJ
gra-84	82	17	solution	solution	NOUN
gra-84	82	18	y.	y.	NOUN
gra-84	82	19	9	9	NUM
gra-84	82	20	.	.	PUNCT
gra-84	83	1	compare	compare	VERB
gra-84	83	2	offspring	offspring	NOUN
gra-84	83	3	y	y	PROPN
gra-84	83	4	with	with	ADP
gra-84	83	5	the	the	DET
gra-84	83	6	t	t	PROPN
gra-84	83	7	closet	closet	NOUN
gra-84	83	8	points	point	NOUN
gra-84	83	9	of	of	ADP
gra-84	83	10	its	its	PRON
gra-84	83	11	parent	parent	NOUN
gra-84	83	12	using	use	VERB
gra-84	83	13	tchebycheff	tchebycheff	NOUN
gra-84	83	14	values	value	NOUN
gra-84	83	15	.	.	PUNCT
gra-84	84	1	10	10	NUM
gra-84	84	2	.	.	X
gra-84	84	3	update	update	VERB
gra-84	84	4	the	the	DET
gra-84	84	5	ideal	ideal	ADJ
gra-84	84	6	point	point	NOUN
gra-84	84	7	z	z	NOUN
gra-84	84	8	*	*	NOUN
gra-84	84	9	.	.	PUNCT
gra-84	85	1	11	11	NUM
gra-84	85	2	.	.	PUNCT
gra-84	86	1	update	update	NOUN
gra-84	86	2	of	of	ADP
gra-84	86	3	population	population	NOUN
gra-84	86	4	p.	p.	NOUN
gra-84	86	5	12	12	NUM
gra-84	86	6	.	.	PUNCT
gra-84	87	1	get	get	VERB
gra-84	87	2	a	a	DET
gra-84	87	3	new	new	ADJ
gra-84	87	4	elite	elite	ADJ
gra-84	87	5	population	population	NOUN
gra-84	87	6	ep	ep	PROPN
gra-84	87	7	.	.	PROPN
gra-84	87	8	13	13	NUM
gra-84	87	9	.	.	PUNCT
gra-84	88	1	merge	merge	VERB
gra-84	88	2	ep	ep	PROPN
gra-84	88	3	into	into	ADP
gra-84	88	4	ep	ep	PROPN
gra-84	88	5	and	and	CCONJ
gra-84	88	6	adopt	adopt	VERB
gra-84	88	7	differential	differential	ADJ
gra-84	88	8	selection	selection	NOUN
gra-84	88	9	strategy	strategy	NOUN
gra-84	88	10	to	to	PART
gra-84	88	11	obtain	obtain	VERB
gra-84	88	12	individuals	individual	NOUN
gra-84	88	13	.	.	PUNCT
gra-84	89	1	14	14	NUM
gra-84	89	2	.	.	X
gra-84	89	3	end	end	VERB
gra-84	89	4	for	for	ADP
gra-84	89	5	15	15	NUM
gra-84	89	6	.	.	PUNCT
gra-84	90	1	end	end	NOUN
gra-84	90	2	while	while	SCONJ
gra-84	90	3	the	the	DET
gra-84	90	4	pseudo	pseudo	NOUN
gra-84	90	5	-	-	NOUN
gra-84	90	6	code	code	NOUN
gra-84	90	7	of	of	ADP
gra-84	90	8	moea	moea	NOUN
gra-84	90	9	/	/	SYM
gra-84	90	10	d	d	NOUN
gra-84	90	11	-	-	PUNCT
gra-84	90	12	dfs	dfs	PROPN
gra-84	90	13	is	be	AUX
gra-84	90	14	given	give	VERB
gra-84	90	15	in	in	ADP
gra-84	90	16	algorithm	algorithm	NOUN
gra-84	90	17	1	1	NUM
gra-84	90	18	.	.	PUNCT
gra-84	90	19	steps	step	NOUN
gra-84	90	20	1	1	NUM
gra-84	90	21	-	-	SYM
gra-84	90	22	5	5	NUM
gra-84	90	23	are	be	AUX
gra-84	90	24	the	the	DET
gra-84	90	25	initialized	initialize	VERB
gra-84	90	26	part	part	NOUN
gra-84	90	27	.	.	PUNCT
gra-84	91	1	the	the	DET
gra-84	91	2	population	population	NOUN
gra-84	91	3	p	p	NOUN
gra-84	91	4	with	with	ADP
gra-84	91	5	size	size	NOUN
gra-84	91	6	n	n	PRON
gra-84	91	7	is	be	AUX
gra-84	91	8	initialized	initialize	VERB
gra-84	91	9	in	in	ADP
gra-84	91	10	step	step	NOUN
gra-84	91	11	1	1	NUM
gra-84	91	12	.	.	PUNCT
gra-84	92	1	step	step	NOUN
gra-84	92	2	2	2	NUM
gra-84	92	3	is	be	AUX
gra-84	92	4	to	to	PART
gra-84	92	5	generate	generate	VERB
gra-84	92	6	a	a	DET
gra-84	92	7	uniformly	uniformly	ADV
gra-84	92	8	distributed	distribute	VERB
gra-84	92	9	weight	weight	NOUN
gra-84	92	10	vector	vector	NOUN
gra-84	92	11	λ=	λ=	NOUN
gra-84	92	12	{	{	PUNCT
gra-84	92	13	λ	λ	X
gra-84	92	14	=	=	SYM
gra-84	92	15	(	(	PUNCT
gra-84	92	16	λ	λ	PROPN
gra-84	92	17	,	,	PUNCT
gra-84	92	18	…	…	PUNCT
gra-84	92	19	,	,	PUNCT
gra-84	92	20	λ	λ	INTJ
gra-84	92	21	)	)	PUNCT
gra-84	93	1	|	|	ADV
gra-84	93	2	i	i	PRON
gra-84	93	3	(	(	PUNCT
gra-84	93	4	1	1	NUM
gra-84	93	5	,	,	PUNCT
gra-84	93	6	…	…	PUNCT
gra-84	93	7	,	,	PUNCT
gra-84	93	8	n	n	CCONJ
gra-84	93	9	)	)	PUNCT
gra-84	93	10	}	}	PUNCT
gra-84	93	11	,	,	PUNCT
gra-84	93	12	i	i	PRON
gra-84	93	13	i1	i1	PROPN
gra-84	94	1	i	i	PRON
gra-84	94	2	m	m	VERB
gra-84	94	3	where	where	SCONJ
gra-84	94	4	λ	λ	X
gra-84	94	5	=	=	NOUN
gra-84	95	1	1	1	X
gra-84	95	2	.	.	PUNCT
gra-84	96	1	in	in	ADP
gra-84	96	2	step	step	NOUN
gra-84	96	3	3	3	NUM
gra-84	96	4	,	,	PUNCT
gra-84	96	5	the	the	DET
gra-84	96	6	t	t	PROPN
gra-84	96	7	closest	close	ADJ
gra-84	96	8	weight	weight	NOUN
gra-84	96	9	vectors	vector	NOUN
gra-84	96	10	b(i	b(i	NUM
gra-84	96	11	)	)	PUNCT
gra-84	97	1	=	=	PRON
gra-84	97	2	{	{	PUNCT
gra-84	97	3	b	b	PROPN
gra-84	97	4	,	,	PUNCT
gra-84	97	5	b	b	PROPN
gra-84	97	6	,	,	PUNCT
gra-84	97	7	i	i	NOUN
gra-84	97	8	1	1	NUM
gra-84	97	9	2	2	NUM
gra-84	97	10	…	…	PUNCT
gra-84	97	11	,	,	PUNCT
gra-84	97	12	b	b	NOUN
gra-84	97	13	}	}	PUNCT
gra-84	97	14	of	of	ADP
gra-84	97	15	each	each	DET
gra-84	97	16	weight	weight	NOUN
gra-84	97	17	vector	vector	NOUN
gra-84	97	18	are	be	AUX
gra-84	97	19	calculated	calculate	VERB
gra-84	97	20	,	,	PUNCT
gra-84	97	21	using	use	VERB
gra-84	97	22	the	the	DET
gra-84	97	23	t	t	PROPN
gra-84	97	24	euclidean	euclidean	PROPN
gra-84	97	25	distance	distance	NOUN
gra-84	97	26	.	.	PUNCT
gra-84	98	1	in	in	ADP
gra-84	98	2	step	step	NOUN
gra-84	98	3	4	4	NUM
gra-84	98	4	,	,	PUNCT
gra-84	98	5	the	the	DET
gra-84	98	6	ideal	ideal	ADJ
gra-84	98	7	point	point	NOUN
gra-84	98	8	z	z	X
gra-84	98	9	*	*	PUNCT
gra-84	98	10	=	=	PUNCT
gra-84	98	11	{	{	PUNCT
gra-84	98	12	z	z	NOUN
gra-84	98	13	,	,	PUNCT
gra-84	98	14	…	…	PUNCT
gra-84	98	15	,	,	PUNCT
gra-84	98	16	z	z	NOUN
gra-84	98	17	}	}	PUNCT
gra-84	98	18	is	be	AUX
gra-84	98	19	1	1	NUM
gra-84	98	20	m	m	AUX
gra-84	98	21	initialized	initialize	VERB
gra-84	98	22	,	,	PUNCT
gra-84	98	23	and	and	CCONJ
gra-84	98	24	ts	ts	AUX
gra-84	98	25	updated	update	VERB
gra-84	98	26	during	during	ADP
gra-84	98	27	the	the	DET
gra-84	98	28	search	search	NOUN
gra-84	98	29	process	process	NOUN
gra-84	98	30	.	.	PUNCT
gra-84	99	1	in	in	ADP
gra-84	99	2	step	step	NOUN
gra-84	99	3	5	5	NUM
gra-84	99	4	,	,	PUNCT
gra-84	99	5	the	the	DET
gra-84	99	6	elite	elite	ADJ
gra-84	99	7	individuals	individual	NOUN
gra-84	99	8	in	in	ADP
gra-84	99	9	the	the	DET
gra-84	99	10	population	population	NOUN
gra-84	99	11	are	be	AUX
gra-84	99	12	preserved	preserve	VERB
gra-84	99	13	in	in	ADP
gra-84	99	14	ep	ep	PROPN
gra-84	99	15	,	,	PUNCT
gra-84	99	16	that	that	PRON
gra-84	99	17	is	be	AUX
gra-84	99	18	to	to	PART
gra-84	99	19	say	say	VERB
gra-84	99	20	,	,	PUNCT
gra-84	99	21	the	the	DET
gra-84	99	22	non	non	ADJ
gra-84	99	23	-	-	ADJ
gra-84	99	24	dominant	dominant	ADJ
gra-84	99	25	solution	solution	NOUN
gra-84	99	26	in	in	ADP
gra-84	99	27	the	the	DET
gra-84	99	28	population	population	NOUN
gra-84	99	29	is	be	AUX
gra-84	99	30	selected	select	VERB
gra-84	99	31	.	.	PUNCT
gra-84	100	1	steps	step	NOUN
gra-84	100	2	6	6	NUM
gra-84	100	3	-	-	SYM
gra-84	100	4	15	15	NUM
gra-84	100	5	are	be	AUX
gra-84	100	6	iterated	iterate	VERB
gra-84	100	7	until	until	SCONJ
gra-84	100	8	the	the	DET
gra-84	100	9	termination	termination	NOUN
gra-84	100	10	criterion	criterion	NOUN
gra-84	100	11	is	be	AUX
gra-84	100	12	satised	satised	PROPN
gra-84	100	13	.	.	PUNCT
gra-84	101	1	in	in	ADP
gra-84	101	2	step	step	NOUN
gra-84	101	3	8	8	NUM
gra-84	101	4	,	,	PUNCT
gra-84	101	5	simulated	simulate	VERB
gra-84	101	6	binary	binary	NOUN
gra-84	101	7	crossover	crossover	NOUN
gra-84	101	8	(	(	PUNCT
gra-84	101	9	sbx	sbx	NOUN
gra-84	101	10	)	)	PUNCT
gra-84	102	1	[	[	X
gra-84	102	2	]	]	X
gra-84	102	3	and	and	CCONJ
gra-84	102	4	polynomial	polynomial	ADJ
gra-84	102	5	mutation	mutation	NOUN
gra-84	102	6	are	be	AUX
gra-84	102	7	applied	apply	VERB
gra-84	102	8	as	as	ADP
gra-84	102	9	the	the	DET
gra-84	102	10	crossover	crossover	NOUN
gra-84	102	11	operation	operation	NOUN
gra-84	102	12	to	to	PART
gra-84	102	13	produce	produce	VERB
gra-84	102	14	offspring	offspring	NOUN
gra-84	102	15	.	.	PUNCT
gra-84	103	1	this	this	DET
gra-84	103	2	cross	cross	NOUN
gra-84	103	3	mutation	mutation	NOUN
gra-84	103	4	drives	drive	VERB
gra-84	103	5	two	two	NUM
gra-84	103	6	parents	parent	NOUN
gra-84	103	7	generate	generate	VERB
gra-84	103	8	an	an	DET
gra-84	103	9	offspring	offspring	NOUN
gra-84	103	10	.	.	PUNCT
gra-84	104	1	comparing	compare	VERB
gra-84	104	2	the	the	DET
gra-84	104	3	generated	generate	VERB
gra-84	104	4	offspring	offspring	NOUN
gra-84	104	5	with	with	ADP
gra-84	104	6	the	the	DET
gra-84	104	7	individuals	individual	NOUN
gra-84	104	8	in	in	ADP
gra-84	104	9	the	the	DET
gra-84	104	10	t	t	PROPN
gra-84	104	11	neighborhood	neighborhood	NOUN
gra-84	104	12	of	of	ADP
gra-84	104	13	the	the	DET
gra-84	104	14	parent	parent	NOUN
gra-84	104	15	generation	generation	NOUN
gra-84	104	16	,	,	PUNCT
gra-84	104	17	the	the	DET
gra-84	104	18	replacement	replacement	NOUN
gra-84	104	19	operation	operation	NOUN
gra-84	104	20	of	of	ADP
gra-84	104	21	the	the	DET
gra-84	104	22	current	current	ADJ
gra-84	104	23	individual	individual	NOUN
gra-84	104	24	will	will	AUX
gra-84	104	25	be	be	AUX
gra-84	104	26	stopped	stop	VERB
gra-84	104	27	when	when	SCONJ
gra-84	104	28	the	the	DET
gra-84	104	29	replaceable	replaceable	ADJ
gra-84	104	30	parent	parent	NOUN
gra-84	104	31	generation	generation	NOUN
gra-84	104	32	is	be	AUX
gra-84	104	33	rst	rst	AUX
gra-84	104	34	encountered	encounter	VERB
gra-84	104	35	in	in	ADP
gra-84	104	36	step	step	NOUN
gra-84	104	37	9	9	NUM
gra-84	104	38	.	.	PUNCT
gra-84	105	1	it	it	PRON
gra-84	105	2	is	be	AUX
gra-84	105	3	conducive	conducive	ADJ
gra-84	105	4	to	to	ADP
gra-84	105	5	preserving	preserve	VERB
gra-84	105	6	the	the	DET
gra-84	105	7	diversity	diversity	NOUN
gra-84	105	8	of	of	ADP
gra-84	105	9	the	the	DET
gra-84	105	10	population	population	NOUN
gra-84	105	11	.	.	PUNCT
gra-84	106	1	in	in	ADP
gra-84	106	2	step	step	NOUN
gra-84	106	3	10,the	10,the	DET
gra-84	106	4	ideal	ideal	ADJ
gra-84	106	5	point	point	NOUN
gra-84	106	6	z	z	PROPN
gra-84	106	7	*	*	PUNCT
gra-84	106	8	is	be	AUX
gra-84	106	9	updated	update	VERB
gra-84	106	10	.	.	PUNCT
gra-84	107	1	then	then	ADV
gra-84	107	2	the	the	DET
gra-84	107	3	population	population	NOUN
gra-84	107	4	is	be	AUX
gra-84	107	5	updated	update	VERB
gra-84	107	6	in	in	ADP
gra-84	107	7	step	step	NOUN
gra-84	107	8	11	11	NUM
gra-84	107	9	.	.	PUNCT
gra-84	108	1	in	in	ADP
gra-84	108	2	step	step	NOUN
gra-84	108	3	12	12	NUM
gra-84	108	4	,	,	PUNCT
gra-84	108	5	the	the	DET
gra-84	108	6	non	non	ADJ
gra-84	108	7	-	-	ADJ
gra-84	108	8	dominant	dominant	ADJ
gra-84	108	9	solution	solution	NOUN
gra-84	108	10	set	set	VERB
gra-84	108	11	of	of	ADP
gra-84	108	12	the	the	DET
gra-84	108	13	new	new	ADJ
gra-84	108	14	population	population	NOUN
gra-84	108	15	is	be	AUX
gra-84	108	16	obtained	obtain	VERB
gra-84	108	17	,	,	PUNCT
gra-84	108	18	which	which	PRON
gra-84	108	19	is	be	AUX
gra-84	108	20	denoted	denote	VERB
gra-84	108	21	as	as	ADP
gra-84	108	22	ep	ep	PROPN
gra-84	108	23	.	.	PUNCT
gra-84	109	1	in	in	ADP
gra-84	109	2	step	step	NOUN
gra-84	109	3	13	13	NUM
gra-84	109	4	,	,	PUNCT
gra-84	109	5	ep	ep	PROPN
gra-84	109	6	and	and	CCONJ
gra-84	109	7	ep	ep	PROPN
gra-84	109	8	are	be	AUX
gra-84	109	9	combined	combine	VERB
gra-84	109	10	to	to	PART
gra-84	109	11	adopt	adopt	VERB
gra-84	109	12	differential	differential	ADJ
gra-84	109	13	selection	selection	NOUN
gra-84	109	14	strategy	strategy	NOUN
gra-84	109	15	to	to	PART
gra-84	109	16	obtain	obtain	VERB
gra-84	109	17	individuals	individual	NOUN
gra-84	109	18	.	.	PUNCT
gra-84	110	1	the	the	DET
gra-84	110	2	obtained	obtain	VERB
gra-84	110	3	solution	solution	NOUN
gra-84	110	4	is	be	AUX
gra-84	110	5	stored	store	VERB
gra-84	110	6	in	in	ADP
gra-84	110	7	ep	ep	PROPN
gra-84	110	8	.	.	PUNCT
gra-84	111	1	this	this	DET
gra-84	111	2	strategy	strategy	NOUN
gra-84	111	3	adopts	adopt	VERB
gra-84	111	4	the	the	DET
gra-84	111	5	method	method	NOUN
gra-84	111	6	of	of	ADP
gra-84	111	7	nsga	nsga	NOUN
gra-84	111	8	-	-	PUNCT
gra-84	111	9	ii	ii	NOUN
gra-84	112	1	[	[	X
gra-84	112	2	7	7	NUM
gra-84	112	3	]	]	PUNCT
gra-84	112	4	to	to	PART
gra-84	112	5	select	select	VERB
gra-84	112	6	the	the	DET
gra-84	112	7	solution	solution	NOUN
gra-84	112	8	.	.	PUNCT
gra-84	113	1	the	the	DET
gra-84	113	2	solutions	solution	NOUN
gra-84	113	3	in	in	ADP
gra-84	113	4	ep	ep	PROPN
gra-84	113	5	are	be	AUX
gra-84	113	6	sorted	sort	VERB
gra-84	113	7	nondominantly	nondominantly	ADV
gra-84	113	8	(	(	PUNCT
gra-84	113	9	f	f	PROPN
gra-84	113	10	,	,	PUNCT
gra-84	113	11	f	f	PROPN
gra-84	113	12	,	,	PUNCT
gra-84	113	13	…	…	PUNCT
gra-84	113	14	,	,	PUNCT
gra-84	113	15	)	)	PUNCT
gra-84	113	16	and	and	CCONJ
gra-84	113	17	selected	select	VERB
gra-84	113	18	layer	layer	NOUN
gra-84	113	19	by	by	ADP
gra-84	113	20	layer	layer	NOUN
gra-84	113	21	.	.	PUNCT
gra-84	114	1	the	the	DET
gra-84	114	2	1	1	NUM
gra-84	114	3	2	2	NUM
gra-84	114	4	selection	selection	NOUN
gra-84	114	5	process	process	NOUN
gra-84	114	6	is	be	AUX
gra-84	114	7	as	as	SCONJ
gra-84	114	8	follows	follow	VERB
gra-84	114	9	:	:	PUNCT
gra-84	114	10	initial	initial	ADJ
gra-84	114	11	q	q	NOUN
gra-84	114	12	is	be	AUX
gra-84	114	13	an	an	DET
gra-84	114	14	empty	empty	ADJ
gra-84	114	15	set	set	NOUN
gra-84	114	16	,	,	PUNCT
gra-84	114	17	which	which	PRON
gra-84	114	18	merges	merge	VERB
gra-84	114	19	individuals	individual	NOUN
gra-84	114	20	into	into	ADP
gra-84	114	21	q	q	NOUN
gra-84	114	22	layer	layer	NOUN
gra-84	114	23	by	by	ADP
gra-84	114	24	layer	layer	NOUN
gra-84	114	25	according	accord	VERB
gra-84	114	26	to	to	ADP
gra-84	114	27	non	non	ADJ
gra-84	114	28	-	-	ADJ
gra-84	114	29	dominant	dominant	ADJ
gra-84	114	30	sorting	sorting	NOUN
gra-84	114	31	.	.	PUNCT
gra-84	115	1	when	when	SCONJ
gra-84	115	2	f	f	PROPN
gra-84	115	3	merges	merge	VERB
gra-84	115	4	i	i	PRON
gra-84	115	5	into	into	ADP
gra-84	115	6	q	q	NOUN
gra-84	115	7	and	and	CCONJ
gra-84	115	8	the	the	DET
gra-84	115	9	number	number	NOUN
gra-84	115	10	of	of	ADP
gra-84	115	11	individuals	individual	NOUN
gra-84	115	12	in	in	ADP
gra-84	115	13	q	q	PROPN
gra-84	115	14	is	be	AUX
gra-84	115	15	larger	large	ADJ
gra-84	115	16	than	than	ADP
gra-84	115	17	the	the	DET
gra-84	115	18	set	set	NOUN
gra-84	115	19	number	number	NOUN
gra-84	115	20	,	,	PUNCT
gra-84	115	21	select	select	ADJ
gra-84	115	22	individuals	individual	NOUN
gra-84	115	23	in	in	ADP
gra-84	115	24	f	f	PROPN
gra-84	115	25	layer	layer	NOUN
gra-84	115	26	and	and	CCONJ
gra-84	115	27	put	put	VERB
gra-84	115	28	them	they	PRON
gra-84	115	29	into	into	ADP
gra-84	115	30	q	q	NOUN
gra-84	115	31	,	,	PUNCT
gra-84	116	1	so	so	ADV
gra-84	116	2	i	i	PRON
gra-84	116	3	that	that	SCONJ
gra-84	116	4	the	the	DET
gra-84	116	5	number	number	NOUN
gra-84	116	6	of	of	ADP
gra-84	116	7	individuals	individual	NOUN
gra-84	116	8	in	in	ADP
gra-84	116	9	q	q	PROPN
gra-84	116	10	is	be	AUX
gra-84	116	11	equals	equal	VERB
gra-84	116	12	to	to	ADP
gra-84	116	13	the	the	DET
gra-84	116	14	set	set	ADJ
gra-84	116	15	number	number	NOUN
gra-84	116	16	.	.	PUNCT
gra-84	117	1	the	the	DET
gra-84	117	2	crowding	crowd	VERB
gra-84	117	3	distance	distance	NOUN
gra-84	117	4	[	[	X
gra-84	117	5	7	7	X
gra-84	117	6	]	]	PUNCT
gra-84	117	7	is	be	AUX
gra-84	117	8	used	use	VERB
gra-84	117	9	when	when	SCONJ
gra-84	117	10	selecting	select	VERB
gra-84	117	11	individuals	individual	NOUN
gra-84	117	12	in	in	ADP
gra-84	117	13	f	f	PROPN
gra-84	117	14	.	.	PUNCT
gra-84	118	1	in	in	ADP
gra-84	118	2	this	this	DET
gra-84	118	3	way	way	NOUN
gra-84	118	4	,	,	PUNCT
gra-84	118	5	the	the	DET
gra-84	118	6	q	q	NOUN
gra-84	118	7	obtained	obtain	VERB
gra-84	118	8	is	be	AUX
gra-84	118	9	the	the	DET
gra-84	118	10	elite	elite	ADJ
gra-84	118	11	population	population	NOUN
gra-84	118	12	selected	select	VERB
gra-84	118	13	i	i	PRON
gra-84	118	14	from	from	ADP
gra-84	118	15	the	the	DET
gra-84	118	16	population	population	NOUN
gra-84	118	17	,	,	PUNCT
gra-84	118	18	where	where	SCONJ
gra-84	118	19	ep	ep	PROPN
gra-84	118	20	=	=	PROPN
gra-84	118	21	q.	q.	PROPN
gra-84	118	22	results	result	NOUN
gra-84	118	23	and	and	CCONJ
gra-84	118	24	analysis	analysis	NOUN
gra-84	118	25	4.1	4.1	NUM
gra-84	118	26	unconstrained	unconstraine	VERB
gra-84	118	27	zdt	zdt	PROPN
gra-84	118	28	problems	problem	NOUN
gra-84	118	29	zdt	zdt	PROPN
gra-84	118	30	test	test	PROPN
gra-84	118	31	function	function	PROPN
gra-84	118	32	series	series	NOUN
gra-84	118	33	is	be	AUX
gra-84	118	34	used	use	VERB
gra-84	118	35	to	to	PART
gra-84	118	36	verify	verify	VERB
gra-84	118	37	the	the	DET
gra-84	118	38	effectiveness	effectiveness	NOUN
gra-84	118	39	of	of	ADP
gra-84	118	40	the	the	DET
gra-84	118	41	proposed	propose	VERB
gra-84	118	42	moea	moea	NOUN
gra-84	118	43	/	/	SYM
gra-84	118	44	d	d	ADJ
gra-84	118	45	-	-	PUNCT
gra-84	118	46	dfs	dfs	ADJ
gra-84	118	47	algorithm	algorithm	NOUN
gra-84	118	48	.	.	PUNCT
gra-84	119	1	next	next	ADV
gra-84	119	2	,	,	PUNCT
gra-84	119	3	zdt	zdt	PROPN
gra-84	119	4	test	test	NOUN
gra-84	119	5	function	function	NOUN
gra-84	119	6	series.is	series.is	PROPN
gra-84	119	7	introduced	introduce	VERB
gra-84	119	8	.	.	PUNCT
gra-84	120	1	table	table	NOUN
gra-84	120	2	1	1	NUM
gra-84	120	3	.	.	PUNCT
gra-84	120	4	zdt	zdt	PROPN
gra-84	120	5	test	test	NOUN
gra-84	120	6	function	function	VERB
gra-84	120	7	4.2	4.2	NUM
gra-84	120	8	metric	metric	ADJ
gra-84	120	9	and	and	CCONJ
gra-84	120	10	setting	set	VERB
gra-84	120	11	the	the	DET
gra-84	120	12	inverted	inverted	ADJ
gra-84	120	13	generational	generational	ADJ
gra-84	120	14	distance	distance	NOUN
gra-84	120	15	(	(	PUNCT
gra-84	120	16	igd	igd	PROPN
gra-84	120	17	)	)	PUNCT
gra-84	120	18	is	be	AUX
gra-84	120	19	a	a	DET
gra-84	120	20	comprehensive	comprehensive	ADJ
gra-84	120	21	performance	performance	NOUN
gra-84	120	22	evaluation	evaluation	NOUN
gra-84	120	23	index	index	NOUN
gra-84	120	24	.	.	PUNCT
gra-84	121	1	it	it	PRON
gra-84	121	2	is	be	AUX
gra-84	121	3	used	use	VERB
gra-84	121	4	to	to	PART
gra-84	121	5	evaluate	evaluate	VERB
gra-84	121	6	the	the	DET
gra-84	121	7	volume-8	volume-8	NUM
gra-84	121	8	,	,	PUNCT
gra-84	121	9	issue-9	issue-9	NUM
gra-84	121	10	,	,	PUNCT
gra-84	121	11	september-2019	september-2019	ADJ
gra-84	121	12	•	•	NUM
gra-84	121	13	print	print	NOUN
gra-84	121	14	issn	issn	PROPN
gra-84	121	15	no	no	NOUN
gra-84	121	16	.	.	PROPN
gra-84	121	17	2277	2277	NUM
gra-84	121	18	8160	8160	NUM
gra-84	121	19	•	•	NOUN
gra-84	121	20	doi	doi	NOUN
gra-84	121	21	:	:	PUNCT
gra-84	121	22	10.36106	10.36106	NUM
gra-84	121	23	/	/	SYM
gra-84	121	24	gjra	gjra	NOUN
gra-84	121	25	test	test	NOUN
gra-84	121	26	function	function	VERB
gra-84	121	27	functional	functional	ADJ
gra-84	121	28	formula	formula	NOUN
gra-84	121	29	parameter	parameter	NOUN
gra-84	121	30	zdt1	zdt1	PROPN
gra-84	121	31	tx	tx	PROPN
gra-84	121	32	=	=	PUNCT
gra-84	121	33	(	(	PUNCT
gra-84	121	34	x	x	X
gra-84	121	35	,	,	PUNCT
gra-84	121	36	…	…	PUNCT
gra-84	121	37	,	,	PUNCT
gra-84	121	38	x	x	X
gra-84	121	39	)	)	PUNCT
gra-84	122	1	[	[	X
gra-84	122	2	0	0	NUM
gra-84	122	3	,	,	PUNCT
gra-84	122	4	1	1	NUM
gra-84	122	5	n	n	PRON
gra-84	122	6	n1	n1	NOUN
gra-84	122	7	]	]	PUNCT
gra-84	122	8	,	,	PUNCT
gra-84	122	9	n	n	NOUN
gra-84	122	10	=	=	SYM
gra-84	122	11	30	30	NUM
gra-84	122	12	zdt2	zdt2	NOUN
gra-84	122	13	tx	tx	PROPN
gra-84	122	14	=	=	PUNCT
gra-84	122	15	(	(	PUNCT
gra-84	122	16	x	x	X
gra-84	122	17	,	,	PUNCT
gra-84	122	18	…	…	PUNCT
gra-84	122	19	,	,	PUNCT
gra-84	122	20	x	x	X
gra-84	122	21	)	)	PUNCT
gra-84	123	1	[	[	X
gra-84	123	2	0	0	NUM
gra-84	123	3	,	,	PUNCT
gra-84	123	4	1	1	NUM
gra-84	123	5	n	n	PRON
gra-84	123	6	n1	n1	NOUN
gra-84	123	7	]	]	PUNCT
gra-84	123	8	,	,	PUNCT
gra-84	123	9	n	n	NOUN
gra-84	123	10	=	=	SYM
gra-84	123	11	30	30	NUM
gra-84	123	12	zdt3	zdt3	NOUN
gra-84	123	13	tx	tx	NOUN
gra-84	123	14	=	=	PUNCT
gra-84	123	15	(	(	PUNCT
gra-84	123	16	x	x	X
gra-84	123	17	,	,	PUNCT
gra-84	123	18	…	…	PUNCT
gra-84	123	19	,	,	PUNCT
gra-84	123	20	x	x	X
gra-84	123	21	)	)	PUNCT
gra-84	124	1	[	[	X
gra-84	124	2	0	0	NUM
gra-84	124	3	,	,	PUNCT
gra-84	124	4	1	1	NUM
gra-84	124	5	n	n	PRON
gra-84	124	6	n1	n1	NOUN
gra-84	124	7	]	]	PUNCT
gra-84	124	8	,	,	PUNCT
gra-84	124	9	n	n	PROPN
gra-84	124	10	=	=	SYM
gra-84	124	11	30	30	NUM
gra-84	124	12	zdt4	zdt4	NOUN
gra-84	124	13	tx	tx	PROPN
gra-84	124	14	=	=	PUNCT
gra-84	124	15	(	(	PUNCT
gra-84	124	16	x	x	X
gra-84	124	17	,	,	PUNCT
gra-84	124	18	…	…	PUNCT
gra-84	124	19	,	,	PUNCT
gra-84	124	20	x	x	X
gra-84	124	21	)	)	PUNCT
gra-84	125	1	[	[	X
gra-84	125	2	0	0	NUM
gra-84	125	3	,	,	PUNCT
gra-84	125	4	1	1	NUM
gra-84	125	5	]	]	SYM
gra-84	125	6	1	1	NUM
gra-84	125	7	n	n	PRON
gra-84	125	8	n-1[-5	n-1[-5	NUM
gra-84	125	9	,	,	PUNCT
gra-84	125	10	5	5	NUM
gra-84	125	11	]	]	PUNCT
gra-84	125	12	,	,	PUNCT
gra-84	125	13	n	n	NOUN
gra-84	125	14	=	=	SYM
gra-84	125	15	10	10	NUM
gra-84	125	16	zdt6	zdt6	NOUN
gra-84	125	17	tx	tx	PROPN
gra-84	125	18	=	=	PUNCT
gra-84	125	19	(	(	PUNCT
gra-84	125	20	x	x	X
gra-84	125	21	,	,	PUNCT
gra-84	125	22	…	…	PUNCT
gra-84	125	23	,	,	PUNCT
gra-84	125	24	x	x	X
gra-84	125	25	)	)	PUNCT
gra-84	126	1	[	[	X
gra-84	126	2	0	0	NUM
gra-84	126	3	,	,	PUNCT
gra-84	126	4	1	1	NUM
gra-84	126	5	n	n	PRON
gra-84	126	6	n1	n1	NOUN
gra-84	126	7	]	]	PUNCT
gra-84	126	8	,	,	PUNCT
gra-84	126	9	n	n	NOUN
gra-84	126	10	=	=	SYM
gra-84	127	1	10	10	NUM
gra-84	127	2	1	1	NUM
gra-84	127	3	1	1	NUM
gra-84	127	4	2	2	NUM
gra-84	127	5	2	2	NUM
gra-84	127	6	1	1	NUM
gra-84	127	7	(	(	PUNCT
gra-84	127	8	)	)	PUNCT
gra-84	127	9	(	(	PUNCT
gra-84	127	10	)	)	PUNCT
gra-84	127	11	(	(	PUNCT
gra-84	127	12	)	)	PUNCT
gra-84	127	13	*	*	PUNCT
gra-84	127	14	(	(	PUNCT
gra-84	127	15	)	)	PUNCT
gra-84	127	16	9	9	NUM
gra-84	127	17	(	(	PUNCT
gra-84	127	18	)	)	PUNCT
gra-84	127	19	1	1	NUM
gra-84	127	20	*	*	PUNCT
gra-84	127	21	(	(	PUNCT
gra-84	127	22	1	1	NUM
gra-84	127	23	)	)	PUNCT
gra-84	127	24	(	(	PUNCT
gra-84	127	25	)	)	PUNCT
gra-84	127	26	(	(	PUNCT
gra-84	127	27	)	)	PUNCT
gra-84	127	28	1	1	NUM
gra-84	127	29	(	(	PUNCT
gra-84	127	30	)	)	PUNCT
gra-84	127	31	n	n	NOUN
gra-84	127	32	ii	ii	NOUN
gra-84	128	1	f	f	NOUN
gra-84	128	2	x	x	PUNCT
gra-84	128	3	x	x	PUNCT
gra-84	128	4	f	f	NOUN
gra-84	128	5	x	x	SYM
gra-84	128	6	g	g	NOUN
gra-84	128	7	x	x	X
gra-84	128	8	h	h	NOUN
gra-84	128	9	x	x	NOUN
gra-84	128	10	g	g	NOUN
gra-84	128	11	x	x	SYM
gra-84	128	12	x	x	NOUN
gra-84	128	13	n	n	X
gra-84	128	14	f	f	NOUN
gra-84	128	15	x	x	SYM
gra-84	128	16	h	h	NOUN
gra-84	128	17	x	x	NOUN
gra-84	128	18	g	g	NOUN
gra-84	128	19	x	x	NOUN
gra-84	128	20	=	=	PUNCT
gra-84	128	21	=	=	PUNCT
gra-84	128	22	=	=	PUNCT
gra-84	128	23	=	=	PUNCT
gra-84	129	1	+	+	NUM
gra-84	129	2	=	=	SYM
gra-84	129	3	å	å	PROPN
gra-84	129	4	1	1	NUM
gra-84	129	5	1	1	NUM
gra-84	129	6	2	2	NUM
gra-84	129	7	2	2	NUM
gra-84	129	8	1	1	NUM
gra-84	129	9	(	(	PUNCT
gra-84	129	10	)	)	PUNCT
gra-84	129	11	(	(	PUNCT
gra-84	129	12	)	)	PUNCT
gra-84	129	13	(	(	PUNCT
gra-84	129	14	)	)	PUNCT
gra-84	129	15	*	*	PUNCT
gra-84	129	16	(	(	PUNCT
gra-84	129	17	)	)	PUNCT
gra-84	129	18	(	(	PUNCT
gra-84	129	19	)	)	PUNCT
gra-84	129	20	(	(	PUNCT
gra-84	129	21	)	)	PUNCT
gra-84	129	22	1	1	NUM
gra-84	129	23	(	(	PUNCT
gra-84	129	24	)	)	PUNCT
gra-84	129	25	f	f	NOUN
gra-84	130	1	x	x	PUNCT
gra-84	130	2	x	x	PUNCT
gra-84	130	3	f	f	NOUN
gra-84	130	4	x	x	SYM
gra-84	130	5	g	g	NOUN
gra-84	130	6	x	x	X
gra-84	130	7	h	h	NOUN
gra-84	131	1	x	x	X
gra-84	131	2	f	f	NOUN
gra-84	131	3	x	x	SYM
gra-84	131	4	h	h	NOUN
gra-84	131	5	x	x	NOUN
gra-84	131	6	g	g	NOUN
gra-84	131	7	x	x	NOUN
gra-84	131	8	=	=	PUNCT
gra-84	132	1	=	=	PUNCT
gra-84	132	2	æ	æ	X
gra-84	132	3	ö	ö	NOUN
gra-84	132	4	=	=	SYM
gra-84	132	5	-ç	-ç	PROPN
gra-84	133	1	÷	÷	NUM
gra-84	134	1	è	è	PUNCT
gra-84	134	2	ø	ø	NOUN
gra-84	134	3	1	1	NUM
gra-84	134	4	1	1	NUM
gra-84	134	5	2	2	NUM
gra-84	134	6	1	1	NUM
gra-84	134	7	1	1	NUM
gra-84	134	8	1	1	NUM
gra-84	134	9	(	(	PUNCT
gra-84	134	10	)	)	PUNCT
gra-84	134	11	(	(	PUNCT
gra-84	134	12	)	)	PUNCT
gra-84	134	13	(	(	PUNCT
gra-84	134	14	)	)	PUNCT
gra-84	134	15	*	*	PUNCT
gra-84	134	16	(	(	PUNCT
gra-84	134	17	)	)	PUNCT
gra-84	134	18	(	(	PUNCT
gra-84	134	19	)	)	PUNCT
gra-84	134	20	(	(	PUNCT
gra-84	134	21	)	)	PUNCT
gra-84	134	22	*	*	PUNCT
gra-84	134	23	sin(10	sin(10	X
gra-84	134	24	)	)	PUNCT
gra-84	134	25	(	(	PUNCT
gra-84	134	26	)	)	PUNCT
gra-84	134	27	1	1	NUM
gra-84	134	28	(	(	PUNCT
gra-84	134	29	)	)	PUNCT
gra-84	134	30	(	(	PUNCT
gra-84	134	31	)	)	PUNCT
gra-84	134	32	f	f	X
gra-84	135	1	x	x	PUNCT
gra-84	135	2	x	x	PUNCT
gra-84	135	3	f	f	NOUN
gra-84	135	4	x	x	SYM
gra-84	135	5	g	g	NOUN
gra-84	135	6	x	x	X
gra-84	135	7	h	h	NOUN
gra-84	136	1	x	x	X
gra-84	136	2	f	f	NOUN
gra-84	136	3	x	x	X
gra-84	136	4	f	f	NOUN
gra-84	137	1	x	x	PUNCT
gra-84	137	2	x	x	SYM
gra-84	137	3	h	h	NOUN
gra-84	137	4	x	x	NOUN
gra-84	137	5	g	g	NOUN
gra-84	137	6	x	x	X
gra-84	137	7	g	g	NOUN
gra-84	137	8	x	x	X
gra-84	137	9	p	p	NOUN
gra-84	137	10	=	=	PUNCT
gra-84	137	11	=	=	SYM
gra-84	138	1	=	=	SYM
gra-84	138	2	1	1	NUM
gra-84	138	3	1	1	NUM
gra-84	138	4	2	2	NUM
gra-84	138	5	2	2	NUM
gra-84	138	6	2	2	NUM
gra-84	138	7	2	2	NUM
gra-84	138	8	1	1	NUM
gra-84	138	9	(	(	PUNCT
gra-84	138	10	)	)	PUNCT
gra-84	138	11	(	(	PUNCT
gra-84	138	12	)	)	PUNCT
gra-84	138	13	(	(	PUNCT
gra-84	138	14	)	)	PUNCT
gra-84	138	15	*	*	PUNCT
gra-84	138	16	(	(	PUNCT
gra-84	138	17	)	)	PUNCT
gra-84	138	18	(	(	PUNCT
gra-84	138	19	)	)	PUNCT
gra-84	138	20	91	91	NUM
gra-84	138	21	10cos(4	10cos(4	NUM
gra-84	138	22	)	)	PUNCT
gra-84	138	23	(	(	PUNCT
gra-84	138	24	)	)	PUNCT
gra-84	138	25	(	(	PUNCT
gra-84	138	26	)	)	PUNCT
gra-84	138	27	1	1	NUM
gra-84	138	28	(	(	PUNCT
gra-84	138	29	)	)	PUNCT
gra-84	138	30	n	n	CCONJ
gra-84	138	31	n	n	NOUN
gra-84	139	1	i	i	PRON
gra-84	139	2	ii	ii	VERB
gra-84	140	1	i	i	PRON
gra-84	140	2	f	f	NOUN
gra-84	141	1	x	x	PUNCT
gra-84	141	2	x	x	X
gra-84	141	3	f	f	NOUN
gra-84	141	4	x	x	SYM
gra-84	141	5	g	g	NOUN
gra-84	141	6	x	x	X
gra-84	141	7	h	h	NOUN
gra-84	141	8	x	x	NOUN
gra-84	141	9	g	g	NOUN
gra-84	141	10	x	x	SYM
gra-84	141	11	x	x	PUNCT
gra-84	141	12	x	x	X
gra-84	141	13	f	f	NOUN
gra-84	141	14	x	x	SYM
gra-84	141	15	h	h	NOUN
gra-84	141	16	x	x	NOUN
gra-84	141	17	g	g	NOUN
gra-84	141	18	x	x	X
gra-84	142	1	p	p	NOUN
gra-84	142	2	=	=	PUNCT
gra-84	142	3	=	=	PUNCT
gra-84	142	4	=	=	PUNCT
gra-84	142	5	=	=	PUNCT
gra-84	142	6	=	=	PUNCT
gra-84	143	1	+	+	NUM
gra-84	143	2	=	=	SYM
gra-84	143	3	å	å	PROPN
gra-84	143	4	å	å	PROPN
gra-84	143	5	6	6	NUM
gra-84	143	6	1	1	NUM
gra-84	143	7	1	1	NUM
gra-84	143	8	1	1	NUM
gra-84	143	9	2	2	NUM
gra-84	143	10	0.25	0.25	NUM
gra-84	143	11	2	2	NUM
gra-84	143	12	2	2	NUM
gra-84	143	13	1	1	NUM
gra-84	143	14	(	(	PUNCT
gra-84	143	15	)	)	PUNCT
gra-84	143	16	1	1	NUM
gra-84	143	17	exp	exp	NOUN
gra-84	143	18	(	(	PUNCT
gra-84	143	19	4	4	NUM
gra-84	143	20	)	)	PUNCT
gra-84	143	21	(	(	PUNCT
gra-84	143	22	sin(6	sin(6	ADJ
gra-84	143	23	)	)	PUNCT
gra-84	143	24	)	)	PUNCT
gra-84	143	25	(	(	PUNCT
gra-84	143	26	)	)	PUNCT
gra-84	143	27	(	(	PUNCT
gra-84	143	28	)	)	PUNCT
gra-84	143	29	*	*	PUNCT
gra-84	143	30	(	(	PUNCT
gra-84	143	31	)	)	PUNCT
gra-84	143	32	(	(	PUNCT
gra-84	143	33	)	)	PUNCT
gra-84	143	34	1	1	NUM
gra-84	143	35	9	9	NUM
gra-84	143	36	(	(	PUNCT
gra-84	143	37	1	1	NUM
gra-84	143	38	)	)	PUNCT
gra-84	143	39	(	(	PUNCT
gra-84	143	40	)	)	PUNCT
gra-84	143	41	(	(	PUNCT
gra-84	143	42	)	)	PUNCT
gra-84	143	43	1	1	NUM
gra-84	143	44	(	(	PUNCT
gra-84	143	45	)	)	PUNCT
gra-84	143	46	n	n	NOUN
gra-84	143	47	ii	ii	NOUN
gra-84	143	48	f	f	NOUN
gra-84	143	49	x	x	PUNCT
gra-84	143	50	x	x	PUNCT
gra-84	143	51	x	x	X
gra-84	143	52	f	f	NOUN
gra-84	143	53	x	x	SYM
gra-84	143	54	g	g	NOUN
gra-84	143	55	x	x	X
gra-84	143	56	h	h	NOUN
gra-84	143	57	x	x	NOUN
gra-84	143	58	x	x	X
gra-84	143	59	g	g	NOUN
gra-84	143	60	x	x	SYM
gra-84	143	61	n	n	NOUN
gra-84	143	62	f	f	NOUN
gra-84	143	63	x	x	SYM
gra-84	143	64	h	h	NOUN
gra-84	143	65	x	x	X
gra-84	143	66	g	g	NOUN
gra-84	143	67	x	x	X
gra-84	143	68	p	p	NOUN
gra-84	143	69	=	=	PUNCT
gra-84	143	70	=	=	PUNCT
gra-84	143	71	=	=	PUNCT
gra-84	143	72	æ	æ	PROPN
gra-84	143	73	ö	ö	NOUN
gra-84	143	74	ç	ç	X
gra-84	143	75	÷=	÷=	X
gra-84	143	76	+	+	CCONJ
gra-84	143	77	ç	ç	X
gra-84	143	78	֏	֏	ADP
gra-84	143	79	ø	ø	PROPN
gra-84	143	80	æ	æ	X
gra-84	143	81	ö	ö	X
gra-84	143	82	=	=	SYM
gra-84	143	83	ç	ç	PROPN
gra-84	143	84	÷	÷	NOUN
gra-84	143	85	è	è	PUNCT
gra-84	143	86	ø	ø	X
gra-84	143	87	å	å	PROPN
gra-84	143	88	convergence	convergence	NOUN
gra-84	143	89	and	and	CCONJ
gra-84	143	90	distribution	distribution	NOUN
gra-84	143	91	performance	performance	NOUN
gra-84	143	92	of	of	ADP
gra-84	143	93	algorithm	algorithm	NOUN
gra-84	143	94	.	.	PUNCT
gra-84	144	1	igd	igd	NOUN
gra-84	144	2	is	be	AUX
gra-84	144	3	one	one	NUM
gra-84	144	4	of	of	ADP
gra-84	144	5	the	the	DET
gra-84	144	6	most	most	ADV
gra-84	144	7	widely	widely	ADV
gra-84	144	8	used	use	VERB
gra-84	144	9	indicators	indicator	NOUN
gra-84	144	10	[	[	X
gra-84	144	11	15	15	NUM
gra-84	144	12	]	]	PUNCT
gra-84	144	13	.	.	PUNCT
gra-84	145	1	the	the	DET
gra-84	145	2	true	true	ADJ
gra-84	145	3	pareto	pareto	ADJ
gra-84	145	4	frontier	frontier	NOUN
gra-84	145	5	is	be	AUX
gra-84	145	6	needed	need	VERB
gra-84	145	7	to	to	PART
gra-84	145	8	calculate	calculate	VERB
gra-84	145	9	the	the	DET
gra-84	145	10	igd	igd	NOUN
gra-84	145	11	value	value	NOUN
gra-84	145	12	of	of	ADP
gra-84	145	13	the	the	DET
gra-84	145	14	obtained	obtain	VERB
gra-84	145	15	solution	solution	NOUN
gra-84	145	16	set	set	VERB
gra-84	145	17	.	.	PUNCT
gra-84	146	1	for	for	ADP
gra-84	146	2	zdt	zdt	PROPN
gra-84	146	3	test	test	NOUN
gra-84	146	4	function	function	NOUN
gra-84	146	5	,	,	PUNCT
gra-84	146	6	the	the	DET
gra-84	146	7	igd	igd	NOUN
gra-84	146	8	calculation	calculation	NOUN
gra-84	146	9	requires	require	VERB
gra-84	146	10	normalizing	normalize	VERB
gra-84	146	11	the	the	DET
gra-84	146	12	given	give	VERB
gra-84	146	13	set	set	NOUN
gra-84	146	14	of	of	ADP
gra-84	146	15	solutions	solution	NOUN
gra-84	146	16	at	at	ADP
gra-84	146	17	ideal	ideal	ADJ
gra-84	146	18	and	and	CCONJ
gra-84	146	19	extreme	extreme	ADJ
gra-84	146	20	points	point	NOUN
gra-84	146	21	.	.	PUNCT
gra-84	147	1	for	for	ADP
gra-84	147	2	any	any	DET
gra-84	147	3	algorithm	algorithm	NOUN
gra-84	147	4	,	,	PUNCT
gra-84	147	5	the	the	DET
gra-84	147	6	nal	nal	ADJ
gra-84	147	7	nondominated	nondominated	ADJ
gra-84	147	8	solutions	solution	NOUN
gra-84	147	9	is	be	AUX
gra-84	147	10	named	name	VERB
gra-84	147	11	s	s	PRON
gra-84	147	12	and	and	CCONJ
gra-84	147	13	the	the	DET
gra-84	147	14	true	true	ADJ
gra-84	147	15	pareto	pareto	ADJ
gra-84	147	16	frontier	frontier	NOUN
gra-84	147	17	is	be	AUX
gra-84	147	18	named	name	VERB
gra-84	147	19	z.	z.	PROPN
gra-84	148	1	then	then	ADV
gra-84	148	2	,	,	PUNCT
gra-84	148	3	the	the	DET
gra-84	148	4	igd	igd	NOUN
gra-84	148	5	metric	metric	NOUN
gra-84	148	6	is	be	AUX
gra-84	148	7	calculated	calculate	VERB
gra-84	148	8	as	as	SCONJ
gra-84	148	9	follows	follow	VERB
gra-84	148	10	:	:	PUNCT
gra-84	148	11	where	where	SCONJ
gra-84	148	12	d(z	d(z	NOUN
gra-84	148	13	,	,	PUNCT
gra-84	148	14	s	s	PART
gra-84	148	15	)	)	PUNCT
gra-84	148	16	is	be	AUX
gra-84	148	17	the	the	DET
gra-84	148	18	euclidean	euclidean	ADJ
gra-84	148	19	distance	distance	NOUN
gra-84	148	20	between	between	ADP
gra-84	148	21	the	the	DET
gra-84	148	22	points	point	NOUN
gra-84	149	1	z	z	NOUN
gra-84	150	1	i	i	PRON
gra-84	150	2	i	i	PRON
gra-84	151	1	i	i	PRON
gra-84	151	2	and	and	CCONJ
gra-84	151	3	s	s	VERB
gra-84	151	4	.	.	PUNCT
gra-84	152	1	the	the	PRON
gra-84	152	2	smaller	small	ADJ
gra-84	152	3	the	the	DET
gra-84	152	4	value	value	NOUN
gra-84	152	5	of	of	ADP
gra-84	152	6	igd	igd	PROPN
gra-84	152	7	,	,	PUNCT
gra-84	152	8	the	the	DET
gra-84	152	9	better	well	ADJ
gra-84	152	10	s.i	s.i	NOUN
gra-84	152	11	in	in	ADP
gra-84	152	12	order	order	NOUN
gra-84	152	13	to	to	PART
gra-84	152	14	ensure	ensure	VERB
gra-84	152	15	the	the	DET
gra-84	152	16	reliability	reliability	NOUN
gra-84	152	17	of	of	ADP
gra-84	152	18	the	the	DET
gra-84	152	19	experiment	experiment	NOUN
gra-84	152	20	results	result	NOUN
gra-84	152	21	,	,	PUNCT
gra-84	152	22	the	the	DET
gra-84	152	23	parameters	parameter	NOUN
gra-84	152	24	of	of	ADP
gra-84	152	25	the	the	DET
gra-84	152	26	algorithm	algorithm	NOUN
gra-84	152	27	are	be	AUX
gra-84	152	28	set	set	VERB
gra-84	152	29	as	as	SCONJ
gra-84	152	30	follows	follow	VERB
gra-84	152	31	.	.	PUNCT
gra-84	153	1	the	the	DET
gra-84	153	2	number	number	NOUN
gra-84	153	3	of	of	ADP
gra-84	153	4	population	population	NOUN
gra-84	153	5	individuals	individual	NOUN
gra-84	153	6	p	p	NOUN
gra-84	153	7	is	be	AUX
gra-84	153	8	set	set	VERB
gra-84	153	9	to	to	ADP
gra-84	153	10	100	100	NUM
gra-84	153	11	,	,	PUNCT
gra-84	153	12	which	which	PRON
gra-84	153	13	means	mean	VERB
gra-84	153	14	n	n	X
gra-84	153	15	=	=	SYM
gra-84	153	16	100	100	NUM
gra-84	153	17	.	.	PUNCT
gra-84	154	1	the	the	DET
gra-84	154	2	number	number	NOUN
gra-84	154	3	of	of	ADP
gra-84	154	4	iterations	iteration	NOUN
gra-84	154	5	it	it	PRON
gra-84	154	6	is	be	AUX
gra-84	154	7	set	set	VERB
gra-84	154	8	to	to	ADP
gra-84	154	9	250	250	NUM
gra-84	154	10	.	.	PUNCT
gra-84	155	1	the	the	DET
gra-84	155	2	probability	probability	NOUN
gra-84	155	3	of	of	ADP
gra-84	155	4	crossover	crossover	NOUN
gra-84	155	5	cr	cr	PROPN
gra-84	155	6	is	be	AUX
gra-84	155	7	set	set	VERB
gra-84	155	8	to	to	ADP
gra-84	155	9	0.5	0.5	NUM
gra-84	155	10	and	and	CCONJ
gra-84	155	11	the	the	DET
gra-84	155	12	probability	probability	NOUN
gra-84	155	13	of	of	ADP
gra-84	155	14	mutation	mutation	NOUN
gra-84	155	15	f	f	PROPN
gra-84	155	16	is	be	AUX
gra-84	155	17	set	set	VERB
gra-84	155	18	to	to	ADP
gra-84	155	19	0.02	0.02	NUM
gra-84	155	20	.	.	PUNCT
gra-84	156	1	the	the	DET
gra-84	156	2	maximum	maximum	ADJ
gra-84	156	3	value	value	NOUN
gra-84	156	4	of	of	ADP
gra-84	156	5	t	t	PROPN
gra-84	156	6	closet	closet	NOUN
gra-84	156	7	neighborhood	neighborhood	NOUN
gra-84	156	8	is	be	AUX
gra-84	156	9	set	set	VERB
gra-84	156	10	to	to	ADP
gra-84	156	11	15	15	NUM
gra-84	156	12	,	,	PUNCT
gra-84	156	13	and	and	CCONJ
gra-84	156	14	minimum	minimum	NOUN
gra-84	156	15	value	value	NOUN
gra-84	156	16	of	of	ADP
gra-84	156	17	t	t	PROPN
gra-84	156	18	is	be	AUX
gra-84	156	19	set	set	VERB
gra-84	156	20	to	to	ADP
gra-84	156	21	2	2	NUM
gra-84	156	22	.	.	PUNCT
gra-84	157	1	generally	generally	ADV
gra-84	157	2	,	,	PUNCT
gra-84	157	3	the	the	DET
gra-84	157	4	neighborhood	neighborhood	NOUN
gra-84	157	5	size	size	NOUN
gra-84	157	6	t	t	PROPN
gra-84	157	7	is	be	AUX
gra-84	157	8	set	set	VERB
gra-84	157	9	to	to	ADP
gra-84	157	10	t	t	NOUN
gra-84	157	11	=	=	SYM
gra-84	157	12	0.1n	0.1n	PROPN
gra-84	157	13	.	.	PUNCT
gra-84	158	1	4.3	4.3	NUM
gra-84	158	2	analysis	analysis	NOUN
gra-84	158	3	table	table	NOUN
gra-84	158	4	2	2	NUM
gra-84	158	5	shows	show	VERB
gra-84	158	6	the	the	DET
gra-84	158	7	experimental	experimental	ADJ
gra-84	158	8	results	result	NOUN
gra-84	158	9	of	of	ADP
gra-84	158	10	moea	moea	NOUN
gra-84	158	11	/	/	SYM
gra-84	158	12	d	d	ADJ
gra-84	158	13	-	-	PUNCT
gra-84	158	14	dfs	dfs	ADJ
gra-84	158	15	algorithm	algorithm	NOUN
gra-84	158	16	and	and	CCONJ
gra-84	158	17	moea	moea	NOUN
gra-84	158	18	/	/	SYM
gra-84	158	19	d	d	NOUN
gra-84	158	20	algorithm	algorithm	NOUN
gra-84	158	21	on	on	ADP
gra-84	158	22	test	test	NOUN
gra-84	158	23	functions	function	NOUN
gra-84	158	24	zdt1	zdt1	NOUN
gra-84	158	25	-	-	PUNCT
gra-84	158	26	4	4	NUM
gra-84	158	27	and	and	CCONJ
gra-84	158	28	zdt6	zdt6	PROPN
gra-84	158	29	.	.	PUNCT
gra-84	159	1	static	static	ADJ
gra-84	159	2	analysis	analysis	NOUN
gra-84	159	3	is	be	AUX
gra-84	159	4	used	use	VERB
gra-84	159	5	to	to	PART
gra-84	159	6	judge	judge	VERB
gra-84	159	7	the	the	DET
gra-84	159	8	performance	performance	NOUN
gra-84	159	9	of	of	ADP
gra-84	159	10	each	each	DET
gra-84	159	11	algorithm	algorithm	NOUN
gra-84	159	12	by	by	ADP
gra-84	159	13	using	use	VERB
gra-84	159	14	igd	igd	NOUN
gra-84	159	15	value	value	NOUN
gra-84	159	16	.	.	PUNCT
gra-84	160	1	the	the	DET
gra-84	160	2	smaller	small	ADJ
gra-84	160	3	the	the	DET
gra-84	160	4	igd	igd	NOUN
gra-84	160	5	values	value	NOUN
gra-84	160	6	,	,	PUNCT
gra-84	160	7	the	the	PRON
gra-84	160	8	better	well	ADJ
gra-84	160	9	the	the	DET
gra-84	160	10	performance	performance	NOUN
gra-84	160	11	of	of	ADP
gra-84	160	12	the	the	DET
gra-84	160	13	algorithm	algorithm	NOUN
gra-84	160	14	.	.	PUNCT
gra-84	161	1	table	table	NOUN
gra-84	161	2	2	2	NUM
gra-84	161	3	shows	show	VERB
gra-84	161	4	that	that	SCONJ
gra-84	161	5	the	the	DET
gra-84	161	6	performance	performance	NOUN
gra-84	161	7	of	of	ADP
gra-84	161	8	the	the	DET
gra-84	161	9	moea	moea	NOUN
gra-84	161	10	/	/	SYM
gra-84	161	11	d	d	ADJ
gra-84	161	12	-	-	PUNCT
gra-84	161	13	dfs	dfs	ADJ
gra-84	161	14	algorithm	algorithm	NOUN
gra-84	161	15	is	be	AUX
gra-84	161	16	better	well	ADJ
gra-84	161	17	than	than	ADP
gra-84	161	18	that	that	PRON
gra-84	161	19	of	of	ADP
gra-84	161	20	the	the	DET
gra-84	161	21	moea	moea	NOUN
gra-84	161	22	/	/	SYM
gra-84	161	23	d	d	NOUN
gra-84	161	24	algorithm	algorithm	NOUN
gra-84	161	25	on	on	ADP
gra-84	161	26	the	the	DET
gra-84	161	27	whole	whole	NOUN
gra-84	161	28	.	.	PUNCT
gra-84	162	1	table	table	NOUN
gra-84	162	2	2	2	NUM
gra-84	162	3	.	.	PUNCT
gra-84	163	1	the	the	DET
gra-84	163	2	igd	igd	NOUN
gra-84	163	3	(	(	PUNCT
gra-84	163	4	min	min	PROPN
gra-84	163	5	,	,	PUNCT
gra-84	163	6	avg	avg	PROPN
gra-84	163	7	,	,	PUNCT
gra-84	163	8	max	max	PROPN
gra-84	163	9	)	)	PUNCT
gra-84	163	10	values	value	NOUN
gra-84	163	11	of	of	ADP
gra-84	163	12	the	the	DET
gra-84	163	13	moea	moea	NOUN
gra-84	163	14	/	/	SYM
gra-84	163	15	d	d	NOUN
gra-84	163	16	-	-	PUNCT
gra-84	163	17	dfs	dfs	NOUN
gra-84	163	18	and	and	CCONJ
gra-84	163	19	moea	moea	NOUN
gra-84	163	20	/	/	SYM
gra-84	163	21	d	d	NOUN
gra-84	163	22	algorithms	algorithm	NOUN
gra-84	163	23	on	on	ADP
gra-84	163	24	test	test	NOUN
gra-84	163	25	functions	function	NOUN
gra-84	163	26	zdt1	zdt1	PROPN
gra-84	163	27	,	,	PUNCT
gra-84	163	28	zdt2	zdt2	PROPN
gra-84	163	29	,	,	PUNCT
gra-84	163	30	zdt3	zdt3	PROPN
gra-84	163	31	,	,	PUNCT
gra-84	163	32	zdt4	zdt4	PROPN
gra-84	163	33	,	,	PUNCT
gra-84	163	34	and	and	CCONJ
gra-84	163	35	zdt6	zdt6	PROPN
gra-84	163	36	.	.	PUNCT
gra-84	163	37	figure1	figure1	PROPN
gra-84	163	38	shows	show	VERB
gra-84	163	39	the	the	DET
gra-84	163	40	approximate	approximate	ADJ
gra-84	163	41	pareto	pareto	NOUN
gra-84	163	42	frontier	frontier	NOUN
gra-84	163	43	obtained	obtain	VERB
gra-84	163	44	by	by	ADP
gra-84	163	45	moea	moea	NOUN
gra-84	163	46	/	/	SYM
gra-84	163	47	d	d	ADJ
gra-84	163	48	-	-	PUNCT
gra-84	163	49	dfs	dfs	ADJ
gra-84	163	50	algorithm	algorithm	NOUN
gra-84	163	51	and	and	CCONJ
gra-84	163	52	moea	moea	NOUN
gra-84	163	53	/	/	SYM
gra-84	163	54	d	d	NOUN
gra-84	163	55	algorithm	algorithm	NOUN
gra-84	163	56	on	on	ADP
gra-84	163	57	zdt	zdt	PROPN
gra-84	163	58	test	test	NOUN
gra-84	163	59	function	function	NOUN
gra-84	163	60	.	.	PUNCT
gra-84	164	1	from	from	ADP
gra-84	164	2	the	the	DET
gra-84	164	3	comparison	comparison	NOUN
gra-84	164	4	chart	chart	NOUN
gra-84	164	5	of	of	ADP
gra-84	164	6	fig1	fig1	PROPN
gra-84	164	7	,	,	PUNCT
gra-84	164	8	the	the	DET
gra-84	164	9	improved	improved	ADJ
gra-84	164	10	algorithm	algorithm	NOUN
gra-84	164	11	moea	moea	NOUN
gra-84	164	12	/	/	SYM
gra-84	164	13	d	d	NOUN
gra-84	164	14	-	-	PUNCT
gra-84	164	15	dfs	dfs	NOUN
gra-84	164	16	gives	give	VERB
gra-84	164	17	better	well	ADJ
gra-84	164	18	approximate	approximate	ADJ
gra-84	164	19	pareto	pareto	ADJ
gra-84	164	20	frontier	frontier	NOUN
gra-84	164	21	.	.	PUNCT
gra-84	165	1	compared	compare	VERB
gra-84	165	2	with	with	ADP
gra-84	165	3	moea	moea	NOUN
gra-84	165	4	/	/	SYM
gra-84	165	5	d	d	NOUN
gra-84	165	6	algorithm	algorithm	NOUN
gra-84	165	7	,	,	PUNCT
gra-84	165	8	the	the	DET
gra-84	165	9	convergence	convergence	NOUN
gra-84	165	10	and	and	CCONJ
gra-84	165	11	distribution	distribution	NOUN
gra-84	165	12	of	of	ADP
gra-84	165	13	moea	moea	NOUN
gra-84	165	14	/	/	SYM
gra-84	165	15	d	d	NOUN
gra-84	165	16	-	-	PUNCT
gra-84	165	17	dfs	dfs	NOUN
gra-84	165	18	are	be	AUX
gra-84	165	19	excellent	excellent	ADJ
gra-84	165	20	.	.	PUNCT
gra-84	166	1	although	although	SCONJ
gra-84	166	2	the	the	DET
gra-84	166	3	zdt2	zdt2	PROPN
gra-84	166	4	test	test	NOUN
gra-84	166	5	function	function	NOUN
gra-84	166	6	does	do	AUX
gra-84	166	7	not	not	PART
gra-84	166	8	obtain	obtain	VERB
gra-84	166	9	a	a	DET
gra-84	166	10	good	good	ADJ
gra-84	166	11	enough	enough	ADJ
gra-84	166	12	set	set	NOUN
gra-84	166	13	of	of	ADP
gra-84	166	14	solutions	solution	NOUN
gra-84	166	15	,	,	PUNCT
gra-84	166	16	compared	compare	VERB
gra-84	166	17	with	with	ADP
gra-84	166	18	the	the	DET
gra-84	166	19	moea	moea	NOUN
gra-84	166	20	/	/	SYM
gra-84	166	21	d	d	NOUN
gra-84	166	22	algorithm	algorithm	NOUN
gra-84	166	23	,	,	PUNCT
gra-84	166	24	a	a	DET
gra-84	166	25	sufcient	sufcient	ADJ
gra-84	166	26	number	number	NOUN
gra-84	166	27	of	of	ADP
gra-84	166	28	solutions	solution	NOUN
gra-84	166	29	are	be	AUX
gra-84	166	30	obtained	obtain	VERB
gra-84	166	31	.	.	PUNCT
gra-84	167	1	obviously	obviously	ADV
gra-84	167	2	,	,	PUNCT
gra-84	167	3	on	on	ADP
gra-84	167	4	the	the	DET
gra-84	167	5	test	test	NOUN
gra-84	167	6	functions	function	NOUN
gra-84	167	7	zdt1	zdt1	NOUN
gra-84	167	8	,	,	PUNCT
gra-84	167	9	zdt3	zdt3	PROPN
gra-84	167	10	,	,	PUNCT
gra-84	167	11	zdt4	zdt4	PROPN
gra-84	167	12	and	and	CCONJ
gra-84	167	13	zdt6	zdt6	PROPN
gra-84	167	14	,	,	PUNCT
gra-84	167	15	the	the	DET
gra-84	167	16	solution	solution	NOUN
gra-84	167	17	set	set	NOUN
gra-84	167	18	obtained	obtain	VERB
gra-84	167	19	by	by	ADP
gra-84	167	20	moea	moea	NOUN
gra-84	167	21	/	/	SYM
gra-84	167	22	d	d	NOUN
gra-84	167	23	-	-	PUNCT
gra-84	167	24	dfs	dfs	NOUN
gra-84	167	25	has	have	VERB
gra-84	167	26	better	well	ADJ
gra-84	167	27	convergence	convergence	NOUN
gra-84	167	28	and	and	CCONJ
gra-84	167	29	distribution	distribution	NOUN
gra-84	167	30	than	than	ADP
gra-84	167	31	that	that	PRON
gra-84	167	32	obtained	obtain	VERB
gra-84	167	33	by	by	ADP
gra-84	167	34	moea	moea	NOUN
gra-84	167	35	/	/	SYM
gra-84	167	36	d	d	NOUN
gra-84	167	37	algorithm	algorithm	NOUN
gra-84	167	38	.	.	PUNCT
gra-84	168	1	figure	figure	NOUN
gra-84	168	2	1	1	NUM
gra-84	168	3	.	.	PUNCT
gra-84	169	1	the	the	DET
gra-84	169	2	approximate	approximate	ADJ
gra-84	169	3	pareto	pareto	ADJ
gra-84	169	4	frontier	frontier	NOUN
gra-84	169	5	obtained	obtain	VERB
gra-84	169	6	by	by	ADP
gra-84	169	7	moea	moea	NOUN
gra-84	169	8	/	/	SYM
gra-84	169	9	d	d	ADJ
gra-84	169	10	-	-	PUNCT
gra-84	169	11	dfs	dfs	ADJ
gra-84	169	12	algorithm	algorithm	NOUN
gra-84	169	13	and	and	CCONJ
gra-84	169	14	moea	moea	NOUN
gra-84	169	15	/	/	SYM
gra-84	169	16	d	d	NOUN
gra-84	169	17	algorithm	algorithm	NOUN
gra-84	169	18	on	on	ADP
gra-84	169	19	the	the	DET
gra-84	169	20	zdt	zdt	PROPN
gra-84	169	21	test	test	NOUN
gra-84	169	22	function	function	NOUN
gra-84	169	23	.	.	PUNCT
gra-84	170	1	5	5	NUM
gra-84	170	2	conclusion	conclusion	NOUN
gra-84	170	3	in	in	ADP
gra-84	170	4	order	order	NOUN
gra-84	170	5	to	to	PART
gra-84	170	6	achieve	achieve	VERB
gra-84	170	7	a	a	DET
gra-84	170	8	good	good	ADJ
gra-84	170	9	balance	balance	NOUN
gra-84	170	10	between	between	ADP
gra-84	170	11	convergence	convergence	NOUN
gra-84	170	12	and	and	CCONJ
gra-84	170	13	diversity	diversity	NOUN
gra-84	170	14	,	,	PUNCT
gra-84	170	15	this	this	DET
gra-84	170	16	paper	paper	NOUN
gra-84	170	17	proposes	propose	VERB
gra-84	170	18	an	an	DET
gra-84	170	19	algorithm	algorithm	NOUN
gra-84	170	20	,	,	PUNCT
gra-84	170	21	moea	moea	NOUN
gra-84	170	22	/	/	SYM
gra-84	170	23	d	d	NOUN
gra-84	170	24	-	-	PUNCT
gra-84	170	25	dfs	dfs	NOUN
gra-84	170	26	,	,	PUNCT
gra-84	170	27	which	which	PRON
gra-84	170	28	adopts	adopt	VERB
gra-84	170	29	differently	differently	ADV
gra-84	170	30	selecting	select	VERB
gra-84	170	31	strategy	strategy	NOUN
gra-84	170	32	for	for	ADP
gra-84	170	33	population	population	NOUN
gra-84	170	34	.	.	PUNCT
gra-84	171	1	this	this	DET
gra-84	171	2	strategy	strategy	NOUN
gra-84	171	3	adopts	adopt	VERB
gra-84	171	4	the	the	DET
gra-84	171	5	non	non	ADJ
gra-84	171	6	-	-	ADJ
gra-84	171	7	dominated	dominated	ADJ
gra-84	171	8	sorting	sorting	NOUN
gra-84	171	9	method	method	NOUN
gra-84	171	10	and	and	CCONJ
gra-84	171	11	gives	give	VERB
gra-84	171	12	priority	priority	NOUN
gra-84	171	13	to	to	ADP
gra-84	171	14	the	the	DET
gra-84	171	15	selection	selection	NOUN
gra-84	171	16	of	of	ADP
gra-84	171	17	good	good	ADJ
gra-84	171	18	individuals	individual	NOUN
gra-84	171	19	,	,	PUNCT
gra-84	171	20	which	which	PRON
gra-84	171	21	is	be	AUX
gra-84	171	22	conducive	conducive	ADJ
gra-84	171	23	to	to	ADP
gra-84	171	24	enhancing	enhance	VERB
gra-84	171	25	the	the	DET
gra-84	171	26	convergence	convergence	NOUN
gra-84	171	27	of	of	ADP
gra-84	171	28	the	the	DET
gra-84	171	29	nal	nal	ADJ
gra-84	171	30	solution	solution	NOUN
gra-84	171	31	set	set	NOUN
gra-84	171	32	.	.	PUNCT
gra-84	172	1	meanwhile	meanwhile	ADV
gra-84	172	2	,	,	PUNCT
gra-84	172	3	it	it	PRON
gra-84	172	4	is	be	AUX
gra-84	172	5	benecial	benecial	ADJ
gra-84	172	6	to	to	PART
gra-84	172	7	enhance	enhance	VERB
gra-84	172	8	the	the	DET
gra-84	172	9	diversity	diversity	NOUN
gra-84	172	10	of	of	ADP
gra-84	172	11	the	the	DET
gra-84	172	12	population	population	NOUN
gra-84	172	13	by	by	ADP
gra-84	172	14	using	use	VERB
gra-84	172	15	the	the	DET
gra-84	172	16	rst	rst	PROPN
gra-84	172	17	encounter	encounter	NOUN
gra-84	172	18	and	and	CCONJ
gra-84	172	19	stop	stop	VERB
gra-84	172	20	substitution	substitution	NOUN
gra-84	172	21	operation	operation	NOUN
gra-84	172	22	.	.	PUNCT
gra-84	173	1	to	to	PART
gra-84	173	2	prove	prove	VERB
gra-84	173	3	the	the	DET
gra-84	173	4	effectiveness	effectiveness	NOUN
gra-84	173	5	of	of	ADP
gra-84	173	6	the	the	DET
gra-84	173	7	proposed	propose	VERB
gra-84	173	8	algorithm	algorithm	NOUN
gra-84	173	9	,	,	PUNCT
gra-84	173	10	the	the	DET
gra-84	173	11	moea	moea	NOUN
gra-84	173	12	/	/	SYM
gra-84	173	13	d	d	ADJ
gra-84	173	14	-	-	PUNCT
gra-84	173	15	dfs	dfs	ADJ
gra-84	173	16	algorithm	algorithm	NOUN
gra-84	173	17	and	and	CCONJ
gra-84	173	18	moea	moea	NOUN
gra-84	173	19	/	/	SYM
gra-84	173	20	d	d	NOUN
gra-84	173	21	algorithm	algorithm	NOUN
gra-84	173	22	are	be	AUX
gra-84	173	23	compared	compare	VERB
gra-84	173	24	with	with	ADP
gra-84	173	25	zdt	zdt	PROPN
gra-84	173	26	series	series	PROPN
gra-84	173	27	of	of	ADP
gra-84	173	28	test	test	NOUN
gra-84	173	29	functions	function	NOUN
gra-84	173	30	.	.	PUNCT
gra-84	174	1	experiments	experiment	NOUN
gra-84	174	2	show	show	VERB
gra-84	174	3	that	that	SCONJ
gra-84	174	4	the	the	DET
gra-84	174	5	proposed	propose	VERB
gra-84	174	6	algorithm	algorithm	NOUN
gra-84	174	7	can	can	AUX
gra-84	174	8	obtain	obtain	VERB
gra-84	174	9	good	good	ADJ
gra-84	174	10	convergence	convergence	NOUN
gra-84	174	11	and	and	CCONJ
gra-84	174	12	distribution	distribution	NOUN
gra-84	174	13	solutions	solution	NOUN
gra-84	174	14	for	for	ADP
gra-84	174	15	different	different	ADJ
gra-84	174	16	optimization	optimization	NOUN
gra-84	174	17	problems	problem	NOUN
gra-84	174	18	.	.	PUNCT
gra-84	175	1	references	reference	NOUN
gra-84	175	2	[	[	X
gra-84	175	3	1	1	NUM
gra-84	175	4	]	]	PUNCT
gra-84	175	5	trindade	trindade	VERB
gra-84	175	6	b	b	PROPN
gra-84	175	7	c	c	PROPN
gra-84	175	8	,	,	PUNCT
gra-84	175	9	reed	reed	NOUN
gra-84	175	10	p	p	PROPN
gra-84	175	11	m	m	PROPN
gra-84	175	12	,	,	PUNCT
gra-84	175	13	herman	herman	PROPN
gra-84	175	14	j	j	PROPN
gra-84	175	15	d	d	PROPN
gra-84	175	16	,	,	PUNCT
gra-84	175	17	et	et	PROPN
gra-84	175	18	al	al	PROPN
gra-84	175	19	.	.	PUNCT
gra-84	176	1	reducing	reduce	VERB
gra-84	176	2	regional	regional	ADJ
gra-84	176	3	drought	drought	NOUN
gra-84	176	4	vulnerabilities	vulnerability	NOUN
gra-84	176	5	and	and	CCONJ
gra-84	176	6	multi	multi	ADJ
gra-84	176	7	-	-	ADJ
gra-84	176	8	city	city	ADJ
gra-84	176	9	robustness	robustness	NOUN
gra-84	176	10	conicts	conict	NOUN
gra-84	176	11	using	use	VERB
gra-84	176	12	many	many	ADJ
gra-84	176	13	-	-	PUNCT
gra-84	176	14	objective	objective	ADJ
gra-84	176	15	optimization	optimization	NOUN
gra-84	176	16	under	under	ADP
gra-84	176	17	deep	deep	ADJ
gra-84	176	18	uncertainty[j	uncertainty[j	NOUN
gra-84	176	19	]	]	PUNCT
gra-84	176	20	.	.	PUNCT
gra-84	177	1	advances	advance	NOUN
gra-84	177	2	in	in	ADP
gra-84	177	3	water	water	NOUN
gra-84	177	4	resources	resource	NOUN
gra-84	177	5	,	,	PUNCT
gra-84	177	6	2017	2017	NUM
gra-84	177	7	,	,	PUNCT
gra-84	177	8	104:195	104:195	NOUN
gra-84	177	9	-	-	PUNCT
gra-84	177	10	209	209	NUM
gra-84	177	11	.	.	PUNCT
gra-84	178	1	[	[	X
gra-84	178	2	2	2	X
gra-84	178	3	]	]	X
gra-84	178	4	ringkamp	ringkamp	PROPN
gra-84	178	5	m	m	PROPN
gra-84	178	6	,	,	PUNCT
gra-84	178	7	ober	ober	NOUN
gra-84	178	8	-	-	PUNCT
gra-84	178	9	bl?baum	bl?baum	NOUN
gra-84	178	10	s	s	PART
gra-84	178	11	,	,	PUNCT
gra-84	178	12	dellnitz	dellnitz	AUX
gra-84	178	13	m	m	PROPN
gra-84	178	14	,	,	PUNCT
gra-84	178	15	et	et	PROPN
gra-84	178	16	al	al	PROPN
gra-84	178	17	.	.	PROPN
gra-84	178	18	handling	handle	VERB
gra-84	178	19	high	high	ADJ
gra-84	178	20	-	-	PUNCT
gra-84	178	21	dimensional	dimensional	ADJ
gra-84	178	22	problems	problem	NOUN
gra-84	178	23	with	with	ADP
gra-84	178	24	multi	multi	ADJ
gra-84	178	25	-	-	ADJ
gra-84	178	26	objective	objective	ADJ
gra-84	178	27	continuation	continuation	NOUN
gra-84	178	28	methods	method	NOUN
gra-84	178	29	via	via	ADP
gra-84	178	30	successive	successive	ADJ
gra-84	178	31	approximation	approximation	NOUN
gra-84	178	32	of	of	ADP
gra-84	178	33	the	the	DET
gra-84	178	34	tangent	tangent	PROPN
gra-84	178	35	space[j	space[j	PROPN
gra-84	178	36	]	]	PUNCT
gra-84	178	37	.	.	PUNCT
gra-84	179	1	engineering	engineer	VERB
gra-84	179	2	optimization	optimization	NOUN
gra-84	179	3	,	,	PUNCT
gra-84	179	4	2012	2012	NUM
gra-84	179	5	,	,	PUNCT
gra-84	179	6	44(9):1117	44(9):1117	NUM
gra-84	179	7	-	-	SYM
gra-84	179	8	1146	1146	NUM
gra-84	179	9	.	.	PUNCT
gra-84	180	1	[	[	X
gra-84	180	2	3	3	X
gra-84	180	3	]	]	X
gra-84	180	4	fleming	fleme	VERB
gra-84	180	5	p	p	PROPN
gra-84	180	6	j	j	PROPN
gra-84	180	7	,	,	PUNCT
gra-84	180	8	purshouse	purshouse	ADP
gra-84	180	9	r	r	NOUN
gra-84	180	10	c	c	PROPN
gra-84	180	11	,	,	PUNCT
gra-84	180	12	lygoe	lygoe	PROPN
gra-84	180	13	r	r	NOUN
gra-84	180	14	j.	j.	PROPN
gra-84	180	15	many	many	ADJ
gra-84	180	16	-	-	PUNCT
gra-84	180	17	objective	objective	ADJ
gra-84	180	18	optimization	optimization	NOUN
gra-84	180	19	:	:	PUNCT
gra-84	180	20	an	an	DET
gra-84	180	21	engineering	engineering	NOUN
gra-84	180	22	design	design	NOUN
gra-84	180	23	perspective[j	perspective[j	NOUN
gra-84	180	24	]	]	PUNCT
gra-84	180	25	.	.	PUNCT
gra-84	181	1	2005	2005	NUM
gra-84	181	2	.	.	PUNCT
gra-84	182	1	[	[	X
gra-84	182	2	4	4	X
gra-84	182	3	]	]	PUNCT
gra-84	182	4	goulart	goulart	PROPN
gra-84	182	5	f	f	PROPN
gra-84	182	6	,	,	PUNCT
gra-84	182	7	campelo	campelo	PROPN
gra-84	182	8	f.	f.	PROPN
gra-84	182	9	preference	preference	NOUN
gra-84	182	10	-	-	PUNCT
gra-84	182	11	guided	guide	VERB
gra-84	182	12	evolutionary	evolutionary	ADJ
gra-84	182	13	algorithms	algorithm	NOUN
gra-84	182	14	for	for	ADP
gra-84	182	15	manyobjective	manyobjective	ADJ
gra-84	182	16	optimization[j	optimization[j	PROPN
gra-84	182	17	]	]	PUNCT
gra-84	182	18	.	.	PUNCT
gra-84	183	1	information	information	NOUN
gra-84	183	2	sciences	sciences	PROPN
gra-84	183	3	,	,	PUNCT
gra-84	183	4	2016	2016	NUM
gra-84	183	5	,	,	PUNCT
gra-84	183	6	329:236	329:236	PROPN
gra-84	183	7	-	-	SYM
gra-84	183	8	255	255	NUM
gra-84	183	9	.	.	PUNCT
gra-84	184	1	[	[	X
gra-84	184	2	5	5	X
gra-84	184	3	]	]	X
gra-84	184	4	kim	kim	PROPN
gra-84	184	5	m	m	PROPN
gra-84	184	6	,	,	PUNCT
gra-84	184	7	hiroyasu	hiroyasu	PROPN
gra-84	184	8	t	t	PROPN
gra-84	184	9	,	,	PUNCT
gra-84	184	10	miki	miki	PROPN
gra-84	184	11	m	m	PROPN
gra-84	184	12	,	,	PUNCT
gra-84	184	13	et	et	PROPN
gra-84	184	14	al	al	PROPN
gra-84	184	15	.	.	PROPN
gra-84	184	16	spea2	spea2	PROPN
gra-84	185	1	+	+	ADV
gra-84	185	2	:	:	PUNCT
gra-84	185	3	improving	improve	VERB
gra-84	185	4	the	the	DET
gra-84	185	5	performance	performance	NOUN
gra-84	185	6	of	of	ADP
gra-84	185	7	the	the	DET
gra-84	185	8	strength	strength	NOUN
gra-84	185	9	pareto	pareto	ADJ
gra-84	185	10	evolutionary	evolutionary	ADJ
gra-84	185	11	algorithm	algorithm	NOUN
gra-84	185	12	2.[j	2.[j	NUM
gra-84	185	13	]	]	PUNCT
gra-84	185	14	.	.	PUNCT
gra-84	186	1	parallel	parallel	ADJ
gra-84	186	2	problem	problem	NOUN
gra-84	186	3	solving	solve	VERB
gra-84	186	4	from	from	ADP
gra-84	186	5	nature	nature	NOUN
gra-84	186	6	-	-	PUNCT
gra-84	186	7	ppsn	ppsn	PROPN
gra-84	186	8	viii	viii	PROPN
gra-84	186	9	,	,	PUNCT
gra-84	186	10	2004	2004	NUM
gra-84	186	11	,	,	PUNCT
gra-84	186	12	3242(4):742	3242(4):742	NUM
gra-84	186	13	-	-	SYM
gra-84	186	14	751	751	NUM
gra-84	186	15	.	.	PUNCT
gra-84	187	1	[	[	X
gra-84	187	2	6	6	NUM
gra-84	187	3	]	]	X
gra-84	187	4	sheng	sheng	PROPN
gra-84	187	5	w	w	PROPN
gra-84	187	6	,	,	PUNCT
gra-84	187	7	liu	liu	PROPN
gra-84	187	8	y	y	PROPN
gra-84	187	9	,	,	PUNCT
gra-84	187	10	meng	meng	PROPN
gra-84	187	11	x	x	PROPN
gra-84	187	12	,	,	PUNCT
gra-84	187	13	et	et	PROPN
gra-84	187	14	al	al	PROPN
gra-84	187	15	.	.	PUNCT
gra-84	188	1	an	an	DET
gra-84	188	2	improved	improve	VERB
gra-84	188	3	strength	strength	NOUN
gra-84	188	4	pareto	pareto	ADJ
gra-84	188	5	evolutionary	evolutionary	ADJ
gra-84	188	6	algorithm	algorithm	NOUN
gra-84	188	7	2	2	NUM
gra-84	188	8	with	with	ADP
gra-84	188	9	application	application	NOUN
gra-84	188	10	to	to	ADP
gra-84	188	11	the	the	DET
gra-84	188	12	optimization	optimization	NOUN
gra-84	188	13	of	of	ADP
gra-84	188	14	distributed	distribute	VERB
gra-84	188	15	generations[j	generations[j	NOUN
gra-84	188	16	]	]	PUNCT
gra-84	188	17	.	.	PUNCT
gra-84	189	1	computers	computer	NOUN
gra-84	189	2	&	&	CCONJ
gra-84	189	3	mathematics	mathematics	PROPN
gra-84	189	4	with	with	ADP
gra-84	189	5	applications	application	NOUN
gra-84	189	6	,	,	PUNCT
gra-84	189	7	2012	2012	NUM
gra-84	189	8	,	,	PUNCT
gra-84	189	9	64(5	64(5	PROPN
gra-84	189	10	)	)	PUNCT
gra-84	189	11	.	.	PUNCT
gra-84	190	1	[	[	X
gra-84	190	2	7	7	X
gra-84	190	3	]	]	X
gra-84	190	4	deb	deb	PROPN
gra-84	190	5	k	k	PROPN
gra-84	190	6	,	,	PUNCT
gra-84	190	7	pratap	pratap	PROPN
gra-84	190	8	a	a	PROPN
gra-84	190	9	,	,	PUNCT
gra-84	190	10	agarwal	agarwal	PROPN
gra-84	190	11	s	s	PROPN
gra-84	190	12	,	,	PUNCT
gra-84	190	13	et	et	PROPN
gra-84	190	14	al	al	PROPN
gra-84	190	15	.	.	PUNCT
gra-84	191	1	a	a	DET
gra-84	191	2	fast	fast	ADJ
gra-84	191	3	and	and	CCONJ
gra-84	191	4	elitist	elitist	ADJ
gra-84	191	5	multiobjective	multiobjective	ADJ
gra-84	191	6	genetic	genetic	ADJ
gra-84	191	7	algorithm	algorithm	NOUN
gra-84	191	8	:	:	PUNCT
gra-84	191	9	nsga	nsga	NOUN
gra-84	191	10	-	-	PUNCT
gra-84	191	11	ii[j	ii[j	PRON
gra-84	191	12	]	]	PUNCT
gra-84	191	13	.	.	PUNCT
gra-84	192	1	ieee	ieee	NOUN
gra-84	192	2	transactions	transaction	NOUN
gra-84	192	3	on	on	ADP
gra-84	192	4	evolutionary	evolutionary	ADJ
gra-84	192	5	computation	computation	NOUN
gra-84	192	6	,	,	PUNCT
gra-84	192	7	2002	2002	NUM
gra-84	192	8	,	,	PUNCT
gra-84	192	9	6(2):0	6(2):0	PROPN
gra-84	192	10	-	-	PUNCT
gra-84	192	11	197	197	NUM
gra-84	192	12	.	.	PUNCT
gra-84	193	1	[	[	X
gra-84	193	2	8	8	NUM
gra-84	193	3	]	]	PUNCT
gra-84	193	4	deb	deb	PROPN
gra-84	193	5	k	k	PROPN
gra-84	193	6	,	,	PUNCT
gra-84	193	7	jain	jain	PROPN
gra-84	193	8	h.	h.	PROPN
gra-84	193	9	an	an	DET
gra-84	193	10	evolutionary	evolutionary	ADJ
gra-84	193	11	many	many	ADJ
gra-84	193	12	-	-	PUNCT
gra-84	193	13	objective	objective	ADJ
gra-84	193	14	optimization	optimization	NOUN
gra-84	193	15	algorithm	algorithm	NOUN
gra-84	193	16	using	use	VERB
gra-84	193	17	reference	reference	NOUN
gra-84	193	18	-	-	PUNCT
gra-84	193	19	point	point	NOUN
gra-84	193	20	-	-	PUNCT
gra-84	193	21	based	base	VERB
gra-84	193	22	nondominated	nondominated	ADJ
gra-84	193	23	sorting	sorting	NOUN
gra-84	193	24	approach	approach	NOUN
gra-84	193	25	,	,	PUNCT
gra-84	193	26	part	part	NOUN
gra-84	193	27	i	i	NOUN
gra-84	193	28	:	:	PUNCT
gra-84	193	29	solving	solve	VERB
gra-84	193	30	problems	problem	NOUN
gra-84	193	31	with	with	ADP
gra-84	193	32	box	box	PROPN
gra-84	193	33	constraints[j	constraints[j	PROPN
gra-84	193	34	]	]	PUNCT
gra-84	193	35	.	.	PUNCT
gra-84	194	1	ieee	ieee	NOUN
gra-84	194	2	transactions	transaction	NOUN
gra-84	194	3	on	on	ADP
gra-84	194	4	evolutionary	evolutionary	ADJ
gra-84	194	5	computation	computation	NOUN
gra-84	194	6	,	,	PUNCT
gra-84	194	7	2014	2014	NUM
gra-84	194	8	,	,	PUNCT
gra-84	194	9	18(4):577	18(4):577	NUM
gra-84	194	10	-	-	PUNCT
gra-84	194	11	601	601	NUM
gra-84	194	12	.	.	PUNCT
gra-84	195	1	[	[	X
gra-84	195	2	9	9	NUM
gra-84	195	3	]	]	SYM
gra-84	195	4	yao	yao	NOUN
gra-84	195	5	x	x	X
gra-84	195	6	,	,	PUNCT
gra-84	195	7	burke	burke	PROPN
gra-84	195	8	e	e	PROPN
gra-84	195	9	k	k	PROPN
gra-84	195	10	,	,	PUNCT
gra-84	195	11	lozano	lozano	PROPN
gra-84	195	12	,	,	PUNCT
gra-84	195	13	josé	josé	PROPN
gra-84	195	14	a	a	PROPN
gra-84	195	15	,	,	PUNCT
gra-84	195	16	et	et	PROPN
gra-84	195	17	al	al	PROPN
gra-84	195	18	.	.	PUNCT
gra-84	196	1	[	[	X
gra-84	196	2	lecture	lecture	NOUN
gra-84	196	3	notes	note	VERB
gra-84	196	4	in	in	ADP
gra-84	196	5	computer	computer	NOUN
gra-84	196	6	science	science	NOUN
gra-84	196	7	]	]	PUNCT
gra-84	196	8	parallel	parallel	ADJ
gra-84	196	9	problem	problem	NOUN
gra-84	196	10	solving	solve	VERB
gra-84	196	11	from	from	ADP
gra-84	196	12	nature	nature	NOUN
gra-84	196	13	ppsn	ppsn	PROPN
gra-84	196	14	viii	viii	VERB
gra-84	196	15	volume	volume	NOUN
gra-84	196	16	3242	3242	NUM
gra-84	196	17	||	||	CCONJ
gra-84	197	1	indicatorbased	indicatorbase	VERB
gra-84	197	2	selection	selection	NOUN
gra-84	197	3	in	in	ADP
gra-84	197	4	multiobjective	multiobjective	ADJ
gra-84	197	5	search[c]//	search[c]//	PROPN
gra-84	197	6	2004:832	2004:832	NOUN
gra-84	197	7	-	-	SYM
gra-84	197	8	842	842	NUM
gra-84	197	9	.	.	PUNCT
gra-84	198	1	[	[	X
gra-84	198	2	10	10	NUM
gra-84	198	3	]	]	X
gra-84	198	4	bader	bader	PROPN
gra-84	198	5	j	j	PROPN
gra-84	198	6	,	,	PUNCT
gra-84	198	7	zitzler	zitzler	PROPN
gra-84	198	8	e.	e.	PROPN
gra-84	198	9	hype	hype	PROPN
gra-84	198	10	:	:	PUNCT
gra-84	198	11	an	an	DET
gra-84	198	12	algorithm	algorithm	NOUN
gra-84	198	13	for	for	ADP
gra-84	198	14	fast	fast	ADJ
gra-84	198	15	hypervolume	hypervolume	NOUN
gra-84	198	16	-	-	PUNCT
gra-84	198	17	based	base	VERB
gra-84	198	18	manyobjective	manyobjective	ADJ
gra-84	198	19	optimization[j	optimization[j	NOUN
gra-84	198	20	]	]	PUNCT
gra-84	198	21	.	.	PUNCT
gra-84	199	1	evolutionary	evolutionary	ADJ
gra-84	199	2	computation	computation	NOUN
gra-84	199	3	,	,	PUNCT
gra-84	199	4	2011	2011	NUM
gra-84	199	5	,	,	PUNCT
gra-84	199	6	19(1):45	19(1):45	PROPN
gra-84	199	7	-	-	NOUN
gra-84	199	8	76	76	NUM
gra-84	199	9	.	.	PUNCT
gra-84	200	1	[	[	X
gra-84	200	2	11	11	NUM
gra-84	200	3	]	]	X
gra-84	200	4	suzuki	suzuki	PROPN
gra-84	200	5	j	j	PROPN
gra-84	200	6	,	,	PUNCT
gra-84	200	7	phan	phan	PROPN
gra-84	200	8	d	d	PROPN
gra-84	200	9	h.	h.	PROPN
gra-84	200	10	r2	r2	PROPN
gra-84	200	11	-	-	PUNCT
gra-84	200	12	ibea	ibea	NOUN
gra-84	200	13	:	:	PUNCT
gra-84	200	14	r2	r2	PROPN
gra-84	200	15	indicator	indicator	NOUN
gra-84	200	16	based	base	VERB
gra-84	200	17	evolutionary	evolutionary	ADJ
gra-84	200	18	algorithm	algorithm	NOUN
gra-84	200	19	for	for	ADP
gra-84	200	20	multiobjective	multiobjective	ADJ
gra-84	200	21	x129	x129	PROPN
gra-84	200	22	gjra	gjra	NOUN
gra-84	200	23	global	global	ADJ
gra-84	200	24	journal	journal	PROPN
gra-84	200	25	for	for	ADP
gra-84	200	26	research	research	NOUN
gra-84	200	27	analysis	analysis	NOUN
gra-84	200	28	volume-8	volume-8	NUM
gra-84	200	29	,	,	PUNCT
gra-84	200	30	issue-9	issue-9	NUM
gra-84	200	31	,	,	PUNCT
gra-84	200	32	september-2019	september-2019	ADJ
gra-84	200	33	•	•	NUM
gra-84	200	34	print	print	NOUN
gra-84	200	35	issn	issn	PROPN
gra-84	200	36	no	no	NOUN
gra-84	200	37	.	.	PROPN
gra-84	200	38	2277	2277	NUM
gra-84	200	39	8160	8160	NUM
gra-84	200	40	•	•	NOUN
gra-84	200	41	doi	doi	NOUN
gra-84	200	42	:	:	PUNCT
gra-84	200	43	10.36106	10.36106	NUM
gra-84	200	44	/	/	SYM
gra-84	200	45	gjra	gjra	NOUN
gra-84	200	46	1	1	NUM
gra-84	200	47	1	1	NUM
gra-84	200	48	1	1	NUM
gra-84	200	49	igd	igd	PROPN
gra-84	200	50	(	(	PUNCT
gra-84	200	51	,	,	PUNCT
gra-84	200	52	)	)	PUNCT
gra-84	200	53	(	(	PUNCT
gra-84	200	54	,	,	PUNCT
gra-84	200	55	)	)	PUNCT
gra-84	201	1	min	min	PROPN
gra-84	202	1	z	z	NOUN
gra-84	202	2	s	s	PROPN
gra-84	203	1	i	i	INTJ
gra-84	203	2	jj	jj	INTJ
gra-84	204	1	i	i	PRON
gra-84	204	2	s	s	PROPN
gra-84	204	3	z	z	PROPN
gra-84	204	4	d	d	X
gra-84	204	5	z	z	PROPN
gra-84	204	6	s	s	NOUN
gra-84	204	7	z	z	NOUN
gra-84	204	8	=	=	SYM
gra-84	205	1	=	=	SYM
gra-84	205	2	=	=	SYM
gra-84	205	3	å	å	PROPN
gra-84	205	4	test	test	NOUN
gra-84	205	5	function	function	NOUN
gra-84	205	6	item	item	NOUN
gra-84	205	7	moea	moea	NOUN
gra-84	205	8	/	/	SYM
gra-84	205	9	d	d	ADJ
gra-84	205	10	-	-	PUNCT
gra-84	205	11	dfs	dfs	ADJ
gra-84	205	12	moea	moea	NOUN
gra-84	205	13	/	/	SYM
gra-84	205	14	d	d	PROPN
gra-84	205	15	zdt1	zdt1	PROPN
gra-84	205	16	min	min	PROPN
gra-84	206	1	0.01001	0.01001	NUM
gra-84	206	2	0.05076	0.05076	NUM
gra-84	206	3	avg	avg	NOUN
gra-84	206	4	0.040336	0.040336	NUM
gra-84	206	5	0.43379	0.43379	NUM
gra-84	206	6	max	max	PROPN
gra-84	206	7	0.040336	0.040336	NUM
gra-84	206	8	0.95388	0.95388	NUM
gra-84	206	9	zdt2	zdt2	PROPN
gra-84	206	10	min	min	NOUN
gra-84	206	11	0.00227	0.00227	NUM
gra-84	206	12	0.00008	0.00008	NUM
gra-84	206	13	avg	avg	NOUN
gra-84	206	14	0.29614	0.29614	NUM
gra-84	206	15	0.001564	0.001564	NUM
gra-84	206	16	max	max	PROPN
gra-84	206	17	0.74984	0.74984	NUM
gra-84	206	18	0.00640	0.00640	NUM
gra-84	206	19	zdt3	zdt3	NOUN
gra-84	206	20	min	min	NOUN
gra-84	206	21	0.04068	0.04068	NUM
gra-84	206	22	0.16221	0.16221	NUM
gra-84	206	23	avg	avg	NOUN
gra-84	206	24	0.25665	0.25665	NUM
gra-84	206	25	0.46492	0.46492	NUM
gra-84	206	26	max	max	NOUN
gra-84	206	27	0.38568	0.38568	NUM
gra-84	206	28	0.97953	0.97953	NUM
gra-84	206	29	zdt4	zdt4	PROPN
gra-84	206	30	min	min	PROPN
gra-84	206	31	0.73323	0.73323	PROPN
gra-84	206	32	15.09150	15.09150	NUM
gra-84	206	33	avg	avg	PROPN
gra-84	206	34	10.72729	10.72729	NUM
gra-84	206	35	24.05082	24.05082	NUM
gra-84	206	36	max	max	PROPN
gra-84	206	37	24.1546	24.1546	NUM
gra-84	206	38	40.12033	40.12033	NUM
gra-84	206	39	zdt6	zdt6	PROPN
gra-84	206	40	min	min	NOUN
gra-84	206	41	0.00952	0.00952	NUM
gra-84	206	42	0.00011	0.00011	NUM
gra-84	206	43	avg	avg	NOUN
gra-84	206	44	1.39815	1.39815	NUM
gra-84	206	45	2.00117	2.00117	NUM
gra-84	206	46	max	max	PROPN
gra-84	206	47	4.12405	4.12405	NUM
gra-84	206	48	5.34535	5.34535	NUM