id	sid	tid	token	lemma	pos
fcis-25095	1	1	frontiers	frontier	NOUN
fcis-25095	1	2	in	in	ADP
fcis-25095	1	3	computing	computing	NOUN
fcis-25095	1	4	and	and	CCONJ
fcis-25095	1	5	intelligent	intelligent	ADJ
fcis-25095	1	6	systems	system	NOUN
fcis-25095	1	7	issn	issn	VERB
fcis-25095	1	8	:	:	PUNCT
fcis-25095	1	9	2832	2832	NUM
fcis-25095	1	10	-	-	SYM
fcis-25095	1	11	6024	6024	NUM
fcis-25095	1	12	|	|	NOUN
fcis-25095	1	13	vol	vol	NOUN
fcis-25095	1	14	.	.	PROPN
fcis-25095	2	1	9	9	NUM
fcis-25095	2	2	,	,	PUNCT
fcis-25095	2	3	no	no	INTJ
fcis-25095	2	4	.	.	NOUN
fcis-25095	2	5	2	2	NUM
fcis-25095	2	6	,	,	PUNCT
fcis-25095	2	7	2024	2024	NUM
fcis-25095	2	8	4	4	NUM
fcis-25095	2	9	a	a	DET
fcis-25095	2	10	hill‐climbing	hill‐climbing	NOUN
fcis-25095	2	11	differential	differential	VERB
fcis-25095	2	12	evolutionary	evolutionary	ADJ
fcis-25095	2	13	algorithm	algorithm	NOUN
fcis-25095	2	14	for	for	ADP
fcis-25095	2	15	solving	solve	VERB
fcis-25095	2	16	multiple	multiple	ADJ
fcis-25095	2	17	travelling	travel	VERB
fcis-25095	2	18	salesman	salesman	NOUN
fcis-25095	2	19	problem	problem	NOUN
fcis-25095	2	20	jinhua	jinhua	PROPN
fcis-25095	2	21	bian	bian	PROPN
fcis-25095	2	22	,	,	PUNCT
fcis-25095	2	23	xiaoxia	xiaoxia	PROPN
fcis-25095	2	24	zhang	zhang	PROPN
fcis-25095	2	25	school	school	PROPN
fcis-25095	2	26	of	of	ADP
fcis-25095	2	27	computer	computer	NOUN
fcis-25095	2	28	science	science	NOUN
fcis-25095	2	29	and	and	CCONJ
fcis-25095	2	30	software	software	NOUN
fcis-25095	2	31	engineering	engineering	NOUN
fcis-25095	2	32	,	,	PUNCT
fcis-25095	2	33	university	university	NOUN
fcis-25095	2	34	of	of	ADP
fcis-25095	2	35	science	science	NOUN
fcis-25095	2	36	and	and	CCONJ
fcis-25095	2	37	technology	technology	NOUN
fcis-25095	2	38	liaoning	liaoning	NOUN
fcis-25095	2	39	,	,	PUNCT
fcis-25095	2	40	anshan	anshan	PROPN
fcis-25095	2	41	liaoning	liaoning	NOUN
fcis-25095	2	42	,	,	PUNCT
fcis-25095	2	43	114051	114051	NUM
fcis-25095	2	44	,	,	PUNCT
fcis-25095	2	45	china	china	PROPN
fcis-25095	2	46	abstract	abstract	NOUN
fcis-25095	2	47	:	:	PUNCT
fcis-25095	2	48	the	the	DET
fcis-25095	2	49	multiple	multiple	ADJ
fcis-25095	2	50	travelling	travel	VERB
fcis-25095	2	51	salesman	salesman	ADJ
fcis-25095	2	52	problem	problem	NOUN
fcis-25095	2	53	(	(	PUNCT
fcis-25095	2	54	mtsp	mtsp	NOUN
fcis-25095	2	55	)	)	PUNCT
fcis-25095	2	56	is	be	AUX
fcis-25095	2	57	a	a	DET
fcis-25095	2	58	basic	basic	ADJ
fcis-25095	2	59	deformation	deformation	NOUN
fcis-25095	2	60	of	of	ADP
fcis-25095	2	61	the	the	DET
fcis-25095	2	62	travelling	travel	VERB
fcis-25095	2	63	salesman	salesman	NOUN
fcis-25095	2	64	problem	problem	NOUN
fcis-25095	2	65	(	(	PUNCT
fcis-25095	2	66	tsp	tsp	NOUN
fcis-25095	2	67	)	)	PUNCT
fcis-25095	2	68	,	,	PUNCT
fcis-25095	2	69	which	which	PRON
fcis-25095	2	70	is	be	AUX
fcis-25095	2	71	a	a	DET
fcis-25095	2	72	typical	typical	ADJ
fcis-25095	2	73	np	np	ADJ
fcis-25095	2	74	-	-	PUNCT
fcis-25095	2	75	hard	hard	ADJ
fcis-25095	2	76	problem	problem	NOUN
fcis-25095	2	77	.	.	PUNCT
fcis-25095	3	1	for	for	ADP
fcis-25095	3	2	combinatorial	combinatorial	ADJ
fcis-25095	3	3	optimization	optimization	NOUN
fcis-25095	3	4	problems	problem	NOUN
fcis-25095	3	5	shaped	shape	VERB
fcis-25095	3	6	like	like	ADP
fcis-25095	3	7	mtsp	mtsp	NOUN
fcis-25095	3	8	,	,	PUNCT
fcis-25095	3	9	researchers	researcher	NOUN
fcis-25095	3	10	often	often	ADV
fcis-25095	3	11	use	use	VERB
fcis-25095	3	12	intelligent	intelligent	ADJ
fcis-25095	3	13	optimization	optimization	NOUN
fcis-25095	3	14	algorithms	algorithm	NOUN
fcis-25095	3	15	such	such	ADJ
fcis-25095	3	16	as	as	ADP
fcis-25095	3	17	genetic	genetic	ADJ
fcis-25095	3	18	algorithms	algorithm	NOUN
fcis-25095	3	19	,	,	PUNCT
fcis-25095	3	20	differential	differential	ADJ
fcis-25095	3	21	evolutionary	evolutionary	ADJ
fcis-25095	3	22	algorithms	algorithm	NOUN
fcis-25095	3	23	,	,	PUNCT
fcis-25095	3	24	simulated	simulate	VERB
fcis-25095	3	25	annealing	anneal	VERB
fcis-25095	3	26	algorithms	algorithm	NOUN
fcis-25095	3	27	and	and	CCONJ
fcis-25095	3	28	other	other	ADJ
fcis-25095	3	29	intelligent	intelligent	ADJ
fcis-25095	3	30	optimization	optimization	NOUN
fcis-25095	3	31	algorithms	algorithm	NOUN
fcis-25095	3	32	to	to	PART
fcis-25095	3	33	approximate	approximate	VERB
fcis-25095	3	34	the	the	DET
fcis-25095	3	35	solution	solution	NOUN
fcis-25095	3	36	.	.	PUNCT
fcis-25095	4	1	however	however	ADV
fcis-25095	4	2	,	,	PUNCT
fcis-25095	4	3	typical	typical	ADJ
fcis-25095	4	4	intelligent	intelligent	ADJ
fcis-25095	4	5	optimization	optimization	NOUN
fcis-25095	4	6	algorithms	algorithm	NOUN
fcis-25095	4	7	have	have	VERB
fcis-25095	4	8	the	the	DET
fcis-25095	4	9	disadvantage	disadvantage	NOUN
fcis-25095	4	10	of	of	ADP
fcis-25095	4	11	being	be	AUX
fcis-25095	4	12	prone	prone	ADJ
fcis-25095	4	13	to	to	ADP
fcis-25095	4	14	local	local	ADJ
fcis-25095	4	15	convergence	convergence	NOUN
fcis-25095	4	16	and	and	CCONJ
fcis-25095	4	17	failing	fail	VERB
fcis-25095	4	18	to	to	PART
fcis-25095	4	19	produce	produce	VERB
fcis-25095	4	20	theoretically	theoretically	ADV
fcis-25095	4	21	optimal	optimal	ADJ
fcis-25095	4	22	solutions	solution	NOUN
fcis-25095	4	23	.	.	PUNCT
fcis-25095	5	1	based	base	VERB
fcis-25095	5	2	on	on	ADP
fcis-25095	5	3	this	this	PRON
fcis-25095	5	4	,	,	PUNCT
fcis-25095	5	5	we	we	PRON
fcis-25095	5	6	propose	propose	VERB
fcis-25095	5	7	an	an	DET
fcis-25095	5	8	hca&de	hca&de	NOUN
fcis-25095	5	9	algorithm	algorithm	NOUN
fcis-25095	5	10	that	that	PRON
fcis-25095	5	11	improves	improve	VERB
fcis-25095	5	12	the	the	DET
fcis-25095	5	13	de	de	X
fcis-25095	5	14	algorithm	algorithm	NOUN
fcis-25095	5	15	by	by	ADP
fcis-25095	5	16	using	use	VERB
fcis-25095	5	17	the	the	DET
fcis-25095	5	18	hill	hill	NOUN
fcis-25095	5	19	-	-	PUNCT
fcis-25095	5	20	climbing	climb	VERB
fcis-25095	5	21	algorithm	algorithm	NOUN
fcis-25095	5	22	,	,	PUNCT
fcis-25095	5	23	and	and	CCONJ
fcis-25095	5	24	carry	carry	VERB
fcis-25095	5	25	out	out	ADP
fcis-25095	5	26	data	data	NOUN
fcis-25095	5	27	experiments	experiment	NOUN
fcis-25095	5	28	using	use	VERB
fcis-25095	5	29	the	the	DET
fcis-25095	5	30	solution	solution	NOUN
fcis-25095	5	31	set	set	VERB
fcis-25095	5	32	of	of	ADP
fcis-25095	5	33	tsplib	tsplib	PROPN
fcis-25095	5	34	,	,	PUNCT
fcis-25095	5	35	which	which	PRON
fcis-25095	5	36	proves	prove	VERB
fcis-25095	5	37	the	the	DET
fcis-25095	5	38	practicality	practicality	NOUN
fcis-25095	5	39	and	and	CCONJ
fcis-25095	5	40	effectiveness	effectiveness	NOUN
fcis-25095	5	41	of	of	ADP
fcis-25095	5	42	the	the	DET
fcis-25095	5	43	algorithm	algorithm	NOUN
fcis-25095	5	44	.	.	PUNCT
fcis-25095	6	1	keywords	keyword	NOUN
fcis-25095	6	2	:	:	PUNCT
fcis-25095	6	3	mtsp	mtsp	NOUN
fcis-25095	6	4	problem	problem	NOUN
fcis-25095	6	5	;	;	PUNCT
fcis-25095	6	6	differential	differential	ADJ
fcis-25095	6	7	evolution	evolution	NOUN
fcis-25095	6	8	algorithm	algorithm	PROPN
fcis-25095	6	9	;	;	PUNCT
fcis-25095	6	10	hill	hill	NOUN
fcis-25095	6	11	climbing	climbing	NOUN
fcis-25095	6	12	algorithm	algorithm	NOUN
fcis-25095	6	13	.	.	PUNCT
fcis-25095	7	1	1	1	X
fcis-25095	7	2	.	.	X
fcis-25095	7	3	introduction	introduction	NOUN
fcis-25095	7	4	the	the	DET
fcis-25095	7	5	multiple	multiple	ADJ
fcis-25095	7	6	travelling	travel	VERB
fcis-25095	7	7	salesman	salesman	ADJ
fcis-25095	7	8	problem	problem	NOUN
fcis-25095	7	9	is	be	AUX
fcis-25095	7	10	a	a	DET
fcis-25095	7	11	variant	variant	NOUN
fcis-25095	7	12	of	of	ADP
fcis-25095	7	13	the	the	DET
fcis-25095	7	14	classic	classic	ADJ
fcis-25095	7	15	combinatorial	combinatorial	ADJ
fcis-25095	7	16	optimization	optimization	NOUN
fcis-25095	7	17	problem	problem	NOUN
fcis-25095	7	18	---	---	PUNCT
fcis-25095	7	19	the	the	DET
fcis-25095	7	20	travelling	travel	VERB
fcis-25095	7	21	salesman	salesman	NOUN
fcis-25095	7	22	problem	problem	NOUN
fcis-25095	7	23	,	,	PUNCT
fcis-25095	7	24	which	which	PRON
fcis-25095	7	25	is	be	AUX
fcis-25095	7	26	described	describe	VERB
fcis-25095	7	27	as	as	ADP
fcis-25095	7	28	[	[	X
fcis-25095	7	29	1	1	NUM
fcis-25095	7	30	-	-	SYM
fcis-25095	7	31	2	2	NUM
fcis-25095	7	32	]	]	PUNCT
fcis-25095	7	33	:	:	PUNCT
fcis-25095	7	34	there	there	PRON
fcis-25095	7	35	are	be	VERB
fcis-25095	7	36	n	n	PRON
fcis-25095	7	37	cities	city	NOUN
fcis-25095	7	38	and	and	CCONJ
fcis-25095	7	39	m	m	NOUN
fcis-25095	7	40	travelers	traveler	NOUN
fcis-25095	7	41	,	,	PUNCT
fcis-25095	7	42	which	which	PRON
fcis-25095	7	43	need	need	VERB
fcis-25095	7	44	to	to	PART
fcis-25095	7	45	visit	visit	VERB
fcis-25095	7	46	a	a	DET
fcis-25095	7	47	certain	certain	ADJ
fcis-25095	7	48	number	number	NOUN
fcis-25095	7	49	of	of	ADP
fcis-25095	7	50	cities	city	NOUN
fcis-25095	7	51	and	and	CCONJ
fcis-25095	7	52	return	return	VERB
fcis-25095	7	53	to	to	ADP
fcis-25095	7	54	their	their	PRON
fcis-25095	7	55	respective	respective	ADJ
fcis-25095	7	56	starting	starting	NOUN
fcis-25095	7	57	points	point	NOUN
fcis-25095	7	58	,	,	PUNCT
fcis-25095	7	59	and	and	CCONJ
fcis-25095	7	60	each	each	DET
fcis-25095	7	61	city	city	NOUN
fcis-25095	7	62	needs	need	VERB
fcis-25095	7	63	to	to	PART
fcis-25095	7	64	be	be	AUX
fcis-25095	7	65	visited	visit	VERB
fcis-25095	7	66	at	at	ADP
fcis-25095	7	67	least	least	ADJ
fcis-25095	7	68	once	once	ADV
fcis-25095	7	69	,	,	PUNCT
fcis-25095	7	70	and	and	CCONJ
fcis-25095	7	71	the	the	DET
fcis-25095	7	72	goal	goal	NOUN
fcis-25095	7	73	is	be	AUX
fcis-25095	7	74	to	to	PART
fcis-25095	7	75	make	make	VERB
fcis-25095	7	76	the	the	DET
fcis-25095	7	77	total	total	ADJ
fcis-25095	7	78	trip	trip	NOUN
fcis-25095	7	79	of	of	ADP
fcis-25095	7	80	these	these	DET
fcis-25095	7	81	m	m	NOUN
fcis-25095	7	82	travelers	traveler	NOUN
fcis-25095	7	83	the	the	DET
fcis-25095	7	84	shortest	short	ADJ
fcis-25095	7	85	.	.	PUNCT
fcis-25095	8	1	the	the	DET
fcis-25095	8	2	travelling	travel	VERB
fcis-25095	8	3	salesman	salesman	NOUN
fcis-25095	8	4	problem	problem	NOUN
fcis-25095	8	5	has	have	VERB
fcis-25095	8	6	a	a	DET
fcis-25095	8	7	broader	broad	ADJ
fcis-25095	8	8	utility	utility	NOUN
fcis-25095	8	9	compared	compare	VERB
fcis-25095	8	10	to	to	ADP
fcis-25095	8	11	the	the	DET
fcis-25095	8	12	traveler	traveler	NOUN
fcis-25095	8	13	problem	problem	NOUN
fcis-25095	8	14	,	,	PUNCT
fcis-25095	8	15	and	and	CCONJ
fcis-25095	8	16	is	be	AUX
fcis-25095	8	17	more	more	ADV
fcis-25095	8	18	applicable	applicable	ADJ
fcis-25095	8	19	to	to	ADP
fcis-25095	8	20	problems	problem	NOUN
fcis-25095	8	21	such	such	ADJ
fcis-25095	8	22	as	as	ADP
fcis-25095	8	23	logistics	logistic	NOUN
fcis-25095	8	24	and	and	CCONJ
fcis-25095	8	25	transportation	transportation	NOUN
fcis-25095	8	26	,	,	PUNCT
fcis-25095	8	27	and	and	CCONJ
fcis-25095	8	28	path	path	NOUN
fcis-25095	8	29	planning	planning	NOUN
fcis-25095	8	30	.	.	PUNCT
fcis-25095	9	1	for	for	ADP
fcis-25095	9	2	the	the	DET
fcis-25095	9	3	mtsp	mtsp	NOUN
fcis-25095	9	4	problem	problem	NOUN
fcis-25095	9	5	,	,	PUNCT
fcis-25095	9	6	many	many	ADJ
fcis-25095	9	7	researchers	researcher	NOUN
fcis-25095	9	8	used	use	VERB
fcis-25095	9	9	different	different	ADJ
fcis-25095	9	10	improved	improved	ADJ
fcis-25095	9	11	optimization	optimization	NOUN
fcis-25095	9	12	algorithms	algorithm	NOUN
fcis-25095	9	13	to	to	PART
fcis-25095	9	14	solve	solve	VERB
fcis-25095	9	15	it	it	PRON
fcis-25095	9	16	,	,	PUNCT
fcis-25095	9	17	pin	pin	NOUN
fcis-25095	9	18	liu	liu	PROPN
fcis-25095	10	1	[	[	X
fcis-25095	10	2	3	3	NUM
fcis-25095	10	3	]	]	PUNCT
fcis-25095	10	4	divided	divide	VERB
fcis-25095	10	5	the	the	DET
fcis-25095	10	6	algorithm	algorithm	NOUN
fcis-25095	10	7	into	into	ADP
fcis-25095	10	8	a	a	DET
fcis-25095	10	9	k	k	NOUN
fcis-25095	10	10	-	-	PUNCT
fcis-25095	10	11	means	means	NOUN
fcis-25095	10	12	clustering	clustering	NOUN
fcis-25095	10	13	phase	phase	NOUN
fcis-25095	10	14	and	and	CCONJ
fcis-25095	10	15	a	a	DET
fcis-25095	10	16	genetic	genetic	ADJ
fcis-25095	10	17	algorithm	algorithm	NOUN
fcis-25095	10	18	phase	phase	NOUN
fcis-25095	10	19	,	,	PUNCT
fcis-25095	10	20	thus	thus	ADV
fcis-25095	10	21	speeding	speed	VERB
fcis-25095	10	22	up	up	ADP
fcis-25095	10	23	the	the	DET
fcis-25095	10	24	algorithm	algorithm	NOUN
fcis-25095	10	25	running	running	NOUN
fcis-25095	10	26	efficiency	efficiency	NOUN
fcis-25095	10	27	and	and	CCONJ
fcis-25095	10	28	ensuring	ensure	VERB
fcis-25095	10	29	a	a	DET
fcis-25095	10	30	balanced	balanced	ADJ
fcis-25095	10	31	distribution	distribution	NOUN
fcis-25095	10	32	of	of	ADP
fcis-25095	10	33	the	the	DET
fcis-25095	10	34	workload	workload	NOUN
fcis-25095	10	35	among	among	ADP
fcis-25095	10	36	the	the	DET
fcis-25095	10	37	travelers	traveler	NOUN
fcis-25095	10	38	;	;	PUNCT
fcis-25095	10	39	cong	cong	NOUN
fcis-25095	10	40	bao[4]proposed	bao[4]propose	VERB
fcis-25095	10	41	an	an	DET
fcis-25095	10	42	antwatching	antwatching	NOUN
fcis-25095	10	43	mechanism	mechanism	NOUN
fcis-25095	10	44	as	as	ADV
fcis-25095	10	45	well	well	ADV
fcis-25095	10	46	as	as	ADP
fcis-25095	10	47	a	a	DET
fcis-25095	10	48	modal	modal	ADJ
fcis-25095	10	49	algorithm	algorithm	NOUN
fcis-25095	10	50	based	base	VERB
fcis-25095	10	51	on	on	ADP
fcis-25095	10	52	comparative	comparative	ADJ
fcis-25095	10	53	crossover	crossover	NOUN
fcis-25095	10	54	,	,	PUNCT
fcis-25095	10	55	which	which	PRON
fcis-25095	10	56	significantly	significantly	ADV
fcis-25095	10	57	improves	improve	VERB
fcis-25095	10	58	the	the	DET
fcis-25095	10	59	quality	quality	NOUN
fcis-25095	10	60	of	of	ADP
fcis-25095	10	61	the	the	DET
fcis-25095	10	62	offspring	offspring	NOUN
fcis-25095	10	63	solution	solution	NOUN
fcis-25095	10	64	;	;	PUNCT
fcis-25095	10	65	hong	hong	PROPN
fcis-25095	10	66	rui	rui	PROPN
fcis-25095	10	67	zhu[5]improved	zhu[5]improve	VERB
fcis-25095	10	68	the	the	DET
fcis-25095	10	69	fast	fast	ADJ
fcis-25095	10	70	uniparental	uniparental	ADJ
fcis-25095	10	71	genetic	genetic	ADJ
fcis-25095	10	72	algorithm	algorithm	NOUN
fcis-25095	10	73	to	to	PART
fcis-25095	10	74	enhance	enhance	VERB
fcis-25095	10	75	the	the	DET
fcis-25095	10	76	diversity	diversity	NOUN
fcis-25095	10	77	of	of	ADP
fcis-25095	10	78	the	the	DET
fcis-25095	10	79	population	population	NOUN
fcis-25095	10	80	and	and	CCONJ
fcis-25095	10	81	thus	thus	ADV
fcis-25095	10	82	avoid	avoid	VERB
fcis-25095	10	83	falling	fall	VERB
fcis-25095	10	84	into	into	ADP
fcis-25095	10	85	local	local	ADJ
fcis-25095	10	86	optimums	optimum	NOUN
fcis-25095	10	87	;	;	PUNCT
fcis-25095	10	88	yafei	yafei	PROPN
fcis-25095	10	89	dong[6]introduced	dong[6]introduce	VERB
fcis-25095	10	90	a	a	DET
fcis-25095	10	91	new	new	ADJ
fcis-25095	10	92	population	population	NOUN
fcis-25095	10	93	partitioning	partitioning	NOUN
fcis-25095	10	94	method	method	NOUN
fcis-25095	10	95	and	and	CCONJ
fcis-25095	10	96	heterogeneous	heterogeneous	ADJ
fcis-25095	10	97	evolutionary	evolutionary	ADJ
fcis-25095	10	98	mechanism	mechanism	NOUN
fcis-25095	10	99	,	,	PUNCT
fcis-25095	10	100	as	as	ADV
fcis-25095	10	101	well	well	ADV
fcis-25095	10	102	as	as	ADP
fcis-25095	10	103	a	a	DET
fcis-25095	10	104	guided	guide	VERB
fcis-25095	10	105	and	and	CCONJ
fcis-25095	10	106	unguided	unguided	ADJ
fcis-25095	10	107	jumping	jumping	NOUN
fcis-25095	10	108	mechanism	mechanism	NOUN
fcis-25095	10	109	on	on	ADP
fcis-25095	10	110	the	the	DET
fcis-25095	10	111	basis	basis	NOUN
fcis-25095	10	112	of	of	ADP
fcis-25095	10	113	the	the	DET
fcis-25095	10	114	frog	frog	NOUN
fcis-25095	10	115	-	-	PUNCT
fcis-25095	10	116	jumping	jumping	NOUN
fcis-25095	10	117	algorithm	algorithm	NOUN
fcis-25095	10	118	,	,	PUNCT
fcis-25095	10	119	thus	thus	ADV
fcis-25095	10	120	improving	improve	VERB
fcis-25095	10	121	the	the	DET
fcis-25095	10	122	efficiency	efficiency	NOUN
fcis-25095	10	123	of	of	ADP
fcis-25095	10	124	the	the	DET
fcis-25095	10	125	co	co	ADJ
fcis-25095	10	126	-	-	ADJ
fcis-25095	10	127	evolutionary	evolutionary	ADJ
fcis-25095	10	128	process	process	NOUN
fcis-25095	10	129	and	and	CCONJ
fcis-25095	10	130	ultimately	ultimately	ADV
fcis-25095	10	131	obtaining	obtain	VERB
fcis-25095	10	132	a	a	DET
fcis-25095	10	133	highquality	highquality	NOUN
fcis-25095	10	134	solution	solution	NOUN
fcis-25095	10	135	;	;	PUNCT
fcis-25095	10	136	bing	bing	VERB
fcis-25095	10	137	sun[7	sun[7	NUM
fcis-25095	10	138	]	]	PUNCT
fcis-25095	10	139	,	,	PUNCT
fcis-25095	10	140	based	base	VERB
fcis-25095	10	141	on	on	ADP
fcis-25095	10	142	the	the	DET
fcis-25095	10	143	balanced	balanced	ADJ
fcis-25095	10	144	multitraveler	multitraveler	NOUN
fcis-25095	10	145	problem	problem	NOUN
fcis-25095	10	146	's	's	PART
fcis-25095	10	147	optimization	optimization	NOUN
fcis-25095	10	148	objective	objective	NOUN
fcis-25095	10	149	,	,	PUNCT
fcis-25095	10	150	constructed	construct	VERB
fcis-25095	10	151	a	a	DET
fcis-25095	10	152	new	new	ADJ
fcis-25095	10	153	type	type	NOUN
fcis-25095	10	154	of	of	ADP
fcis-25095	10	155	evaluation	evaluation	NOUN
fcis-25095	10	156	function	function	NOUN
fcis-25095	10	157	and	and	CCONJ
fcis-25095	10	158	designed	design	VERB
fcis-25095	10	159	a	a	DET
fcis-25095	10	160	dual	dual	ADJ
fcis-25095	10	161	chromosome	chromosome	NOUN
fcis-25095	10	162	coding	code	VERB
fcis-25095	10	163	method	method	NOUN
fcis-25095	10	164	,	,	PUNCT
fcis-25095	10	165	thus	thus	ADV
fcis-25095	10	166	improving	improve	VERB
fcis-25095	10	167	the	the	DET
fcis-25095	10	168	computational	computational	ADJ
fcis-25095	10	169	ability	ability	NOUN
fcis-25095	10	170	of	of	ADP
fcis-25095	10	171	the	the	DET
fcis-25095	10	172	algorithm	algorithm	NOUN
fcis-25095	10	173	.	.	PUNCT
fcis-25095	11	1	in	in	ADP
fcis-25095	11	2	this	this	DET
fcis-25095	11	3	paper	paper	NOUN
fcis-25095	11	4	,	,	PUNCT
fcis-25095	11	5	for	for	ADP
fcis-25095	11	6	the	the	DET
fcis-25095	11	7	shortcomings	shortcoming	NOUN
fcis-25095	11	8	of	of	ADP
fcis-25095	11	9	differential	differential	ADJ
fcis-25095	11	10	evolutionary	evolutionary	ADJ
fcis-25095	11	11	algorithm	algorithm	NOUN
fcis-25095	11	12	which	which	PRON
fcis-25095	11	13	is	be	AUX
fcis-25095	11	14	easy	easy	ADJ
fcis-25095	11	15	to	to	PART
fcis-25095	11	16	fall	fall	VERB
fcis-25095	11	17	into	into	ADP
fcis-25095	11	18	local	local	ADJ
fcis-25095	11	19	optimum	optimum	ADJ
fcis-25095	11	20	and	and	CCONJ
fcis-25095	11	21	unable	unable	ADJ
fcis-25095	11	22	to	to	PART
fcis-25095	11	23	obtain	obtain	VERB
fcis-25095	11	24	the	the	DET
fcis-25095	11	25	optimal	optimal	ADJ
fcis-25095	11	26	solution	solution	NOUN
fcis-25095	11	27	,	,	PUNCT
fcis-25095	11	28	an	an	DET
fcis-25095	11	29	improved	improve	VERB
fcis-25095	11	30	de	de	X
fcis-25095	11	31	algorithm	algorithm	NOUN
fcis-25095	11	32	based	base	VERB
fcis-25095	11	33	on	on	ADP
fcis-25095	11	34	hill	hill	NOUN
fcis-25095	11	35	-	-	PUNCT
fcis-25095	11	36	climbing	climb	VERB
fcis-25095	11	37	algorithmhca&de	algorithmhca&de	ADJ
fcis-25095	11	38	algorithm	algorithm	NOUN
fcis-25095	11	39	is	be	AUX
fcis-25095	11	40	proposed	propose	VERB
fcis-25095	11	41	according	accord	VERB
fcis-25095	11	42	to	to	ADP
fcis-25095	11	43	the	the	DET
fcis-25095	11	44	strategy	strategy	NOUN
fcis-25095	11	45	of	of	ADP
fcis-25095	11	46	hill	hill	NOUN
fcis-25095	11	47	-	-	PUNCT
fcis-25095	11	48	climbing	climb	VERB
fcis-25095	11	49	algorithm	algorithm	NOUN
fcis-25095	11	50	,	,	PUNCT
fcis-25095	11	51	which	which	PRON
fcis-25095	11	52	utilizes	utilize	VERB
fcis-25095	11	53	the	the	DET
fcis-25095	11	54	crossover	crossover	NOUN
fcis-25095	11	55	operators	operator	NOUN
fcis-25095	11	56	such	such	ADJ
fcis-25095	11	57	as	as	ADP
fcis-25095	11	58	2	2	NUM
fcis-25095	11	59	-	-	PUNCT
fcis-25095	11	60	opt	opt	NOUN
fcis-25095	11	61	,	,	PUNCT
fcis-25095	11	62	insert	insert	NOUN
fcis-25095	11	63	-	-	PUNCT
fcis-25095	11	64	opt	opt	ADJ
fcis-25095	11	65	,	,	PUNCT
fcis-25095	11	66	3	3	NUM
fcis-25095	11	67	-	-	PUNCT
fcis-25095	11	68	opt	opt	NOUN
fcis-25095	11	69	to	to	ADP
fcis-25095	11	70	local	local	ADJ
fcis-25095	11	71	search	search	NOUN
fcis-25095	11	72	for	for	ADP
fcis-25095	11	73	the	the	DET
fcis-25095	11	74	solution	solution	NOUN
fcis-25095	11	75	set	set	VERB
fcis-25095	11	76	,	,	PUNCT
fcis-25095	11	77	to	to	PART
fcis-25095	11	78	improve	improve	VERB
fcis-25095	11	79	the	the	DET
fcis-25095	11	80	algorithm	algorithm	NOUN
fcis-25095	11	81	's	's	PART
fcis-25095	11	82	ability	ability	NOUN
fcis-25095	11	83	to	to	ADP
fcis-25095	11	84	local	local	ADJ
fcis-25095	11	85	search	search	NOUN
fcis-25095	11	86	,	,	PUNCT
fcis-25095	11	87	and	and	CCONJ
fcis-25095	11	88	performs	perform	VERB
fcis-25095	11	89	the	the	DET
fcis-25095	11	90	data	data	NOUN
fcis-25095	11	91	experiments	experiment	NOUN
fcis-25095	11	92	by	by	ADP
fcis-25095	11	93	using	use	VERB
fcis-25095	11	94	the	the	DET
fcis-25095	11	95	tsplib	tsplib	PROPN
fcis-25095	11	96	dataset	dataset	NOUN
fcis-25095	11	97	.	.	PUNCT
fcis-25095	12	1	the	the	DET
fcis-25095	12	2	experiments	experiment	NOUN
fcis-25095	12	3	prove	prove	VERB
fcis-25095	12	4	the	the	DET
fcis-25095	12	5	superiority	superiority	NOUN
fcis-25095	12	6	and	and	CCONJ
fcis-25095	12	7	effectiveness	effectiveness	NOUN
fcis-25095	12	8	of	of	ADP
fcis-25095	12	9	the	the	DET
fcis-25095	12	10	improved	improved	ADJ
fcis-25095	12	11	algorithm	algorithm	NOUN
fcis-25095	12	12	.	.	PUNCT
fcis-25095	13	1	2	2	X
fcis-25095	13	2	.	.	X
fcis-25095	13	3	algorithm	algorithm	NOUN
fcis-25095	13	4	design	design	VERB
fcis-25095	13	5	2.1	2.1	NUM
fcis-25095	13	6	.	.	PUNCT
fcis-25095	14	1	differential	differential	ADJ
fcis-25095	14	2	evolutionary	evolutionary	ADJ
fcis-25095	14	3	algorithm	algorithm	NOUN
fcis-25095	14	4	the	the	DET
fcis-25095	14	5	idea	idea	NOUN
fcis-25095	14	6	of	of	ADP
fcis-25095	14	7	differential	differential	ADJ
fcis-25095	14	8	evolutionary	evolutionary	ADJ
fcis-25095	14	9	algorithm	algorithm	NOUN
fcis-25095	14	10	is	be	AUX
fcis-25095	14	11	similar	similar	ADJ
fcis-25095	14	12	to	to	ADP
fcis-25095	14	13	genetic	genetic	ADJ
fcis-25095	14	14	algorithm	algorithm	NOUN
fcis-25095	14	15	,	,	PUNCT
fcis-25095	14	16	which	which	PRON
fcis-25095	14	17	is	be	AUX
fcis-25095	14	18	an	an	DET
fcis-25095	14	19	intelligent	intelligent	ADJ
fcis-25095	14	20	optimization	optimization	NOUN
fcis-25095	14	21	algorithm	algorithm	NOUN
fcis-25095	14	22	that	that	PRON
fcis-25095	14	23	simulates	simulate	VERB
fcis-25095	14	24	the	the	DET
fcis-25095	14	25	criterion	criterion	NOUN
fcis-25095	14	26	of	of	ADP
fcis-25095	14	27	biological	biological	ADJ
fcis-25095	14	28	selection	selection	NOUN
fcis-25095	14	29	and	and	CCONJ
fcis-25095	14	30	survival	survival	NOUN
fcis-25095	14	31	of	of	ADP
fcis-25095	14	32	the	the	DET
fcis-25095	14	33	fittest	fit	ADJ
fcis-25095	14	34	in	in	ADP
fcis-25095	14	35	nature	nature	NOUN
fcis-25095	14	36	.	.	PUNCT
fcis-25095	15	1	it	it	PRON
fcis-25095	15	2	consists	consist	VERB
fcis-25095	15	3	of	of	ADP
fcis-25095	15	4	four	four	NUM
fcis-25095	15	5	main	main	ADJ
fcis-25095	15	6	operations	operation	NOUN
fcis-25095	15	7	:	:	PUNCT
fcis-25095	15	8	initial	initial	ADJ
fcis-25095	15	9	population	population	NOUN
fcis-25095	15	10	,	,	PUNCT
fcis-25095	15	11	simulated	simulated	ADJ
fcis-25095	15	12	mutation	mutation	NOUN
fcis-25095	15	13	,	,	PUNCT
fcis-25095	15	14	simulated	simulate	VERB
fcis-25095	15	15	crossover	crossover	NOUN
fcis-25095	15	16	,	,	PUNCT
fcis-25095	15	17	and	and	CCONJ
fcis-25095	15	18	natural	natural	ADJ
fcis-25095	15	19	selection	selection	NOUN
fcis-25095	15	20	.	.	PUNCT
fcis-25095	16	1	the	the	DET
fcis-25095	16	2	de	de	PROPN
fcis-25095	16	3	algorithm	algorithm	NOUN
fcis-25095	16	4	retains	retain	VERB
fcis-25095	16	5	the	the	DET
fcis-25095	16	6	global	global	ADJ
fcis-25095	16	7	search	search	NOUN
fcis-25095	16	8	strategy	strategy	NOUN
fcis-25095	16	9	based	base	VERB
fcis-25095	16	10	on	on	ADP
fcis-25095	16	11	population	population	NOUN
fcis-25095	16	12	,	,	PUNCT
fcis-25095	16	13	and	and	CCONJ
fcis-25095	16	14	reduces	reduce	VERB
fcis-25095	16	15	the	the	DET
fcis-25095	16	16	complexity	complexity	NOUN
fcis-25095	16	17	of	of	ADP
fcis-25095	16	18	the	the	DET
fcis-25095	16	19	genetic	genetic	ADJ
fcis-25095	16	20	operation	operation	NOUN
fcis-25095	16	21	by	by	ADP
fcis-25095	16	22	adopting	adopt	VERB
fcis-25095	16	23	the	the	DET
fcis-25095	16	24	real	real	ADJ
fcis-25095	16	25	number	number	NOUN
fcis-25095	16	26	coding	coding	NOUN
fcis-25095	16	27	,	,	PUNCT
fcis-25095	16	28	the	the	DET
fcis-25095	16	29	simple	simple	ADJ
fcis-25095	16	30	mutation	mutation	NOUN
fcis-25095	16	31	operation	operation	NOUN
fcis-25095	16	32	based	base	VERB
fcis-25095	16	33	on	on	ADP
fcis-25095	16	34	difference	difference	NOUN
fcis-25095	16	35	,	,	PUNCT
fcis-25095	16	36	and	and	CCONJ
fcis-25095	16	37	the	the	DET
fcis-25095	16	38	one	one	NUM
fcis-25095	16	39	-	-	PUNCT
fcis-25095	16	40	to	to	ADP
fcis-25095	16	41	-	-	PUNCT
fcis-25095	16	42	one	one	NUM
fcis-25095	16	43	competition	competition	NOUN
fcis-25095	16	44	survival	survival	NOUN
fcis-25095	16	45	strategy	strategy	NOUN
fcis-25095	16	46	.	.	PUNCT
fcis-25095	17	1	unlike	unlike	ADP
fcis-25095	17	2	the	the	DET
fcis-25095	17	3	ga	ga	PROPN
fcis-25095	17	4	algorithm	algorithm	NOUN
fcis-25095	17	5	,	,	PUNCT
fcis-25095	17	6	the	the	DET
fcis-25095	17	7	de	de	PROPN
fcis-25095	17	8	algorithm	algorithm	NOUN
fcis-25095	17	9	links	link	VERB
fcis-25095	17	10	the	the	DET
fcis-25095	17	11	mutation	mutation	NOUN
fcis-25095	17	12	operation	operation	NOUN
fcis-25095	17	13	to	to	ADP
fcis-25095	17	14	the	the	DET
fcis-25095	17	15	crossover	crossover	NOUN
fcis-25095	17	16	operation	operation	NOUN
fcis-25095	17	17	,	,	PUNCT
fcis-25095	17	18	where	where	SCONJ
fcis-25095	17	19	the	the	DET
fcis-25095	17	20	mutated	mutate	VERB
fcis-25095	17	21	individuals	individual	NOUN
fcis-25095	17	22	are	be	AUX
fcis-25095	17	23	parametrically	parametrically	ADV
fcis-25095	17	24	mixed	mixed	ADJ
fcis-25095	17	25	with	with	ADP
fcis-25095	17	26	some	some	DET
fcis-25095	17	27	predetermined	predetermine	VERB
fcis-25095	17	28	target	target	NOUN
fcis-25095	17	29	individuals	individual	NOUN
fcis-25095	17	30	to	to	PART
fcis-25095	17	31	generate	generate	VERB
fcis-25095	17	32	test	test	NOUN
fcis-25095	17	33	individuals	individual	NOUN
fcis-25095	17	34	and	and	CCONJ
fcis-25095	17	35	complete	complete	VERB
fcis-25095	17	36	the	the	DET
fcis-25095	17	37	crossover	crossover	NOUN
fcis-25095	17	38	operation	operation	NOUN
fcis-25095	17	39	.	.	PUNCT
fcis-25095	18	1	the	the	DET
fcis-25095	18	2	mutation	mutation	NOUN
fcis-25095	18	3	operation	operation	NOUN
fcis-25095	18	4	of	of	ADP
fcis-25095	18	5	the	the	DET
fcis-25095	18	6	difference	difference	NOUN
fcis-25095	18	7	algorithm	algorithm	NOUN
fcis-25095	18	8	utilizes	utilize	VERB
fcis-25095	18	9	the	the	DET
fcis-25095	18	10	difference	difference	NOUN
fcis-25095	18	11	vectors	vector	NOUN
fcis-25095	18	12	xp1	xp1	PROPN
fcis-25095	18	13	,	,	PUNCT
fcis-25095	18	14	xp2	xp2	PROPN
fcis-25095	18	15	of	of	ADP
fcis-25095	18	16	two	two	NUM
fcis-25095	18	17	individuals	individual	NOUN
fcis-25095	18	18	randomly	randomly	ADV
fcis-25095	18	19	selected	select	VERB
fcis-25095	18	20	from	from	ADP
fcis-25095	18	21	the	the	DET
fcis-25095	18	22	population	population	NOUN
fcis-25095	18	23	as	as	ADP
fcis-25095	18	24	the	the	DET
fcis-25095	18	25	source	source	NOUN
fcis-25095	18	26	of	of	ADP
fcis-25095	18	27	random	random	ADJ
fcis-25095	18	28	variation	variation	NOUN
fcis-25095	18	29	of	of	ADP
fcis-25095	18	30	the	the	DET
fcis-25095	18	31	third	third	ADJ
fcis-25095	18	32	individual	individual	ADJ
fcis-25095	18	33	xp3	xp3	PROPN
fcis-25095	18	34	,	,	PUNCT
fcis-25095	18	35	and	and	CCONJ
fcis-25095	18	36	generates	generate	VERB
fcis-25095	18	37	the	the	DET
fcis-25095	18	38	mutated	mutate	VERB
fcis-25095	18	39	individuals	individual	NOUN
fcis-25095	18	40	by	by	ADP
fcis-25095	18	41	weighting	weight	VERB
fcis-25095	18	42	the	the	DET
fcis-25095	18	43	difference	difference	NOUN
fcis-25095	18	44	vectors	vector	NOUN
fcis-25095	18	45	and	and	CCONJ
fcis-25095	18	46	summing	sum	VERB
fcis-25095	18	47	them	they	PRON
fcis-25095	18	48	with	with	ADP
fcis-25095	18	49	the	the	DET
fcis-25095	18	50	third	third	ADJ
fcis-25095	18	51	individual	individual	NOUN
fcis-25095	18	52	according	accord	VERB
fcis-25095	18	53	to	to	ADP
fcis-25095	18	54	a	a	DET
fcis-25095	18	55	certain	certain	ADJ
fcis-25095	18	56	rule	rule	NOUN
fcis-25095	18	57	,	,	PUNCT
fcis-25095	18	58	which	which	PRON
fcis-25095	18	59	is	be	AUX
fcis-25095	18	60	calculated	calculate	VERB
fcis-25095	18	61	by	by	ADP
fcis-25095	18	62	the	the	DET
fcis-25095	18	63	formula	formula	NOUN
fcis-25095	18	64	:	:	PUNCT
fcis-25095	18	65			NOUN
fcis-25095	18	66			SYM
fcis-25095	18	67			NOUN
fcis-25095	18	68			SYM
fcis-25095	18	69			NOUN
fcis-25095	18	70			PUNCT
fcis-25095	18	71			NOUN
fcis-25095	19	1			NOUN
fcis-25095	20	1			PROPN
fcis-25095	21	1	1	1	NUM
fcis-25095	21	2	2	2	NUM
fcis-25095	21	3	3	3	NUM
fcis-25095	21	4	1ij	1ij	NOUN
fcis-25095	21	5	p	p	X
fcis-25095	22	1	j	j	PROPN
fcis-25095	22	2	p	p	X
fcis-25095	22	3	j	j	PROPN
fcis-25095	22	4	p	p	PROPN
fcis-25095	22	5	jv	jv	PROPN
fcis-25095	22	6	t	t	PROPN
fcis-25095	22	7	x	x	PROPN
fcis-25095	22	8	t	t	PROPN
fcis-25095	22	9	x	x	SYM
fcis-25095	22	10	t	t	NOUN
fcis-25095	22	11	x	x	X
fcis-25095	22	12	t	t	PROPN
fcis-25095	22	13			PROPN
fcis-25095	22	14			ADJ
fcis-25095	22	15			X
fcis-25095	22	16	(	(	PUNCT
fcis-25095	22	17	1	1	NUM
fcis-25095	22	18	)	)	PUNCT
fcis-25095	22	19	after	after	ADP
fcis-25095	22	20	the	the	DET
fcis-25095	22	21	mutation	mutation	NOUN
fcis-25095	22	22	operation	operation	NOUN
fcis-25095	22	23	,	,	PUNCT
fcis-25095	22	24	we	we	PRON
fcis-25095	22	25	perform	perform	VERB
fcis-25095	22	26	a	a	DET
fcis-25095	22	27	crossover	crossover	NOUN
fcis-25095	22	28	operation	operation	NOUN
fcis-25095	22	29	to	to	PART
fcis-25095	22	30	crossover	crossover	VERB
fcis-25095	22	31	the	the	DET
fcis-25095	22	32	mutated	mutate	VERB
fcis-25095	22	33	individual	individual	NOUN
fcis-25095	22	34	with	with	ADP
fcis-25095	22	35	the	the	DET
fcis-25095	22	36	probability	probability	NOUN
fcis-25095	22	37	of	of	ADP
fcis-25095	22	38	a	a	DET
fcis-25095	22	39	particular	particular	ADJ
fcis-25095	22	40	parent	parent	NOUN
fcis-25095	22	41	individual	individual	NOUN
fcis-25095	22	42	,	,	PUNCT
fcis-25095	22	43	firstly	firstly	ADV
fcis-25095	22	44	,	,	PUNCT
fcis-25095	22	45	we	we	PRON
fcis-25095	22	46	set	set	VERB
fcis-25095	22	47	the	the	DET
fcis-25095	22	48	mutation	mutation	NOUN
fcis-25095	22	49	probability	probability	NOUN
fcis-25095	22	50	pc	pc	NOUN
fcis-25095	22	51	,	,	PUNCT
fcis-25095	22	52	and	and	CCONJ
fcis-25095	22	53	then	then	ADV
fcis-25095	22	54	we	we	PRON
fcis-25095	22	55	generate	generate	VERB
fcis-25095	22	56	the	the	DET
fcis-25095	22	57	mutation	mutation	NOUN
fcis-25095	22	58	random	random	ADJ
fcis-25095	22	59	number	number	NOUN
fcis-25095	22	60	and	and	CCONJ
fcis-25095	22	61	dimension	dimension	VERB
fcis-25095	22	62	random	random	ADJ
fcis-25095	22	63	number	number	NOUN
fcis-25095	22	64	for	for	ADP
fcis-25095	22	65	each	each	DET
fcis-25095	22	66	dimension	dimension	NOUN
fcis-25095	22	67	of	of	ADP
fcis-25095	22	68	the	the	DET
fcis-25095	22	69	individual	individual	NOUN
fcis-25095	22	70	,	,	PUNCT
fcis-25095	22	71	when	when	SCONJ
fcis-25095	22	72	the	the	DET
fcis-25095	22	73	random	random	ADJ
fcis-25095	22	74	number	number	NOUN
fcis-25095	22	75	of	of	ADP
fcis-25095	22	76	a	a	DET
fcis-25095	22	77	certain	certain	ADJ
fcis-25095	22	78	dimension	dimension	NOUN
fcis-25095	22	79	is	be	AUX
fcis-25095	22	80	less	less	ADJ
fcis-25095	22	81	than	than	ADP
fcis-25095	22	82	pc	pc	NOUN
fcis-25095	22	83	or	or	CCONJ
fcis-25095	22	84	the	the	DET
fcis-25095	22	85	dimension	dimension	NOUN
fcis-25095	22	86	random	random	ADJ
fcis-25095	22	87	number	number	NOUN
fcis-25095	22	88	is	be	AUX
fcis-25095	22	89	equal	equal	ADJ
fcis-25095	22	90	to	to	ADP
fcis-25095	22	91	the	the	DET
fcis-25095	22	92	number	number	NOUN
fcis-25095	22	93	of	of	ADP
fcis-25095	22	94	the	the	DET
fcis-25095	22	95	current	current	ADJ
fcis-25095	22	96	dimension	dimension	NOUN
fcis-25095	22	97	,	,	PUNCT
fcis-25095	22	98	then	then	ADV
fcis-25095	22	99	the	the	DET
fcis-25095	22	100	current	current	ADJ
fcis-25095	22	101	dimension	dimension	NOUN
fcis-25095	22	102	value	value	NOUN
fcis-25095	22	103	of	of	ADP
fcis-25095	22	104	the	the	DET
fcis-25095	22	105	new	new	ADJ
fcis-25095	22	106	individual	individual	NOUN
fcis-25095	22	107	equals	equal	VERB
fcis-25095	22	108	to	to	ADP
fcis-25095	22	109	the	the	DET
fcis-25095	22	110	current	current	ADJ
fcis-25095	22	111	dimension	dimension	NOUN
fcis-25095	22	112	value	value	NOUN
fcis-25095	22	113	of	of	ADP
fcis-25095	22	114	the	the	DET
fcis-25095	22	115	mutated	mutate	VERB
fcis-25095	22	116	individual	individual	NOUN
fcis-25095	22	117	,	,	PUNCT
fcis-25095	22	118	or	or	CCONJ
fcis-25095	22	119	else	else	ADV
fcis-25095	22	120	it	it	PRON
fcis-25095	22	121	equals	equal	VERB
fcis-25095	22	122	to	to	ADP
fcis-25095	22	123	the	the	DET
fcis-25095	22	124	current	current	ADJ
fcis-25095	22	125	dimension	dimension	NOUN
fcis-25095	22	126	value	value	NOUN
fcis-25095	22	127	of	of	ADP
fcis-25095	22	128	the	the	DET
fcis-25095	22	129	parent	parent	NOUN
fcis-25095	22	130	individual	individual	NOUN
fcis-25095	22	131	.	.	PUNCT
fcis-25095	23	1	individual	individual	PROPN
fcis-25095	23	2	's	's	PART
fcis-25095	23	3	current	current	ADJ
fcis-25095	23	4	dimension	dimension	NOUN
fcis-25095	23	5	value	value	NOUN
fcis-25095	23	6	,	,	PUNCT
fcis-25095	23	7	otherwise	otherwise	ADV
fcis-25095	23	8	it	it	PRON
fcis-25095	23	9	5	5	NUM
fcis-25095	23	10	is	be	AUX
fcis-25095	23	11	equal	equal	ADJ
fcis-25095	23	12	to	to	ADP
fcis-25095	23	13	the	the	DET
fcis-25095	23	14	parent	parent	NOUN
fcis-25095	23	15	's	's	PART
fcis-25095	23	16	current	current	ADJ
fcis-25095	23	17	dimension	dimension	NOUN
fcis-25095	23	18	value	value	NOUN
fcis-25095	23	19	.	.	PUNCT
fcis-25095	24	1	the	the	DET
fcis-25095	24	2	formula	formula	NOUN
fcis-25095	24	3	is	be	AUX
fcis-25095	24	4	as	as	SCONJ
fcis-25095	24	5	follows	follow	VERB
fcis-25095	24	6	:	:	PUNCT
fcis-25095	25	1	rand(i)j	rand(i)j	PROPN
fcis-25095	25	2	or	or	CCONJ
fcis-25095	25	3	pcrand	pcrand	PROPN
fcis-25095	25	4	tv	tv	PROPN
fcis-25095	25	5	rand(i	rand(i	PROPN
fcis-25095	25	6	)	)	PUNCT
fcis-25095	25	7	j	j	PROPN
fcis-25095	25	8	and	and	CCONJ
fcis-25095	25	9	pcrand	pcrand	PROPN
fcis-25095	25	10	tx	tx	PROPN
fcis-25095	25	11	tu	tu	PROPN
fcis-25095	25	12	ijij	ijij	ADJ
fcis-25095	25	13	ijij	ijij	ADJ
fcis-25095	25	14	ij	ij	NOUN
fcis-25095	25	15			PUNCT
fcis-25095	25	16			PROPN
fcis-25095	25	17	)	)	PUNCT
fcis-25095	25	18	1	1	NUM
fcis-25095	25	19	(	(	PUNCT
fcis-25095	25	20	)	)	PUNCT
fcis-25095	25	21	(	(	PUNCT
fcis-25095	25	22	)	)	PUNCT
fcis-25095	25	23	1	1	NUM
fcis-25095	25	24	(	(	PUNCT
fcis-25095	25	25	{	{	PUNCT
fcis-25095	25	26	(	(	PUNCT
fcis-25095	25	27	2	2	X
fcis-25095	25	28	)	)	PUNCT
fcis-25095	25	29	randij	randij	NOUN
fcis-25095	25	30	is	be	AUX
fcis-25095	25	31	a	a	DET
fcis-25095	25	32	random	random	ADJ
fcis-25095	25	33	decimal	decimal	NOUN
fcis-25095	25	34	between	between	ADP
fcis-25095	25	35	[	[	X
fcis-25095	25	36	0,1	0,1	NUM
fcis-25095	25	37	]	]	PUNCT
fcis-25095	25	38	,	,	PUNCT
fcis-25095	25	39	pc	pc	NOUN
fcis-25095	25	40	is	be	AUX
fcis-25095	25	41	the	the	DET
fcis-25095	25	42	crossover	crossover	NOUN
fcis-25095	25	43	probability	probability	NOUN
fcis-25095	25	44	,	,	PUNCT
fcis-25095	25	45	pc∈[0	pc∈[0	NOUN
fcis-25095	25	46	,	,	PUNCT
fcis-25095	25	47	1	1	NUM
fcis-25095	25	48	]	]	PUNCT
fcis-25095	25	49	,	,	PUNCT
fcis-25095	25	50	and	and	CCONJ
fcis-25095	25	51	rand	rand	NOUN
fcis-25095	25	52	(	(	PUNCT
fcis-25095	25	53	i	i	NOUN
fcis-25095	25	54	)	)	PUNCT
fcis-25095	25	55	is	be	AUX
fcis-25095	25	56	a	a	DET
fcis-25095	25	57	random	random	ADJ
fcis-25095	25	58	integer	integer	NOUN
fcis-25095	25	59	between	between	ADP
fcis-25095	25	60	[	[	X
fcis-25095	25	61	1,n	1,n	NUM
fcis-25095	25	62	]	]	X
fcis-25095	25	63	.	.	PUNCT
fcis-25095	26	1	this	this	DET
fcis-25095	26	2	crossover	crossover	NOUN
fcis-25095	26	3	strategy	strategy	NOUN
fcis-25095	26	4	ensures	ensure	VERB
fcis-25095	26	5	that	that	SCONJ
fcis-25095	26	6	at	at	ADV
fcis-25095	26	7	least	least	ADV
fcis-25095	26	8	one	one	NUM
fcis-25095	26	9	component	component	NOUN
fcis-25095	26	10	of	of	ADP
fcis-25095	26	11	xi	xi	PROPN
fcis-25095	26	12	(	(	PUNCT
fcis-25095	26	13	t+1	t+1	PROPN
fcis-25095	26	14	)	)	PUNCT
fcis-25095	26	15	is	be	AUX
fcis-25095	26	16	contributed	contribute	VERB
fcis-25095	26	17	by	by	ADP
fcis-25095	26	18	the	the	DET
fcis-25095	26	19	corresponding	corresponding	ADJ
fcis-25095	26	20	component	component	NOUN
fcis-25095	26	21	of	of	ADP
fcis-25095	26	22	xi	xi	PROPN
fcis-25095	26	23	(	(	PUNCT
fcis-25095	26	24	t	t	PROPN
fcis-25095	26	25	)	)	PUNCT
fcis-25095	26	26	.	.	PUNCT
fcis-25095	27	1	after	after	ADP
fcis-25095	27	2	the	the	DET
fcis-25095	27	3	above	above	ADJ
fcis-25095	27	4	crossover	crossover	NOUN
fcis-25095	27	5	and	and	CCONJ
fcis-25095	27	6	selection	selection	NOUN
fcis-25095	27	7	algorithms	algorithm	NOUN
fcis-25095	27	8	,	,	PUNCT
fcis-25095	27	9	the	the	DET
fcis-25095	27	10	selection	selection	NOUN
fcis-25095	27	11	operation	operation	NOUN
fcis-25095	27	12	is	be	AUX
fcis-25095	27	13	executed	execute	VERB
fcis-25095	27	14	,	,	PUNCT
fcis-25095	27	15	using	use	VERB
fcis-25095	27	16	tournament	tournament	NOUN
fcis-25095	27	17	one	one	NUM
fcis-25095	27	18	-	-	PUNCT
fcis-25095	27	19	to	to	ADP
fcis-25095	27	20	-	-	PUNCT
fcis-25095	27	21	one	one	NUM
fcis-25095	27	22	selection	selection	NOUN
fcis-25095	27	23	,	,	PUNCT
fcis-25095	27	24	i.e.	i.e.	X
fcis-25095	27	25	,	,	PUNCT
fcis-25095	27	26	the	the	DET
fcis-25095	27	27	parent	parent	NOUN
fcis-25095	27	28	individual	individual	NOUN
fcis-25095	27	29	is	be	AUX
fcis-25095	27	30	compared	compare	VERB
fcis-25095	27	31	with	with	ADP
fcis-25095	27	32	its	its	PRON
fcis-25095	27	33	own	own	ADJ
fcis-25095	27	34	children	child	NOUN
fcis-25095	27	35	,	,	PUNCT
fcis-25095	27	36	and	and	CCONJ
fcis-25095	27	37	whoever	whoever	PRON
fcis-25095	27	38	is	be	AUX
fcis-25095	27	39	better	well	ADV
fcis-25095	27	40	adapted	adapt	VERB
fcis-25095	27	41	survives	survive	NOUN
fcis-25095	27	42	.	.	PUNCT
fcis-25095	28	1	this	this	PRON
fcis-25095	28	2	concludes	conclude	VERB
fcis-25095	28	3	the	the	DET
fcis-25095	28	4	round	round	NOUN
fcis-25095	28	5	of	of	ADP
fcis-25095	28	6	differential	differential	ADJ
fcis-25095	28	7	evolutionary	evolutionary	ADJ
fcis-25095	28	8	algorithm	algorithm	NOUN
fcis-25095	28	9	.	.	PUNCT
fcis-25095	29	1	the	the	DET
fcis-25095	29	2	pseudo	pseudo	NOUN
fcis-25095	29	3	-	-	NOUN
fcis-25095	29	4	code	code	NOUN
fcis-25095	29	5	of	of	ADP
fcis-25095	29	6	de	de	X
fcis-25095	29	7	algorithm	algorithm	NOUN
fcis-25095	29	8	is	be	AUX
fcis-25095	29	9	shown	show	VERB
fcis-25095	29	10	in	in	ADP
fcis-25095	29	11	algorithm	algorithm	NOUN
fcis-25095	29	12	1	1	NUM
fcis-25095	29	13	.	.	PUNCT
fcis-25095	30	1	algorithm	algorithm	NOUN
fcis-25095	30	2	1	1	NUM
fcis-25095	30	3	:	:	PUNCT
fcis-25095	30	4	de	de	X
fcis-25095	30	5	algorithm	algorithm	NOUN
fcis-25095	30	6	input	input	NOUN
fcis-25095	30	7	:	:	PUNCT
fcis-25095	30	8	population	population	NOUN
fcis-25095	30	9	:	:	PUNCT
fcis-25095	30	10	p；dimension	p；dimension	NOUN
fcis-25095	30	11	:	:	PUNCT
fcis-25095	30	12	d；generation	d；generation	NOUN
fcis-25095	30	13	:	:	PUNCT
fcis-25095	30	14	r	r	NOUN
fcis-25095	30	15	；	；	NOUN
fcis-25095	30	16	output	output	NOUN
fcis-25095	30	17	:	:	PUNCT
fcis-25095	30	18	the	the	DET
fcis-25095	30	19	best	good	ADJ
fcis-25095	30	20	solution	solution	NOUN
fcis-25095	30	21	path	path	NOUN
fcis-25095	30	22	:	:	PUNCT
fcis-25095	30	23	bestpath	bestpath	NOUN
fcis-25095	30	24	1	1	NUM
fcis-25095	30	25	：	：	PUNCT
fcis-25095	30	26	r←1(initialization	r←1(initialization	NOUN
fcis-25095	30	27	):	):	PUNCT
fcis-25095	30	28	2	2	NUM
fcis-25095	30	29	：	：	PUNCT
fcis-25095	30	30	for	for	ADP
fcis-25095	30	31	i	i	PRON
fcis-25095	30	32	=	=	NOUN
fcis-25095	30	33	1	1	NUM
fcis-25095	30	34	to	to	ADP
fcis-25095	30	35	p	p	PROPN
fcis-25095	30	36	do	do	VERB
fcis-25095	30	37	3	3	NUM
fcis-25095	30	38	：	：	PUNCT
fcis-25095	30	39	for	for	SCONJ
fcis-25095	30	40	j=1	j=1	PROPN
fcis-25095	30	41	to	to	PART
fcis-25095	30	42	d	d	PROPN
fcis-25095	30	43	do	do	AUX
fcis-25095	30	44	4	4	NUM
fcis-25095	30	45	：	：	SYM
fcis-25095	30	46	5	5	NUM
fcis-25095	30	47	：	：	PUNCT
fcis-25095	30	48	end	end	NOUN
fcis-25095	30	49	6	6	NUM
fcis-25095	30	50	：	：	PUNCT
fcis-25095	30	51	end	end	NOUN
fcis-25095	30	52	7	7	NUM
fcis-25095	30	53	：	：	PUNCT
fcis-25095	30	54	while	while	SCONJ
fcis-25095	30	55	(	(	PUNCT
fcis-25095	30	56	)	)	PUNCT
fcis-25095	30	57	or	or	CCONJ
fcis-25095	30	58	(	(	PUNCT
fcis-25095	30	59	)	)	PUNCT
fcis-25095	30	60	do	do	VERB
fcis-25095	30	61	8	8	NUM
fcis-25095	30	62	：	：	PUNCT
fcis-25095	30	63	for	for	SCONJ
fcis-25095	30	64	i=1	i=1	PROPN
fcis-25095	30	65	to	to	ADP
fcis-25095	30	66	p	p	PROPN
fcis-25095	30	67	do	do	VERB
fcis-25095	30	68	9	9	NUM
fcis-25095	30	69	：	：	PUNCT
fcis-25095	30	70	//mutation	//mutation	NOUN
fcis-25095	30	71	and	and	CCONJ
fcis-25095	30	72	crossover	crossover	VERB
fcis-25095	30	73	operation	operation	NOUN
fcis-25095	30	74	10	10	NUM
fcis-25095	30	75	：	：	PUNCT
fcis-25095	30	76	for	for	SCONJ
fcis-25095	30	77	j=1	j=1	PROPN
fcis-25095	30	78	to	to	PART
fcis-25095	30	79	d	d	PROPN
fcis-25095	30	80	do	do	VERB
fcis-25095	30	81	11	11	NUM
fcis-25095	30	82	：	：	SYM
fcis-25095	30	83	12	12	NUM
fcis-25095	30	84	：	：	SYM
fcis-25095	30	85	13	13	NUM
fcis-25095	30	86	：	：	PUNCT
fcis-25095	30	87	end	end	NOUN
fcis-25095	30	88	14	14	NUM
fcis-25095	30	89	：	：	PUNCT
fcis-25095	30	90	//selection	//selection	SYM
fcis-25095	30	91	operation	operation	NOUN
fcis-25095	30	92	15	15	NUM
fcis-25095	30	93	：	：	PUNCT
fcis-25095	30	94	if	if	SCONJ
fcis-25095	30	95	then	then	ADV
fcis-25095	30	96	16	16	NUM
fcis-25095	30	97	：	：	SYM
fcis-25095	30	98	17	17	NUM
fcis-25095	30	99	：	：	PUNCT
fcis-25095	30	100	if	if	SCONJ
fcis-25095	30	101	then	then	ADV
fcis-25095	30	102	18	18	NUM
fcis-25095	30	103	：	：	SYM
fcis-25095	30	104	19	19	NUM
fcis-25095	30	105	：	：	PUNCT
fcis-25095	30	106	end	end	NOUN
fcis-25095	30	107	20	20	NUM
fcis-25095	30	108	：	：	PUNCT
fcis-25095	30	109	else	else	ADV
fcis-25095	30	110	21	21	NUM
fcis-25095	30	111	：	：	SYM
fcis-25095	30	112	22	22	NUM
fcis-25095	30	113	：	：	PUNCT
fcis-25095	30	114	end	end	NOUN
fcis-25095	30	115	23	23	NUM
fcis-25095	30	116	：	：	PUNCT
fcis-25095	30	117	end	end	NOUN
fcis-25095	30	118	24	24	NUM
fcis-25095	30	119	：	：	PUNCT
fcis-25095	30	120	r←r+1	r←r+1	NUM
fcis-25095	30	121	;	;	PUNCT
fcis-25095	30	122	25	25	NUM
fcis-25095	30	123	：	：	PUNCT
fcis-25095	30	124	end	end	NOUN
fcis-25095	30	125	26	26	NUM
fcis-25095	30	126	：	：	PUNCT
fcis-25095	30	127	return	return	VERB
fcis-25095	30	128	the	the	DET
fcis-25095	30	129	best	good	ADJ
fcis-25095	30	130	solution	solution	NOUN
fcis-25095	30	131	path	path	NOUN
fcis-25095	30	132	bestpath	bestpath	PROPN
fcis-25095	30	133	2.2	2.2	NUM
fcis-25095	30	134	.	.	PUNCT
fcis-25095	31	1	hill	hill	NOUN
fcis-25095	31	2	climbing	climbing	NOUN
fcis-25095	31	3	algorithm	algorithm	NOUN
fcis-25095	31	4	figure	figure	NOUN
fcis-25095	31	5	1	1	NUM
fcis-25095	31	6	.	.	PUNCT
fcis-25095	32	1	flowchart	flowchart	NOUN
fcis-25095	32	2	of	of	ADP
fcis-25095	32	3	hca	hca	PROPN
fcis-25095	32	4	search	search	NOUN
fcis-25095	32	5	algorithm	algorithm	NOUN
fcis-25095	32	6	the	the	DET
fcis-25095	32	7	hill	hill	NOUN
fcis-25095	32	8	-	-	PUNCT
fcis-25095	32	9	climbing	climb	VERB
fcis-25095	32	10	algorithm	algorithm	NOUN
fcis-25095	32	11	is	be	AUX
fcis-25095	32	12	a	a	DET
fcis-25095	32	13	typical	typical	ADJ
fcis-25095	32	14	local	local	ADJ
fcis-25095	32	15	optimal	optimal	ADJ
fcis-25095	32	16	search	search	NOUN
fcis-25095	32	17	algorithm	algorithm	NOUN
fcis-25095	32	18	,	,	PUNCT
fcis-25095	32	19	which	which	PRON
fcis-25095	32	20	uses	use	VERB
fcis-25095	32	21	various	various	ADJ
fcis-25095	32	22	crossover	crossover	NOUN
fcis-25095	32	23	operators	operator	NOUN
fcis-25095	32	24	to	to	PART
fcis-25095	32	25	generate	generate	VERB
fcis-25095	32	26	the	the	DET
fcis-25095	32	27	neighbors	neighbor	NOUN
fcis-25095	32	28	of	of	ADP
fcis-25095	32	29	the	the	DET
fcis-25095	32	30	current	current	ADJ
fcis-25095	32	31	solution	solution	NOUN
fcis-25095	32	32	,	,	PUNCT
fcis-25095	32	33	and	and	CCONJ
fcis-25095	32	34	iterates	iterate	VERB
fcis-25095	32	35	using	use	VERB
fcis-25095	32	36	the	the	DET
fcis-25095	32	37	better	well	ADJ
fcis-25095	32	38	individuals	individual	NOUN
fcis-25095	32	39	in	in	ADP
fcis-25095	32	40	the	the	DET
fcis-25095	32	41	generated	generate	VERB
fcis-25095	32	42	neighboring	neighboring	NOUN
fcis-25095	32	43	solutions	solution	NOUN
fcis-25095	32	44	to	to	PART
fcis-25095	32	45	keep	keep	VERB
fcis-25095	32	46	updating	update	VERB
fcis-25095	32	47	the	the	DET
fcis-25095	32	48	current	current	ADJ
fcis-25095	32	49	optimal	optimal	ADJ
fcis-25095	32	50	solution	solution	NOUN
fcis-25095	32	51	until	until	SCONJ
fcis-25095	32	52	there	there	PRON
fcis-25095	32	53	is	be	VERB
fcis-25095	32	54	no	no	DET
fcis-25095	32	55	better	well	ADJ
fcis-25095	32	56	solution	solution	NOUN
fcis-25095	32	57	in	in	ADP
fcis-25095	32	58	the	the	DET
fcis-25095	32	59	current	current	ADJ
fcis-25095	32	60	generated	generate	VERB
fcis-25095	32	61	neighboring	neighboring	NOUN
fcis-25095	32	62	solutions	solution	NOUN
fcis-25095	32	63	.	.	PUNCT
fcis-25095	33	1	for	for	ADP
fcis-25095	33	2	the	the	DET
fcis-25095	33	3	mtsp	mtsp	NOUN
fcis-25095	33	4	problem	problem	NOUN
fcis-25095	33	5	,	,	PUNCT
fcis-25095	33	6	the	the	DET
fcis-25095	33	7	more	more	ADV
fcis-25095	33	8	classical	classical	ADJ
fcis-25095	33	9	crossover	crossover	NOUN
fcis-25095	33	10	operators	operator	NOUN
fcis-25095	33	11	include	include	VERB
fcis-25095	33	12	2	2	NUM
fcis-25095	33	13	-	-	PUNCT
fcis-25095	33	14	opt	opt	ADJ
fcis-25095	33	15	,	,	PUNCT
fcis-25095	33	16	double	double	ADJ
fcis-25095	33	17	-	-	PUNCT
fcis-25095	33	18	bridge	bridge	NOUN
fcis-25095	33	19	-	-	PUNCT
fcis-25095	33	20	swap	swap	NOUN
fcis-25095	33	21	,	,	PUNCT
fcis-25095	33	22	insert	insert	NOUN
fcis-25095	33	23	-	-	NOUN
fcis-25095	33	24	swap	swap	NOUN
fcis-25095	33	25	,	,	PUNCT
fcis-25095	33	26	etc	etc	X
fcis-25095	33	27	.	.	X
fcis-25095	34	1	these	these	DET
fcis-25095	34	2	operators	operator	NOUN
fcis-25095	34	3	are	be	AUX
fcis-25095	34	4	able	able	ADJ
fcis-25095	34	5	to	to	PART
fcis-25095	34	6	form	form	VERB
fcis-25095	34	7	new	new	ADJ
fcis-25095	34	8	neighboring	neighboring	NOUN
fcis-25095	34	9	individuals	individual	NOUN
fcis-25095	34	10	flexibly	flexibly	ADV
fcis-25095	34	11	and	and	CCONJ
fcis-25095	34	12	extensively	extensively	ADV
fcis-25095	34	13	,	,	PUNCT
fcis-25095	34	14	thus	thus	ADV
fcis-25095	34	15	effectively	effectively	ADV
fcis-25095	34	16	forming	form	VERB
fcis-25095	34	17	and	and	CCONJ
fcis-25095	34	18	updating	update	VERB
fcis-25095	34	19	the	the	DET
fcis-25095	34	20	current	current	ADJ
fcis-25095	34	21	optimal	optimal	ADJ
fcis-25095	34	22	solution	solution	NOUN
fcis-25095	34	23	.	.	PUNCT
fcis-25095	35	1	as	as	ADP
fcis-25095	35	2	a	a	DET
fcis-25095	35	3	typical	typical	ADJ
fcis-25095	35	4	local	local	ADJ
fcis-25095	35	5	search	search	NOUN
fcis-25095	35	6	algorithm	algorithm	NOUN
fcis-25095	35	7	,	,	PUNCT
fcis-25095	35	8	hill	hill	NOUN
fcis-25095	35	9	-	-	PUNCT
fcis-25095	35	10	climbing	climb	VERB
fcis-25095	35	11	algorithm	algorithm	NOUN
fcis-25095	35	12	can	can	AUX
fcis-25095	35	13	effectively	effectively	ADV
fcis-25095	35	14	solve	solve	VERB
fcis-25095	35	15	the	the	DET
fcis-25095	35	16	problem	problem	NOUN
fcis-25095	35	17	that	that	PRON
fcis-25095	35	18	de	de	ADJ
fcis-25095	35	19	algorithm	algorithm	NOUN
fcis-25095	35	20	is	be	AUX
fcis-25095	35	21	easy	easy	ADJ
fcis-25095	35	22	to	to	PART
fcis-25095	35	23	fall	fall	VERB
fcis-25095	35	24	into	into	ADP
fcis-25095	35	25	the	the	DET
fcis-25095	35	26	local	local	ADJ
fcis-25095	35	27	optimum	optimum	NOUN
fcis-25095	35	28	and	and	CCONJ
fcis-25095	35	29	can	can	AUX
fcis-25095	35	30	not	not	PART
fcis-25095	35	31	obtain	obtain	VERB
fcis-25095	35	32	the	the	DET
fcis-25095	35	33	optimal	optimal	ADJ
fcis-25095	35	34	solution	solution	NOUN
fcis-25095	35	35	.	.	PUNCT
fcis-25095	36	1	the	the	DET
fcis-25095	36	2	performance	performance	NOUN
fcis-25095	36	3	of	of	ADP
fcis-25095	36	4	hill	hill	NOUN
fcis-25095	36	5	-	-	PUNCT
fcis-25095	36	6	climbing	climb	VERB
fcis-25095	36	7	algorithm	algorithm	NOUN
fcis-25095	36	8	depends	depend	VERB
fcis-25095	36	9	on	on	ADP
fcis-25095	36	10	the	the	DET
fcis-25095	36	11	selection	selection	NOUN
fcis-25095	36	12	of	of	ADP
fcis-25095	36	13	crossover	crossover	NOUN
fcis-25095	36	14	operators	operator	NOUN
fcis-25095	36	15	,	,	PUNCT
fcis-25095	36	16	and	and	CCONJ
fcis-25095	36	17	in	in	ADP
fcis-25095	36	18	this	this	DET
fcis-25095	36	19	paper	paper	NOUN
fcis-25095	36	20	,	,	PUNCT
fcis-25095	36	21	2	2	NUM
fcis-25095	36	22	-	-	PUNCT
fcis-25095	36	23	opt	opt	NOUN
fcis-25095	36	24	,	,	PUNCT
fcis-25095	36	25	insert	insert	NOUN
fcis-25095	36	26	-	-	PUNCT
fcis-25095	36	27	opt	opt	ADJ
fcis-25095	36	28	and	and	CCONJ
fcis-25095	36	29	3	3	NUM
fcis-25095	36	30	-	-	PUNCT
fcis-25095	36	31	opt	opt	NOUN
fcis-25095	36	32	are	be	AUX
fcis-25095	36	33	selected	select	VERB
fcis-25095	36	34	as	as	ADP
fcis-25095	36	35	the	the	DET
fcis-25095	36	36	crossover	crossover	NOUN
fcis-25095	36	37	operators	operator	NOUN
fcis-25095	36	38	of	of	ADP
fcis-25095	36	39	hill	hill	NOUN
fcis-25095	36	40	-	-	PUNCT
fcis-25095	36	41	climbing	climb	VERB
fcis-25095	36	42	algorithm	algorithm	NOUN
fcis-25095	36	43	.	.	PUNCT
fcis-25095	37	1	2	2	NUM
fcis-25095	37	2	-	-	PUNCT
fcis-25095	37	3	opt	opt	NOUN
fcis-25095	37	4	-	-	PUNCT
fcis-25095	37	5	swap	swap	NOUN
fcis-25095	37	6	algorithm	algorithm	NOUN
fcis-25095	37	7	is	be	AUX
fcis-25095	37	8	to	to	PART
fcis-25095	37	9	exchange	exchange	VERB
fcis-25095	37	10	all	all	DET
fcis-25095	37	11	the	the	DET
fcis-25095	37	12	cities	city	NOUN
fcis-25095	37	13	in	in	ADP
fcis-25095	37	14	the	the	DET
fcis-25095	37	15	two	two	NUM
fcis-25095	37	16	cities	city	NOUN
fcis-25095	37	17	in	in	ADP
fcis-25095	37	18	the	the	DET
fcis-25095	37	19	reverse	reverse	ADJ
fcis-25095	37	20	order	order	NOUN
fcis-25095	37	21	to	to	PART
fcis-25095	37	22	form	form	VERB
fcis-25095	37	23	a	a	DET
fcis-25095	37	24	new	new	ADJ
fcis-25095	37	25	path	path	NOUN
fcis-25095	37	26	.	.	PUNCT
fcis-25095	38	1	insert	insert	VERB
fcis-25095	38	2	-	-	PUNCT
fcis-25095	38	3	opt	opt	ADJ
fcis-25095	38	4	algorithm	algorithm	NOUN
fcis-25095	38	5	is	be	AUX
fcis-25095	38	6	to	to	PART
fcis-25095	38	7	randomly	randomly	ADV
fcis-25095	38	8	select	select	VERB
fcis-25095	38	9	the	the	DET
fcis-25095	38	10	cities	city	NOUN
fcis-25095	38	11	in	in	ADP
fcis-25095	38	12	an	an	DET
fcis-25095	38	13	interval	interval	NOUN
fcis-25095	38	14	and	and	CCONJ
fcis-25095	38	15	randomly	randomly	ADV
fcis-25095	38	16	insert	insert	VERB
fcis-25095	38	17	a	a	DET
fcis-25095	38	18	sequence	sequence	NOUN
fcis-25095	38	19	of	of	ADP
fcis-25095	38	20	cities	city	NOUN
fcis-25095	38	21	in	in	ADP
fcis-25095	38	22	the	the	DET
fcis-25095	38	23	segment	segment	NOUN
fcis-25095	38	24	into	into	ADP
fcis-25095	38	25	another	another	DET
fcis-25095	38	26	position	position	NOUN
fcis-25095	38	27	of	of	ADP
fcis-25095	38	28	the	the	DET
fcis-25095	38	29	solution	solution	NOUN
fcis-25095	38	30	set	set	VERB
fcis-25095	38	31	.	.	PUNCT
fcis-25095	39	1	3	3	NUM
fcis-25095	39	2	-	-	PUNCT
fcis-25095	39	3	opt	opt	NOUN
fcis-25095	39	4	algorithm	algorithm	NOUN
fcis-25095	39	5	is	be	AUX
fcis-25095	39	6	to	to	PART
fcis-25095	39	7	randomly	randomly	ADV
fcis-25095	39	8	select	select	VERB
fcis-25095	39	9	the	the	DET
fcis-25095	39	10	cities	city	NOUN
fcis-25095	39	11	in	in	ADP
fcis-25095	39	12	an	an	DET
fcis-25095	39	13	interval	interval	NOUN
fcis-25095	39	14	and	and	CCONJ
fcis-25095	39	15	randomly	randomly	ADV
fcis-25095	39	16	insert	insert	VERB
fcis-25095	39	17	a	a	DET
fcis-25095	39	18	sequence	sequence	NOUN
fcis-25095	39	19	of	of	ADP
fcis-25095	39	20	cities	city	NOUN
fcis-25095	39	21	into	into	ADP
fcis-25095	39	22	the	the	DET
fcis-25095	39	23	solution	solution	NOUN
fcis-25095	39	24	set	set	VERB
fcis-25095	39	25	.	.	PUNCT
fcis-25095	40	1	another	another	DET
fcis-25095	40	2	location	location	NOUN
fcis-25095	40	3	.	.	PUNCT
fcis-25095	41	1	the	the	DET
fcis-25095	41	2	3	3	NUM
fcis-25095	41	3	-	-	PUNCT
fcis-25095	41	4	opt	opt	NOUN
fcis-25095	41	5	algorithm	algorithm	NOUN
fcis-25095	41	6	is	be	AUX
fcis-25095	41	7	to	to	PART
fcis-25095	41	8	randomly	randomly	VERB
fcis-25095	41	9	select	select	VERB
fcis-25095	41	10	three	three	NUM
fcis-25095	41	11	cities	city	NOUN
fcis-25095	41	12	,	,	PUNCT
fcis-25095	41	13	exchange	exchange	VERB
fcis-25095	41	14	their	their	PRON
fcis-25095	41	15	order	order	NOUN
fcis-25095	41	16	and	and	CCONJ
fcis-25095	41	17	generate	generate	VERB
fcis-25095	41	18	a	a	DET
fcis-25095	41	19	new	new	ADJ
fcis-25095	41	20	path	path	NOUN
fcis-25095	41	21	.	.	PUNCT
fcis-25095	42	1	the	the	DET
fcis-25095	42	2	flowchart	flowchart	NOUN
fcis-25095	42	3	of	of	ADP
fcis-25095	42	4	the	the	DET
fcis-25095	42	5	hill	hill	NOUN
fcis-25095	42	6	-	-	PUNCT
fcis-25095	42	7	climbing	climb	VERB
fcis-25095	42	8	algorithm	algorithm	NOUN
fcis-25095	42	9	designed	design	VERB
fcis-25095	42	10	in	in	ADP
fcis-25095	42	11	this	this	DET
fcis-25095	42	12	paper	paper	NOUN
fcis-25095	42	13	is	be	AUX
fcis-25095	42	14	shown	show	VERB
fcis-25095	42	15	in	in	ADP
fcis-25095	42	16	figure	figure	NOUN
fcis-25095	42	17	1	1	NUM
fcis-25095	42	18	.	.	NOUN
fcis-25095	42	19	3	3	NUM
fcis-25095	42	20	.	.	NOUN
fcis-25095	42	21	hca&de	hca&de	NOUN
fcis-25095	42	22	algorithm	algorithm	NOUN
fcis-25095	42	23	3.1	3.1	NUM
fcis-25095	42	24	.	.	PUNCT
fcis-25095	42	25	hca&de	hca&de	NOUN
fcis-25095	42	26	algorithm	algorithm	NOUN
fcis-25095	42	27	introduction	introduction	NOUN
fcis-25095	42	28	hca&de	hca&de	NOUN
fcis-25095	42	29	algorithm	algorithm	NOUN
fcis-25095	42	30	is	be	AUX
fcis-25095	42	31	a	a	DET
fcis-25095	42	32	combination	combination	NOUN
fcis-25095	42	33	algorithm	algorithm	NOUN
fcis-25095	42	34	of	of	ADP
fcis-25095	42	35	differential	differential	ADJ
fcis-25095	42	36	evolutionary	evolutionary	ADJ
fcis-25095	42	37	algorithm	algorithm	NOUN
fcis-25095	42	38	and	and	CCONJ
fcis-25095	42	39	hill	hill	NOUN
fcis-25095	42	40	-	-	PUNCT
fcis-25095	42	41	climbing	climb	VERB
fcis-25095	42	42	search	search	NOUN
fcis-25095	42	43	algorithm	algorithm	NOUN
fcis-25095	42	44	,	,	PUNCT
fcis-25095	42	45	he	he	PRON
fcis-25095	42	46	has	have	VERB
fcis-25095	42	47	the	the	DET
fcis-25095	42	48	powerful	powerful	ADJ
fcis-25095	42	49	global	global	ADJ
fcis-25095	42	50	search	search	NOUN
fcis-25095	42	51	performance	performance	NOUN
fcis-25095	42	52	of	of	ADP
fcis-25095	42	53	differential	differential	ADJ
fcis-25095	42	54	evolutionary	evolutionary	ADJ
fcis-25095	42	55	algorithm	algorithm	NOUN
fcis-25095	42	56	,	,	PUNCT
fcis-25095	42	57	and	and	CCONJ
fcis-25095	42	58	at	at	ADP
fcis-25095	42	59	the	the	DET
fcis-25095	42	60	same	same	ADJ
fcis-25095	42	61	time	time	NOUN
fcis-25095	42	62	,	,	PUNCT
fcis-25095	42	63	the	the	DET
fcis-25095	42	64	local	local	ADJ
fcis-25095	42	65	search	search	NOUN
fcis-25095	42	66	ability	ability	NOUN
fcis-25095	42	67	of	of	ADP
fcis-25095	42	68	de	de	X
fcis-25095	42	69	algorithm	algorithm	NOUN
fcis-25095	42	70	is	be	AUX
fcis-25095	42	71	enhanced	enhance	VERB
fcis-25095	42	72	by	by	ADP
fcis-25095	42	73	the	the	DET
fcis-25095	42	74	hill	hill	NOUN
fcis-25095	42	75	-	-	PUNCT
fcis-25095	42	76	climbing	climb	VERB
fcis-25095	42	77	algorithm	algorithm	NOUN
fcis-25095	42	78	,	,	PUNCT
fcis-25095	42	79	which	which	PRON
fcis-25095	42	80	makes	make	VERB
fcis-25095	42	81	the	the	DET
fcis-25095	42	82	hca&de	hca&de	NOUN
fcis-25095	42	83	algorithm	algorithm	NOUN
fcis-25095	42	84	have	have	VERB
fcis-25095	42	85	both	both	CCONJ
fcis-25095	42	86	powerful	powerful	ADJ
fcis-25095	42	87	local	local	ADJ
fcis-25095	42	88	search	search	NOUN
fcis-25095	42	89	ability	ability	NOUN
fcis-25095	42	90	and	and	CCONJ
fcis-25095	42	91	global	global	ADJ
fcis-25095	42	92	search	search	NOUN
fcis-25095	42	93	ability	ability	NOUN
fcis-25095	42	94	,	,	PUNCT
fcis-25095	42	95	and	and	CCONJ
fcis-25095	42	96	it	it	PRON
fcis-25095	42	97	can	can	AUX
fcis-25095	42	98	search	search	VERB
fcis-25095	42	99	for	for	ADP
fcis-25095	42	100	better	well	ADJ
fcis-25095	42	101	solutions	solution	NOUN
fcis-25095	42	102	more	more	ADV
fcis-25095	42	103	efficiently	efficiently	ADV
fcis-25095	42	104	.	.	PUNCT
fcis-25095	43	1	the	the	DET
fcis-25095	43	2	hca&de	hca&de	NOUN
fcis-25095	43	3	algorithm	algorithm	NOUN
fcis-25095	43	4	includes	include	VERB
fcis-25095	43	5	initialization	initialization	NOUN
fcis-25095	43	6	,	,	PUNCT
fcis-25095	43	7	mutation	mutation	NOUN
fcis-25095	43	8	,	,	PUNCT
fcis-25095	43	9	crossover	crossover	NOUN
fcis-25095	43	10	,	,	PUNCT
fcis-25095	43	11	selection	selection	NOUN
fcis-25095	43	12	,	,	PUNCT
fcis-25095	43	13	2	2	NUM
fcis-25095	43	14	-	-	PUNCT
fcis-25095	43	15	opt	opt	NOUN
fcis-25095	43	16	,	,	PUNCT
fcis-25095	43	17	insert	insert	NOUN
fcis-25095	43	18	-	-	PUNCT
fcis-25095	43	19	opt	opt	ADJ
fcis-25095	43	20	,	,	PUNCT
fcis-25095	43	21	3	3	NUM
fcis-25095	43	22	-	-	PUNCT
fcis-25095	43	23	opt	opt	NOUN
fcis-25095	43	24	and	and	CCONJ
fcis-25095	43	25	other	other	ADJ
fcis-25095	43	26	operations	operation	NOUN
fcis-25095	43	27	.	.	PUNCT
fcis-25095	44	1	first	first	ADV
fcis-25095	44	2	,	,	PUNCT
fcis-25095	44	3	initialize	initialize	VERB
fcis-25095	44	4	the	the	DET
fcis-25095	44	5	population	population	NOUN
fcis-25095	44	6	and	and	CCONJ
fcis-25095	44	7	randomly	randomly	ADV
fcis-25095	44	8	generate	generate	VERB
fcis-25095	44	9	n	n	PRON
fcis-25095	44	10	paths	path	NOUN
fcis-25095	44	11	that	that	PRON
fcis-25095	44	12	meet	meet	VERB
fcis-25095	44	13	the	the	DET
fcis-25095	44	14	requirements	requirement	NOUN
fcis-25095	44	15	.	.	PUNCT
fcis-25095	45	1	after	after	ADP
fcis-25095	45	2	that	that	PRON
fcis-25095	45	3	,	,	PUNCT
fcis-25095	45	4	we	we	PRON
fcis-25095	45	5	set	set	VERB
fcis-25095	45	6	the	the	DET
fcis-25095	45	7	6	6	NUM
fcis-25095	45	8	crossover	crossover	NOUN
fcis-25095	45	9	and	and	CCONJ
fcis-25095	45	10	mutation	mutation	NOUN
fcis-25095	45	11	probabilities	probability	NOUN
fcis-25095	45	12	of	of	ADP
fcis-25095	45	13	de	de	X
fcis-25095	45	14	algorithm	algorithm	NOUN
fcis-25095	45	15	and	and	CCONJ
fcis-25095	45	16	start	start	VERB
fcis-25095	45	17	to	to	PART
fcis-25095	45	18	calculate	calculate	VERB
fcis-25095	45	19	the	the	DET
fcis-25095	45	20	number	number	NOUN
fcis-25095	45	21	of	of	ADP
fcis-25095	45	22	iterations	iteration	NOUN
fcis-25095	45	23	of	of	ADP
fcis-25095	45	24	hca	hca	PROPN
fcis-25095	45	25	&	&	CCONJ
fcis-25095	45	26	de	de	X
fcis-25095	45	27	algorithm	algorithm	PROPN
fcis-25095	45	28	,	,	PUNCT
fcis-25095	45	29	perform	perform	VERB
fcis-25095	45	30	the	the	DET
fcis-25095	45	31	regular	regular	ADJ
fcis-25095	45	32	de	de	X
fcis-25095	45	33	mutation	mutation	NOUN
fcis-25095	45	34	,	,	PUNCT
fcis-25095	45	35	crossover	crossover	NOUN
fcis-25095	45	36	and	and	CCONJ
fcis-25095	45	37	selection	selection	NOUN
fcis-25095	45	38	operations	operation	NOUN
fcis-25095	45	39	,	,	PUNCT
fcis-25095	45	40	update	update	VERB
fcis-25095	45	41	the	the	DET
fcis-25095	45	42	current	current	ADJ
fcis-25095	45	43	population	population	NOUN
fcis-25095	45	44	solution	solution	NOUN
fcis-25095	45	45	and	and	CCONJ
fcis-25095	45	46	then	then	ADV
fcis-25095	45	47	select	select	VERB
fcis-25095	45	48	an	an	DET
fcis-25095	45	49	city	city	NOUN
fcis-25095	45	50	path	path	NOUN
fcis-25095	45	51	solution	solution	NOUN
fcis-25095	45	52	set	set	VERB
fcis-25095	45	53	i	i	PRON
fcis-25095	45	54	from	from	ADP
fcis-25095	45	55	the	the	DET
fcis-25095	45	56	current	current	ADJ
fcis-25095	45	57	population	population	NOUN
fcis-25095	45	58	in	in	ADP
fcis-25095	45	59	a	a	DET
fcis-25095	45	60	roulette	roulette	NOUN
fcis-25095	45	61	wheel	wheel	NOUN
fcis-25095	45	62	way	way	NOUN
fcis-25095	45	63	,	,	PUNCT
fcis-25095	45	64	and	and	CCONJ
fcis-25095	45	65	then	then	ADV
fcis-25095	45	66	enter	enter	VERB
fcis-25095	45	67	into	into	ADP
fcis-25095	45	68	the	the	DET
fcis-25095	45	69	hill	hill	NOUN
fcis-25095	45	70	-	-	PUNCT
fcis-25095	45	71	climbing	climb	VERB
fcis-25095	45	72	search	search	NOUN
fcis-25095	45	73	algorithm	algorithm	NOUN
fcis-25095	45	74	,	,	PUNCT
fcis-25095	45	75	which	which	PRON
fcis-25095	45	76	first	first	ADV
fcis-25095	45	77	performs	perform	VERB
fcis-25095	45	78	the	the	DET
fcis-25095	45	79	2opt	2opt	NUM
fcis-25095	45	80	algorithm	algorithm	NOUN
fcis-25095	45	81	to	to	PART
fcis-25095	45	82	form	form	VERB
fcis-25095	45	83	the	the	DET
fcis-25095	45	84	neighbors	neighbor	NOUN
fcis-25095	45	85	of	of	ADP
fcis-25095	45	86	the	the	DET
fcis-25095	45	87	current	current	ADJ
fcis-25095	45	88	solution	solution	NOUN
fcis-25095	45	89	,	,	PUNCT
fcis-25095	45	90	then	then	ADV
fcis-25095	45	91	the	the	DET
fcis-25095	45	92	2	2	NUM
fcis-25095	45	93	-	-	PUNCT
fcis-25095	45	94	opt	opt	NOUN
fcis-25095	45	95	algorithm	algorithm	NOUN
fcis-25095	45	96	to	to	PART
fcis-25095	45	97	form	form	VERB
fcis-25095	45	98	the	the	DET
fcis-25095	45	99	neighbors	neighbor	NOUN
fcis-25095	45	100	of	of	ADP
fcis-25095	45	101	the	the	DET
fcis-25095	45	102	current	current	ADJ
fcis-25095	45	103	solution	solution	NOUN
fcis-25095	45	104	.	.	PUNCT
fcis-25095	46	1	opt	opt	PROPN
fcis-25095	46	2	algorithm	algorithm	NOUN
fcis-25095	46	3	to	to	PART
fcis-25095	46	4	form	form	VERB
fcis-25095	46	5	the	the	DET
fcis-25095	46	6	neighbor	neighbor	NOUN
fcis-25095	46	7	s	s	PROPN
fcis-25095	46	8	of	of	ADP
fcis-25095	46	9	the	the	DET
fcis-25095	46	10	current	current	ADJ
fcis-25095	46	11	solution	solution	NOUN
fcis-25095	46	12	,	,	PUNCT
fcis-25095	46	13	if	if	SCONJ
fcis-25095	46	14	the	the	DET
fcis-25095	46	15	fitness	fitness	NOUN
fcis-25095	46	16	of	of	ADP
fcis-25095	46	17	all	all	DET
fcis-25095	46	18	the	the	DET
fcis-25095	46	19	individuals	individual	NOUN
fcis-25095	46	20	in	in	ADP
fcis-25095	46	21	the	the	DET
fcis-25095	46	22	current	current	ADJ
fcis-25095	46	23	neighbor	neighbor	NOUN
fcis-25095	46	24	s	s	PART
fcis-25095	46	25	is	be	AUX
fcis-25095	46	26	lower	low	ADJ
fcis-25095	46	27	than	than	ADP
fcis-25095	46	28	the	the	DET
fcis-25095	46	29	fitness	fitness	NOUN
fcis-25095	46	30	of	of	ADP
fcis-25095	46	31	the	the	DET
fcis-25095	46	32	current	current	ADJ
fcis-25095	46	33	optimal	optimal	ADJ
fcis-25095	46	34	solution	solution	NOUN
fcis-25095	46	35	,	,	PUNCT
fcis-25095	46	36	then	then	ADV
fcis-25095	46	37	enter	enter	VERB
fcis-25095	46	38	insert	insert	ADJ
fcis-25095	46	39	-	-	PUNCT
fcis-25095	46	40	swap	swap	ADJ
fcis-25095	46	41	swap	swap	NOUN
fcis-25095	46	42	algorithm	algorithm	NOUN
fcis-25095	46	43	,	,	PUNCT
fcis-25095	46	44	if	if	SCONJ
fcis-25095	46	45	the	the	DET
fcis-25095	46	46	fitness	fitness	NOUN
fcis-25095	46	47	of	of	ADP
fcis-25095	46	48	all	all	DET
fcis-25095	46	49	the	the	DET
fcis-25095	46	50	individuals	individual	NOUN
fcis-25095	46	51	in	in	ADP
fcis-25095	46	52	the	the	DET
fcis-25095	46	53	neighbor	neighbor	NOUN
fcis-25095	46	54	of	of	ADP
fcis-25095	46	55	the	the	DET
fcis-25095	46	56	current	current	ADJ
fcis-25095	46	57	solution	solution	NOUN
fcis-25095	46	58	formed	form	VERB
fcis-25095	46	59	by	by	ADP
fcis-25095	46	60	the	the	DET
fcis-25095	46	61	insert	insert	ADJ
fcis-25095	46	62	-	-	PUNCT
fcis-25095	46	63	swap	swap	ADJ
fcis-25095	46	64	algorithm	algorithm	NOUN
fcis-25095	46	65	is	be	AUX
fcis-25095	46	66	lower	low	ADJ
fcis-25095	46	67	than	than	ADP
fcis-25095	46	68	the	the	DET
fcis-25095	46	69	fitness	fitness	NOUN
fcis-25095	46	70	of	of	ADP
fcis-25095	46	71	the	the	DET
fcis-25095	46	72	current	current	ADJ
fcis-25095	46	73	optimal	optimal	ADJ
fcis-25095	46	74	solution	solution	NOUN
fcis-25095	46	75	,	,	PUNCT
fcis-25095	46	76	then	then	ADV
fcis-25095	46	77	enter	enter	VERB
fcis-25095	46	78	the	the	DET
fcis-25095	46	79	3	3	NUM
fcis-25095	46	80	-	-	PUNCT
fcis-25095	46	81	opt	opt	NOUN
fcis-25095	46	82	algorithm	algorithm	NOUN
fcis-25095	46	83	,	,	PUNCT
fcis-25095	46	84	and	and	CCONJ
fcis-25095	46	85	if	if	SCONJ
fcis-25095	46	86	it	it	PRON
fcis-25095	46	87	still	still	ADV
fcis-25095	46	88	ca	can	AUX
fcis-25095	46	89	n't	not	PART
fcis-25095	46	90	replace	replace	VERB
fcis-25095	46	91	the	the	DET
fcis-25095	46	92	optimal	optimal	ADJ
fcis-25095	46	93	solution	solution	NOUN
fcis-25095	46	94	,	,	PUNCT
fcis-25095	46	95	then	then	ADV
fcis-25095	46	96	the	the	DET
fcis-25095	46	97	hca&de	hca&de	NOUN
fcis-25095	46	98	will	will	AUX
fcis-25095	46	99	be	be	AUX
fcis-25095	46	100	used	use	VERB
fcis-25095	46	101	.	.	PUNCT
fcis-25095	47	1	the	the	DET
fcis-25095	47	2	current	current	ADJ
fcis-25095	47	3	round	round	NOUN
fcis-25095	47	4	of	of	ADP
fcis-25095	47	5	hca&de	hca&de	NOUN
fcis-25095	47	6	algorithm	algorithm	NOUN
fcis-25095	47	7	ends	end	VERB
fcis-25095	47	8	,	,	PUNCT
fcis-25095	47	9	so	so	SCONJ
fcis-25095	47	10	that	that	SCONJ
fcis-25095	47	11	the	the	DET
fcis-25095	47	12	number	number	NOUN
fcis-25095	47	13	of	of	ADP
fcis-25095	47	14	hca&de	hca&de	NOUN
fcis-25095	47	15	iterations	iteration	NOUN
fcis-25095	47	16	is	be	AUX
fcis-25095	47	17	increased	increase	VERB
fcis-25095	47	18	by	by	ADP
fcis-25095	47	19	1	1	NUM
fcis-25095	47	20	.	.	PUNCT
fcis-25095	48	1	if	if	SCONJ
fcis-25095	48	2	one	one	NUM
fcis-25095	48	3	of	of	ADP
fcis-25095	48	4	the	the	DET
fcis-25095	48	5	solutions	solution	NOUN
fcis-25095	48	6	generated	generate	VERB
fcis-25095	48	7	during	during	ADP
fcis-25095	48	8	the	the	DET
fcis-25095	48	9	execution	execution	NOUN
fcis-25095	48	10	of	of	ADP
fcis-25095	48	11	the	the	DET
fcis-25095	48	12	three	three	NUM
fcis-25095	48	13	local	local	ADJ
fcis-25095	48	14	search	search	NOUN
fcis-25095	48	15	algorithms	algorithms	NOUN
fcis-25095	48	16	is	be	AUX
fcis-25095	48	17	better	well	ADJ
fcis-25095	48	18	than	than	ADP
fcis-25095	48	19	the	the	DET
fcis-25095	48	20	current	current	ADJ
fcis-25095	48	21	optimal	optimal	ADJ
fcis-25095	48	22	solution	solution	NOUN
fcis-25095	48	23	,	,	PUNCT
fcis-25095	48	24	the	the	DET
fcis-25095	48	25	current	current	ADJ
fcis-25095	48	26	optimal	optimal	ADJ
fcis-25095	48	27	solution	solution	NOUN
fcis-25095	48	28	is	be	AUX
fcis-25095	48	29	updated	update	VERB
fcis-25095	48	30	immediately	immediately	ADV
fcis-25095	48	31	and	and	CCONJ
fcis-25095	48	32	the	the	DET
fcis-25095	48	33	search	search	NOUN
fcis-25095	48	34	is	be	AUX
fcis-25095	48	35	restarted	restart	VERB
fcis-25095	48	36	by	by	ADP
fcis-25095	48	37	jumping	jump	VERB
fcis-25095	48	38	to	to	ADP
fcis-25095	48	39	the	the	DET
fcis-25095	48	40	2	2	NUM
fcis-25095	48	41	-	-	PUNCT
fcis-25095	48	42	opt	opt	NOUN
fcis-25095	48	43	algorithm	algorithm	NOUN
fcis-25095	48	44	.	.	PUNCT
fcis-25095	49	1	the	the	DET
fcis-25095	49	2	hca&de	hca&de	NOUN
fcis-25095	49	3	algorithm	algorithm	NOUN
fcis-25095	49	4	ends	end	VERB
fcis-25095	49	5	when	when	SCONJ
fcis-25095	49	6	the	the	DET
fcis-25095	49	7	upper	upper	ADJ
fcis-25095	49	8	limit	limit	NOUN
fcis-25095	49	9	of	of	ADP
fcis-25095	49	10	the	the	DET
fcis-25095	49	11	hca&de	hca&de	NOUN
fcis-25095	49	12	algorithm	algorithm	NOUN
fcis-25095	49	13	iterations	iteration	NOUN
fcis-25095	49	14	is	be	AUX
fcis-25095	49	15	reached	reach	VERB
fcis-25095	49	16	.	.	PUNCT
fcis-25095	50	1	3.2	3.2	NUM
fcis-25095	50	2	.	.	PUNCT
fcis-25095	51	1	hca&de	hca&de	NOUN
fcis-25095	51	2	algorithm	algorithm	NOUN
fcis-25095	51	3	design	design	NOUN
fcis-25095	51	4	step1	step1	PROPN
fcis-25095	51	5	:	:	PUNCT
fcis-25095	51	6	initialize	initialize	VERB
fcis-25095	51	7	hca&de	hca&de	NOUN
fcis-25095	51	8	parameters	parameter	NOUN
fcis-25095	51	9	:	:	PUNCT
fcis-25095	51	10	set	set	VERB
fcis-25095	51	11	de	de	X
fcis-25095	51	12	mutation	mutation	NOUN
fcis-25095	51	13	probability	probability	NOUN
fcis-25095	51	14	0.08	0.08	NUM
fcis-25095	51	15	,	,	PUNCT
fcis-25095	51	16	crossover	crossover	VERB
fcis-25095	51	17	probability	probability	NOUN
fcis-25095	51	18	0.65	0.65	NUM
fcis-25095	51	19	,	,	PUNCT
fcis-25095	51	20	hca&de	hca&de	NOUN
fcis-25095	51	21	algorithm	algorithm	NOUN
fcis-25095	51	22	iteration	iteration	NOUN
fcis-25095	51	23	number	number	NOUN
fcis-25095	51	24	upper	upper	ADJ
fcis-25095	51	25	limit	limit	NOUN
fcis-25095	51	26	is	be	AUX
fcis-25095	51	27	800	800	NUM
fcis-25095	51	28	,	,	PUNCT
fcis-25095	51	29	population	population	NOUN
fcis-25095	51	30	size	size	NOUN
fcis-25095	51	31	pop_size=500	pop_size=500	PROPN
fcis-25095	51	32	,	,	PUNCT
fcis-25095	51	33	make	make	VERB
fcis-25095	51	34	current	current	ADJ
fcis-25095	51	35	hca&de	hca&de	NOUN
fcis-25095	51	36	iteration	iteration	NOUN
fcis-25095	51	37	count	count	NOUN
fcis-25095	51	38	variable	variable	ADJ
fcis-25095	51	39	g=0	g=0	NOUN
fcis-25095	51	40	,	,	PUNCT
fcis-25095	51	41	greedy	greedy	ADJ
fcis-25095	51	42	initialization	initialization	NOUN
fcis-25095	51	43	to	to	PART
fcis-25095	51	44	generate	generate	VERB
fcis-25095	51	45	initial	initial	ADJ
fcis-25095	51	46	population	population	NOUN
fcis-25095	51	47	p.	p.	PROPN
fcis-25095	51	48	step2	step2	PROPN
fcis-25095	51	49	:	:	PUNCT
fcis-25095	51	50	randomly	randomly	ADV
fcis-25095	51	51	select	select	VERB
fcis-25095	51	52	three	three	NUM
fcis-25095	51	53	solution	solution	NOUN
fcis-25095	51	54	sets	set	NOUN
fcis-25095	51	55	from	from	ADP
fcis-25095	51	56	the	the	DET
fcis-25095	51	57	current	current	ADJ
fcis-25095	51	58	population	population	NOUN
fcis-25095	51	59	,	,	PUNCT
fcis-25095	51	60	perform	perform	VERB
fcis-25095	51	61	de	de	X
fcis-25095	51	62	algorithm	algorithm	NOUN
fcis-25095	51	63	mutation	mutation	NOUN
fcis-25095	51	64	operation	operation	NOUN
fcis-25095	51	65	to	to	PART
fcis-25095	51	66	generate	generate	VERB
fcis-25095	51	67	new	new	ADJ
fcis-25095	51	68	city	city	NOUN
fcis-25095	51	69	solution	solution	NOUN
fcis-25095	51	70	paths	path	NOUN
fcis-25095	51	71	,	,	PUNCT
fcis-25095	51	72	and	and	CCONJ
fcis-25095	51	73	calculate	calculate	VERB
fcis-25095	51	74	the	the	DET
fcis-25095	51	75	fitness	fitness	NOUN
fcis-25095	51	76	of	of	ADP
fcis-25095	51	77	the	the	DET
fcis-25095	51	78	new	new	ADJ
fcis-25095	51	79	solutions	solution	NOUN
fcis-25095	51	80	.	.	PUNCT
fcis-25095	52	1	step3	step3	PROPN
fcis-25095	52	2	:	:	PUNCT
fcis-25095	52	3	select	select	ADJ
fcis-25095	52	4	city	city	NOUN
fcis-25095	52	5	solution	solution	NOUN
fcis-25095	52	6	sets	set	NOUN
fcis-25095	52	7	from	from	ADP
fcis-25095	52	8	the	the	DET
fcis-25095	52	9	current	current	ADJ
fcis-25095	52	10	population	population	NOUN
fcis-25095	52	11	and	and	CCONJ
fcis-25095	52	12	perform	perform	VERB
fcis-25095	52	13	de	de	X
fcis-25095	52	14	algorithm	algorithm	NOUN
fcis-25095	52	15	crossover	crossover	ADP
fcis-25095	52	16	operation	operation	NOUN
fcis-25095	52	17	with	with	ADP
fcis-25095	52	18	mutated	mutate	VERB
fcis-25095	52	19	individuals	individual	NOUN
fcis-25095	52	20	to	to	PART
fcis-25095	52	21	generate	generate	VERB
fcis-25095	52	22	new	new	ADJ
fcis-25095	52	23	city	city	NOUN
fcis-25095	52	24	solution	solution	NOUN
fcis-25095	52	25	paths	path	NOUN
fcis-25095	52	26	and	and	CCONJ
fcis-25095	52	27	calculate	calculate	VERB
fcis-25095	52	28	the	the	DET
fcis-25095	52	29	fitness	fitness	NOUN
fcis-25095	52	30	of	of	ADP
fcis-25095	52	31	new	new	ADJ
fcis-25095	52	32	solutions	solution	NOUN
fcis-25095	52	33	.	.	PUNCT
fcis-25095	53	1	step4	step4	PROPN
fcis-25095	53	2	:	:	PUNCT
fcis-25095	53	3	perform	perform	VERB
fcis-25095	53	4	the	the	DET
fcis-25095	53	5	de	de	X
fcis-25095	53	6	algorithm	algorithm	NOUN
fcis-25095	53	7	selection	selection	NOUN
fcis-25095	53	8	operation	operation	NOUN
fcis-25095	53	9	,	,	PUNCT
fcis-25095	53	10	update	update	VERB
fcis-25095	53	11	the	the	DET
fcis-25095	53	12	current	current	ADJ
fcis-25095	53	13	population	population	NOUN
fcis-25095	53	14	,	,	PUNCT
fcis-25095	53	15	and	and	CCONJ
fcis-25095	53	16	select	select	VERB
fcis-25095	53	17	an	an	DET
fcis-25095	53	18	city	city	NOUN
fcis-25095	53	19	solution	solution	NOUN
fcis-25095	53	20	set	set	VERB
fcis-25095	53	21	by	by	ADP
fcis-25095	53	22	the	the	DET
fcis-25095	53	23	rule	rule	NOUN
fcis-25095	53	24	of	of	ADP
fcis-25095	53	25	“	"	PUNCT
fcis-25095	53	26	roulette	roulette	NOUN
fcis-25095	53	27	”	"	PUNCT
fcis-25095	53	28	.	.	PUNCT
fcis-25095	54	1	step5	step5	PROPN
fcis-25095	54	2	:	:	PUNCT
fcis-25095	54	3	start	start	VERB
fcis-25095	54	4	hill	hill	NOUN
fcis-25095	54	5	-	-	PUNCT
fcis-25095	54	6	climbing	climb	VERB
fcis-25095	54	7	algorithm	algorithm	NOUN
fcis-25095	54	8	and	and	CCONJ
fcis-25095	54	9	select	select	VERB
fcis-25095	54	10	an	an	DET
fcis-25095	54	11	initial	initial	ADJ
fcis-25095	54	12	solution	solution	NOUN
fcis-25095	54	13	i	i	PRON
fcis-25095	54	14	in	in	ADP
fcis-25095	54	15	the	the	DET
fcis-25095	54	16	rule	rule	NOUN
fcis-25095	54	17	of	of	ADP
fcis-25095	54	18	“	"	PUNCT
fcis-25095	54	19	roulette	roulette	NOUN
fcis-25095	54	20	”	"	PUNCT
fcis-25095	54	21	.	.	PUNCT
fcis-25095	55	1	step6	step6	NOUN
fcis-25095	55	2	:	:	PUNCT
fcis-25095	55	3	execute	execute	VERB
fcis-25095	55	4	2	2	NUM
fcis-25095	55	5	-	-	PUNCT
fcis-25095	55	6	opt	opt	NOUN
fcis-25095	55	7	crossover	crossover	NOUN
fcis-25095	55	8	algorithm	algorithm	NOUN
fcis-25095	55	9	,	,	PUNCT
fcis-25095	55	10	randomly	randomly	ADV
fcis-25095	55	11	select	select	VERB
fcis-25095	55	12	two	two	NUM
fcis-25095	55	13	cities	city	NOUN
fcis-25095	55	14	at	at	ADP
fcis-25095	55	15	a	a	DET
fcis-25095	55	16	time	time	NOUN
fcis-25095	55	17	,	,	PUNCT
fcis-25095	55	18	exchange	exchange	VERB
fcis-25095	55	19	their	their	PRON
fcis-25095	55	20	order	order	NOUN
fcis-25095	55	21	in	in	ADP
fcis-25095	55	22	the	the	DET
fcis-25095	55	23	solution	solution	NOUN
fcis-25095	55	24	set	set	VERB
fcis-25095	55	25	,	,	PUNCT
fcis-25095	55	26	and	and	CCONJ
fcis-25095	55	27	form	form	VERB
fcis-25095	55	28	the	the	DET
fcis-25095	55	29	neighbor	neighbor	NOUN
fcis-25095	55	30	si1	si1	PROPN
fcis-25095	55	31	of	of	ADP
fcis-25095	55	32	the	the	DET
fcis-25095	55	33	current	current	ADJ
fcis-25095	55	34	solution	solution	NOUN
fcis-25095	55	35	,	,	PUNCT
fcis-25095	55	36	if	if	SCONJ
fcis-25095	55	37	there	there	PRON
fcis-25095	55	38	is	be	VERB
fcis-25095	55	39	a	a	DET
fcis-25095	55	40	better	well	ADJ
fcis-25095	55	41	solution	solution	NOUN
fcis-25095	55	42	than	than	ADP
fcis-25095	55	43	the	the	DET
fcis-25095	55	44	current	current	ADJ
fcis-25095	55	45	solution	solution	NOUN
fcis-25095	55	46	i	i	PRON
fcis-25095	55	47	in	in	ADP
fcis-25095	55	48	si1	si1	PROPN
fcis-25095	55	49	,	,	PUNCT
fcis-25095	55	50	update	update	VERB
fcis-25095	55	51	the	the	DET
fcis-25095	55	52	current	current	ADJ
fcis-25095	55	53	solution	solution	NOUN
fcis-25095	55	54	and	and	CCONJ
fcis-25095	55	55	re	re	NOUN
fcis-25095	55	56	-	-	NOUN
fcis-25095	55	57	execute	execute	VERB
fcis-25095	55	58	step6	step6	NOUN
fcis-25095	55	59	,	,	PUNCT
fcis-25095	55	60	otherwise	otherwise	ADV
fcis-25095	55	61	go	go	VERB
fcis-25095	55	62	to	to	ADP
fcis-25095	55	63	step7	step7	PROPN
fcis-25095	55	64	.	.	PUNCT
fcis-25095	56	1	step7	step7	PROPN
fcis-25095	56	2	:	:	PUNCT
fcis-25095	56	3	execute	execute	VERB
fcis-25095	56	4	insert	insert	ADJ
fcis-25095	56	5	-	-	PUNCT
fcis-25095	56	6	swap	swap	NOUN
fcis-25095	56	7	crossover	crossover	NOUN
fcis-25095	56	8	operator	operator	NOUN
fcis-25095	56	9	to	to	PART
fcis-25095	56	10	randomly	randomly	ADV
fcis-25095	56	11	select	select	VERB
fcis-25095	56	12	a	a	DET
fcis-25095	56	13	city	city	NOUN
fcis-25095	56	14	in	in	ADP
fcis-25095	56	15	an	an	DET
fcis-25095	56	16	interval	interval	NOUN
fcis-25095	56	17	and	and	CCONJ
fcis-25095	56	18	randomly	randomly	ADV
fcis-25095	56	19	insert	insert	VERB
fcis-25095	56	20	this	this	DET
fcis-25095	56	21	sequence	sequence	NOUN
fcis-25095	56	22	of	of	ADP
fcis-25095	56	23	cities	city	NOUN
fcis-25095	56	24	into	into	ADP
fcis-25095	56	25	another	another	DET
fcis-25095	56	26	position	position	NOUN
fcis-25095	56	27	in	in	ADP
fcis-25095	56	28	the	the	DET
fcis-25095	56	29	solution	solution	NOUN
fcis-25095	56	30	set	set	VERB
fcis-25095	56	31	to	to	PART
fcis-25095	56	32	form	form	VERB
fcis-25095	56	33	the	the	DET
fcis-25095	56	34	neighbor	neighbor	NOUN
fcis-25095	56	35	si2	si2	NOUN
fcis-25095	56	36	of	of	ADP
fcis-25095	56	37	the	the	DET
fcis-25095	56	38	current	current	ADJ
fcis-25095	56	39	solution	solution	NOUN
fcis-25095	56	40	,	,	PUNCT
fcis-25095	56	41	if	if	SCONJ
fcis-25095	56	42	there	there	PRON
fcis-25095	56	43	exists	exist	VERB
fcis-25095	56	44	a	a	DET
fcis-25095	56	45	solution	solution	NOUN
fcis-25095	56	46	in	in	ADP
fcis-25095	56	47	si2	si2	NOUN
fcis-25095	56	48	that	that	PRON
fcis-25095	56	49	is	be	AUX
fcis-25095	56	50	better	well	ADJ
fcis-25095	56	51	than	than	ADP
fcis-25095	56	52	the	the	DET
fcis-25095	56	53	current	current	ADJ
fcis-25095	56	54	solution	solution	NOUN
fcis-25095	57	1	i	i	PRON
fcis-25095	57	2	,	,	PUNCT
fcis-25095	57	3	then	then	ADV
fcis-25095	57	4	update	update	VERB
fcis-25095	57	5	the	the	DET
fcis-25095	57	6	current	current	ADJ
fcis-25095	57	7	solution	solution	NOUN
fcis-25095	57	8	and	and	CCONJ
fcis-25095	57	9	execute	execute	VERB
fcis-25095	57	10	step6	step6	NOUN
fcis-25095	57	11	,	,	PUNCT
fcis-25095	57	12	otherwise	otherwise	ADV
fcis-25095	57	13	go	go	VERB
fcis-25095	57	14	to	to	ADP
fcis-25095	57	15	step8	step8	NOUN
fcis-25095	57	16	.	.	PUNCT
fcis-25095	58	1	step8	step8	ADJ
fcis-25095	58	2	:	:	PUNCT
fcis-25095	58	3	perform	perform	VERB
fcis-25095	58	4	3	3	NUM
fcis-25095	58	5	-	-	PUNCT
fcis-25095	58	6	opt	opt	NOUN
fcis-25095	58	7	algorithm	algorithm	NOUN
fcis-25095	58	8	operation	operation	NOUN
fcis-25095	58	9	,	,	PUNCT
fcis-25095	58	10	randomly	randomly	ADV
fcis-25095	58	11	select	select	VERB
fcis-25095	58	12	three	three	NUM
fcis-25095	58	13	cities	city	NOUN
fcis-25095	58	14	at	at	ADP
fcis-25095	58	15	a	a	DET
fcis-25095	58	16	time	time	NOUN
fcis-25095	58	17	to	to	PART
fcis-25095	58	18	form	form	VERB
fcis-25095	58	19	the	the	DET
fcis-25095	58	20	neighbor	neighbor	NOUN
fcis-25095	58	21	si3	si3	PROPN
fcis-25095	58	22	of	of	ADP
fcis-25095	58	23	the	the	DET
fcis-25095	58	24	current	current	ADJ
fcis-25095	58	25	solution	solution	NOUN
fcis-25095	58	26	,	,	PUNCT
fcis-25095	58	27	if	if	SCONJ
fcis-25095	58	28	there	there	PRON
fcis-25095	58	29	exists	exist	VERB
fcis-25095	58	30	a	a	DET
fcis-25095	58	31	better	well	ADJ
fcis-25095	58	32	solution	solution	NOUN
fcis-25095	58	33	than	than	ADP
fcis-25095	58	34	the	the	DET
fcis-25095	58	35	current	current	ADJ
fcis-25095	58	36	solution	solution	NOUN
fcis-25095	58	37	i	i	PRON
fcis-25095	58	38	in	in	ADP
fcis-25095	58	39	si3	si3	PROPN
fcis-25095	58	40	,	,	PUNCT
fcis-25095	58	41	update	update	VERB
fcis-25095	58	42	the	the	DET
fcis-25095	58	43	current	current	ADJ
fcis-25095	58	44	solution	solution	NOUN
fcis-25095	58	45	and	and	CCONJ
fcis-25095	58	46	execute	execute	VERB
fcis-25095	58	47	step6	step6	NOUN
fcis-25095	58	48	,	,	PUNCT
fcis-25095	58	49	otherwise	otherwise	ADV
fcis-25095	58	50	go	go	VERB
fcis-25095	58	51	to	to	ADP
fcis-25095	58	52	step9	step9	NOUN
fcis-25095	58	53	.	.	PUNCT
fcis-25095	59	1	step9	step9	NOUN
fcis-25095	59	2	:	:	PUNCT
fcis-25095	59	3	make	make	VERB
fcis-25095	59	4	g	g	PRON
fcis-25095	59	5	=	=	NOUN
fcis-25095	59	6	g+1,if	g+1,if	VERB
fcis-25095	59	7	g<800	g<800	AUX
fcis-25095	59	8	then	then	ADV
fcis-25095	59	9	go	go	VERB
fcis-25095	59	10	to	to	ADP
fcis-25095	59	11	step2,otherwise	step2,otherwise	NOUN
fcis-25095	59	12	it	it	PRON
fcis-25095	59	13	represents	represent	VERB
fcis-25095	59	14	that	that	SCONJ
fcis-25095	59	15	the	the	DET
fcis-25095	59	16	upper	upper	ADJ
fcis-25095	59	17	limit	limit	NOUN
fcis-25095	59	18	of	of	ADP
fcis-25095	59	19	iteration	iteration	NOUN
fcis-25095	59	20	number	number	NOUN
fcis-25095	59	21	of	of	ADP
fcis-25095	59	22	hca&de	hca&de	NOUN
fcis-25095	59	23	algorithm	algorithm	NOUN
fcis-25095	59	24	is	be	AUX
fcis-25095	59	25	reached	reach	VERB
fcis-25095	59	26	at	at	ADP
fcis-25095	59	27	this	this	DET
fcis-25095	59	28	time	time	NOUN
fcis-25095	59	29	,	,	PUNCT
fcis-25095	59	30	end	end	VERB
fcis-25095	59	31	hca&de	hca&de	NOUN
fcis-25095	59	32	algorithm	algorithm	NOUN
fcis-25095	59	33	.	.	PUNCT
fcis-25095	60	1	4	4	X
fcis-25095	60	2	.	.	X
fcis-25095	60	3	experiment	experiment	VERB
fcis-25095	60	4	the	the	DET
fcis-25095	60	5	hca&de	hca&de	NOUN
fcis-25095	60	6	algorithm	algorithm	NOUN
fcis-25095	60	7	proposed	propose	VERB
fcis-25095	60	8	in	in	ADP
fcis-25095	60	9	this	this	DET
fcis-25095	60	10	paper	paper	NOUN
fcis-25095	60	11	is	be	AUX
fcis-25095	60	12	implemented	implement	VERB
fcis-25095	60	13	in	in	ADP
fcis-25095	60	14	codeblocks	codeblock	NOUN
fcis-25095	60	15	software	software	NOUN
fcis-25095	60	16	using	use	VERB
fcis-25095	60	17	c++	c++	NOUN
fcis-25095	60	18	.	.	PUNCT
fcis-25095	61	1	in	in	ADP
fcis-25095	61	2	order	order	NOUN
fcis-25095	61	3	to	to	PART
fcis-25095	61	4	test	test	VERB
fcis-25095	61	5	the	the	DET
fcis-25095	61	6	performance	performance	NOUN
fcis-25095	61	7	of	of	ADP
fcis-25095	61	8	the	the	DET
fcis-25095	61	9	hca&de	hca&de	NOUN
fcis-25095	61	10	algorithm	algorithm	NOUN
fcis-25095	61	11	in	in	ADP
fcis-25095	61	12	solving	solve	VERB
fcis-25095	61	13	the	the	DET
fcis-25095	61	14	multi	multi	ADJ
fcis-25095	61	15	-	-	ADJ
fcis-25095	61	16	starting	starting	ADJ
fcis-25095	61	17	-	-	PUNCT
fcis-25095	61	18	point	point	NOUN
fcis-25095	61	19	mtsp	mtsp	NOUN
fcis-25095	61	20	problem	problem	NOUN
fcis-25095	61	21	and	and	CCONJ
fcis-25095	61	22	to	to	PART
fcis-25095	61	23	compare	compare	VERB
fcis-25095	61	24	the	the	DET
fcis-25095	61	25	difference	difference	NOUN
fcis-25095	61	26	in	in	ADP
fcis-25095	61	27	performance	performance	NOUN
fcis-25095	61	28	between	between	ADP
fcis-25095	61	29	the	the	DET
fcis-25095	61	30	hca&de	hca&de	NOUN
fcis-25095	61	31	algorithm	algorithm	NOUN
fcis-25095	61	32	and	and	CCONJ
fcis-25095	61	33	the	the	DET
fcis-25095	61	34	ordinary	ordinary	ADJ
fcis-25095	61	35	de	de	X
fcis-25095	61	36	algorithm	algorithm	NOUN
fcis-25095	61	37	,	,	PUNCT
fcis-25095	61	38	we	we	PRON
fcis-25095	61	39	use	use	VERB
fcis-25095	61	40	the	the	DET
fcis-25095	61	41	tsplib	tsplib	PROPN
fcis-25095	61	42	test	test	NOUN
fcis-25095	61	43	dataset	dataset	VERB
fcis-25095	61	44	and	and	CCONJ
fcis-25095	61	45	choose	choose	VERB
fcis-25095	61	46	three	three	NUM
fcis-25095	61	47	city	city	NOUN
fcis-25095	61	48	datasets	dataset	NOUN
fcis-25095	61	49	with	with	ADP
fcis-25095	61	50	a	a	DET
fcis-25095	61	51	large	large	ADJ
fcis-25095	61	52	difference	difference	NOUN
fcis-25095	61	53	in	in	ADP
fcis-25095	61	54	the	the	DET
fcis-25095	61	55	number	number	NOUN
fcis-25095	61	56	of	of	ADP
fcis-25095	61	57	cities	city	NOUN
fcis-25095	61	58	,	,	PUNCT
fcis-25095	61	59	for	for	ADP
fcis-25095	61	60	each	each	DET
fcis-25095	61	61	test	test	NOUN
fcis-25095	61	62	set	set	NOUN
fcis-25095	61	63	,	,	PUNCT
fcis-25095	61	64	we	we	PRON
fcis-25095	61	65	set	set	VERB
fcis-25095	61	66	the	the	DET
fcis-25095	61	67	number	number	NOUN
fcis-25095	61	68	of	of	ADP
fcis-25095	61	69	travel	travel	NOUN
fcis-25095	61	70	quotients	quotient	NOUN
fcis-25095	61	71	as	as	ADP
fcis-25095	61	72	4	4	NUM
fcis-25095	61	73	,	,	PUNCT
fcis-25095	61	74	8	8	NUM
fcis-25095	61	75	,	,	PUNCT
fcis-25095	61	76	and	and	CCONJ
fcis-25095	61	77	12	12	NUM
fcis-25095	61	78	,	,	PUNCT
fcis-25095	61	79	and	and	CCONJ
fcis-25095	61	80	set	set	VERB
fcis-25095	61	81	fixed	fix	VERB
fcis-25095	61	82	starting	starting	NOUN
fcis-25095	61	83	points	point	NOUN
fcis-25095	61	84	for	for	ADP
fcis-25095	61	85	each	each	PRON
fcis-25095	61	86	of	of	ADP
fcis-25095	61	87	them	they	PRON
fcis-25095	61	88	,	,	PUNCT
fcis-25095	61	89	after	after	ADP
fcis-25095	61	90	which	which	PRON
fcis-25095	61	91	the	the	DET
fcis-25095	61	92	algorithm	algorithm	NOUN
fcis-25095	61	93	is	be	AUX
fcis-25095	61	94	run	run	VERB
fcis-25095	61	95	for	for	ADP
fcis-25095	61	96	testing	testing	NOUN
fcis-25095	61	97	.	.	PUNCT
fcis-25095	62	1	in	in	ADP
fcis-25095	62	2	order	order	NOUN
fcis-25095	62	3	to	to	PART
fcis-25095	62	4	set	set	VERB
fcis-25095	62	5	the	the	DET
fcis-25095	62	6	optimal	optimal	ADJ
fcis-25095	62	7	hca&de	hca&de	NOUN
fcis-25095	62	8	algorithm	algorithm	NOUN
fcis-25095	62	9	parameters	parameter	NOUN
fcis-25095	62	10	for	for	ADP
fcis-25095	62	11	the	the	DET
fcis-25095	62	12	multi	multi	ADJ
fcis-25095	62	13	-	-	ADJ
fcis-25095	62	14	starting	starting	ADJ
fcis-25095	62	15	point	point	NOUN
fcis-25095	62	16	mtsp	mtsp	NOUN
fcis-25095	62	17	problem	problem	NOUN
fcis-25095	62	18	,	,	PUNCT
fcis-25095	62	19	we	we	PRON
fcis-25095	62	20	utilize	utilize	VERB
fcis-25095	62	21	the	the	DET
fcis-25095	62	22	eil51	eil51	PROPN
fcis-25095	62	23	dataset	dataset	PROPN
fcis-25095	62	24	,	,	PUNCT
fcis-25095	62	25	which	which	PRON
fcis-25095	62	26	has	have	VERB
fcis-25095	62	27	fewer	few	ADJ
fcis-25095	62	28	cities	city	NOUN
fcis-25095	62	29	and	and	CCONJ
fcis-25095	62	30	is	be	AUX
fcis-25095	62	31	relatively	relatively	ADV
fcis-25095	62	32	easy	easy	ADJ
fcis-25095	62	33	to	to	PART
fcis-25095	62	34	compute	compute	VERB
fcis-25095	62	35	the	the	DET
fcis-25095	62	36	optimal	optimal	ADJ
fcis-25095	62	37	solution	solution	NOUN
fcis-25095	62	38	,	,	PUNCT
fcis-25095	62	39	for	for	ADP
fcis-25095	62	40	the	the	DET
fcis-25095	62	41	parameter	parameter	NOUN
fcis-25095	62	42	test	test	NOUN
fcis-25095	62	43	,	,	PUNCT
fcis-25095	62	44	and	and	CCONJ
fcis-25095	62	45	finally	finally	ADV
fcis-25095	62	46	determine	determine	VERB
fcis-25095	62	47	the	the	DET
fcis-25095	62	48	optimal	optimal	ADJ
fcis-25095	62	49	crossover	crossover	NOUN
fcis-25095	62	50	probability	probability	NOUN
fcis-25095	62	51	parameter	parameter	NOUN
fcis-25095	62	52	for	for	ADP
fcis-25095	62	53	the	the	DET
fcis-25095	62	54	de	de	X
fcis-25095	62	55	algorithm	algorithm	NOUN
fcis-25095	62	56	to	to	PART
fcis-25095	62	57	be	be	AUX
fcis-25095	62	58	0.65	0.65	NUM
fcis-25095	62	59	,	,	PUNCT
fcis-25095	62	60	the	the	DET
fcis-25095	62	61	variance	variance	NOUN
fcis-25095	62	62	probability	probability	NOUN
fcis-25095	62	63	to	to	PART
fcis-25095	62	64	be	be	AUX
fcis-25095	62	65	0.08	0.08	NUM
fcis-25095	62	66	,	,	PUNCT
fcis-25095	62	67	the	the	DET
fcis-25095	62	68	population	population	NOUN
fcis-25095	62	69	size	size	NOUN
fcis-25095	62	70	to	to	PART
fcis-25095	62	71	be	be	AUX
fcis-25095	62	72	500	500	NUM
fcis-25095	62	73	,	,	PUNCT
fcis-25095	62	74	and	and	CCONJ
fcis-25095	62	75	the	the	DET
fcis-25095	62	76	upper	upper	ADJ
fcis-25095	62	77	limit	limit	NOUN
fcis-25095	62	78	of	of	ADP
fcis-25095	62	79	the	the	DET
fcis-25095	62	80	iteration	iteration	NOUN
fcis-25095	62	81	number	number	NOUN
fcis-25095	62	82	of	of	ADP
fcis-25095	62	83	the	the	DET
fcis-25095	62	84	hca&de	hca&de	NOUN
fcis-25095	62	85	algorithm	algorithm	NOUN
fcis-25095	62	86	to	to	PART
fcis-25095	62	87	be	be	AUX
fcis-25095	62	88	800	800	NUM
fcis-25095	62	89	.	.	PUNCT
fcis-25095	62	90	table	table	NOUN
fcis-25095	62	91	1	1	NUM
fcis-25095	62	92	gives	give	VERB
fcis-25095	62	93	the	the	DET
fcis-25095	62	94	optimal	optimal	ADJ
fcis-25095	62	95	paths	path	NOUN
fcis-25095	62	96	generated	generate	VERB
fcis-25095	62	97	by	by	ADP
fcis-25095	62	98	de	de	X
fcis-25095	62	99	algorithm	algorithm	PROPN
fcis-25095	62	100	,	,	PUNCT
fcis-25095	62	101	hca	hca	ADJ
fcis-25095	62	102	algorithm	algorithm	NOUN
fcis-25095	62	103	and	and	CCONJ
fcis-25095	62	104	hca&de	hca&de	NOUN
fcis-25095	62	105	algorithm	algorithm	NOUN
fcis-25095	62	106	under	under	ADP
fcis-25095	62	107	the	the	DET
fcis-25095	62	108	test	test	NOUN
fcis-25095	62	109	of	of	ADP
fcis-25095	62	110	dataset	dataset	NOUN
fcis-25095	62	111	with	with	ADP
fcis-25095	62	112	city	city	NOUN
fcis-25095	62	113	size	size	NOUN
fcis-25095	62	114	of	of	ADP
fcis-25095	62	115	51,100,150	51,100,150	NUM
fcis-25095	62	116	.	.	PUNCT
fcis-25095	63	1	the	the	DET
fcis-25095	63	2	data	datum	NOUN
fcis-25095	63	3	show	show	VERB
fcis-25095	63	4	that	that	SCONJ
fcis-25095	63	5	under	under	ADP
fcis-25095	63	6	the	the	DET
fcis-25095	63	7	same	same	ADJ
fcis-25095	63	8	parameter	parameter	NOUN
fcis-25095	63	9	settings	setting	NOUN
fcis-25095	63	10	,	,	PUNCT
fcis-25095	63	11	hca&de	hca&de	NOUN
fcis-25095	63	12	is	be	AUX
fcis-25095	63	13	not	not	PART
fcis-25095	63	14	only	only	ADV
fcis-25095	63	15	able	able	ADJ
fcis-25095	63	16	to	to	PART
fcis-25095	63	17	find	find	VERB
fcis-25095	63	18	a	a	DET
fcis-25095	63	19	better	well	ADJ
fcis-25095	63	20	path	path	NOUN
fcis-25095	63	21	to	to	ADP
fcis-25095	63	22	the	the	DET
fcis-25095	63	23	city	city	NOUN
fcis-25095	63	24	solution	solution	NOUN
fcis-25095	63	25	set	set	NOUN
fcis-25095	63	26	,	,	PUNCT
fcis-25095	63	27	but	but	CCONJ
fcis-25095	63	28	also	also	ADV
fcis-25095	63	29	the	the	DET
fcis-25095	63	30	solution	solution	NOUN
fcis-25095	63	31	differences	difference	NOUN
fcis-25095	63	32	are	be	AUX
fcis-25095	63	33	more	more	ADV
fcis-25095	63	34	stable	stable	ADJ
fcis-25095	63	35	than	than	ADP
fcis-25095	63	36	the	the	DET
fcis-25095	63	37	ordinary	ordinary	ADJ
fcis-25095	63	38	de	de	X
fcis-25095	63	39	algorithm	algorithm	NOUN
fcis-25095	63	40	and	and	CCONJ
fcis-25095	63	41	hca	hca	ADJ
fcis-25095	63	42	algorithm	algorithm	NOUN
fcis-25095	63	43	,	,	PUNCT
fcis-25095	63	44	which	which	PRON
fcis-25095	63	45	proves	prove	VERB
fcis-25095	63	46	that	that	SCONJ
fcis-25095	63	47	hca&de	hca&de	NOUN
fcis-25095	63	48	can	can	AUX
fcis-25095	63	49	jump	jump	VERB
fcis-25095	63	50	out	out	ADP
fcis-25095	63	51	of	of	ADP
fcis-25095	63	52	the	the	DET
fcis-25095	63	53	localoptimum	localoptimum	NOUN
fcis-25095	63	54	timely	timely	ADV
fcis-25095	63	55	when	when	SCONJ
fcis-25095	63	56	the	the	DET
fcis-25095	63	57	algorithm	algorithm	NOUN
fcis-25095	63	58	falls	fall	VERB
fcis-25095	63	59	into	into	ADP
fcis-25095	63	60	the	the	DET
fcis-25095	63	61	local	local	ADJ
fcis-25095	63	62	optimum	optimum	NOUN
fcis-25095	63	63	,	,	PUNCT
fcis-25095	63	64	ensure	ensure	VERB
fcis-25095	63	65	the	the	DET
fcis-25095	63	66	diversity	diversity	NOUN
fcis-25095	63	67	of	of	ADP
fcis-25095	63	68	the	the	DET
fcis-25095	63	69	population	population	NOUN
fcis-25095	63	70	solution	solution	NOUN
fcis-25095	63	71	,	,	PUNCT
fcis-25095	63	72	and	and	CCONJ
fcis-25095	63	73	find	find	VERB
fcis-25095	63	74	the	the	DET
fcis-25095	63	75	optimal	optimal	ADJ
fcis-25095	63	76	solution	solution	NOUN
fcis-25095	63	77	with	with	ADP
fcis-25095	63	78	a	a	DET
fcis-25095	63	79	greater	great	ADJ
fcis-25095	63	80	probability	probability	NOUN
fcis-25095	63	81	.	.	PUNCT
fcis-25095	64	1	table	table	NOUN
fcis-25095	64	2	1	1	NUM
fcis-25095	64	3	.	.	PUNCT
fcis-25095	65	1	running	run	VERB
fcis-25095	65	2	results	result	NOUN
fcis-25095	65	3	of	of	ADP
fcis-25095	65	4	de	de	X
fcis-25095	65	5	algorithm	algorithm	NOUN
fcis-25095	65	6	,	,	PUNCT
fcis-25095	65	7	hca	hca	ADJ
fcis-25095	65	8	algorithm	algorithm	NOUN
fcis-25095	65	9	and	and	CCONJ
fcis-25095	65	10	hca&de	hca&de	NOUN
fcis-25095	65	11	algorithm	algorithm	NOUN
fcis-25095	65	12	number	number	NOUN
fcis-25095	65	13	of	of	ADP
fcis-25095	65	14	cities	city	NOUN
fcis-25095	65	15	number	number	NOUN
fcis-25095	65	16	of	of	ADP
fcis-25095	65	17	salesman	salesman	NOUN
fcis-25095	65	18	de	de	X
fcis-25095	65	19	hca	hca	X
fcis-25095	65	20	hca&de	hca&de	PROPN
fcis-25095	65	21	best	good	ADJ
fcis-25095	65	22	average	average	ADJ
fcis-25095	65	23	best	good	ADJ
fcis-25095	65	24	average	average	ADJ
fcis-25095	65	25	best	good	ADJ
fcis-25095	65	26	average	average	ADJ
fcis-25095	65	27	51	51	NUM
fcis-25095	65	28	4	4	NUM
fcis-25095	65	29	507	507	NUM
fcis-25095	65	30	530	530	NUM
fcis-25095	65	31	516	516	NUM
fcis-25095	65	32	543	543	NUM
fcis-25095	65	33	497	497	NUM
fcis-25095	65	34	513	513	NUM
fcis-25095	65	35	8	8	NUM
fcis-25095	65	36	673	673	NUM
fcis-25095	65	37	702	702	NUM
fcis-25095	65	38	656	656	NUM
fcis-25095	65	39	708	708	NUM
fcis-25095	65	40	613	613	NUM
fcis-25095	65	41	640	640	NUM
fcis-25095	65	42	12	12	NUM
fcis-25095	65	43	987	987	NUM
fcis-25095	65	44	1033	1033	NUM
fcis-25095	65	45	946	946	NUM
fcis-25095	65	46	979	979	NUM
fcis-25095	65	47	876	876	NUM
fcis-25095	65	48	891	891	NUM
fcis-25095	65	49	100	100	NUM
fcis-25095	65	50	4	4	NUM
fcis-25095	65	51	26475	26475	NUM
fcis-25095	65	52	28571	28571	NUM
fcis-25095	65	53	24968	24968	NUM
fcis-25095	65	54	26092	26092	NUM
fcis-25095	65	55	23377	23377	NUM
fcis-25095	65	56	23609	23609	NUM
fcis-25095	65	57	8	8	NUM
fcis-25095	65	58	27876	27876	NUM
fcis-25095	65	59	31016	31016	NUM
fcis-25095	65	60	27348	27348	NUM
fcis-25095	65	61	31648	31648	NUM
fcis-25095	65	62	25099	25099	NUM
fcis-25095	65	63	26002	26002	NUM
fcis-25095	65	64	12	12	NUM
fcis-25095	65	65	32547	32547	NUM
fcis-25095	65	66	34879	34879	NUM
fcis-25095	65	67	31954	31954	NUM
fcis-25095	65	68	33399	33399	NUM
fcis-25095	65	69	30174	30174	NUM
fcis-25095	65	70	30453	30453	NUM
fcis-25095	65	71	150	150	NUM
fcis-25095	65	72	4	4	NUM
fcis-25095	65	73	30153	30153	NUM
fcis-25095	65	74	31797	31797	NUM
fcis-25095	65	75	30092	30092	NUM
fcis-25095	65	76	32017	32017	NUM
fcis-25095	65	77	28176	28176	NUM
fcis-25095	65	78	28791	28791	NUM
fcis-25095	65	79	8	8	NUM
fcis-25095	65	80	39880	39880	NUM
fcis-25095	65	81	43097	43097	NUM
fcis-25095	65	82	38987	38987	NUM
fcis-25095	65	83	40188	40188	NUM
fcis-25095	65	84	34049	34049	NUM
fcis-25095	65	85	36804	36804	NUM
fcis-25095	65	86	12	12	NUM
fcis-25095	65	87	48901	48901	NUM
fcis-25095	65	88	50013	50013	NUM
fcis-25095	65	89	49073	49073	NUM
fcis-25095	65	90	49975	49975	NUM
fcis-25095	65	91	38042	38042	NUM
fcis-25095	65	92	40035	40035	NUM
fcis-25095	65	93	7	7	NUM
fcis-25095	65	94	5	5	NUM
fcis-25095	65	95	.	.	PUNCT
fcis-25095	65	96	conclusion	conclusion	NOUN
fcis-25095	65	97	in	in	ADP
fcis-25095	65	98	this	this	DET
fcis-25095	65	99	paper	paper	NOUN
fcis-25095	65	100	,	,	PUNCT
fcis-25095	65	101	for	for	ADP
fcis-25095	65	102	the	the	DET
fcis-25095	65	103	shortcomings	shortcoming	NOUN
fcis-25095	65	104	of	of	ADP
fcis-25095	65	105	de	de	X
fcis-25095	65	106	algorithm	algorithm	NOUN
fcis-25095	65	107	which	which	PRON
fcis-25095	65	108	is	be	AUX
fcis-25095	65	109	easy	easy	ADJ
fcis-25095	65	110	to	to	PART
fcis-25095	65	111	fall	fall	VERB
fcis-25095	65	112	into	into	ADP
fcis-25095	65	113	local	local	ADJ
fcis-25095	65	114	optimization	optimization	NOUN
fcis-25095	65	115	,	,	PUNCT
fcis-25095	65	116	the	the	DET
fcis-25095	65	117	hill	hill	NOUN
fcis-25095	65	118	-	-	PUNCT
fcis-25095	65	119	climbing	climb	VERB
fcis-25095	65	120	search	search	NOUN
fcis-25095	65	121	algorithm	algorithm	NOUN
fcis-25095	65	122	is	be	AUX
fcis-25095	65	123	introduced	introduce	VERB
fcis-25095	65	124	to	to	PART
fcis-25095	65	125	enhance	enhance	VERB
fcis-25095	65	126	the	the	DET
fcis-25095	65	127	local	local	ADJ
fcis-25095	65	128	search	search	NOUN
fcis-25095	65	129	ability	ability	NOUN
fcis-25095	65	130	of	of	ADP
fcis-25095	65	131	de	de	X
fcis-25095	65	132	algorithm	algorithm	NOUN
fcis-25095	65	133	,	,	PUNCT
fcis-25095	65	134	so	so	SCONJ
fcis-25095	65	135	that	that	SCONJ
fcis-25095	65	136	de	de	X
fcis-25095	65	137	algorithm	algorithm	NOUN
fcis-25095	65	138	can	can	AUX
fcis-25095	65	139	jump	jump	VERB
fcis-25095	65	140	out	out	ADP
fcis-25095	65	141	of	of	ADP
fcis-25095	65	142	the	the	DET
fcis-25095	65	143	local	local	ADJ
fcis-25095	65	144	optimization	optimization	NOUN
fcis-25095	65	145	in	in	ADP
fcis-25095	65	146	time	time	NOUN
fcis-25095	65	147	and	and	CCONJ
fcis-25095	65	148	obtain	obtain	VERB
fcis-25095	65	149	the	the	DET
fcis-25095	65	150	optimal	optimal	ADJ
fcis-25095	65	151	solution	solution	NOUN
fcis-25095	65	152	more	more	ADV
fcis-25095	65	153	efficiently	efficiently	ADV
fcis-25095	65	154	.	.	PUNCT
fcis-25095	66	1	the	the	DET
fcis-25095	66	2	experimental	experimental	ADJ
fcis-25095	66	3	data	datum	NOUN
fcis-25095	66	4	proves	prove	VERB
fcis-25095	66	5	that	that	SCONJ
fcis-25095	66	6	for	for	ADP
fcis-25095	66	7	the	the	DET
fcis-25095	66	8	multistart	multistart	ADJ
fcis-25095	66	9	mtsp	mtsp	NOUN
fcis-25095	66	10	problem	problem	NOUN
fcis-25095	66	11	,	,	PUNCT
fcis-25095	66	12	the	the	DET
fcis-25095	66	13	results	result	NOUN
fcis-25095	66	14	of	of	ADP
fcis-25095	66	15	the	the	DET
fcis-25095	66	16	hca&de	hca&de	NOUN
fcis-25095	66	17	algorithm	algorithm	NOUN
fcis-25095	66	18	proposed	propose	VERB
fcis-25095	66	19	in	in	ADP
fcis-25095	66	20	this	this	DET
fcis-25095	66	21	paper	paper	NOUN
fcis-25095	66	22	are	be	AUX
fcis-25095	66	23	proved	prove	VERB
fcis-25095	66	24	to	to	PART
fcis-25095	66	25	be	be	AUX
fcis-25095	66	26	better	well	ADJ
fcis-25095	66	27	than	than	ADP
fcis-25095	66	28	the	the	DET
fcis-25095	66	29	ordinary	ordinary	ADJ
fcis-25095	66	30	de	de	X
fcis-25095	66	31	algorithm	algorithm	NOUN
fcis-25095	66	32	and	and	CCONJ
fcis-25095	66	33	the	the	DET
fcis-25095	66	34	ordinary	ordinary	ADJ
fcis-25095	66	35	hill	hill	NOUN
fcis-25095	66	36	-	-	PUNCT
fcis-25095	66	37	climbing	climb	VERB
fcis-25095	66	38	search	search	NOUN
fcis-25095	66	39	algorithm	algorithm	NOUN
fcis-25095	66	40	,	,	PUNCT
fcis-25095	66	41	and	and	CCONJ
fcis-25095	66	42	the	the	DET
fcis-25095	66	43	probability	probability	NOUN
fcis-25095	66	44	of	of	ADP
fcis-25095	66	45	obtaining	obtain	VERB
fcis-25095	66	46	the	the	DET
fcis-25095	66	47	optimal	optimal	ADJ
fcis-25095	66	48	solution	solution	NOUN
fcis-25095	66	49	is	be	AUX
fcis-25095	66	50	larger	large	ADJ
fcis-25095	66	51	,	,	PUNCT
fcis-25095	66	52	which	which	PRON
fcis-25095	66	53	proves	prove	VERB
fcis-25095	66	54	that	that	SCONJ
fcis-25095	66	55	the	the	DET
fcis-25095	66	56	hca&de	hca&de	NOUN
fcis-25095	66	57	algorithm	algorithm	NOUN
fcis-25095	66	58	combines	combine	VERB
fcis-25095	66	59	the	the	DET
fcis-25095	66	60	local	local	ADJ
fcis-25095	66	61	search	search	NOUN
fcis-25095	66	62	ability	ability	NOUN
fcis-25095	66	63	of	of	ADP
fcis-25095	66	64	the	the	DET
fcis-25095	66	65	hca	hca	ADJ
fcis-25095	66	66	algorithm	algorithm	NOUN
fcis-25095	66	67	and	and	CCONJ
fcis-25095	66	68	the	the	DET
fcis-25095	66	69	global	global	ADJ
fcis-25095	66	70	search	search	NOUN
fcis-25095	66	71	ability	ability	NOUN
fcis-25095	66	72	of	of	ADP
fcis-25095	66	73	the	the	DET
fcis-25095	66	74	de	de	X
fcis-25095	66	75	algorithm	algorithm	NOUN
fcis-25095	66	76	,	,	PUNCT
fcis-25095	66	77	and	and	CCONJ
fcis-25095	66	78	proves	prove	VERB
fcis-25095	66	79	the	the	DET
fcis-25095	66	80	effectiveness	effectiveness	NOUN
fcis-25095	66	81	of	of	ADP
fcis-25095	66	82	the	the	DET
fcis-25095	66	83	hca&de	hca&de	NOUN
fcis-25095	66	84	algorithm	algorithm	NOUN
fcis-25095	66	85	.	.	PUNCT
fcis-25095	67	1	however	however	ADV
fcis-25095	67	2	,	,	PUNCT
fcis-25095	67	3	the	the	DET
fcis-25095	67	4	time	time	NOUN
fcis-25095	67	5	complexity	complexity	NOUN
fcis-25095	67	6	of	of	ADP
fcis-25095	67	7	hca&de	hca&de	NOUN
fcis-25095	67	8	algorithm	algorithm	NOUN
fcis-25095	67	9	is	be	AUX
fcis-25095	67	10	larger	large	ADJ
fcis-25095	67	11	,	,	PUNCT
fcis-25095	67	12	and	and	CCONJ
fcis-25095	67	13	with	with	ADP
fcis-25095	67	14	the	the	DET
fcis-25095	67	15	increase	increase	NOUN
fcis-25095	67	16	of	of	ADP
fcis-25095	67	17	city	city	NOUN
fcis-25095	67	18	scale	scale	NOUN
fcis-25095	67	19	,	,	PUNCT
fcis-25095	67	20	the	the	DET
fcis-25095	67	21	time	time	NOUN
fcis-25095	67	22	complexity	complexity	NOUN
fcis-25095	67	23	of	of	ADP
fcis-25095	67	24	hca&de	hca&de	NOUN
fcis-25095	67	25	algorithm	algorithm	NOUN
fcis-25095	67	26	needs	need	VERB
fcis-25095	67	27	to	to	PART
fcis-25095	67	28	be	be	AUX
fcis-25095	67	29	further	far	ADV
fcis-25095	67	30	improved	improve	VERB
fcis-25095	67	31	.	.	PUNCT
fcis-25095	68	1	acknowledgments	acknowledgment	NOUN
fcis-25095	68	2	this	this	DET
fcis-25095	68	3	work	work	NOUN
fcis-25095	68	4	it	it	PRON
fcis-25095	68	5	was	be	AUX
fcis-25095	68	6	supported	support	VERB
fcis-25095	68	7	by	by	ADP
fcis-25095	68	8	national	national	ADJ
fcis-25095	68	9	college	college	PROPN
fcis-25095	68	10	students	student	NOUN
fcis-25095	68	11	'	'	PART
fcis-25095	68	12	innovation	innovation	NOUN
fcis-25095	68	13	and	and	CCONJ
fcis-25095	68	14	entrepreneurship	entrepreneurship	NOUN
fcis-25095	68	15	training	training	NOUN
fcis-25095	68	16	program	program	NOUN
fcis-25095	68	17	project	project	NOUN
fcis-25095	68	18	(	(	PUNCT
fcis-25095	68	19	no	no	INTJ
fcis-25095	68	20	.	.	PUNCT
fcis-25095	68	21	?	?	PUNCT
fcis-25095	68	22	?	?	PUNCT
fcis-25095	68	23	?	?	PUNCT
fcis-25095	68	24	)	)	PUNCT
fcis-25095	68	25	.	.	PUNCT
fcis-25095	69	1	references	reference	NOUN
fcis-25095	69	2	[	[	X
fcis-25095	69	3	1	1	NUM
fcis-25095	69	4	]	]	X
fcis-25095	69	5	zhao	zhao	PROPN
fcis-25095	69	6	xiaoqiang	xiaoqiang	PROPN
fcis-25095	69	7	,	,	PUNCT
fcis-25095	69	8	tuo	tuo	NOUN
fcis-25095	69	9	mingfu	mingfu	NOUN
fcis-25095	69	10	.	.	PUNCT
fcis-25095	70	1	an	an	DET
fcis-25095	70	2	applied	apply	VERB
fcis-25095	70	3	study	study	NOUN
fcis-25095	70	4	of	of	ADP
fcis-25095	70	5	task	task	PROPN
fcis-25095	70	6	planning	planning	NOUN
fcis-25095	70	7	problem	problem	NOUN
fcis-25095	70	8	based	base	VERB
fcis-25095	70	9	on	on	ADP
fcis-25095	70	10	multi	multi	ADJ
fcis-25095	70	11	-	-	ADJ
fcis-25095	70	12	traveler	traveler	ADJ
fcis-25095	70	13	problem	problem	NOUN
fcis-25095	70	14	model	model	NOUN
fcis-25095	70	15	for	for	ADP
fcis-25095	70	16	solving	solve	VERB
fcis-25095	70	17	workload	workload	NOUN
fcis-25095	70	18	equalization[j	equalization[j	ADJ
fcis-25095	70	19	]	]	PUNCT
fcis-25095	70	20	.	.	PUNCT
fcis-25095	71	1	internet	internet	NOUN
fcis-25095	71	2	of	of	ADP
fcis-25095	71	3	things	thing	NOUN
fcis-25095	71	4	technology	technology	NOUN
fcis-25095	71	5	,	,	PUNCT
fcis-25095	71	6	2024,14(07	2024,14(07	NUM
fcis-25095	71	7	):	):	PUNCT
fcis-25095	71	8	84	84	NUM
fcis-25095	71	9	-	-	SYM
fcis-25095	71	10	89.doi:10.16667	89.doi:10.16667	NUM
fcis-25095	71	11	/	/	SYM
fcis-25095	71	12	j.issn.20951302	j.issn.20951302	NOUN
fcis-25095	71	13	.	.	PUNCT
fcis-25095	72	1	2024.07.022	2024.07.022	NOUN
fcis-25095	72	2	.	.	PUNCT
fcis-25095	73	1	[	[	X
fcis-25095	73	2	2	2	NUM
fcis-25095	73	3	]	]	X
fcis-25095	73	4	yang	yang	PROPN
fcis-25095	73	5	hua	hua	PROPN
fcis-25095	73	6	,	,	PUNCT
fcis-25095	73	7	chen	chen	PROPN
fcis-25095	73	8	yanhua	yanhua	PROPN
fcis-25095	73	9	,	,	PUNCT
fcis-25095	73	10	li	li	PROPN
fcis-25095	73	11	hongyi	hongyi	PROPN
fcis-25095	73	12	.	.	PUNCT
fcis-25095	74	1	automatic	automatic	ADJ
fcis-25095	74	2	preparation	preparation	NOUN
fcis-25095	74	3	method	method	NOUN
fcis-25095	74	4	of	of	ADP
fcis-25095	74	5	contact	contact	NOUN
fcis-25095	74	6	network	network	NOUN
fcis-25095	74	7	maintenance	maintenance	NOUN
fcis-25095	74	8	plan	plan	NOUN
fcis-25095	74	9	based	base	VERB
fcis-25095	74	10	on	on	ADP
fcis-25095	74	11	multi	multi	ADJ
fcis-25095	74	12	-	-	NOUN
fcis-25095	74	13	traveler	traveler	NOUN
fcis-25095	74	14	problem[j	problem[j	NOUN
fcis-25095	74	15	]	]	PUNCT
fcis-25095	74	16	.	.	PUNCT
fcis-25095	75	1	electrified	electrify	VERB
fcis-25095	75	2	railway,2023,34(01	railway,2023,34(01	PROPN
fcis-25095	75	3	):	):	PUNCT
fcis-25095	75	4	81	81	NUM
fcis-25095	75	5	-	-	PUNCT
fcis-25095	75	6	85.doi:10.19587	85.doi:10.19587	NUM
fcis-25095	75	7	/	/	SYM
fcis-25095	75	8	j.cnki.1007	j.cnki.1007	ADJ
fcis-25095	75	9	-	-	PUNCT
fcis-25095	75	10	936x.2023.01.016	936x.2023.01.016	NOUN
fcis-25095	75	11	.	.	PUNCT
fcis-25095	76	1	[	[	X
fcis-25095	76	2	3	3	X
fcis-25095	76	3	]	]	X
fcis-25095	76	4	liu	liu	PROPN
fcis-25095	76	5	pin	pin	PROPN
fcis-25095	76	6	.	.	PUNCT
fcis-25095	77	1	research	research	NOUN
fcis-25095	77	2	based	base	VERB
fcis-25095	77	3	on	on	ADP
fcis-25095	77	4	two	two	NUM
fcis-25095	77	5	-	-	PUNCT
fcis-25095	77	6	stage	stage	NOUN
fcis-25095	77	7	heuristic	heuristic	ADJ
fcis-25095	77	8	algorithm	algorithm	NOUN
fcis-25095	77	9	for	for	ADP
fcis-25095	77	10	multi	multi	ADJ
fcis-25095	77	11	-	-	ADJ
fcis-25095	77	12	traveler	traveler	ADJ
fcis-25095	77	13	problem[d].northern	problem[d].northern	ADJ
fcis-25095	77	14	-	-	PUNCT
fcis-25095	77	15	nationalities	nationality	NOUN
fcis-25095	77	16	-	-	PUNCT
fcis-25095	77	17	university	university	NOUN
fcis-25095	77	18	,	,	PUNCT
fcis-25095	77	19	2024	2024	NUM
fcis-25095	77	20	.	.	PUNCT
fcis-25095	78	1	doi:10.27754	doi:10.27754	PROPN
fcis-25095	78	2	/	/	SYM
fcis-25095	78	3	d.cnki.gbfmz.2024.000383	d.cnki.gbfmz.2024.000383	NOUN
fcis-25095	78	4	.	.	PUNCT
fcis-25095	79	1	[	[	X
fcis-25095	79	2	4	4	X
fcis-25095	79	3	]	]	X
fcis-25095	79	4	bao	bao	PROPN
fcis-25095	79	5	cong.research	cong.research	PROPN
fcis-25095	79	6	on	on	ADP
fcis-25095	79	7	evolutionary	evolutionary	ADJ
fcis-25095	79	8	algorithms	algorithm	NOUN
fcis-25095	79	9	for	for	ADP
fcis-25095	79	10	accessconstrained	accessconstraine	VERB
fcis-25095	79	11	multi	multi	ADJ
fcis-25095	79	12	-	-	ADJ
fcis-25095	79	13	traveler	traveler	ADJ
fcis-25095	79	14	problem[d	problem[d	NOUN
fcis-25095	79	15	]	]	PUNCT
fcis-25095	79	16	.	.	PUNCT
fcis-25095	80	1	nanjing	nanjing	PROPN
fcis-25095	80	2	university	university	PROPN
fcis-25095	80	3	of	of	ADP
fcis-25095	80	4	information	information	NOUN
fcis-25095	80	5	engineering	engineering	NOUN
fcis-25095	80	6	,	,	PUNCT
fcis-25095	80	7	2023.doi	2023.doi	NUM
fcis-25095	80	8	:	:	SYM
fcis-25095	80	9	10.27248/	10.27248/	NUM
fcis-25095	80	10	d.cnki	d.cnki	NOUN
fcis-25095	80	11	.	.	PUNCT
fcis-25095	81	1	gnjqc	gnjqc	PROPN
fcis-25095	81	2	.	.	PUNCT
fcis-25095	82	1	2023.001033	2023.001033	NUM
fcis-25095	82	2	.	.	PUNCT
fcis-25095	83	1	[	[	X
fcis-25095	83	2	5	5	NUM
fcis-25095	83	3	]	]	X
fcis-25095	83	4	h.r	h.r	PROPN
fcis-25095	83	5	.	.	PROPN
fcis-25095	83	6	zhu	zhu	PROPN
fcis-25095	83	7	.	.	PUNCT
fcis-25095	84	1	research	research	NOUN
fcis-25095	84	2	on	on	ADP
fcis-25095	84	3	improving	improve	VERB
fcis-25095	84	4	monophilic	monophilic	ADJ
fcis-25095	84	5	genetic	genetic	ADJ
fcis-25095	84	6	algorithm	algorithm	NOUN
fcis-25095	84	7	to	to	PART
fcis-25095	84	8	solve	solve	VERB
fcis-25095	84	9	multi	multi	ADJ
fcis-25095	84	10	-	-	NOUN
fcis-25095	84	11	travelerproblem[d	travelerproblem[d	ADJ
fcis-25095	84	12	]	]	PUNCT
fcis-25095	84	13	.	.	PUNCT
fcis-25095	85	1	west	west	PROPN
fcis-25095	85	2	-	-	PUNCT
fcis-25095	85	3	chinanormaluniversity,2023.doi:10.27859	chinanormaluniversity,2023.doi:10.27859	NOUN
fcis-25095	85	4	/	/	SYM
fcis-25095	85	5	d.cnki.gxhsf.2023.000	d.cnki.gxhsf.2023.000	ADJ
fcis-25095	85	6	111	111	NUM
fcis-25095	85	7	.	.	PUNCT
fcis-25095	86	1	[	[	X
fcis-25095	86	2	6	6	NUM
fcis-25095	86	3	]	]	PUNCT
fcis-25095	86	4	dong	dong	PROPN
fcis-25095	86	5	yafei	yafei	PROPN
fcis-25095	86	6	.	.	PUNCT
fcis-25095	87	1	optimization	optimization	NOUN
fcis-25095	87	2	study	study	NOUN
fcis-25095	87	3	of	of	ADP
fcis-25095	87	4	two	two	NUM
fcis-25095	87	5	classes	class	NOUN
fcis-25095	87	6	of	of	ADP
fcis-25095	87	7	complex	complex	ADJ
fcis-25095	87	8	multi	multi	ADJ
fcis-25095	87	9	-	-	NOUN
fcis-25095	87	10	traveler	traveler	NOUN
fcis-25095	87	11	problems	problem	NOUN
fcis-25095	87	12	based	base	VERB
fcis-25095	87	13	on	on	ADP
fcis-25095	87	14	evolutionary	evolutionary	ADJ
fcis-25095	87	15	algorithms[d	algorithms[d	PROPN
fcis-25095	87	16	]	]	PUNCT
fcis-25095	87	17	.	.	PUNCT
fcis-25095	88	1	chongqing	chongqing	PROPN
fcis-25095	88	2	university	university	PROPN
fcis-25095	88	3	,	,	PUNCT
fcis-25095	88	4	2022.doi	2022.doi	NUM
fcis-25095	88	5	:	:	PUNCT
fcis-25095	88	6	10.27670/	10.27670/	NUM
fcis-25095	88	7	d.cnki	d.cnki	NOUN
fcis-25095	88	8	.	.	PUNCT
fcis-25095	89	1	gcqdu	gcqdu	PROPN
fcis-25095	89	2	.	.	PUNCT
fcis-25095	90	1	2022.002674	2022.002674	VERB
fcis-25095	90	2	.	.	PUNCT
fcis-25095	91	1	[	[	X
fcis-25095	91	2	7	7	X
fcis-25095	91	3	]	]	X
fcis-25095	91	4	sun	sun	NOUN
fcis-25095	91	5	bing	bing	NOUN
fcis-25095	91	6	,	,	PUNCT
fcis-25095	91	7	wang	wang	PROPN
fcis-25095	91	8	chuan	chuan	PROPN
fcis-25095	91	9	,	,	PUNCT
fcis-25095	91	10	yang	yang	PROPN
fcis-25095	91	11	qiang	qiang	PROPN
fcis-25095	91	12	,	,	PUNCT
fcis-25095	91	13	et	et	PROPN
fcis-25095	91	14	al	al	PROPN
fcis-25095	91	15	.	.	PROPN
fcis-25095	92	1	evolutionary	evolutionary	ADJ
fcis-25095	92	2	algorithms	algorithm	NOUN
fcis-25095	92	3	for	for	ADP
fcis-25095	92	4	the	the	DET
fcis-25095	92	5	multiple	multiple	ADJ
fcis-25095	92	6	starting	starting	NOUN
fcis-25095	92	7	point	point	NOUN
fcis-25095	92	8	equilibrium	equilibrium	NOUN
fcis-25095	92	9	multitraveler	multitraveler	NOUN
fcis-25095	92	10	problem[j	problem[j	NOUN
fcis-25095	92	11	]	]	PUNCT
fcis-25095	92	12	.	.	PUNCT
fcis-25095	93	1	computer	computer	NOUN
fcis-25095	93	2	engineering	engineering	NOUN
fcis-25095	93	3	and	and	CCONJ
fcis-25095	93	4	design	design	NOUN
fcis-25095	93	5	,	,	PUNCT
fcis-25095	93	6	2023	2023	NUM
fcis-25095	93	7	,	,	PUNCT
fcis-25095	93	8	44(07):2030	44(07):2030	X
fcis-25095	93	9	-	-	SYM
fcis-25095	93	10	2038.doi:10.16208	2038.doi:10.16208	VERB
fcis-25095	93	11	/	/	SYM
fcis-25095	93	12	j.issn1000	j.issn1000	PROPN
fcis-25095	93	13	-	-	PUNCT
fcis-25095	93	14	7024	7024	NUM
fcis-25095	93	15	.	.	PUNCT
fcis-25095	94	1	2023.07.015	2023.07.015	X
fcis-25095	94	2	.	.	PUNCT