id	sid	tid	token	lemma	pos
ijassa-821	1	1	adv	adv	PROPN
ijassa-821	1	2	syst	syst	PROPN
ijassa-821	1	3	sci	sci	PROPN
ijassa-821	1	4	appl	appl	PROPN
ijassa-821	1	5	2020	2020	NUM
ijassa-821	1	6	;	;	PUNCT
ijassa-821	1	7	02:32–43	02:32–43	PROPN
ijassa-821	1	8	published	publish	VERB
ijassa-821	1	9	online	online	ADV
ijassa-821	1	10	at	at	ADP
ijassa-821	1	11	https://ijassa.ipu.ru	https://ijassa.ipu.ru	ADV
ijassa-821	1	12	.	.	PUNCT
ijassa-821	2	1	original	original	ADJ
ijassa-821	2	2	russian	russian	ADJ
ijassa-821	2	3	text	text	NOUN
ijassa-821	2	4	©	©	PROPN
ijassa-821	2	5	v.	v.	ADP
ijassa-821	2	6	v.	v.	CCONJ
ijassa-821	2	7	zakharov	zakharov	PROPN
ijassa-821	2	8	,	,	PUNCT
ijassa-821	2	9	a.	a.	NOUN
ijassa-821	2	10	v.	v.	ADP
ijassa-821	2	11	mugayskikh	mugayskikh	NOUN
ijassa-821	2	12	,	,	PUNCT
ijassa-821	2	13	2018	2018	NUM
ijassa-821	2	14	,	,	PUNCT
ijassa-821	2	15	published	publish	VERB
ijassa-821	2	16	in	in	ADP
ijassa-821	2	17	upravlenie	upravlenie	NOUN
ijassa-821	2	18	bol’shimi	bol’shimi	NOUN
ijassa-821	2	19	sistemami	sistemami	NOUN
ijassa-821	2	20	/	/	PUNCT
ijassa-821	2	21	large	large	ADJ
ijassa-821	2	22	-	-	PUNCT
ijassa-821	2	23	scale	scale	NOUN
ijassa-821	2	24	systems	system	NOUN
ijassa-821	2	25	control	control	NOUN
ijassa-821	2	26	,	,	PUNCT
ijassa-821	2	27	2018	2018	NUM
ijassa-821	2	28	,	,	PUNCT
ijassa-821	2	29	no	no	INTJ
ijassa-821	2	30	.	.	NOUN
ijassa-821	2	31	73	73	NUM
ijassa-821	2	32	,	,	PUNCT
ijassa-821	2	33	pp	pp	ADJ
ijassa-821	2	34	.	.	PUNCT
ijassa-821	3	1	108	108	NUM
ijassa-821	3	2	-	-	SYM
ijassa-821	3	3	133	133	NUM
ijassa-821	3	4	.	.	PUNCT
ijassa-821	4	1	dynamic	dynamic	ADJ
ijassa-821	4	2	adaptation	adaptation	NOUN
ijassa-821	4	3	of	of	ADP
ijassa-821	4	4	genetic	genetic	ADJ
ijassa-821	4	5	algorithm	algorithm	NOUN
ijassa-821	4	6	for	for	ADP
ijassa-821	4	7	solving	solve	VERB
ijassa-821	4	8	routing	routing	NOUN
ijassa-821	4	9	problems	problem	NOUN
ijassa-821	4	10	on	on	ADP
ijassa-821	4	11	large	large	ADJ
ijassa-821	4	12	scale	scale	NOUN
ijassa-821	4	13	systems	system	NOUN
ijassa-821	4	14	viktor	viktor	NOUN
ijassa-821	4	15	zakharov1	zakharov1	NOUN
ijassa-821	4	16	,	,	PUNCT
ijassa-821	4	17	alexander	alexander	NOUN
ijassa-821	4	18	mugayskikh1	mugayskikh1	PROPN
ijassa-821	4	19	*	*	PROPN
ijassa-821	4	20	1saint	1saint	NUM
ijassa-821	4	21	petersburg	petersburg	PROPN
ijassa-821	4	22	state	state	PROPN
ijassa-821	4	23	university	university	PROPN
ijassa-821	4	24	,	,	PUNCT
ijassa-821	4	25	saint	saint	PROPN
ijassa-821	4	26	petersburg	petersburg	PROPN
ijassa-821	4	27	,	,	PUNCT
ijassa-821	4	28	russia	russia	PROPN
ijassa-821	4	29	abstract	abstract	NOUN
ijassa-821	4	30	:	:	PUNCT
ijassa-821	4	31	this	this	DET
ijassa-821	4	32	paper	paper	NOUN
ijassa-821	4	33	is	be	AUX
ijassa-821	4	34	devoted	devote	VERB
ijassa-821	4	35	to	to	ADP
ijassa-821	4	36	the	the	DET
ijassa-821	4	37	implementation	implementation	NOUN
ijassa-821	4	38	of	of	ADP
ijassa-821	4	39	the	the	DET
ijassa-821	4	40	dynamic	dynamic	ADJ
ijassa-821	4	41	adaptation	adaptation	NOUN
ijassa-821	4	42	procedure	procedure	NOUN
ijassa-821	4	43	for	for	ADP
ijassa-821	4	44	the	the	DET
ijassa-821	4	45	genetic	genetic	ADJ
ijassa-821	4	46	algorithm	algorithm	NOUN
ijassa-821	4	47	used	use	VERB
ijassa-821	4	48	for	for	ADP
ijassa-821	4	49	solving	solve	VERB
ijassa-821	4	50	large	large	ADJ
ijassa-821	4	51	-	-	PUNCT
ijassa-821	4	52	scale	scale	NOUN
ijassa-821	4	53	travelling	travel	VERB
ijassa-821	4	54	salesman	salesman	ADJ
ijassa-821	4	55	problem	problem	NOUN
ijassa-821	4	56	.	.	PUNCT
ijassa-821	5	1	this	this	DET
ijassa-821	5	2	procedure	procedure	NOUN
ijassa-821	5	3	serves	serve	VERB
ijassa-821	5	4	to	to	PART
ijassa-821	5	5	obtain	obtain	VERB
ijassa-821	5	6	more	more	ADV
ijassa-821	5	7	profitable	profitable	ADJ
ijassa-821	5	8	solutions	solution	NOUN
ijassa-821	5	9	by	by	ADP
ijassa-821	5	10	a	a	DET
ijassa-821	5	11	fixed	fix	VERB
ijassa-821	5	12	operating	operating	NOUN
ijassa-821	5	13	time	time	NOUN
ijassa-821	5	14	.	.	PUNCT
ijassa-821	6	1	in	in	ADP
ijassa-821	6	2	order	order	NOUN
ijassa-821	6	3	to	to	PART
ijassa-821	6	4	evaluate	evaluate	VERB
ijassa-821	6	5	effectiveness	effectiveness	NOUN
ijassa-821	6	6	of	of	ADP
ijassa-821	6	7	new	new	ADJ
ijassa-821	6	8	approach	approach	NOUN
ijassa-821	6	9	computational	computational	ADJ
ijassa-821	6	10	experiments	experiment	NOUN
ijassa-821	6	11	were	be	AUX
ijassa-821	6	12	performed	perform	VERB
ijassa-821	6	13	on	on	ADP
ijassa-821	6	14	well	well	ADV
ijassa-821	6	15	-	-	PUNCT
ijassa-821	6	16	known	know	VERB
ijassa-821	6	17	problem	problem	NOUN
ijassa-821	6	18	instances	instance	NOUN
ijassa-821	6	19	from	from	ADP
ijassa-821	6	20	tsplib	tsplib	PROPN
ijassa-821	6	21	library	library	NOUN
ijassa-821	6	22	.	.	PUNCT
ijassa-821	7	1	as	as	ADP
ijassa-821	7	2	a	a	DET
ijassa-821	7	3	result	result	NOUN
ijassa-821	7	4	,	,	PUNCT
ijassa-821	7	5	generated	generate	VERB
ijassa-821	7	6	solutions	solution	NOUN
ijassa-821	7	7	reduce	reduce	VERB
ijassa-821	7	8	the	the	DET
ijassa-821	7	9	length	length	NOUN
ijassa-821	7	10	of	of	ADP
ijassa-821	7	11	the	the	DET
ijassa-821	7	12	routing	routing	NOUN
ijassa-821	7	13	plans	plan	NOUN
ijassa-821	7	14	in	in	ADP
ijassa-821	7	15	considered	considered	ADJ
ijassa-821	7	16	problem	problem	NOUN
ijassa-821	7	17	instances	instance	NOUN
ijassa-821	7	18	compare	compare	VERB
ijassa-821	7	19	to	to	ADP
ijassa-821	7	20	classical	classical	ADJ
ijassa-821	7	21	genetic	genetic	ADJ
ijassa-821	7	22	heuristics	heuristic	NOUN
ijassa-821	7	23	.	.	PUNCT
ijassa-821	8	1	by	by	ADP
ijassa-821	8	2	that	that	PRON
ijassa-821	8	3	,	,	PUNCT
ijassa-821	8	4	we	we	PRON
ijassa-821	8	5	show	show	VERB
ijassa-821	8	6	how	how	SCONJ
ijassa-821	8	7	to	to	PART
ijassa-821	8	8	use	use	VERB
ijassa-821	8	9	the	the	DET
ijassa-821	8	10	property	property	NOUN
ijassa-821	8	11	of	of	ADP
ijassa-821	8	12	time	time	NOUN
ijassa-821	8	13	inconsistency	inconsistency	NOUN
ijassa-821	8	14	of	of	ADP
ijassa-821	8	15	heuristics	heuristic	NOUN
ijassa-821	8	16	to	to	PART
ijassa-821	8	17	get	get	VERB
ijassa-821	8	18	better	well	ADJ
ijassa-821	8	19	solutions	solution	NOUN
ijassa-821	8	20	.	.	PUNCT
ijassa-821	9	1	new	new	ADJ
ijassa-821	9	2	criteria	criterion	NOUN
ijassa-821	9	3	for	for	ADP
ijassa-821	9	4	estimating	estimate	VERB
ijassa-821	9	5	the	the	DET
ijassa-821	9	6	efficiency	efficiency	NOUN
ijassa-821	9	7	of	of	ADP
ijassa-821	9	8	heuristics	heuristic	NOUN
ijassa-821	9	9	algorithms	algorithm	NOUN
ijassa-821	9	10	called	call	VERB
ijassa-821	9	11	experimental	experimental	ADJ
ijassa-821	9	12	level	level	NOUN
ijassa-821	9	13	of	of	ADP
ijassa-821	9	14	time	time	NOUN
ijassa-821	9	15	consistency	consistency	NOUN
ijassa-821	9	16	is	be	AUX
ijassa-821	9	17	introduced	introduce	VERB
ijassa-821	9	18	.	.	PUNCT
ijassa-821	10	1	keywords	keyword	NOUN
ijassa-821	10	2	:	:	PUNCT
ijassa-821	10	3	time	time	NOUN
ijassa-821	10	4	consistency	consistency	NOUN
ijassa-821	10	5	,	,	PUNCT
ijassa-821	10	6	genetic	genetic	ADJ
ijassa-821	10	7	algorithm	algorithm	NOUN
ijassa-821	10	8	,	,	PUNCT
ijassa-821	10	9	vehicle	vehicle	NOUN
ijassa-821	10	10	routing	routing	NOUN
ijassa-821	10	11	problem	problem	NOUN
ijassa-821	10	12	1	1	NUM
ijassa-821	10	13	.	.	PUNCT
ijassa-821	11	1	introduction	introduction	NOUN
ijassa-821	11	2	one	one	NUM
ijassa-821	11	3	of	of	ADP
ijassa-821	11	4	the	the	DET
ijassa-821	11	5	most	most	ADV
ijassa-821	11	6	challenging	challenging	ADJ
ijassa-821	11	7	goals	goal	NOUN
ijassa-821	11	8	in	in	ADP
ijassa-821	11	9	the	the	DET
ijassa-821	11	10	field	field	NOUN
ijassa-821	11	11	of	of	ADP
ijassa-821	11	12	transportation	transportation	NOUN
ijassa-821	11	13	logistics	logistic	NOUN
ijassa-821	11	14	is	be	AUX
ijassa-821	11	15	cost	cost	NOUN
ijassa-821	11	16	optimization	optimization	NOUN
ijassa-821	11	17	,	,	PUNCT
ijassa-821	11	18	which	which	PRON
ijassa-821	11	19	allows	allow	VERB
ijassa-821	11	20	to	to	PART
ijassa-821	11	21	increase	increase	VERB
ijassa-821	11	22	company	company	NOUN
ijassa-821	11	23	’s	’s	PART
ijassa-821	11	24	benefit	benefit	NOUN
ijassa-821	11	25	for	for	ADP
ijassa-821	11	26	the	the	DET
ijassa-821	11	27	same	same	ADJ
ijassa-821	11	28	amount	amount	NOUN
ijassa-821	11	29	of	of	ADP
ijassa-821	11	30	resources	resource	NOUN
ijassa-821	11	31	used	use	VERB
ijassa-821	11	32	.	.	PUNCT
ijassa-821	12	1	for	for	ADP
ijassa-821	12	2	transportation	transportation	NOUN
ijassa-821	12	3	companies	company	NOUN
ijassa-821	12	4	,	,	PUNCT
ijassa-821	12	5	reduced	reduce	VERB
ijassa-821	12	6	costs	cost	NOUN
ijassa-821	12	7	can	can	AUX
ijassa-821	12	8	be	be	AUX
ijassa-821	12	9	achieved	achieve	VERB
ijassa-821	12	10	by	by	ADP
ijassa-821	12	11	constructing	construct	VERB
ijassa-821	12	12	effective	effective	ADJ
ijassa-821	12	13	route	route	NOUN
ijassa-821	12	14	plans	plan	NOUN
ijassa-821	12	15	for	for	ADP
ijassa-821	12	16	the	the	DET
ijassa-821	12	17	vehicles	vehicle	NOUN
ijassa-821	12	18	.	.	PUNCT
ijassa-821	13	1	a	a	DET
ijassa-821	13	2	significant	significant	ADJ
ijassa-821	13	3	effect	effect	NOUN
ijassa-821	13	4	of	of	ADP
ijassa-821	13	5	cost	cost	NOUN
ijassa-821	13	6	reduction	reduction	NOUN
ijassa-821	13	7	can	can	AUX
ijassa-821	13	8	be	be	AUX
ijassa-821	13	9	shown	show	VERB
ijassa-821	13	10	on	on	ADP
ijassa-821	13	11	large	large	ADJ
ijassa-821	13	12	transport	transport	NOUN
ijassa-821	13	13	networks	network	NOUN
ijassa-821	13	14	.	.	PUNCT
ijassa-821	14	1	for	for	ADP
ijassa-821	14	2	this	this	DET
ijassa-821	14	3	reason	reason	NOUN
ijassa-821	14	4	,	,	PUNCT
ijassa-821	14	5	researches	research	VERB
ijassa-821	14	6	pay	pay	VERB
ijassa-821	14	7	much	much	ADJ
ijassa-821	14	8	attention	attention	NOUN
ijassa-821	14	9	to	to	ADP
ijassa-821	14	10	models	model	NOUN
ijassa-821	14	11	and	and	CCONJ
ijassa-821	14	12	methods	method	NOUN
ijassa-821	14	13	which	which	PRON
ijassa-821	14	14	generate	generate	VERB
ijassa-821	14	15	less	less	ADV
ijassa-821	14	16	expensive	expensive	ADJ
ijassa-821	14	17	solutions	solution	NOUN
ijassa-821	14	18	in	in	ADP
ijassa-821	14	19	the	the	DET
ijassa-821	14	20	routing	routing	NOUN
ijassa-821	14	21	problems	problem	NOUN
ijassa-821	14	22	.	.	PUNCT
ijassa-821	15	1	probably	probably	ADV
ijassa-821	15	2	,	,	PUNCT
ijassa-821	15	3	the	the	DET
ijassa-821	15	4	most	most	ADV
ijassa-821	15	5	important	important	ADJ
ijassa-821	15	6	objective	objective	NOUN
ijassa-821	15	7	of	of	ADP
ijassa-821	15	8	mathematical	mathematical	ADJ
ijassa-821	15	9	modelling	modelling	NOUN
ijassa-821	15	10	in	in	ADP
ijassa-821	15	11	transportation	transportation	NOUN
ijassa-821	15	12	logistics	logistic	NOUN
ijassa-821	15	13	is	be	AUX
ijassa-821	15	14	the	the	DET
ijassa-821	15	15	vehicle	vehicle	NOUN
ijassa-821	15	16	routing	routing	NOUN
ijassa-821	15	17	problem	problem	NOUN
ijassa-821	15	18	.	.	PUNCT
ijassa-821	16	1	a	a	DET
ijassa-821	16	2	classical	classical	ADJ
ijassa-821	16	3	example	example	NOUN
ijassa-821	16	4	of	of	ADP
ijassa-821	16	5	a	a	DET
ijassa-821	16	6	vehicle	vehicle	NOUN
ijassa-821	16	7	routing	routing	NOUN
ijassa-821	16	8	problem	problem	NOUN
ijassa-821	16	9	is	be	AUX
ijassa-821	16	10	the	the	DET
ijassa-821	16	11	travelling	travel	VERB
ijassa-821	16	12	salesman	salesman	ADJ
ijassa-821	16	13	problem	problem	NOUN
ijassa-821	16	14	,	,	PUNCT
ijassa-821	16	15	which	which	PRON
ijassa-821	16	16	will	will	AUX
ijassa-821	16	17	be	be	AUX
ijassa-821	16	18	examined	examine	VERB
ijassa-821	16	19	in	in	ADP
ijassa-821	16	20	details	detail	NOUN
ijassa-821	16	21	.	.	PUNCT
ijassa-821	17	1	this	this	DET
ijassa-821	17	2	article	article	NOUN
ijassa-821	17	3	is	be	AUX
ijassa-821	17	4	motivated	motivate	VERB
ijassa-821	17	5	by	by	ADP
ijassa-821	17	6	the	the	DET
ijassa-821	17	7	problem	problem	NOUN
ijassa-821	17	8	of	of	ADP
ijassa-821	17	9	time	time	NOUN
ijassa-821	17	10	inconsistency	inconsistency	NOUN
ijassa-821	17	11	(	(	PUNCT
ijassa-821	17	12	or	or	CCONJ
ijassa-821	17	13	dynamic	dynamic	ADJ
ijassa-821	17	14	instability	instability	NOUN
ijassa-821	17	15	)	)	PUNCT
ijassa-821	17	16	of	of	ADP
ijassa-821	17	17	heuristic	heuristic	ADJ
ijassa-821	17	18	algorithms	algorithm	NOUN
ijassa-821	17	19	solving	solve	VERB
ijassa-821	17	20	vehicle	vehicle	NOUN
ijassa-821	17	21	routing	routing	NOUN
ijassa-821	17	22	problems	problem	NOUN
ijassa-821	17	23	and	and	CCONJ
ijassa-821	17	24	developing	develop	VERB
ijassa-821	17	25	methods	method	NOUN
ijassa-821	17	26	to	to	PART
ijassa-821	17	27	avoid	avoid	VERB
ijassa-821	17	28	this	this	PRON
ijassa-821	17	29	:	:	PUNCT
ijassa-821	17	30	to	to	PART
ijassa-821	17	31	increase	increase	VERB
ijassa-821	17	32	the	the	DET
ijassa-821	17	33	level	level	NOUN
ijassa-821	17	34	of	of	ADP
ijassa-821	17	35	dynamic	dynamic	ADJ
ijassa-821	17	36	stability	stability	NOUN
ijassa-821	17	37	and	and	CCONJ
ijassa-821	17	38	efficiency	efficiency	NOUN
ijassa-821	17	39	of	of	ADP
ijassa-821	17	40	the	the	DET
ijassa-821	17	41	algorithms	algorithm	NOUN
ijassa-821	17	42	with	with	ADP
ijassa-821	17	43	experiments	experiment	NOUN
ijassa-821	17	44	hold	hold	VERB
ijassa-821	17	45	on	on	ADP
ijassa-821	17	46	a	a	DET
ijassa-821	17	47	genetic	genetic	ADJ
ijassa-821	17	48	algorithm	algorithm	NOUN
ijassa-821	17	49	.	.	PUNCT
ijassa-821	18	1	the	the	DET
ijassa-821	18	2	article	article	NOUN
ijassa-821	18	3	is	be	AUX
ijassa-821	18	4	structured	structure	VERB
ijassa-821	18	5	as	as	SCONJ
ijassa-821	18	6	follows	follow	VERB
ijassa-821	18	7	.	.	PUNCT
ijassa-821	19	1	after	after	ADP
ijassa-821	19	2	introduction	introduction	NOUN
ijassa-821	19	3	,	,	PUNCT
ijassa-821	19	4	it	it	PRON
ijassa-821	19	5	includes	include	VERB
ijassa-821	19	6	seven	seven	NUM
ijassa-821	19	7	sections	section	NOUN
ijassa-821	19	8	.	.	PUNCT
ijassa-821	20	1	the	the	DET
ijassa-821	20	2	first	first	ADJ
ijassa-821	20	3	section	section	NOUN
ijassa-821	20	4	is	be	AUX
ijassa-821	20	5	devoted	devote	VERB
ijassa-821	20	6	to	to	ADP
ijassa-821	20	7	the	the	DET
ijassa-821	20	8	description	description	NOUN
ijassa-821	20	9	of	of	ADP
ijassa-821	20	10	general	general	ADJ
ijassa-821	20	11	model	model	NOUN
ijassa-821	20	12	of	of	ADP
ijassa-821	20	13	the	the	DET
ijassa-821	20	14	travelling	travel	VERB
ijassa-821	20	15	salesman	salesman	NOUN
ijassa-821	20	16	problem	problem	NOUN
ijassa-821	20	17	(	(	PUNCT
ijassa-821	20	18	tsp	tsp	NOUN
ijassa-821	20	19	)	)	PUNCT
ijassa-821	20	20	and	and	CCONJ
ijassa-821	20	21	contains	contain	VERB
ijassa-821	20	22	the	the	DET
ijassa-821	20	23	review	review	NOUN
ijassa-821	20	24	of	of	ADP
ijassa-821	20	25	methods	method	NOUN
ijassa-821	20	26	solving	solve	VERB
ijassa-821	20	27	it	it	PRON
ijassa-821	20	28	.	.	PUNCT
ijassa-821	21	1	the	the	DET
ijassa-821	21	2	second	second	ADJ
ijassa-821	21	3	section	section	NOUN
ijassa-821	21	4	provides	provide	VERB
ijassa-821	21	5	the	the	DET
ijassa-821	21	6	basic	basic	ADJ
ijassa-821	21	7	concepts	concept	NOUN
ijassa-821	21	8	and	and	CCONJ
ijassa-821	21	9	terms	term	NOUN
ijassa-821	21	10	of	of	ADP
ijassa-821	21	11	the	the	DET
ijassa-821	21	12	genetic	genetic	ADJ
ijassa-821	21	13	algorithm	algorithm	NOUN
ijassa-821	21	14	used	use	VERB
ijassa-821	21	15	in	in	ADP
ijassa-821	21	16	the	the	DET
ijassa-821	21	17	text	text	NOUN
ijassa-821	21	18	.	.	PUNCT
ijassa-821	22	1	section	section	NOUN
ijassa-821	22	2	3	3	NUM
ijassa-821	22	3	includes	include	VERB
ijassa-821	22	4	a	a	DET
ijassa-821	22	5	description	description	NOUN
ijassa-821	22	6	of	of	ADP
ijassa-821	22	7	the	the	DET
ijassa-821	22	8	basic	basic	ADJ
ijassa-821	22	9	scheme	scheme	NOUN
ijassa-821	22	10	of	of	ADP
ijassa-821	22	11	the	the	DET
ijassa-821	22	12	genetic	genetic	ADJ
ijassa-821	22	13	algorithm	algorithm	NOUN
ijassa-821	22	14	and	and	CCONJ
ijassa-821	22	15	one	one	NUM
ijassa-821	22	16	of	of	ADP
ijassa-821	22	17	the	the	DET
ijassa-821	22	18	most	most	ADV
ijassa-821	22	19	effective	effective	ADJ
ijassa-821	22	20	tools	tool	NOUN
ijassa-821	22	21	for	for	ADP
ijassa-821	22	22	constructing	construct	VERB
ijassa-821	22	23	a	a	DET
ijassa-821	22	24	solution	solution	NOUN
ijassa-821	22	25	—	—	PUNCT
ijassa-821	22	26	the	the	DET
ijassa-821	22	27	greffenstett	greffenstett	NOUN
ijassa-821	22	28	’s	’s	PART
ijassa-821	22	29	crossover	crossover	NOUN
ijassa-821	22	30	.	.	PUNCT
ijassa-821	23	1	the	the	DET
ijassa-821	23	2	fourth	fourth	ADJ
ijassa-821	23	3	section	section	NOUN
ijassa-821	23	4	discusses	discuss	VERB
ijassa-821	23	5	the	the	DET
ijassa-821	23	6	problem	problem	NOUN
ijassa-821	23	7	of	of	ADP
ijassa-821	23	8	dynamic	dynamic	ADJ
ijassa-821	23	9	instability	instability	NOUN
ijassa-821	23	10	of	of	ADP
ijassa-821	23	11	heuristics	heuristic	NOUN
ijassa-821	23	12	in	in	ADP
ijassa-821	23	13	solving	solve	VERB
ijassa-821	23	14	routing	routing	NOUN
ijassa-821	23	15	problems	problem	NOUN
ijassa-821	23	16	and	and	CCONJ
ijassa-821	23	17	a	a	DET
ijassa-821	23	18	new	new	ADJ
ijassa-821	23	19	criterion	criterion	NOUN
ijassa-821	23	20	is	be	AUX
ijassa-821	23	21	suggested	suggest	VERB
ijassa-821	23	22	—	—	PUNCT
ijassa-821	23	23	the	the	DET
ijassa-821	23	24	experimental	experimental	ADJ
ijassa-821	23	25	level	level	NOUN
ijassa-821	23	26	of	of	ADP
ijassa-821	23	27	time	time	NOUN
ijassa-821	23	28	inconsistency	inconsistency	NOUN
ijassa-821	23	29	.	.	PUNCT
ijassa-821	24	1	in	in	ADP
ijassa-821	24	2	section	section	NOUN
ijassa-821	24	3	5	5	NUM
ijassa-821	24	4	we	we	PRON
ijassa-821	24	5	introduce	introduce	VERB
ijassa-821	24	6	the	the	DET
ijassa-821	24	7	description	description	NOUN
ijassa-821	24	8	of	of	ADP
ijassa-821	24	9	dynamic	dynamic	ADJ
ijassa-821	24	10	adaptation	adaptation	NOUN
ijassa-821	24	11	procedure	procedure	NOUN
ijassa-821	24	12	which	which	PRON
ijassa-821	24	13	can	can	AUX
ijassa-821	24	14	improve	improve	VERB
ijassa-821	24	15	basic	basic	ADJ
ijassa-821	24	16	solutions	solution	NOUN
ijassa-821	24	17	of	of	ADP
ijassa-821	24	18	heuristic	heuristic	ADJ
ijassa-821	24	19	algorithms	algorithm	NOUN
ijassa-821	24	20	.	.	PUNCT
ijassa-821	25	1	section	section	NOUN
ijassa-821	25	2	6	6	NUM
ijassa-821	25	3	presents	present	VERB
ijassa-821	25	4	the	the	DET
ijassa-821	25	5	results	result	NOUN
ijassa-821	25	6	of	of	ADP
ijassa-821	25	7	numerical	numerical	ADJ
ijassa-821	25	8	experiments	experiment	NOUN
ijassa-821	25	9	to	to	PART
ijassa-821	25	10	evaluate	evaluate	VERB
ijassa-821	25	11	∗corresponding	∗corresponde	VERB
ijassa-821	25	12	author	author	NOUN
ijassa-821	25	13	:	:	PUNCT
ijassa-821	25	14	alexander.mugaiskih@gmail.com	alexander.mugaiskih@gmail.com	X
ijassa-821	25	15	dynamic	dynamic	ADJ
ijassa-821	25	16	adaptation	adaptation	NOUN
ijassa-821	25	17	of	of	ADP
ijassa-821	25	18	genetic	genetic	ADJ
ijassa-821	25	19	algorithm	algorithm	NOUN
ijassa-821	25	20	for	for	ADP
ijassa-821	25	21	solving	solve	VERB
ijassa-821	25	22	routing	routing	NOUN
ijassa-821	25	23	problems	problem	NOUN
ijassa-821	25	24	33	33	NUM
ijassa-821	25	25	the	the	DET
ijassa-821	25	26	level	level	NOUN
ijassa-821	25	27	of	of	ADP
ijassa-821	25	28	time	time	NOUN
ijassa-821	25	29	inconsistency	inconsistency	NOUN
ijassa-821	25	30	of	of	ADP
ijassa-821	25	31	the	the	DET
ijassa-821	25	32	genetic	genetic	ADJ
ijassa-821	25	33	algorithm	algorithm	NOUN
ijassa-821	25	34	and	and	CCONJ
ijassa-821	25	35	a	a	DET
ijassa-821	25	36	comparative	comparative	ADJ
ijassa-821	25	37	analysis	analysis	NOUN
ijassa-821	25	38	of	of	ADP
ijassa-821	25	39	the	the	DET
ijassa-821	25	40	results	result	NOUN
ijassa-821	25	41	obtained	obtain	VERB
ijassa-821	25	42	by	by	ADP
ijassa-821	25	43	the	the	DET
ijassa-821	25	44	genetic	genetic	ADJ
ijassa-821	25	45	heuristics	heuristic	NOUN
ijassa-821	25	46	and	and	CCONJ
ijassa-821	25	47	its	its	PRON
ijassa-821	25	48	dynamic	dynamic	ADJ
ijassa-821	25	49	adapdation	adapdation	NOUN
ijassa-821	25	50	procedure	procedure	NOUN
ijassa-821	25	51	.	.	PUNCT
ijassa-821	26	1	comparative	comparative	ADJ
ijassa-821	26	2	analysis	analysis	NOUN
ijassa-821	26	3	was	be	AUX
ijassa-821	26	4	hold	hold	NOUN
ijassa-821	26	5	on	on	ADP
ijassa-821	26	6	a	a	DET
ijassa-821	26	7	set	set	NOUN
ijassa-821	26	8	of	of	ADP
ijassa-821	26	9	problem	problem	NOUN
ijassa-821	26	10	instances	instance	NOUN
ijassa-821	26	11	from	from	ADP
ijassa-821	26	12	the	the	DET
ijassa-821	26	13	tsplib	tsplib	PROPN
ijassa-821	26	14	library	library	NOUN
ijassa-821	26	15	,	,	PUNCT
ijassa-821	26	16	widely	widely	ADV
ijassa-821	26	17	known	know	VERB
ijassa-821	26	18	among	among	ADP
ijassa-821	26	19	specialists	specialist	NOUN
ijassa-821	26	20	.	.	PUNCT
ijassa-821	27	1	in	in	ADP
ijassa-821	27	2	the	the	DET
ijassa-821	27	3	seventh	seventh	ADJ
ijassa-821	27	4	section	section	NOUN
ijassa-821	27	5	we	we	PRON
ijassa-821	27	6	place	place	VERB
ijassa-821	27	7	brief	brief	ADJ
ijassa-821	27	8	conclusions	conclusion	NOUN
ijassa-821	27	9	and	and	CCONJ
ijassa-821	27	10	plans	plan	NOUN
ijassa-821	27	11	for	for	ADP
ijassa-821	27	12	further	further	ADJ
ijassa-821	27	13	research	research	NOUN
ijassa-821	27	14	.	.	PUNCT
ijassa-821	28	1	2	2	X
ijassa-821	28	2	.	.	X
ijassa-821	28	3	travelling	travel	VERB
ijassa-821	28	4	salesman	salesman	ADJ
ijassa-821	28	5	problem	problem	NOUN
ijassa-821	28	6	:	:	PUNCT
ijassa-821	28	7	formulation	formulation	NOUN
ijassa-821	28	8	and	and	CCONJ
ijassa-821	28	9	methods	method	NOUN
ijassa-821	28	10	2.1	2.1	NUM
ijassa-821	28	11	.	.	PUNCT
ijassa-821	29	1	problem	problem	NOUN
ijassa-821	29	2	formulation	formulation	NOUN
ijassa-821	29	3	the	the	DET
ijassa-821	29	4	travelling	travel	VERB
ijassa-821	29	5	salesman	salesman	NOUN
ijassa-821	29	6	problem	problem	NOUN
ijassa-821	29	7	consists	consist	VERB
ijassa-821	29	8	in	in	ADP
ijassa-821	29	9	finding	find	VERB
ijassa-821	29	10	the	the	DET
ijassa-821	29	11	shortest	short	ADJ
ijassa-821	29	12	trip	trip	NOUN
ijassa-821	29	13	between	between	ADP
ijassa-821	29	14	a	a	DET
ijassa-821	29	15	set	set	NOUN
ijassa-821	29	16	of	of	ADP
ijassa-821	29	17	vertices	vertex	NOUN
ijassa-821	29	18	,	,	PUNCT
ijassa-821	29	19	visiting	visit	VERB
ijassa-821	29	20	each	each	DET
ijassa-821	29	21	vertice	vertice	NOUN
ijassa-821	29	22	exactly	exactly	ADV
ijassa-821	29	23	once	once	ADV
ijassa-821	29	24	,	,	PUNCT
ijassa-821	29	25	starting	start	VERB
ijassa-821	29	26	and	and	CCONJ
ijassa-821	29	27	finishing	finish	VERB
ijassa-821	29	28	at	at	ADP
ijassa-821	29	29	a	a	DET
ijassa-821	29	30	specified	specified	ADJ
ijassa-821	29	31	vertice	vertice	NOUN
ijassa-821	29	32	.	.	PUNCT
ijassa-821	30	1	the	the	DET
ijassa-821	30	2	tsp	tsp	NOUN
ijassa-821	30	3	can	can	AUX
ijassa-821	30	4	be	be	AUX
ijassa-821	30	5	represented	represent	VERB
ijassa-821	30	6	as	as	ADP
ijassa-821	30	7	a	a	DET
ijassa-821	30	8	graph	graph	NOUN
ijassa-821	30	9	g	g	NOUN
ijassa-821	30	10	=	=	SYM
ijassa-821	30	11	(	(	PUNCT
ijassa-821	30	12	v	v	NOUN
ijassa-821	30	13	,	,	PUNCT
ijassa-821	30	14	e	e	NOUN
ijassa-821	30	15	)	)	PUNCT
ijassa-821	30	16	,	,	PUNCT
ijassa-821	30	17	where	where	SCONJ
ijassa-821	30	18	set	set	NOUN
ijassa-821	30	19	of	of	ADP
ijassa-821	30	20	vertices	vertex	NOUN
ijassa-821	30	21	v	v	NOUN
ijassa-821	30	22	=	=	SYM
ijassa-821	30	23	{	{	PUNCT
ijassa-821	30	24	v1	v1	PROPN
ijassa-821	30	25	,	,	PUNCT
ijassa-821	30	26	v2	v2	PROPN
ijassa-821	30	27	,	,	PUNCT
ijassa-821	30	28	.	.	PUNCT
ijassa-821	30	29	.	.	PUNCT
ijassa-821	31	1	.	.	PUNCT
ijassa-821	32	1	,	,	PUNCT
ijassa-821	32	2	vn	vn	PROPN
ijassa-821	32	3	}	}	PUNCT
ijassa-821	32	4	stands	stand	VERB
ijassa-821	32	5	for	for	ADP
ijassa-821	32	6	cities	city	NOUN
ijassa-821	32	7	from	from	ADP
ijassa-821	32	8	the	the	DET
ijassa-821	32	9	problem	problem	NOUN
ijassa-821	32	10	instance	instance	NOUN
ijassa-821	32	11	and	and	CCONJ
ijassa-821	32	12	set	set	NOUN
ijassa-821	32	13	of	of	ADP
ijassa-821	32	14	edges	edge	NOUN
ijassa-821	32	15	e	e	NOUN
ijassa-821	32	16	=	=	SYM
ijassa-821	32	17	{	{	PUNCT
ijassa-821	32	18	(	(	PUNCT
ijassa-821	32	19	vi	vi	PROPN
ijassa-821	32	20	,	,	PUNCT
ijassa-821	32	21	vj	vj	NOUN
ijassa-821	32	22	)	)	PUNCT
ijassa-821	32	23	:	:	PUNCT
ijassa-821	33	1	vi	vi	X
ijassa-821	33	2	,	,	PUNCT
ijassa-821	33	3	vj	vj	PROPN
ijassa-821	33	4	∈	∈	PROPN
ijassa-821	33	5	v	v	PROPN
ijassa-821	33	6	,	,	PUNCT
ijassa-821	33	7	i	i	PROPN
ijassa-821	33	8	6=	6=	PROPN
ijassa-821	33	9	j	j	PROPN
ijassa-821	33	10	}	}	PUNCT
ijassa-821	33	11	represents	represent	VERB
ijassa-821	33	12	paths	path	NOUN
ijassa-821	33	13	between	between	ADP
ijassa-821	33	14	the	the	DET
ijassa-821	33	15	cities	city	NOUN
ijassa-821	33	16	.	.	PUNCT
ijassa-821	34	1	the	the	DET
ijassa-821	34	2	weight	weight	NOUN
ijassa-821	34	3	of	of	ADP
ijassa-821	34	4	an	an	DET
ijassa-821	34	5	edge	edge	NOUN
ijassa-821	34	6	(	(	PUNCT
ijassa-821	34	7	vi	vi	NOUN
ijassa-821	34	8	,	,	PUNCT
ijassa-821	34	9	vj	vj	NOUN
ijassa-821	34	10	)	)	PUNCT
ijassa-821	34	11	is	be	AUX
ijassa-821	34	12	the	the	DET
ijassa-821	34	13	distance	distance	NOUN
ijassa-821	34	14	or	or	CCONJ
ijassa-821	34	15	travel	travel	NOUN
ijassa-821	34	16	cost	cost	NOUN
ijassa-821	34	17	between	between	ADP
ijassa-821	34	18	vertices	vertex	NOUN
ijassa-821	34	19	vi	vi	PROPN
ijassa-821	34	20	and	and	CCONJ
ijassa-821	34	21	vj	vj	INTJ
ijassa-821	34	22	.	.	PUNCT
ijassa-821	35	1	travelling	travel	VERB
ijassa-821	35	2	salesman	salesman	ADJ
ijassa-821	35	3	problem	problem	NOUN
ijassa-821	35	4	can	can	AUX
ijassa-821	35	5	be	be	AUX
ijassa-821	35	6	defined	define	VERB
ijassa-821	35	7	as	as	ADP
ijassa-821	35	8	an	an	DET
ijassa-821	35	9	problem	problem	NOUN
ijassa-821	35	10	of	of	ADP
ijassa-821	35	11	finding	find	VERB
ijassa-821	35	12	a	a	DET
ijassa-821	35	13	hamiltonian	hamiltonian	ADJ
ijassa-821	35	14	cycle	cycle	NOUN
ijassa-821	35	15	in	in	ADP
ijassa-821	35	16	graph	graph	NOUN
ijassa-821	35	17	g	g	PROPN
ijassa-821	35	18	with	with	ADP
ijassa-821	35	19	the	the	DET
ijassa-821	35	20	least	least	ADJ
ijassa-821	35	21	weight	weight	NOUN
ijassa-821	35	22	.	.	PUNCT
ijassa-821	36	1	let	let	VERB
ijassa-821	36	2	i	i	PRON
ijassa-821	36	3	=	=	PUNCT
ijassa-821	36	4	{	{	PUNCT
ijassa-821	36	5	1	1	NUM
ijassa-821	36	6	,	,	PUNCT
ijassa-821	36	7	.	.	PUNCT
ijassa-821	36	8	.	.	PUNCT
ijassa-821	37	1	.	.	PUNCT
ijassa-821	38	1	,	,	PUNCT
ijassa-821	38	2	n	n	CCONJ
ijassa-821	38	3	}	}	PUNCT
ijassa-821	38	4	be	be	AUX
ijassa-821	38	5	the	the	DET
ijassa-821	38	6	set	set	NOUN
ijassa-821	38	7	of	of	ADP
ijassa-821	38	8	indices	index	NOUN
ijassa-821	38	9	of	of	ADP
ijassa-821	38	10	vertices	vertex	NOUN
ijassa-821	38	11	from	from	ADP
ijassa-821	38	12	the	the	DET
ijassa-821	38	13	problem	problem	NOUN
ijassa-821	38	14	instance	instance	NOUN
ijassa-821	38	15	.	.	PUNCT
ijassa-821	39	1	the	the	DET
ijassa-821	39	2	problem	problem	NOUN
ijassa-821	39	3	objective	objective	ADJ
ijassa-821	39	4	function	function	NOUN
ijassa-821	39	5	f	f	PROPN
ijassa-821	39	6	is	be	AUX
ijassa-821	39	7	total	total	ADJ
ijassa-821	39	8	length	length	NOUN
ijassa-821	39	9	of	of	ADP
ijassa-821	39	10	the	the	DET
ijassa-821	39	11	route	route	NOUN
ijassa-821	39	12	that	that	PRON
ijassa-821	39	13	includes	include	VERB
ijassa-821	39	14	all	all	DET
ijassa-821	39	15	vertices	vertex	NOUN
ijassa-821	39	16	from	from	ADP
ijassa-821	39	17	the	the	DET
ijassa-821	39	18	problem	problem	NOUN
ijassa-821	39	19	instance	instance	NOUN
ijassa-821	39	20	.	.	PUNCT
ijassa-821	40	1	suppose	suppose	VERB
ijassa-821	40	2	xij	xij	PRON
ijassa-821	40	3	is	be	AUX
ijassa-821	40	4	a	a	DET
ijassa-821	40	5	binary	binary	ADJ
ijassa-821	40	6	variable	variable	NOUN
ijassa-821	40	7	which	which	PRON
ijassa-821	40	8	is	be	AUX
ijassa-821	40	9	equal	equal	ADJ
ijassa-821	40	10	to	to	ADP
ijassa-821	40	11	one	one	NUM
ijassa-821	40	12	if	if	SCONJ
ijassa-821	40	13	route	route	NOUN
ijassa-821	40	14	passes	pass	VERB
ijassa-821	40	15	the	the	DET
ijassa-821	40	16	arc	arc	NOUN
ijassa-821	40	17	(	(	PUNCT
ijassa-821	40	18	i	i	PROPN
ijassa-821	40	19	,	,	PUNCT
ijassa-821	40	20	j	j	PROPN
ijassa-821	40	21	)	)	PUNCT
ijassa-821	40	22	,	,	PUNCT
ijassa-821	40	23	and	and	CCONJ
ijassa-821	40	24	zero	zero	NUM
ijassa-821	40	25	otherwise	otherwise	ADV
ijassa-821	40	26	.	.	PUNCT
ijassa-821	41	1	length	length	NOUN
ijassa-821	41	2	of	of	ADP
ijassa-821	41	3	the	the	DET
ijassa-821	41	4	route	route	NOUN
ijassa-821	41	5	between	between	ADP
ijassa-821	41	6	two	two	NUM
ijassa-821	41	7	vertices	vertex	NOUN
ijassa-821	41	8	i	i	PRON
ijassa-821	41	9	and	and	CCONJ
ijassa-821	41	10	j	j	PROPN
ijassa-821	41	11	is	be	AUX
ijassa-821	41	12	defined	define	VERB
ijassa-821	41	13	as	as	ADP
ijassa-821	41	14	euclidean	euclidean	ADJ
ijassa-821	41	15	distance	distance	NOUN
ijassa-821	41	16	cij	cij	PROPN
ijassa-821	41	17	.	.	PUNCT
ijassa-821	42	1	then	then	ADV
ijassa-821	42	2	the	the	DET
ijassa-821	42	3	problem	problem	NOUN
ijassa-821	42	4	can	can	AUX
ijassa-821	42	5	be	be	AUX
ijassa-821	42	6	defined	define	VERB
ijassa-821	42	7	in	in	ADP
ijassa-821	42	8	the	the	DET
ijassa-821	42	9	form	form	NOUN
ijassa-821	42	10	of	of	ADP
ijassa-821	42	11	linear	linear	PROPN
ijassa-821	42	12	programming	programming	NOUN
ijassa-821	42	13	proposed	propose	VERB
ijassa-821	42	14	by	by	ADP
ijassa-821	42	15	[	[	X
ijassa-821	42	16	9	9	NUM
ijassa-821	42	17	,	,	PUNCT
ijassa-821	42	18	27	27	NUM
ijassa-821	42	19	,	,	PUNCT
ijassa-821	42	20	29	29	NUM
ijassa-821	42	21	]	]	PUNCT
ijassa-821	42	22	:	:	PUNCT
ijassa-821	42	23	f	f	X
ijassa-821	42	24	=	=	PUNCT
ijassa-821	42	25	∑	∑	PUNCT
ijassa-821	42	26	i∈i	i∈i	ADJ
ijassa-821	42	27	∑	∑	PROPN
ijassa-821	42	28	j	j	PROPN
ijassa-821	42	29	6	6	NUM
ijassa-821	42	30	=	=	PROPN
ijassa-821	42	31	i	i	PROPN
ijassa-821	42	32	,	,	PUNCT
ijassa-821	42	33	j∈j	j∈j	NOUN
ijassa-821	42	34	cijzij	cijzij	PROPN
ijassa-821	42	35	→	→	SYM
ijassa-821	42	36	min	min	PROPN
ijassa-821	42	37	,	,	PUNCT
ijassa-821	42	38	subject	subject	ADJ
ijassa-821	42	39	to	to	ADP
ijassa-821	42	40	:	:	PUNCT
ijassa-821	42	41	0	0	NUM
ijassa-821	42	42	≤	≤	NUM
ijassa-821	42	43	zij	zij	PROPN
ijassa-821	42	44	≤	≤	PROPN
ijassa-821	42	45	1	1	NUM
ijassa-821	42	46	,	,	PUNCT
ijassa-821	42	47	zij	zij	PROPN
ijassa-821	42	48	∈	∈	PROPN
ijassa-821	42	49	z∑	z∑	PROPN
ijassa-821	42	50	j∈i	j∈i	PROPN
ijassa-821	42	51	,	,	PUNCT
ijassa-821	42	52	j	j	PROPN
ijassa-821	42	53	6	6	NUM
ijassa-821	42	54	=	=	NOUN
ijassa-821	42	55	i	i	NOUN
ijassa-821	42	56	zij	zij	NOUN
ijassa-821	42	57	=	=	SYM
ijassa-821	43	1	1,∀i	1,∀i	NUM
ijassa-821	43	2	∈	∈	PROPN
ijassa-821	44	1	i	i	PRON
ijassa-821	44	2	,	,	PUNCT
ijassa-821	44	3	(	(	PUNCT
ijassa-821	44	4	2.1	2.1	NUM
ijassa-821	44	5	)	)	PUNCT
ijassa-821	44	6	∑	∑	PUNCT
ijassa-821	44	7	i∈i	i∈i	ADJ
ijassa-821	44	8	,	,	PUNCT
ijassa-821	44	9	i	i	PROPN
ijassa-821	44	10	6	6	NUM
ijassa-821	44	11	=	=	SYM
ijassa-821	44	12	j	j	PROPN
ijassa-821	44	13	zij	zij	PROPN
ijassa-821	44	14	=	=	SYM
ijassa-821	44	15	1,∀j	1,∀j	NUM
ijassa-821	45	1	∈	∈	PROPN
ijassa-821	45	2	i	i	PRON
ijassa-821	45	3	,	,	PUNCT
ijassa-821	45	4	(	(	PUNCT
ijassa-821	45	5	2.2	2.2	NUM
ijassa-821	45	6	)	)	PUNCT
ijassa-821	45	7	∑	∑	ADV
ijassa-821	45	8	i∈s	i∈	NOUN
ijassa-821	45	9	,	,	PUNCT
ijassa-821	45	10	j∈s	j∈	NOUN
ijassa-821	45	11	zij	zij	PROPN
ijassa-821	45	12	=	=	PUNCT
ijassa-821	45	13	|s|	|s|	PROPN
ijassa-821	45	14	−	−	PROPN
ijassa-821	45	15	1	1	NUM
ijassa-821	45	16	(	(	PUNCT
ijassa-821	45	17	s	s	X
ijassa-821	45	18	⊂	⊂	PROPN
ijassa-821	45	19	v	v	NOUN
ijassa-821	45	20	,	,	PUNCT
ijassa-821	45	21	|s|	|s|	PROPN
ijassa-821	45	22	>	>	X
ijassa-821	45	23	1	1	NUM
ijassa-821	45	24	)	)	PUNCT
ijassa-821	45	25	(	(	PUNCT
ijassa-821	45	26	2.3	2.3	NUM
ijassa-821	45	27	)	)	PUNCT
ijassa-821	45	28	equalities	equality	NOUN
ijassa-821	45	29	(	(	PUNCT
ijassa-821	45	30	2.1	2.1	NUM
ijassa-821	45	31	)	)	PUNCT
ijassa-821	45	32	–	–	PUNCT
ijassa-821	45	33	(	(	PUNCT
ijassa-821	45	34	2.2	2.2	NUM
ijassa-821	45	35	)	)	PUNCT
ijassa-821	45	36	enforce	enforce	NOUN
ijassa-821	45	37	that	that	SCONJ
ijassa-821	45	38	every	every	DET
ijassa-821	45	39	vertice	vertice	NOUN
ijassa-821	45	40	is	be	AUX
ijassa-821	45	41	visited	visit	VERB
ijassa-821	45	42	exactly	exactly	ADV
ijassa-821	45	43	once	once	ADV
ijassa-821	45	44	.	.	PUNCT
ijassa-821	46	1	the	the	DET
ijassa-821	46	2	last	last	ADJ
ijassa-821	46	3	constraints	constraint	NOUN
ijassa-821	46	4	guarantee	guarantee	VERB
ijassa-821	46	5	the	the	DET
ijassa-821	46	6	absence	absence	NOUN
ijassa-821	46	7	of	of	ADP
ijassa-821	46	8	two	two	NUM
ijassa-821	46	9	or	or	CCONJ
ijassa-821	46	10	more	more	ADV
ijassa-821	46	11	disjoined	disjoin	VERB
ijassa-821	46	12	parts	part	NOUN
ijassa-821	46	13	in	in	ADP
ijassa-821	46	14	the	the	DET
ijassa-821	46	15	final	final	ADJ
ijassa-821	46	16	route	route	NOUN
ijassa-821	46	17	.	.	PUNCT
ijassa-821	47	1	the	the	DET
ijassa-821	47	2	travelling	travel	VERB
ijassa-821	47	3	salesman	salesman	NOUN
ijassa-821	47	4	problem	problem	NOUN
ijassa-821	47	5	takes	take	VERB
ijassa-821	47	6	a	a	DET
ijassa-821	47	7	central	central	ADJ
ijassa-821	47	8	role	role	NOUN
ijassa-821	47	9	in	in	ADP
ijassa-821	47	10	combinatorial	combinatorial	ADJ
ijassa-821	47	11	optimization	optimization	NOUN
ijassa-821	47	12	.	.	PUNCT
ijassa-821	48	1	it	it	PRON
ijassa-821	48	2	has	have	VERB
ijassa-821	48	3	a	a	DET
ijassa-821	48	4	wide	wide	ADJ
ijassa-821	48	5	range	range	NOUN
ijassa-821	48	6	of	of	ADP
ijassa-821	48	7	practical	practical	ADJ
ijassa-821	48	8	application	application	NOUN
ijassa-821	48	9	in	in	ADP
ijassa-821	48	10	various	various	ADJ
ijassa-821	48	11	fields	field	NOUN
ijassa-821	48	12	:	:	PUNCT
ijassa-821	48	13	transport	transport	NOUN
ijassa-821	48	14	logistics	logistic	NOUN
ijassa-821	48	15	[	[	X
ijassa-821	48	16	1	1	NUM
ijassa-821	48	17	]	]	PUNCT
ijassa-821	48	18	,	,	PUNCT
ijassa-821	48	19	robotics	robotic	NOUN
ijassa-821	48	20	[	[	X
ijassa-821	48	21	6	6	NUM
ijassa-821	48	22	,	,	PUNCT
ijassa-821	48	23	8	8	NUM
ijassa-821	48	24	]	]	PUNCT
ijassa-821	48	25	,	,	PUNCT
ijassa-821	48	26	job	job	NOUN
ijassa-821	48	27	shop	shop	NOUN
ijassa-821	48	28	scheduling	scheduling	NOUN
ijassa-821	48	29	.	.	PUNCT
ijassa-821	49	1	among	among	ADP
ijassa-821	49	2	its	its	PRON
ijassa-821	49	3	applications	application	NOUN
ijassa-821	49	4	one	one	PRON
ijassa-821	49	5	can	can	AUX
ijassa-821	49	6	mention	mention	VERB
ijassa-821	49	7	constructing	construct	VERB
ijassa-821	49	8	routing	routing	NOUN
ijassa-821	49	9	plans	plan	NOUN
ijassa-821	49	10	for	for	ADP
ijassa-821	49	11	a	a	DET
ijassa-821	49	12	fleet	fleet	NOUN
ijassa-821	49	13	of	of	ADP
ijassa-821	49	14	vehicles	vehicle	NOUN
ijassa-821	49	15	of	of	ADP
ijassa-821	49	16	logistic	logistic	ADJ
ijassa-821	49	17	company	company	NOUN
ijassa-821	49	18	;	;	PUNCT
ijassa-821	49	19	performing	perform	VERB
ijassa-821	49	20	video	video	NOUN
ijassa-821	49	21	surveillance	surveillance	NOUN
ijassa-821	49	22	by	by	ADP
ijassa-821	49	23	wireless	wireless	ADJ
ijassa-821	49	24	robots	robot	NOUN
ijassa-821	49	25	[	[	X
ijassa-821	49	26	33	33	NUM
ijassa-821	49	27	]	]	PUNCT
ijassa-821	49	28	;	;	PUNCT
ijassa-821	49	29	robot	robot	NOUN
ijassa-821	49	30	-	-	PUNCT
ijassa-821	49	31	assisted	assist	VERB
ijassa-821	49	32	sensor	sensor	NOUN
ijassa-821	49	33	network	network	NOUN
ijassa-821	49	34	deployment	deployment	NOUN
ijassa-821	49	35	and	and	CCONJ
ijassa-821	49	36	data	datum	NOUN
ijassa-821	49	37	collection	collection	NOUN
ijassa-821	50	1	[	[	X
ijassa-821	50	2	37	37	NUM
ijassa-821	50	3	]	]	PUNCT
ijassa-821	50	4	;	;	PUNCT
ijassa-821	50	5	generating	generate	VERB
ijassa-821	50	6	assembly	assembly	NOUN
ijassa-821	50	7	sequences	sequence	NOUN
ijassa-821	50	8	in	in	ADP
ijassa-821	50	9	an	an	DET
ijassa-821	50	10	autonomous	autonomous	ADJ
ijassa-821	50	11	multi	multi	ADJ
ijassa-821	50	12	-	-	ADJ
ijassa-821	50	13	robot	robot	ADJ
ijassa-821	50	14	coordinated	coordinate	VERB
ijassa-821	50	15	furniture	furniture	NOUN
ijassa-821	50	16	system	system	NOUN
ijassa-821	50	17	[	[	X
ijassa-821	50	18	26	26	NUM
ijassa-821	50	19	]	]	X
ijassa-821	50	20	;	;	PUNCT
ijassa-821	50	21	planning	plan	VERB
ijassa-821	50	22	routes	route	NOUN
ijassa-821	50	23	in	in	ADP
ijassa-821	50	24	controlled	control	VERB
ijassa-821	50	25	airspace	airspace	NOUN
ijassa-821	50	26	[	[	X
ijassa-821	50	27	12	12	NUM
ijassa-821	50	28	]	]	PUNCT
ijassa-821	50	29	.	.	PUNCT
ijassa-821	51	1	despite	despite	SCONJ
ijassa-821	51	2	the	the	DET
ijassa-821	51	3	seeming	seeming	ADJ
ijassa-821	51	4	simplicity	simplicity	NOUN
ijassa-821	51	5	of	of	ADP
ijassa-821	51	6	the	the	DET
ijassa-821	51	7	mathematical	mathematical	ADJ
ijassa-821	51	8	model	model	NOUN
ijassa-821	51	9	of	of	ADP
ijassa-821	51	10	the	the	DET
ijassa-821	51	11	travelling	travel	VERB
ijassa-821	51	12	salesman	salesman	NOUN
ijassa-821	51	13	problem	problem	NOUN
ijassa-821	51	14	,	,	PUNCT
ijassa-821	51	15	it	it	PRON
ijassa-821	51	16	still	still	ADV
ijassa-821	51	17	receives	receive	VERB
ijassa-821	51	18	close	close	ADJ
ijassa-821	51	19	attention	attention	NOUN
ijassa-821	51	20	from	from	ADP
ijassa-821	51	21	specialists	specialist	NOUN
ijassa-821	51	22	while	while	SCONJ
ijassa-821	51	23	considering	consider	VERB
ijassa-821	51	24	the	the	DET
ijassa-821	51	25	problem	problem	NOUN
ijassa-821	51	26	in	in	ADP
ijassa-821	51	27	new	new	ADJ
ijassa-821	51	28	formulations	formulation	NOUN
ijassa-821	51	29	and	and	CCONJ
ijassa-821	51	30	under	under	ADP
ijassa-821	51	31	various	various	ADJ
ijassa-821	51	32	restrictions	restriction	NOUN
ijassa-821	51	33	and	and	CCONJ
ijassa-821	51	34	constraints	constraint	NOUN
ijassa-821	51	35	.	.	PUNCT
ijassa-821	52	1	copyright	copyright	NOUN
ijassa-821	52	2	©	©	PROPN
ijassa-821	52	3	2020	2020	NUM
ijassa-821	52	4	assa	assa	NOUN
ijassa-821	52	5	.	.	PUNCT
ijassa-821	53	1	adv	adv	PROPN
ijassa-821	53	2	syst	syst	PROPN
ijassa-821	53	3	sci	sci	PROPN
ijassa-821	53	4	appl	appl	PROPN
ijassa-821	53	5	(	(	PUNCT
ijassa-821	53	6	2020	2020	NUM
ijassa-821	53	7	)	)	PUNCT
ijassa-821	53	8	34	34	NUM
ijassa-821	53	9	v.	v.	ADP
ijassa-821	53	10	v.	v.	CCONJ
ijassa-821	53	11	zakharov	zakharov	PROPN
ijassa-821	53	12	,	,	PUNCT
ijassa-821	53	13	a.	a.	NOUN
ijassa-821	53	14	v.	v.	ADP
ijassa-821	53	15	mugayskikh	mugayskikh	NOUN
ijassa-821	53	16	2.2	2.2	NUM
ijassa-821	53	17	.	.	PUNCT
ijassa-821	54	1	algorithms	algorithm	NOUN
ijassa-821	54	2	and	and	CCONJ
ijassa-821	54	3	methods	method	NOUN
ijassa-821	54	4	all	all	PRON
ijassa-821	54	5	of	of	ADP
ijassa-821	54	6	approaches	approach	NOUN
ijassa-821	54	7	solving	solve	VERB
ijassa-821	54	8	travelling	travel	VERB
ijassa-821	54	9	salesman	salesman	ADJ
ijassa-821	54	10	problem	problem	NOUN
ijassa-821	54	11	can	can	AUX
ijassa-821	54	12	be	be	AUX
ijassa-821	54	13	assigned	assign	VERB
ijassa-821	54	14	either	either	ADV
ijassa-821	54	15	to	to	PART
ijassa-821	54	16	exact	exact	VERB
ijassa-821	54	17	or	or	CCONJ
ijassa-821	54	18	heuristics	heuristic	NOUN
ijassa-821	54	19	algorithms	algorithm	NOUN
ijassa-821	54	20	.	.	PUNCT
ijassa-821	55	1	brute	brute	ADJ
ijassa-821	55	2	-	-	PUNCT
ijassa-821	55	3	force	force	NOUN
ijassa-821	55	4	search	search	NOUN
ijassa-821	55	5	,	,	PUNCT
ijassa-821	55	6	branch	branch	NOUN
ijassa-821	55	7	and	and	CCONJ
ijassa-821	55	8	bound	bind	VERB
ijassa-821	55	9	algorithm	algorithm	NOUN
ijassa-821	55	10	,	,	PUNCT
ijassa-821	55	11	branch	branch	NOUN
ijassa-821	55	12	and	and	CCONJ
ijassa-821	55	13	cut	cut	VERB
ijassa-821	55	14	methods	method	NOUN
ijassa-821	55	15	and	and	CCONJ
ijassa-821	55	16	dynamic	dynamic	ADJ
ijassa-821	55	17	programming	programming	NOUN
ijassa-821	55	18	are	be	AUX
ijassa-821	55	19	among	among	ADP
ijassa-821	55	20	the	the	DET
ijassa-821	55	21	exact	exact	ADJ
ijassa-821	55	22	algorithms	algorithm	NOUN
ijassa-821	55	23	.	.	PUNCT
ijassa-821	56	1	the	the	DET
ijassa-821	56	2	branch	branch	NOUN
ijassa-821	56	3	-	-	PUNCT
ijassa-821	56	4	and	and	CCONJ
ijassa-821	56	5	-	-	PUNCT
ijassa-821	56	6	bound	bind	VERB
ijassa-821	56	7	method	method	NOUN
ijassa-821	56	8	and	and	CCONJ
ijassa-821	56	9	the	the	DET
ijassa-821	56	10	branch	branch	NOUN
ijassa-821	56	11	-	-	PUNCT
ijassa-821	56	12	and	and	CCONJ
ijassa-821	56	13	-	-	PUNCT
ijassa-821	56	14	cut	cut	VERB
ijassa-821	56	15	method	method	NOUN
ijassa-821	56	16	represent	represent	VERB
ijassa-821	56	17	the	the	DET
ijassa-821	56	18	modification	modification	NOUN
ijassa-821	56	19	of	of	ADP
ijassa-821	56	20	exhaustive	exhaustive	ADJ
ijassa-821	56	21	search	search	NOUN
ijassa-821	56	22	.	.	PUNCT
ijassa-821	57	1	the	the	DET
ijassa-821	57	2	main	main	ADJ
ijassa-821	57	3	idea	idea	NOUN
ijassa-821	57	4	is	be	AUX
ijassa-821	57	5	to	to	PART
ijassa-821	57	6	form	form	VERB
ijassa-821	57	7	the	the	DET
ijassa-821	57	8	rooted	rooted	ADJ
ijassa-821	57	9	tree	tree	NOUN
ijassa-821	57	10	,	,	PUNCT
ijassa-821	57	11	check	check	VERB
ijassa-821	57	12	the	the	DET
ijassa-821	57	13	bounding	bounding	NOUN
ijassa-821	57	14	criterion	criterion	NOUN
ijassa-821	57	15	bounding	bounding	NOUN
ijassa-821	57	16	and	and	CCONJ
ijassa-821	57	17	discard	discard	VERB
ijassa-821	57	18	the	the	DET
ijassa-821	57	19	current	current	ADJ
ijassa-821	57	20	branch	branch	NOUN
ijassa-821	57	21	if	if	SCONJ
ijassa-821	57	22	it	it	PRON
ijassa-821	57	23	is	be	AUX
ijassa-821	57	24	not	not	PART
ijassa-821	57	25	possible	possible	ADJ
ijassa-821	57	26	to	to	PART
ijassa-821	57	27	produce	produce	VERB
ijassa-821	57	28	a	a	DET
ijassa-821	57	29	better	well	ADJ
ijassa-821	57	30	solution	solution	NOUN
ijassa-821	57	31	than	than	ADP
ijassa-821	57	32	the	the	DET
ijassa-821	57	33	best	good	ADJ
ijassa-821	57	34	one	one	NUM
ijassa-821	57	35	found	find	VERB
ijassa-821	57	36	so	so	ADV
ijassa-821	57	37	far	far	ADV
ijassa-821	57	38	by	by	ADP
ijassa-821	57	39	the	the	DET
ijassa-821	57	40	algorithm	algorithm	NOUN
ijassa-821	57	41	.	.	PUNCT
ijassa-821	58	1	some	some	DET
ijassa-821	58	2	variants	variant	NOUN
ijassa-821	58	3	of	of	ADP
ijassa-821	58	4	this	this	DET
ijassa-821	58	5	approach	approach	NOUN
ijassa-821	58	6	can	can	AUX
ijassa-821	58	7	solve	solve	VERB
ijassa-821	58	8	the	the	DET
ijassa-821	58	9	travelling	travel	VERB
ijassa-821	58	10	salesman	salesman	ADJ
ijassa-821	58	11	problem	problem	NOUN
ijassa-821	58	12	with	with	ADP
ijassa-821	58	13	several	several	ADJ
ijassa-821	58	14	hundred	hundred	NUM
ijassa-821	58	15	vertices	vertex	NOUN
ijassa-821	58	16	,	,	PUNCT
ijassa-821	58	17	however	however	ADV
ijassa-821	58	18	,	,	PUNCT
ijassa-821	58	19	they	they	PRON
ijassa-821	58	20	require	require	VERB
ijassa-821	58	21	high	high	ADJ
ijassa-821	58	22	computation	computation	NOUN
ijassa-821	58	23	power	power	NOUN
ijassa-821	58	24	of	of	ADP
ijassa-821	58	25	the	the	DET
ijassa-821	58	26	computers	computer	NOUN
ijassa-821	58	27	used	use	VERB
ijassa-821	58	28	.	.	PUNCT
ijassa-821	59	1	the	the	DET
ijassa-821	59	2	idea	idea	NOUN
ijassa-821	59	3	of	of	ADP
ijassa-821	59	4	dynamic	dynamic	ADJ
ijassa-821	59	5	programming	programming	NOUN
ijassa-821	59	6	,	,	PUNCT
ijassa-821	59	7	proposed	propose	VERB
ijassa-821	59	8	by	by	ADP
ijassa-821	59	9	r.	r.	PROPN
ijassa-821	59	10	bellman	bellman	NOUN
ijassa-821	60	1	[	[	X
ijassa-821	60	2	3	3	NUM
ijassa-821	60	3	]	]	PUNCT
ijassa-821	60	4	,	,	PUNCT
ijassa-821	60	5	m.	m.	NOUN
ijassa-821	60	6	held	hold	VERB
ijassa-821	60	7	,	,	PUNCT
ijassa-821	60	8	and	and	CCONJ
ijassa-821	60	9	r.	r.	PROPN
ijassa-821	60	10	karp	karp	PROPN
ijassa-821	61	1	[	[	X
ijassa-821	61	2	19	19	NUM
ijassa-821	61	3	]	]	PUNCT
ijassa-821	61	4	,	,	PUNCT
ijassa-821	61	5	can	can	AUX
ijassa-821	61	6	be	be	AUX
ijassa-821	61	7	also	also	ADV
ijassa-821	61	8	applied	apply	VERB
ijassa-821	61	9	to	to	ADP
ijassa-821	61	10	the	the	DET
ijassa-821	61	11	tsp	tsp	NOUN
ijassa-821	61	12	problem	problem	NOUN
ijassa-821	61	13	and	and	CCONJ
ijassa-821	61	14	consists	consist	VERB
ijassa-821	61	15	in	in	ADP
ijassa-821	61	16	a	a	DET
ijassa-821	61	17	many	many	ADJ
ijassa-821	61	18	-	-	PUNCT
ijassa-821	61	19	step	step	NOUN
ijassa-821	61	20	decision	decision	NOUN
ijassa-821	61	21	-	-	PUNCT
ijassa-821	61	22	making	make	VERB
ijassa-821	61	23	process	process	NOUN
ijassa-821	61	24	,	,	PUNCT
ijassa-821	61	25	at	at	ADP
ijassa-821	61	26	each	each	DET
ijassa-821	61	27	step	step	NOUN
ijassa-821	61	28	of	of	ADP
ijassa-821	61	29	which	which	PRON
ijassa-821	61	30	it	it	PRON
ijassa-821	61	31	is	be	AUX
ijassa-821	61	32	necessary	necessary	ADJ
ijassa-821	61	33	to	to	PART
ijassa-821	61	34	determine	determine	VERB
ijassa-821	61	35	the	the	DET
ijassa-821	61	36	bellman	bellman	NOUN
ijassa-821	61	37	function	function	NOUN
ijassa-821	61	38	and	and	CCONJ
ijassa-821	61	39	find	find	VERB
ijassa-821	61	40	the	the	DET
ijassa-821	61	41	best	good	ADJ
ijassa-821	61	42	route	route	NOUN
ijassa-821	61	43	for	for	ADP
ijassa-821	61	44	the	the	DET
ijassa-821	61	45	left	left	ADJ
ijassa-821	61	46	vertices	vertex	NOUN
ijassa-821	61	47	.	.	PUNCT
ijassa-821	62	1	the	the	DET
ijassa-821	62	2	number	number	NOUN
ijassa-821	62	3	of	of	ADP
ijassa-821	62	4	operations	operation	NOUN
ijassa-821	62	5	required	require	VERB
ijassa-821	62	6	to	to	PART
ijassa-821	62	7	calculate	calculate	VERB
ijassa-821	62	8	the	the	DET
ijassa-821	62	9	final	final	ADJ
ijassa-821	62	10	route	route	NOUN
ijassa-821	62	11	increases	increase	NOUN
ijassa-821	62	12	exponentially	exponentially	ADV
ijassa-821	62	13	with	with	ADP
ijassa-821	62	14	of	of	ADP
ijassa-821	62	15	size	size	NOUN
ijassa-821	62	16	of	of	ADP
ijassa-821	62	17	problem	problem	NOUN
ijassa-821	62	18	instance	instance	NOUN
ijassa-821	62	19	.	.	PUNCT
ijassa-821	63	1	due	due	ADP
ijassa-821	63	2	to	to	ADP
ijassa-821	63	3	the	the	DET
ijassa-821	63	4	np	np	NOUN
ijassa-821	63	5	-	-	PUNCT
ijassa-821	63	6	complexity	complexity	NOUN
ijassa-821	63	7	of	of	ADP
ijassa-821	63	8	the	the	DET
ijassa-821	63	9	tsp	tsp	NOUN
ijassa-821	63	10	problem	problem	NOUN
ijassa-821	63	11	,	,	PUNCT
ijassa-821	63	12	exact	exact	ADJ
ijassa-821	63	13	methods	method	NOUN
ijassa-821	63	14	can	can	AUX
ijassa-821	63	15	not	not	PART
ijassa-821	63	16	always	always	ADV
ijassa-821	63	17	be	be	AUX
ijassa-821	63	18	effectively	effectively	ADV
ijassa-821	63	19	applied	apply	VERB
ijassa-821	63	20	to	to	ADP
ijassa-821	63	21	large	large	ADJ
ijassa-821	63	22	-	-	PUNCT
ijassa-821	63	23	scale	scale	NOUN
ijassa-821	63	24	problems	problem	NOUN
ijassa-821	63	25	.	.	PUNCT
ijassa-821	64	1	for	for	ADP
ijassa-821	64	2	this	this	DET
ijassa-821	64	3	reason	reason	NOUN
ijassa-821	64	4	,	,	PUNCT
ijassa-821	64	5	heuristic	heuristic	ADJ
ijassa-821	64	6	methods	method	NOUN
ijassa-821	64	7	are	be	AUX
ijassa-821	64	8	used	use	VERB
ijassa-821	64	9	that	that	PRON
ijassa-821	64	10	generate	generate	VERB
ijassa-821	64	11	solutions	solution	NOUN
ijassa-821	64	12	that	that	PRON
ijassa-821	64	13	are	be	AUX
ijassa-821	64	14	close	close	ADJ
ijassa-821	64	15	to	to	ADP
ijassa-821	64	16	optimal	optimal	ADJ
ijassa-821	64	17	,	,	PUNCT
ijassa-821	64	18	but	but	CCONJ
ijassa-821	64	19	in	in	ADP
ijassa-821	64	20	an	an	DET
ijassa-821	64	21	acceptable	acceptable	ADJ
ijassa-821	64	22	time	time	NOUN
ijassa-821	64	23	compared	compare	VERB
ijassa-821	64	24	to	to	ADP
ijassa-821	64	25	exact	exact	ADJ
ijassa-821	64	26	algorithms	algorithm	NOUN
ijassa-821	64	27	.	.	PUNCT
ijassa-821	65	1	an	an	DET
ijassa-821	65	2	experimental	experimental	ADJ
ijassa-821	65	3	analysis	analysis	NOUN
ijassa-821	65	4	of	of	ADP
ijassa-821	65	5	heuristic	heuristic	ADJ
ijassa-821	65	6	algorithms	algorithm	NOUN
ijassa-821	65	7	for	for	ADP
ijassa-821	65	8	solving	solve	VERB
ijassa-821	65	9	the	the	DET
ijassa-821	65	10	tsp	tsp	NOUN
ijassa-821	65	11	problem	problem	NOUN
ijassa-821	65	12	and	and	CCONJ
ijassa-821	65	13	its	its	PRON
ijassa-821	65	14	subclasses	subclass	NOUN
ijassa-821	65	15	was	be	AUX
ijassa-821	65	16	carried	carry	VERB
ijassa-821	65	17	out	out	ADP
ijassa-821	65	18	in	in	ADP
ijassa-821	65	19	[	[	X
ijassa-821	65	20	17	17	NUM
ijassa-821	65	21	]	]	PUNCT
ijassa-821	65	22	.	.	PUNCT
ijassa-821	66	1	heuristic	heuristic	ADJ
ijassa-821	66	2	algorithms	algorithm	NOUN
ijassa-821	66	3	can	can	AUX
ijassa-821	66	4	be	be	AUX
ijassa-821	66	5	divided	divide	VERB
ijassa-821	66	6	into	into	ADP
ijassa-821	66	7	2	2	NUM
ijassa-821	66	8	classes	class	NOUN
ijassa-821	66	9	according	accord	VERB
ijassa-821	66	10	to	to	ADP
ijassa-821	66	11	the	the	DET
ijassa-821	66	12	method	method	NOUN
ijassa-821	66	13	of	of	ADP
ijassa-821	66	14	generating	generate	VERB
ijassa-821	66	15	the	the	DET
ijassa-821	66	16	final	final	ADJ
ijassa-821	66	17	route	route	NOUN
ijassa-821	66	18	:	:	PUNCT
ijassa-821	66	19	constructive	constructive	ADJ
ijassa-821	66	20	and	and	CCONJ
ijassa-821	66	21	iterative	iterative	ADJ
ijassa-821	66	22	heuristics	heuristic	NOUN
ijassa-821	66	23	.	.	PUNCT
ijassa-821	67	1	tour	tour	NOUN
ijassa-821	67	2	construction	construction	NOUN
ijassa-821	67	3	heuristics	heuristic	NOUN
ijassa-821	67	4	obtain	obtain	VERB
ijassa-821	67	5	only	only	ADV
ijassa-821	67	6	one	one	NUM
ijassa-821	67	7	solution	solution	NOUN
ijassa-821	67	8	without	without	ADP
ijassa-821	67	9	its	its	PRON
ijassa-821	67	10	further	further	ADJ
ijassa-821	67	11	improvement	improvement	NOUN
ijassa-821	67	12	[	[	X
ijassa-821	67	13	24	24	NUM
ijassa-821	67	14	]	]	PUNCT
ijassa-821	67	15	.	.	PUNCT
ijassa-821	68	1	for	for	ADP
ijassa-821	68	2	example	example	NOUN
ijassa-821	68	3	:	:	PUNCT
ijassa-821	68	4	nearest	near	ADJ
ijassa-821	68	5	neighbour	neighbour	ADJ
ijassa-821	68	6	algorithm	algorithm	NOUN
ijassa-821	68	7	[	[	X
ijassa-821	68	8	23	23	NUM
ijassa-821	68	9	]	]	X
ijassa-821	68	10	,	,	PUNCT
ijassa-821	68	11	greedy	greedy	ADJ
ijassa-821	68	12	algorithm	algorithm	NOUN
ijassa-821	69	1	[	[	X
ijassa-821	69	2	18	18	NUM
ijassa-821	69	3	]	]	PUNCT
ijassa-821	69	4	,	,	PUNCT
ijassa-821	69	5	insertion	insertion	NOUN
ijassa-821	69	6	heuristics	heuristic	NOUN
ijassa-821	69	7	[	[	X
ijassa-821	69	8	14	14	NUM
ijassa-821	69	9	]	]	PUNCT
ijassa-821	69	10	and	and	CCONJ
ijassa-821	69	11	christofides	christofide	NOUN
ijassa-821	69	12	approximation	approximation	NOUN
ijassa-821	69	13	algorithm	algorithm	NOUN
ijassa-821	69	14	presented	present	VERB
ijassa-821	69	15	in	in	ADP
ijassa-821	69	16	[	[	X
ijassa-821	69	17	7	7	NUM
ijassa-821	69	18	]	]	PUNCT
ijassa-821	69	19	.	.	PUNCT
ijassa-821	70	1	the	the	DET
ijassa-821	70	2	algorithms	algorithm	NOUN
ijassa-821	70	3	above	above	ADP
ijassa-821	70	4	sequentially	sequentially	ADV
ijassa-821	70	5	build	build	VERB
ijassa-821	70	6	a	a	DET
ijassa-821	70	7	feasible	feasible	ADJ
ijassa-821	70	8	solution	solution	NOUN
ijassa-821	70	9	by	by	ADP
ijassa-821	70	10	adding	add	VERB
ijassa-821	70	11	vertices	vertex	NOUN
ijassa-821	70	12	to	to	ADP
ijassa-821	70	13	the	the	DET
ijassa-821	70	14	final	final	ADJ
ijassa-821	70	15	route	route	NOUN
ijassa-821	70	16	until	until	SCONJ
ijassa-821	70	17	a	a	DET
ijassa-821	70	18	complete	complete	ADJ
ijassa-821	70	19	route	route	NOUN
ijassa-821	70	20	is	be	AUX
ijassa-821	70	21	formed	form	VERB
ijassa-821	70	22	.	.	PUNCT
ijassa-821	71	1	the	the	DET
ijassa-821	71	2	part	part	NOUN
ijassa-821	71	3	of	of	ADP
ijassa-821	71	4	the	the	DET
ijassa-821	71	5	solution	solution	NOUN
ijassa-821	71	6	built	build	VERB
ijassa-821	71	7	to	to	ADP
ijassa-821	71	8	the	the	DET
ijassa-821	71	9	current	current	ADJ
ijassa-821	71	10	moment	moment	NOUN
ijassa-821	71	11	will	will	AUX
ijassa-821	71	12	remain	remain	VERB
ijassa-821	71	13	unchanged	unchanged	ADJ
ijassa-821	71	14	until	until	ADP
ijassa-821	71	15	the	the	DET
ijassa-821	71	16	end	end	NOUN
ijassa-821	71	17	of	of	ADP
ijassa-821	71	18	the	the	DET
ijassa-821	71	19	algorithm	algorithm	NOUN
ijassa-821	71	20	.	.	PUNCT
ijassa-821	72	1	the	the	DET
ijassa-821	72	2	length	length	NOUN
ijassa-821	72	3	of	of	ADP
ijassa-821	72	4	generated	generate	VERB
ijassa-821	72	5	solutions	solution	NOUN
ijassa-821	72	6	is	be	AUX
ijassa-821	72	7	about	about	ADV
ijassa-821	72	8	10–15	10–15	NUM
ijassa-821	72	9	%	%	NOUN
ijassa-821	72	10	away	away	ADV
ijassa-821	72	11	from	from	ADP
ijassa-821	72	12	the	the	DET
ijassa-821	72	13	optimal	optimal	ADJ
ijassa-821	72	14	solution	solution	NOUN
ijassa-821	72	15	.	.	PUNCT
ijassa-821	73	1	more	more	ADV
ijassa-821	73	2	useful	useful	ADJ
ijassa-821	73	3	for	for	ADP
ijassa-821	73	4	getting	get	VERB
ijassa-821	73	5	shorter	short	ADJ
ijassa-821	73	6	routes	route	NOUN
ijassa-821	73	7	are	be	AUX
ijassa-821	73	8	tour	tour	NOUN
ijassa-821	73	9	improvement	improvement	NOUN
ijassa-821	73	10	heuristics	heuristic	NOUN
ijassa-821	73	11	.	.	PUNCT
ijassa-821	74	1	there	there	PRON
ijassa-821	74	2	methods	method	NOUN
ijassa-821	74	3	begin	begin	VERB
ijassa-821	74	4	to	to	PART
ijassa-821	74	5	work	work	VERB
ijassa-821	74	6	with	with	ADP
ijassa-821	74	7	an	an	DET
ijassa-821	74	8	already	already	ADV
ijassa-821	74	9	prepared	prepare	VERB
ijassa-821	74	10	route	route	NOUN
ijassa-821	74	11	generated	generate	VERB
ijassa-821	74	12	by	by	ADP
ijassa-821	74	13	one	one	NUM
ijassa-821	74	14	of	of	ADP
ijassa-821	74	15	the	the	DET
ijassa-821	74	16	constructive	constructive	ADJ
ijassa-821	74	17	methods	method	NOUN
ijassa-821	74	18	,	,	PUNCT
ijassa-821	74	19	iteratively	iteratively	ADV
ijassa-821	74	20	improving	improve	VERB
ijassa-821	74	21	the	the	DET
ijassa-821	74	22	solution	solution	NOUN
ijassa-821	74	23	at	at	ADP
ijassa-821	74	24	each	each	DET
ijassa-821	74	25	step	step	NOUN
ijassa-821	74	26	.	.	PUNCT
ijassa-821	75	1	there	there	PRON
ijassa-821	75	2	are	be	VERB
ijassa-821	75	3	several	several	ADJ
ijassa-821	75	4	ways	way	NOUN
ijassa-821	75	5	to	to	PART
ijassa-821	75	6	do	do	VERB
ijassa-821	75	7	this	this	DET
ijassa-821	75	8	:	:	PUNCT
ijassa-821	75	9	2	2	NUM
ijassa-821	75	10	-	-	PUNCT
ijassa-821	75	11	opt	opt	NOUN
ijassa-821	75	12	swap	swap	NOUN
ijassa-821	75	13	and	and	CCONJ
ijassa-821	75	14	3	3	NUM
ijassa-821	75	15	-	-	PUNCT
ijassa-821	75	16	opt	opt	NOUN
ijassa-821	75	17	swap	swap	NOUN
ijassa-821	75	18	,	,	PUNCT
ijassa-821	75	19	or	or	CCONJ
ijassa-821	75	20	perform	perform	VERB
ijassa-821	75	21	as	as	ADP
ijassa-821	75	22	a	a	DET
ijassa-821	75	23	part	part	NOUN
ijassa-821	75	24	of	of	ADP
ijassa-821	75	25	local	local	ADJ
ijassa-821	75	26	search	search	NOUN
ijassa-821	75	27	algorithms	algorithm	NOUN
ijassa-821	75	28	and	and	CCONJ
ijassa-821	75	29	the	the	DET
ijassa-821	75	30	lin	lin	PROPN
ijassa-821	75	31	-	-	PUNCT
ijassa-821	75	32	kernigan	kernigan	NOUN
ijassa-821	75	33	heuristics	heuristic	NOUN
ijassa-821	75	34	[	[	X
ijassa-821	75	35	20	20	NUM
ijassa-821	75	36	,	,	PUNCT
ijassa-821	75	37	21	21	NUM
ijassa-821	75	38	]	]	PUNCT
ijassa-821	75	39	.	.	PUNCT
ijassa-821	76	1	metaheuristics	metaheuristic	NOUN
ijassa-821	76	2	as	as	ADP
ijassa-821	76	3	a	a	DET
ijassa-821	76	4	higher	high	ADJ
ijassa-821	76	5	-	-	PUNCT
ijassa-821	76	6	level	level	NOUN
ijassa-821	76	7	procedure	procedure	NOUN
ijassa-821	76	8	also	also	ADV
ijassa-821	76	9	refer	refer	VERB
ijassa-821	76	10	to	to	PART
ijassa-821	76	11	tour	tour	VERB
ijassa-821	76	12	improvement	improvement	NOUN
ijassa-821	76	13	heuristics	heuristic	NOUN
ijassa-821	76	14	[	[	X
ijassa-821	76	15	4	4	NUM
ijassa-821	76	16	,	,	PUNCT
ijassa-821	76	17	13	13	NUM
ijassa-821	76	18	]	]	PUNCT
ijassa-821	76	19	.	.	PUNCT
ijassa-821	77	1	these	these	PRON
ijassa-821	77	2	are	be	AUX
ijassa-821	77	3	quite	quite	ADV
ijassa-821	77	4	general	general	ADJ
ijassa-821	77	5	iterative	iterative	NOUN
ijassa-821	77	6	procedures	procedure	NOUN
ijassa-821	77	7	using	use	VERB
ijassa-821	77	8	randomization	randomization	NOUN
ijassa-821	77	9	and	and	CCONJ
ijassa-821	77	10	self	self	NOUN
ijassa-821	77	11	-	-	PUNCT
ijassa-821	77	12	learning	learn	VERB
ijassa-821	77	13	elements	element	NOUN
ijassa-821	77	14	,	,	PUNCT
ijassa-821	77	15	intensification	intensification	NOUN
ijassa-821	77	16	and	and	CCONJ
ijassa-821	77	17	diversification	diversification	NOUN
ijassa-821	77	18	of	of	ADP
ijassa-821	77	19	the	the	DET
ijassa-821	77	20	search	search	NOUN
ijassa-821	77	21	,	,	PUNCT
ijassa-821	77	22	adaptive	adaptive	ADJ
ijassa-821	77	23	control	control	NOUN
ijassa-821	77	24	mechanisms	mechanism	NOUN
ijassa-821	77	25	,	,	PUNCT
ijassa-821	77	26	as	as	ADV
ijassa-821	77	27	well	well	ADV
ijassa-821	77	28	as	as	ADP
ijassa-821	77	29	constructive	constructive	ADJ
ijassa-821	77	30	heuristics	heuristic	NOUN
ijassa-821	77	31	and	and	CCONJ
ijassa-821	77	32	local	local	ADJ
ijassa-821	77	33	search	search	NOUN
ijassa-821	77	34	methods	method	NOUN
ijassa-821	77	35	.	.	PUNCT
ijassa-821	78	1	metaheuristics	metaheuristic	NOUN
ijassa-821	78	2	work	work	VERB
ijassa-821	78	3	either	either	CCONJ
ijassa-821	78	4	with	with	ADP
ijassa-821	78	5	single	single	ADJ
ijassa-821	78	6	candidate	candidate	NOUN
ijassa-821	78	7	or	or	CCONJ
ijassa-821	78	8	with	with	ADP
ijassa-821	78	9	whole	whole	ADJ
ijassa-821	78	10	population	population	NOUN
ijassa-821	78	11	of	of	ADP
ijassa-821	78	12	feasible	feasible	ADJ
ijassa-821	78	13	solutions	solution	NOUN
ijassa-821	78	14	.	.	PUNCT
ijassa-821	79	1	single	single	ADJ
ijassa-821	79	2	solution	solution	NOUN
ijassa-821	79	3	approaches	approach	NOUN
ijassa-821	79	4	include	include	VERB
ijassa-821	79	5	variable	variable	ADJ
ijassa-821	79	6	neighborhood	neighborhood	NOUN
ijassa-821	79	7	search	search	NOUN
ijassa-821	79	8	,	,	PUNCT
ijassa-821	79	9	tabu	tabu	NOUN
ijassa-821	79	10	search	search	NOUN
ijassa-821	79	11	,	,	PUNCT
ijassa-821	79	12	simulated	simulate	VERB
ijassa-821	79	13	annealing	anneal	VERB
ijassa-821	79	14	[	[	X
ijassa-821	79	15	15	15	NUM
ijassa-821	79	16	]	]	PUNCT
ijassa-821	79	17	and	and	CCONJ
ijassa-821	79	18	others	other	NOUN
ijassa-821	79	19	.	.	PUNCT
ijassa-821	80	1	population	population	NOUN
ijassa-821	80	2	-	-	PUNCT
ijassa-821	80	3	based	base	VERB
ijassa-821	80	4	approaches	approach	NOUN
ijassa-821	80	5	are	be	AUX
ijassa-821	80	6	genetic	genetic	ADJ
ijassa-821	80	7	algorithms	algorithm	NOUN
ijassa-821	80	8	,	,	PUNCT
ijassa-821	80	9	ant	ant	ADJ
ijassa-821	80	10	colony	colony	NOUN
ijassa-821	80	11	optimization	optimization	NOUN
ijassa-821	80	12	[	[	X
ijassa-821	80	13	10	10	NUM
ijassa-821	80	14	]	]	PUNCT
ijassa-821	80	15	,	,	PUNCT
ijassa-821	80	16	greedy	greedy	ADJ
ijassa-821	80	17	randomized	randomize	VERB
ijassa-821	80	18	adaptive	adaptive	ADJ
ijassa-821	80	19	search	search	NOUN
ijassa-821	80	20	procedure	procedure	NOUN
ijassa-821	80	21	and	and	CCONJ
ijassa-821	80	22	some	some	DET
ijassa-821	80	23	others	other	NOUN
ijassa-821	81	1	[	[	X
ijassa-821	81	2	36	36	NUM
ijassa-821	81	3	]	]	PUNCT
ijassa-821	81	4	.	.	PUNCT
ijassa-821	82	1	3	3	X
ijassa-821	82	2	.	.	X
ijassa-821	82	3	terminology	terminology	NOUN
ijassa-821	82	4	and	and	CCONJ
ijassa-821	82	5	definitions	definition	NOUN
ijassa-821	82	6	further	far	ADV
ijassa-821	82	7	in	in	ADP
ijassa-821	82	8	the	the	DET
ijassa-821	82	9	article	article	NOUN
ijassa-821	82	10	,	,	PUNCT
ijassa-821	82	11	the	the	DET
ijassa-821	82	12	following	follow	VERB
ijassa-821	82	13	terms	term	NOUN
ijassa-821	82	14	and	and	CCONJ
ijassa-821	82	15	definitions	definition	NOUN
ijassa-821	82	16	are	be	AUX
ijassa-821	82	17	used	use	VERB
ijassa-821	82	18	.	.	PUNCT
ijassa-821	83	1	heuristic	heuristic	ADJ
ijassa-821	83	2	algorithm	algorithm	NOUN
ijassa-821	83	3	is	be	AUX
ijassa-821	83	4	a	a	DET
ijassa-821	83	5	problem	problem	NOUN
ijassa-821	83	6	-	-	PUNCT
ijassa-821	83	7	solving	solve	VERB
ijassa-821	83	8	method	method	NOUN
ijassa-821	83	9	,	,	PUNCT
ijassa-821	83	10	which	which	PRON
ijassa-821	83	11	solutions	solution	NOUN
ijassa-821	83	12	may	may	AUX
ijassa-821	83	13	not	not	PART
ijassa-821	83	14	necessarily	necessarily	ADV
ijassa-821	83	15	be	be	AUX
ijassa-821	83	16	optimal	optimal	ADJ
ijassa-821	83	17	,	,	PUNCT
ijassa-821	83	18	but	but	CCONJ
ijassa-821	83	19	about	about	ADP
ijassa-821	83	20	which	which	PRON
ijassa-821	83	21	it	it	PRON
ijassa-821	83	22	is	be	AUX
ijassa-821	83	23	known	know	VERB
ijassa-821	83	24	that	that	SCONJ
ijassa-821	83	25	it	it	PRON
ijassa-821	83	26	gives	give	VERB
ijassa-821	83	27	a	a	DET
ijassa-821	83	28	fairly	fairly	ADV
ijassa-821	83	29	good	good	ADJ
ijassa-821	83	30	solution	solution	NOUN
ijassa-821	83	31	in	in	ADP
ijassa-821	83	32	most	most	ADJ
ijassa-821	83	33	cases	case	NOUN
ijassa-821	83	34	.	.	PUNCT
ijassa-821	84	1	genetic	genetic	ADJ
ijassa-821	84	2	algorithm	algorithm	NOUN
ijassa-821	84	3	is	be	AUX
ijassa-821	84	4	a	a	DET
ijassa-821	84	5	heuristic	heuristic	ADJ
ijassa-821	84	6	algorithm	algorithm	NOUN
ijassa-821	84	7	for	for	ADP
ijassa-821	84	8	solving	solve	VERB
ijassa-821	84	9	optimization	optimization	NOUN
ijassa-821	84	10	problems	problem	NOUN
ijassa-821	84	11	by	by	ADP
ijassa-821	84	12	randomly	randomly	ADV
ijassa-821	84	13	selecting	select	VERB
ijassa-821	84	14	,	,	PUNCT
ijassa-821	84	15	combining	combine	VERB
ijassa-821	84	16	and	and	CCONJ
ijassa-821	84	17	varying	vary	VERB
ijassa-821	84	18	the	the	DET
ijassa-821	84	19	desired	desire	VERB
ijassa-821	84	20	parameters	parameter	NOUN
ijassa-821	84	21	using	use	VERB
ijassa-821	84	22	mechanisms	mechanism	NOUN
ijassa-821	84	23	similar	similar	ADJ
ijassa-821	84	24	to	to	ADP
ijassa-821	84	25	natural	natural	ADJ
ijassa-821	84	26	selection	selection	NOUN
ijassa-821	84	27	occurred	occur	VERB
ijassa-821	84	28	in	in	ADP
ijassa-821	84	29	nature	nature	NOUN
ijassa-821	84	30	,	,	PUNCT
ijassa-821	84	31	generating	generate	VERB
ijassa-821	84	32	different	different	ADJ
ijassa-821	84	33	solutions	solution	NOUN
ijassa-821	84	34	at	at	ADP
ijassa-821	84	35	each	each	DET
ijassa-821	84	36	launch	launch	NOUN
ijassa-821	84	37	due	due	ADP
ijassa-821	84	38	to	to	ADP
ijassa-821	84	39	the	the	DET
ijassa-821	84	40	randomization	randomization	NOUN
ijassa-821	84	41	mechanisms	mechanism	NOUN
ijassa-821	84	42	used	use	VERB
ijassa-821	84	43	in	in	ADP
ijassa-821	84	44	it	it	PRON
ijassa-821	84	45	.	.	PUNCT
ijassa-821	85	1	individual	individual	ADJ
ijassa-821	85	2	is	be	AUX
ijassa-821	85	3	a	a	DET
ijassa-821	85	4	feasible	feasible	ADJ
ijassa-821	85	5	solution	solution	NOUN
ijassa-821	85	6	to	to	ADP
ijassa-821	85	7	a	a	DET
ijassa-821	85	8	problem	problem	NOUN
ijassa-821	85	9	instance	instance	NOUN
ijassa-821	85	10	in	in	ADP
ijassa-821	85	11	a	a	DET
ijassa-821	85	12	genetic	genetic	ADJ
ijassa-821	85	13	algorithm	algorithm	NOUN
ijassa-821	85	14	.	.	PUNCT
ijassa-821	86	1	copyright	copyright	NOUN
ijassa-821	86	2	©	©	PROPN
ijassa-821	86	3	2020	2020	NUM
ijassa-821	86	4	assa	assa	NOUN
ijassa-821	86	5	.	.	PUNCT
ijassa-821	87	1	adv	adv	PROPN
ijassa-821	87	2	syst	syst	PROPN
ijassa-821	87	3	sci	sci	PROPN
ijassa-821	87	4	appl	appl	PROPN
ijassa-821	87	5	(	(	PUNCT
ijassa-821	87	6	2020	2020	NUM
ijassa-821	87	7	)	)	PUNCT
ijassa-821	87	8	dynamic	dynamic	ADJ
ijassa-821	87	9	adaptation	adaptation	NOUN
ijassa-821	87	10	of	of	ADP
ijassa-821	87	11	genetic	genetic	ADJ
ijassa-821	87	12	algorithm	algorithm	NOUN
ijassa-821	87	13	for	for	ADP
ijassa-821	87	14	solving	solve	VERB
ijassa-821	87	15	routing	routing	NOUN
ijassa-821	87	16	problems	problem	NOUN
ijassa-821	87	17	35	35	NUM
ijassa-821	87	18	population	population	NOUN
ijassa-821	87	19	is	be	AUX
ijassa-821	87	20	the	the	DET
ijassa-821	87	21	final	final	ADJ
ijassa-821	87	22	set	set	NOUN
ijassa-821	87	23	of	of	ADP
ijassa-821	87	24	individuals	individual	NOUN
ijassa-821	87	25	in	in	ADP
ijassa-821	87	26	a	a	DET
ijassa-821	87	27	problem	problem	NOUN
ijassa-821	87	28	instance	instance	NOUN
ijassa-821	87	29	,	,	PUNCT
ijassa-821	87	30	which	which	PRON
ijassa-821	87	31	the	the	DET
ijassa-821	87	32	genetic	genetic	ADJ
ijassa-821	87	33	algorithm	algorithm	NOUN
ijassa-821	87	34	will	will	AUX
ijassa-821	87	35	work	work	VERB
ijassa-821	87	36	with	with	ADP
ijassa-821	87	37	.	.	PUNCT
ijassa-821	88	1	chromosome	chromosome	NOUN
ijassa-821	88	2	is	be	AUX
ijassa-821	88	3	a	a	DET
ijassa-821	88	4	set	set	NOUN
ijassa-821	88	5	of	of	ADP
ijassa-821	88	6	genes	gene	NOUN
ijassa-821	88	7	that	that	PRON
ijassa-821	88	8	describe	describe	VERB
ijassa-821	88	9	an	an	DET
ijassa-821	88	10	individual	individual	NOUN
ijassa-821	88	11	.	.	PUNCT
ijassa-821	89	1	in	in	ADP
ijassa-821	89	2	the	the	DET
ijassa-821	89	3	travelling	travel	VERB
ijassa-821	89	4	salesman	salesman	NOUN
ijassa-821	89	5	problem	problem	NOUN
ijassa-821	89	6	,	,	PUNCT
ijassa-821	89	7	genes	gene	NOUN
ijassa-821	89	8	in	in	ADP
ijassa-821	89	9	the	the	DET
ijassa-821	89	10	chromosome	chromosome	NOUN
ijassa-821	89	11	correspond	correspond	NOUN
ijassa-821	89	12	to	to	ADP
ijassa-821	89	13	the	the	DET
ijassa-821	89	14	vertices	vertex	NOUN
ijassa-821	89	15	of	of	ADP
ijassa-821	89	16	the	the	DET
ijassa-821	89	17	test	test	NOUN
ijassa-821	89	18	problem	problem	NOUN
ijassa-821	89	19	.	.	PUNCT
ijassa-821	90	1	chromosome	chromosome	NOUN
ijassa-821	90	2	contains	contain	VERB
ijassa-821	90	3	the	the	DET
ijassa-821	90	4	order	order	NOUN
ijassa-821	90	5	in	in	ADP
ijassa-821	90	6	which	which	PRON
ijassa-821	90	7	the	the	DET
ijassa-821	90	8	vertices	vertex	NOUN
ijassa-821	90	9	are	be	AUX
ijassa-821	90	10	passed	pass	VERB
ijassa-821	90	11	through	through	ADP
ijassa-821	90	12	in	in	ADP
ijassa-821	90	13	this	this	DET
ijassa-821	90	14	solution	solution	NOUN
ijassa-821	90	15	.	.	PUNCT
ijassa-821	91	1	gene	gene	NOUN
ijassa-821	91	2	is	be	AUX
ijassa-821	91	3	an	an	DET
ijassa-821	91	4	atomic	atomic	ADJ
ijassa-821	91	5	element	element	NOUN
ijassa-821	91	6	of	of	ADP
ijassa-821	91	7	a	a	DET
ijassa-821	91	8	chromosome	chromosome	NOUN
ijassa-821	91	9	.	.	PUNCT
ijassa-821	92	1	crossover	crossover	NOUN
ijassa-821	92	2	is	be	AUX
ijassa-821	92	3	the	the	DET
ijassa-821	92	4	main	main	ADJ
ijassa-821	92	5	stage	stage	NOUN
ijassa-821	92	6	of	of	ADP
ijassa-821	92	7	the	the	DET
ijassa-821	92	8	genetic	genetic	ADJ
ijassa-821	92	9	algorithm	algorithm	NOUN
ijassa-821	92	10	,	,	PUNCT
ijassa-821	92	11	in	in	ADP
ijassa-821	92	12	which	which	PRON
ijassa-821	92	13	two	two	NUM
ijassa-821	92	14	individuals	individual	NOUN
ijassa-821	92	15	of	of	ADP
ijassa-821	92	16	the	the	DET
ijassa-821	92	17	same	same	ADJ
ijassa-821	92	18	population	population	NOUN
ijassa-821	92	19	take	take	VERB
ijassa-821	92	20	part	part	NOUN
ijassa-821	92	21	.	.	PUNCT
ijassa-821	93	1	by	by	ADP
ijassa-821	93	2	combining	combine	VERB
ijassa-821	93	3	and	and	CCONJ
ijassa-821	93	4	inheriting	inherit	VERB
ijassa-821	93	5	the	the	DET
ijassa-821	93	6	characteristics	characteristic	NOUN
ijassa-821	93	7	of	of	ADP
ijassa-821	93	8	both	both	DET
ijassa-821	93	9	parent	parent	NOUN
ijassa-821	93	10	individuals	individual	NOUN
ijassa-821	93	11	(	(	PUNCT
ijassa-821	93	12	parents	parent	NOUN
ijassa-821	93	13	)	)	PUNCT
ijassa-821	93	14	,	,	PUNCT
ijassa-821	93	15	new	new	ADJ
ijassa-821	93	16	individuals	individual	NOUN
ijassa-821	93	17	(	(	PUNCT
ijassa-821	93	18	children	child	NOUN
ijassa-821	93	19	)	)	PUNCT
ijassa-821	93	20	are	be	AUX
ijassa-821	93	21	generated	generate	VERB
ijassa-821	93	22	,	,	PUNCT
ijassa-821	93	23	and	and	CCONJ
ijassa-821	93	24	the	the	DET
ijassa-821	93	25	quality	quality	NOUN
ijassa-821	93	26	of	of	ADP
ijassa-821	93	27	new	new	ADJ
ijassa-821	93	28	individual	individual	NOUN
ijassa-821	93	29	is	be	AUX
ijassa-821	93	30	improved	improve	VERB
ijassa-821	93	31	as	as	ADV
ijassa-821	93	32	well	well	ADV
ijassa-821	93	33	as	as	ADP
ijassa-821	93	34	the	the	DET
ijassa-821	93	35	quality	quality	NOUN
ijassa-821	93	36	of	of	ADP
ijassa-821	93	37	whole	whole	ADJ
ijassa-821	93	38	offspring	offspring	NOUN
ijassa-821	93	39	population	population	NOUN
ijassa-821	93	40	.	.	PUNCT
ijassa-821	94	1	mutation	mutation	NOUN
ijassa-821	94	2	is	be	AUX
ijassa-821	94	3	one	one	NUM
ijassa-821	94	4	of	of	ADP
ijassa-821	94	5	the	the	DET
ijassa-821	94	6	stages	stage	NOUN
ijassa-821	94	7	of	of	ADP
ijassa-821	94	8	the	the	DET
ijassa-821	94	9	genetic	genetic	ADJ
ijassa-821	94	10	algorithm	algorithm	NOUN
ijassa-821	94	11	,	,	PUNCT
ijassa-821	94	12	in	in	ADP
ijassa-821	94	13	which	which	PRON
ijassa-821	94	14	one	one	NUM
ijassa-821	94	15	individual	individual	NOUN
ijassa-821	94	16	from	from	ADP
ijassa-821	94	17	the	the	DET
ijassa-821	94	18	population	population	NOUN
ijassa-821	94	19	takes	take	VERB
ijassa-821	94	20	part	part	NOUN
ijassa-821	94	21	.	.	PUNCT
ijassa-821	95	1	mutation	mutation	NOUN
ijassa-821	95	2	is	be	AUX
ijassa-821	95	3	carried	carry	VERB
ijassa-821	95	4	out	out	ADP
ijassa-821	95	5	with	with	ADP
ijassa-821	95	6	the	the	DET
ijassa-821	95	7	aim	aim	NOUN
ijassa-821	95	8	of	of	ADP
ijassa-821	95	9	restoring	restore	VERB
ijassa-821	95	10	the	the	DET
ijassa-821	95	11	individuals	individual	NOUN
ijassa-821	95	12	dropped	drop	VERB
ijassa-821	95	13	out	out	ADP
ijassa-821	95	14	of	of	ADP
ijassa-821	95	15	the	the	DET
ijassa-821	95	16	population	population	NOUN
ijassa-821	95	17	and	and	CCONJ
ijassa-821	95	18	forming	form	VERB
ijassa-821	95	19	genes	gene	NOUN
ijassa-821	95	20	that	that	PRON
ijassa-821	95	21	were	be	AUX
ijassa-821	95	22	not	not	PART
ijassa-821	95	23	present	present	ADJ
ijassa-821	95	24	in	in	ADP
ijassa-821	95	25	the	the	DET
ijassa-821	95	26	original	original	ADJ
ijassa-821	95	27	population	population	NOUN
ijassa-821	95	28	.	.	PUNCT
ijassa-821	96	1	selection	selection	NOUN
ijassa-821	96	2	is	be	AUX
ijassa-821	96	3	the	the	DET
ijassa-821	96	4	final	final	ADJ
ijassa-821	96	5	stage	stage	NOUN
ijassa-821	96	6	of	of	ADP
ijassa-821	96	7	the	the	DET
ijassa-821	96	8	genetic	genetic	ADJ
ijassa-821	96	9	algorithm	algorithm	NOUN
ijassa-821	96	10	aims	aim	VERB
ijassa-821	96	11	to	to	PART
ijassa-821	96	12	form	form	VERB
ijassa-821	96	13	a	a	DET
ijassa-821	96	14	new	new	ADJ
ijassa-821	96	15	population	population	NOUN
ijassa-821	96	16	of	of	ADP
ijassa-821	96	17	individuals	individual	NOUN
ijassa-821	96	18	by	by	ADP
ijassa-821	96	19	selecting	select	VERB
ijassa-821	96	20	the	the	DET
ijassa-821	96	21	most	most	ADV
ijassa-821	96	22	adapted	adapt	VERB
ijassa-821	96	23	individuals	individual	NOUN
ijassa-821	96	24	for	for	ADP
ijassa-821	96	25	their	their	PRON
ijassa-821	96	26	inclusion	inclusion	NOUN
ijassa-821	96	27	in	in	ADP
ijassa-821	96	28	the	the	DET
ijassa-821	96	29	further	further	ADJ
ijassa-821	96	30	process	process	NOUN
ijassa-821	96	31	of	of	ADP
ijassa-821	96	32	evolution	evolution	NOUN
ijassa-821	96	33	.	.	PUNCT
ijassa-821	97	1	4	4	X
ijassa-821	97	2	.	.	X
ijassa-821	97	3	genetic	genetic	ADJ
ijassa-821	97	4	algorithm	algorithm	NOUN
ijassa-821	97	5	with	with	ADP
ijassa-821	97	6	greffenstte	greffenstte	PROPN
ijassa-821	97	7	’s	’s	PART
ijassa-821	97	8	crossover	crossover	ADP
ijassa-821	97	9	the	the	DET
ijassa-821	97	10	genetic	genetic	ADJ
ijassa-821	97	11	algorithm	algorithm	NOUN
ijassa-821	97	12	is	be	AUX
ijassa-821	97	13	a	a	DET
ijassa-821	97	14	metaheuristic	metaheuristic	ADJ
ijassa-821	97	15	algorithm	algorithm	NOUN
ijassa-821	97	16	,	,	PUNCT
ijassa-821	97	17	which	which	PRON
ijassa-821	97	18	is	be	AUX
ijassa-821	97	19	based	base	VERB
ijassa-821	97	20	on	on	ADP
ijassa-821	97	21	operations	operation	NOUN
ijassa-821	97	22	of	of	ADP
ijassa-821	97	23	natural	natural	ADJ
ijassa-821	97	24	selection	selection	NOUN
ijassa-821	97	25	that	that	PRON
ijassa-821	97	26	occurs	occur	VERB
ijassa-821	97	27	in	in	ADP
ijassa-821	97	28	nature	nature	NOUN
ijassa-821	97	29	.	.	PUNCT
ijassa-821	98	1	it	it	PRON
ijassa-821	98	2	was	be	AUX
ijassa-821	98	3	first	first	ADV
ijassa-821	98	4	introduced	introduce	VERB
ijassa-821	98	5	in	in	ADP
ijassa-821	98	6	1975	1975	NUM
ijassa-821	98	7	by	by	ADP
ijassa-821	98	8	john	john	PROPN
ijassa-821	98	9	holland	holland	PROPN
ijassa-821	98	10	as	as	ADP
ijassa-821	98	11	a	a	DET
ijassa-821	98	12	subcategory	subcategory	NOUN
ijassa-821	98	13	of	of	ADP
ijassa-821	98	14	evolutionary	evolutionary	ADJ
ijassa-821	98	15	algorithms	algorithm	NOUN
ijassa-821	98	16	[	[	X
ijassa-821	98	17	22	22	NUM
ijassa-821	98	18	]	]	PUNCT
ijassa-821	98	19	.	.	PUNCT
ijassa-821	99	1	without	without	ADP
ijassa-821	99	2	detailing	detail	VERB
ijassa-821	99	3	the	the	DET
ijassa-821	99	4	description	description	NOUN
ijassa-821	99	5	of	of	ADP
ijassa-821	99	6	all	all	DET
ijassa-821	99	7	stages	stage	NOUN
ijassa-821	99	8	of	of	ADP
ijassa-821	99	9	the	the	DET
ijassa-821	99	10	genetic	genetic	ADJ
ijassa-821	99	11	algorithm	algorithm	NOUN
ijassa-821	99	12	,	,	PUNCT
ijassa-821	99	13	we	we	PRON
ijassa-821	99	14	briefly	briefly	ADV
ijassa-821	99	15	give	give	VERB
ijassa-821	99	16	a	a	DET
ijassa-821	99	17	pseudocode	pseudocode	NOUN
ijassa-821	99	18	of	of	ADP
ijassa-821	99	19	the	the	DET
ijassa-821	99	20	classical	classical	ADJ
ijassa-821	99	21	genetic	genetic	ADJ
ijassa-821	99	22	algorithm	algorithm	NOUN
ijassa-821	99	23	,	,	PUNCT
ijassa-821	99	24	which	which	PRON
ijassa-821	99	25	consists	consist	VERB
ijassa-821	99	26	of	of	ADP
ijassa-821	99	27	the	the	DET
ijassa-821	99	28	following	follow	VERB
ijassa-821	99	29	steps	step	NOUN
ijassa-821	99	30	:	:	PUNCT
ijassa-821	99	31	1	1	NUM
ijassa-821	99	32	.	.	X
ijassa-821	99	33	initialization	initialization	NOUN
ijassa-821	99	34	of	of	ADP
ijassa-821	99	35	stating	state	VERB
ijassa-821	99	36	population	population	NOUN
ijassa-821	99	37	,	,	PUNCT
ijassa-821	99	38	s	s	PART
ijassa-821	99	39	individuals	individual	NOUN
ijassa-821	99	40	.	.	PUNCT
ijassa-821	100	1	2	2	X
ijassa-821	100	2	.	.	X
ijassa-821	100	3	while	while	SCONJ
ijassa-821	100	4	stop	stop	VERB
ijassa-821	100	5	criterion	criterion	NOUN
ijassa-821	100	6	is	be	AUX
ijassa-821	100	7	not	not	PART
ijassa-821	100	8	met	meet	VERB
ijassa-821	100	9	,	,	PUNCT
ijassa-821	100	10	do	do	VERB
ijassa-821	100	11	:	:	PUNCT
ijassa-821	100	12	3	3	X
ijassa-821	100	13	.	.	X
ijassa-821	100	14	several	several	ADJ
ijassa-821	100	15	crossover	crossover	NOUN
ijassa-821	100	16	operators	operator	NOUN
ijassa-821	100	17	(	(	PUNCT
ijassa-821	100	18	with	with	ADP
ijassa-821	100	19	2	2	NUM
ijassa-821	100	20	two	two	NUM
ijassa-821	100	21	random	random	ADJ
ijassa-821	100	22	individuals	individual	NOUN
ijassa-821	100	23	)	)	PUNCT
ijassa-821	100	24	4	4	NUM
ijassa-821	100	25	.	.	PUNCT
ijassa-821	100	26	several	several	ADJ
ijassa-821	100	27	mutation	mutation	NOUN
ijassa-821	100	28	operators	operator	NOUN
ijassa-821	100	29	(	(	PUNCT
ijassa-821	100	30	random	random	ADJ
ijassa-821	100	31	individual	individual	NOUN
ijassa-821	100	32	)	)	PUNCT
ijassa-821	100	33	5	5	NUM
ijassa-821	100	34	.	.	X
ijassa-821	100	35	evaluation	evaluation	NOUN
ijassa-821	100	36	of	of	ADP
ijassa-821	100	37	fitness	fitness	NOUN
ijassa-821	100	38	function	function	NOUN
ijassa-821	100	39	and	and	CCONJ
ijassa-821	100	40	selection	selection	NOUN
ijassa-821	100	41	applied	apply	VERB
ijassa-821	100	42	to	to	ADP
ijassa-821	100	43	the	the	DET
ijassa-821	100	44	travelling	travel	VERB
ijassa-821	100	45	salesman	salesman	ADJ
ijassa-821	100	46	problem	problem	NOUN
ijassa-821	100	47	,	,	PUNCT
ijassa-821	100	48	each	each	DET
ijassa-821	100	49	individual	individual	NOUN
ijassa-821	100	50	in	in	ADP
ijassa-821	100	51	population	population	NOUN
ijassa-821	100	52	stands	stand	VERB
ijassa-821	100	53	for	for	ADP
ijassa-821	100	54	one	one	NUM
ijassa-821	100	55	feasible	feasible	ADJ
ijassa-821	100	56	solution	solution	NOUN
ijassa-821	100	57	of	of	ADP
ijassa-821	100	58	a	a	DET
ijassa-821	100	59	problem	problem	NOUN
ijassa-821	100	60	instance	instance	NOUN
ijassa-821	100	61	and	and	CCONJ
ijassa-821	100	62	represents	represent	VERB
ijassa-821	100	63	the	the	DET
ijassa-821	100	64	order	order	NOUN
ijassa-821	100	65	in	in	ADP
ijassa-821	100	66	which	which	PRON
ijassa-821	100	67	the	the	DET
ijassa-821	100	68	vertices	vertex	NOUN
ijassa-821	100	69	are	be	AUX
ijassa-821	100	70	visited	visit	VERB
ijassa-821	100	71	.	.	PUNCT
ijassa-821	101	1	the	the	DET
ijassa-821	101	2	fittest	fit	ADJ
ijassa-821	101	3	individual	individual	NOUN
ijassa-821	101	4	in	in	ADP
ijassa-821	101	5	the	the	DET
ijassa-821	101	6	last	last	ADJ
ijassa-821	101	7	population	population	NOUN
ijassa-821	101	8	is	be	AUX
ijassa-821	101	9	accepted	accept	VERB
ijassa-821	101	10	as	as	ADP
ijassa-821	101	11	the	the	DET
ijassa-821	101	12	final	final	ADJ
ijassa-821	101	13	solution	solution	NOUN
ijassa-821	101	14	.	.	PUNCT
ijassa-821	102	1	the	the	DET
ijassa-821	102	2	genetic	genetic	ADJ
ijassa-821	102	3	algorithm	algorithm	NOUN
ijassa-821	102	4	is	be	AUX
ijassa-821	102	5	a	a	DET
ijassa-821	102	6	genetal	genetal	ADJ
ijassa-821	102	7	heuristic	heuristic	ADJ
ijassa-821	102	8	procedure	procedure	NOUN
ijassa-821	102	9	that	that	PRON
ijassa-821	102	10	can	can	AUX
ijassa-821	102	11	be	be	AUX
ijassa-821	102	12	implemented	implement	VERB
ijassa-821	102	13	in	in	ADP
ijassa-821	102	14	a	a	DET
ijassa-821	102	15	software	software	NOUN
ijassa-821	102	16	package	package	NOUN
ijassa-821	102	17	for	for	ADP
ijassa-821	102	18	solving	solve	VERB
ijassa-821	102	19	different	different	ADJ
ijassa-821	102	20	flavors	flavor	NOUN
ijassa-821	102	21	of	of	ADP
ijassa-821	102	22	routing	route	VERB
ijassa-821	102	23	problems	problem	NOUN
ijassa-821	102	24	,	,	PUNCT
ijassa-821	102	25	such	such	ADJ
ijassa-821	102	26	as	as	ADP
ijassa-821	102	27	tsptw	tsptw	NOUN
ijassa-821	102	28	(	(	PUNCT
ijassa-821	102	29	travelling	travel	VERB
ijassa-821	102	30	salesman	salesman	ADJ
ijassa-821	102	31	problem	problem	NOUN
ijassa-821	102	32	with	with	ADP
ijassa-821	102	33	time	time	NOUN
ijassa-821	102	34	windows	window	NOUN
ijassa-821	102	35	)	)	PUNCT
ijassa-821	102	36	,	,	PUNCT
ijassa-821	102	37	irp	irp	NOUN
ijassa-821	102	38	(	(	PUNCT
ijassa-821	102	39	inventory	inventory	NOUN
ijassa-821	102	40	routing	routing	NOUN
ijassa-821	102	41	problem	problem	NOUN
ijassa-821	102	42	)	)	PUNCT
ijassa-821	102	43	,	,	PUNCT
ijassa-821	102	44	vrp	vrp	PROPN
ijassa-821	102	45	(	(	PUNCT
ijassa-821	102	46	vehicle	vehicle	NOUN
ijassa-821	102	47	routing	routing	NOUN
ijassa-821	102	48	problem	problem	NOUN
ijassa-821	102	49	)	)	PUNCT
ijassa-821	102	50	,	,	PUNCT
ijassa-821	102	51	mdvrp	mdvrp	PROPN
ijassa-821	102	52	(	(	PUNCT
ijassa-821	102	53	multi	multi	ADJ
ijassa-821	102	54	-	-	ADJ
ijassa-821	102	55	depot	depot	ADJ
ijassa-821	102	56	vehicle	vehicle	NOUN
ijassa-821	102	57	routing	routing	NOUN
ijassa-821	102	58	problem	problem	NOUN
ijassa-821	102	59	)	)	PUNCT
ijassa-821	102	60	,	,	PUNCT
ijassa-821	102	61	pdp	pdp	PROPN
ijassa-821	102	62	(	(	PUNCT
ijassa-821	102	63	pickup	pickup	NOUN
ijassa-821	102	64	and	and	CCONJ
ijassa-821	102	65	delivery	delivery	NOUN
ijassa-821	102	66	problem	problem	NOUN
ijassa-821	102	67	)	)	PUNCT
ijassa-821	102	68	and	and	CCONJ
ijassa-821	102	69	others	other	NOUN
ijassa-821	102	70	.	.	PUNCT
ijassa-821	103	1	in	in	ADP
ijassa-821	103	2	addition	addition	NOUN
ijassa-821	103	3	,	,	PUNCT
ijassa-821	103	4	genetic	genetic	ADJ
ijassa-821	103	5	heuristics	heuristic	NOUN
ijassa-821	103	6	is	be	AUX
ijassa-821	103	7	capable	capable	ADJ
ijassa-821	103	8	of	of	ADP
ijassa-821	103	9	solving	solve	VERB
ijassa-821	103	10	both	both	CCONJ
ijassa-821	103	11	the	the	DET
ijassa-821	103	12	original	original	ADJ
ijassa-821	103	13	problem	problem	NOUN
ijassa-821	103	14	and	and	CCONJ
ijassa-821	103	15	its	its	PRON
ijassa-821	103	16	sub	sub	NOUN
ijassa-821	103	17	-	-	NOUN
ijassa-821	103	18	problem	problem	NOUN
ijassa-821	103	19	,	,	PUNCT
ijassa-821	103	20	which	which	PRON
ijassa-821	103	21	is	be	AUX
ijassa-821	103	22	necessary	necessary	ADJ
ijassa-821	103	23	condition	condition	NOUN
ijassa-821	103	24	for	for	ADP
ijassa-821	103	25	applying	apply	VERB
ijassa-821	103	26	dynamic	dynamic	ADJ
ijassa-821	103	27	adaptation	adaptation	NOUN
ijassa-821	103	28	procedures	procedure	NOUN
ijassa-821	103	29	of	of	ADP
ijassa-821	103	30	this	this	DET
ijassa-821	103	31	algorithm	algorithm	NOUN
ijassa-821	103	32	.	.	PUNCT
ijassa-821	104	1	as	as	SCONJ
ijassa-821	104	2	it	it	PRON
ijassa-821	104	3	is	be	AUX
ijassa-821	104	4	known	know	VERB
ijassa-821	104	5	,	,	PUNCT
ijassa-821	104	6	the	the	DET
ijassa-821	104	7	main	main	ADJ
ijassa-821	104	8	operator	operator	NOUN
ijassa-821	104	9	of	of	ADP
ijassa-821	104	10	the	the	DET
ijassa-821	104	11	genetic	genetic	ADJ
ijassa-821	104	12	algorithm	algorithm	NOUN
ijassa-821	104	13	,	,	PUNCT
ijassa-821	104	14	which	which	PRON
ijassa-821	104	15	will	will	AUX
ijassa-821	104	16	be	be	AUX
ijassa-821	104	17	discussed	discuss	VERB
ijassa-821	104	18	in	in	ADP
ijassa-821	104	19	details	detail	NOUN
ijassa-821	104	20	in	in	ADP
ijassa-821	104	21	section	section	NOUN
ijassa-821	104	22	5	5	NUM
ijassa-821	104	23	,	,	PUNCT
ijassa-821	104	24	is	be	AUX
ijassa-821	104	25	crossover	crossover	NOUN
ijassa-821	104	26	.	.	PUNCT
ijassa-821	105	1	the	the	DET
ijassa-821	105	2	crossover	crossover	NOUN
ijassa-821	105	3	methods	method	NOUN
ijassa-821	105	4	proposed	propose	VERB
ijassa-821	105	5	in	in	ADP
ijassa-821	105	6	the	the	DET
ijassa-821	105	7	literature	literature	NOUN
ijassa-821	105	8	are	be	AUX
ijassa-821	105	9	valid	valid	ADJ
ijassa-821	105	10	for	for	ADP
ijassa-821	105	11	the	the	DET
ijassa-821	105	12	travelling	travel	VERB
ijassa-821	105	13	salesman	salesman	NOUN
ijassa-821	105	14	problem	problem	NOUN
ijassa-821	105	15	and	and	CCONJ
ijassa-821	105	16	give	give	VERB
ijassa-821	105	17	generally	generally	ADV
ijassa-821	105	18	acceptable	acceptable	ADJ
ijassa-821	105	19	results	result	NOUN
ijassa-821	105	20	,	,	PUNCT
ijassa-821	105	21	but	but	CCONJ
ijassa-821	105	22	they	they	PRON
ijassa-821	105	23	do	do	AUX
ijassa-821	105	24	not	not	PART
ijassa-821	105	25	use	use	VERB
ijassa-821	105	26	information	information	NOUN
ijassa-821	105	27	about	about	ADP
ijassa-821	105	28	the	the	DET
ijassa-821	105	29	distance	distance	NOUN
ijassa-821	105	30	between	between	ADP
ijassa-821	105	31	the	the	DET
ijassa-821	105	32	vertices	vertex	NOUN
ijassa-821	105	33	of	of	ADP
ijassa-821	105	34	the	the	DET
ijassa-821	105	35	tsp	tsp	NOUN
ijassa-821	105	36	problem	problem	NOUN
ijassa-821	105	37	instances	instance	VERB
ijassa-821	105	38	.	.	PUNCT
ijassa-821	106	1	john	john	PROPN
ijassa-821	106	2	greffenstett	greffenstett	PROPN
ijassa-821	106	3	solved	solve	VERB
ijassa-821	106	4	this	this	DET
ijassa-821	106	5	problem	problem	NOUN
ijassa-821	106	6	by	by	ADP
ijassa-821	106	7	proposing	propose	VERB
ijassa-821	106	8	in	in	ADP
ijassa-821	106	9	his	his	PRON
ijassa-821	106	10	work	work	NOUN
ijassa-821	106	11	[	[	X
ijassa-821	106	12	16	16	NUM
ijassa-821	106	13	]	]	PUNCT
ijassa-821	106	14	a	a	DET
ijassa-821	106	15	new	new	ADJ
ijassa-821	106	16	type	type	NOUN
ijassa-821	106	17	of	of	ADP
ijassa-821	106	18	crossover	crossover	NOUN
ijassa-821	106	19	that	that	PRON
ijassa-821	106	20	uses	use	VERB
ijassa-821	106	21	information	information	NOUN
ijassa-821	106	22	about	about	ADP
ijassa-821	106	23	the	the	DET
ijassa-821	106	24	distance	distance	NOUN
ijassa-821	106	25	between	between	ADP
ijassa-821	106	26	vertices	vertex	NOUN
ijassa-821	106	27	.	.	PUNCT
ijassa-821	107	1	as	as	SCONJ
ijassa-821	107	2	applied	apply	VERB
ijassa-821	107	3	to	to	ADP
ijassa-821	107	4	tsp	tsp	NOUN
ijassa-821	107	5	intances	intance	NOUN
ijassa-821	107	6	with	with	ADP
ijassa-821	107	7	a	a	DET
ijassa-821	107	8	symmetric	symmetric	ADJ
ijassa-821	107	9	distance	distance	NOUN
ijassa-821	107	10	matrix	matrix	NOUN
ijassa-821	107	11	of	of	ADP
ijassa-821	107	12	70	70	NUM
ijassa-821	107	13	and	and	CCONJ
ijassa-821	107	14	100	100	NUM
ijassa-821	107	15	vertices	vertex	NOUN
ijassa-821	107	16	of	of	ADP
ijassa-821	107	17	the	the	DET
ijassa-821	107	18	tsplib	tsplib	PROPN
ijassa-821	107	19	test	test	NOUN
ijassa-821	107	20	library	library	NOUN
ijassa-821	108	1	[	[	X
ijassa-821	108	2	32	32	NUM
ijassa-821	108	3	]	]	PUNCT
ijassa-821	108	4	,	,	PUNCT
ijassa-821	108	5	the	the	DET
ijassa-821	108	6	use	use	NOUN
ijassa-821	108	7	of	of	ADP
ijassa-821	108	8	the	the	DET
ijassa-821	108	9	greffenstett	greffenstett	NOUN
ijassa-821	108	10	’s	’s	PART
ijassa-821	108	11	heuristic	heuristic	NOUN
ijassa-821	108	12	at	at	ADP
ijassa-821	108	13	the	the	DET
ijassa-821	108	14	stage	stage	NOUN
ijassa-821	108	15	of	of	ADP
ijassa-821	108	16	crossover	crossover	NOUN
ijassa-821	108	17	helped	help	VERB
ijassa-821	108	18	to	to	PART
ijassa-821	108	19	get	get	VERB
ijassa-821	108	20	shorter	short	ADJ
ijassa-821	108	21	routes	route	NOUN
ijassa-821	108	22	compared	compare	VERB
ijassa-821	108	23	to	to	ADP
ijassa-821	108	24	partially	partially	ADV
ijassa-821	108	25	mapped	map	VERB
ijassa-821	108	26	crossover	crossover	NOUN
ijassa-821	108	27	,	,	PUNCT
ijassa-821	108	28	cycle	cycle	NOUN
ijassa-821	108	29	crossover	crossover	NOUN
ijassa-821	108	30	,	,	PUNCT
ijassa-821	108	31	edge	edge	VERB
ijassa-821	108	32	recombination	recombination	NOUN
ijassa-821	108	33	crossover	crossover	NOUN
ijassa-821	108	34	,	,	PUNCT
ijassa-821	108	35	two	two	NUM
ijassa-821	108	36	-	-	PUNCT
ijassa-821	108	37	point	point	NOUN
ijassa-821	108	38	crossover	crossover	NOUN
ijassa-821	108	39	,	,	PUNCT
ijassa-821	108	40	uniform	uniform	ADJ
ijassa-821	108	41	order	order	NOUN
ijassa-821	108	42	-	-	PUNCT
ijassa-821	108	43	based	base	VERB
ijassa-821	108	44	crossover	crossover	NOUN
ijassa-821	108	45	,	,	PUNCT
ijassa-821	108	46	shuffle	shuffle	VERB
ijassa-821	108	47	crossover	crossover	NOUN
ijassa-821	108	48	and	and	CCONJ
ijassa-821	108	49	sub	sub	ADJ
ijassa-821	108	50	-	-	ADJ
ijassa-821	108	51	tour	tour	ADJ
ijassa-821	108	52	exchange	exchange	NOUN
ijassa-821	108	53	crossover	crossover	NOUN
ijassa-821	108	54	.	.	PUNCT
ijassa-821	109	1	for	for	ADP
ijassa-821	109	2	more	more	ADJ
ijassa-821	109	3	information	information	NOUN
ijassa-821	109	4	on	on	ADP
ijassa-821	109	5	these	these	DET
ijassa-821	109	6	types	type	NOUN
ijassa-821	109	7	of	of	ADP
ijassa-821	109	8	crossovers	crossover	NOUN
ijassa-821	109	9	,	,	PUNCT
ijassa-821	109	10	see	see	VERB
ijassa-821	109	11	[	[	X
ijassa-821	109	12	25	25	NUM
ijassa-821	109	13	]	]	PUNCT
ijassa-821	109	14	.	.	PUNCT
ijassa-821	110	1	for	for	ADP
ijassa-821	110	2	a	a	DET
ijassa-821	110	3	problem	problem	NOUN
ijassa-821	110	4	instance	instance	NOUN
ijassa-821	110	5	with	with	ADP
ijassa-821	110	6	100	100	NUM
ijassa-821	110	7	vertices	vertex	NOUN
ijassa-821	110	8	,	,	PUNCT
ijassa-821	110	9	greffenstett	greffenstett	PROPN
ijassa-821	110	10	’s	’s	PART
ijassa-821	110	11	crossover	crossover	ADP
ijassa-821	110	12	copyright	copyright	NOUN
ijassa-821	110	13	©	©	PROPN
ijassa-821	110	14	2020	2020	NUM
ijassa-821	110	15	assa	assa	NOUN
ijassa-821	110	16	.	.	PUNCT
ijassa-821	111	1	adv	adv	PROPN
ijassa-821	111	2	syst	syst	PROPN
ijassa-821	111	3	sci	sci	PROPN
ijassa-821	111	4	appl	appl	PROPN
ijassa-821	111	5	(	(	PUNCT
ijassa-821	111	6	2020	2020	NUM
ijassa-821	111	7	)	)	PUNCT
ijassa-821	111	8	36	36	NUM
ijassa-821	111	9	v.	v.	ADP
ijassa-821	111	10	v.	v.	ADP
ijassa-821	111	11	zakharov	zakharov	PROPN
ijassa-821	111	12	,	,	PUNCT
ijassa-821	111	13	a.	a.	NOUN
ijassa-821	111	14	v.	v.	NOUN
ijassa-821	111	15	mugayskikh	mugayskikh	NOUN
ijassa-821	111	16	showed	show	VERB
ijassa-821	111	17	the	the	DET
ijassa-821	111	18	best	good	ADJ
ijassa-821	111	19	result	result	NOUN
ijassa-821	111	20	among	among	ADP
ijassa-821	111	21	other	other	ADJ
ijassa-821	111	22	kinds	kind	NOUN
ijassa-821	111	23	of	of	ADP
ijassa-821	111	24	crossovers	crossover	NOUN
ijassa-821	111	25	and	and	CCONJ
ijassa-821	111	26	differs	differ	VERB
ijassa-821	111	27	from	from	ADP
ijassa-821	111	28	optimal	optimal	ADJ
ijassa-821	111	29	solution	solution	NOUN
ijassa-821	111	30	by	by	ADP
ijassa-821	111	31	11.9	11.9	NUM
ijassa-821	111	32	%	%	NOUN
ijassa-821	111	33	[	[	X
ijassa-821	111	34	25	25	NUM
ijassa-821	111	35	]	]	PUNCT
ijassa-821	111	36	in	in	ADP
ijassa-821	111	37	work	work	NOUN
ijassa-821	111	38	[	[	X
ijassa-821	111	39	31	31	NUM
ijassa-821	111	40	]	]	PUNCT
ijassa-821	111	41	authors	author	NOUN
ijassa-821	111	42	also	also	ADV
ijassa-821	111	43	compared	compare	VERB
ijassa-821	111	44	8	8	NUM
ijassa-821	111	45	types	type	NOUN
ijassa-821	111	46	of	of	ADP
ijassa-821	111	47	crossover	crossover	NOUN
ijassa-821	111	48	to	to	PART
ijassa-821	111	49	solve	solve	VERB
ijassa-821	111	50	the	the	DET
ijassa-821	111	51	vrp	vrp	PROPN
ijassa-821	111	52	problem	problem	NOUN
ijassa-821	111	53	,	,	PUNCT
ijassa-821	111	54	generalization	generalization	NOUN
ijassa-821	111	55	of	of	ADP
ijassa-821	111	56	the	the	DET
ijassa-821	111	57	tsp	tsp	NOUN
ijassa-821	111	58	problem	problem	NOUN
ijassa-821	111	59	on	on	ADP
ijassa-821	111	60	the	the	DET
ijassa-821	111	61	number	number	NOUN
ijassa-821	111	62	of	of	ADP
ijassa-821	111	63	vehicles	vehicle	NOUN
ijassa-821	111	64	(	(	PUNCT
ijassa-821	111	65	2	2	NUM
ijassa-821	111	66	and	and	CCONJ
ijassa-821	111	67	more	more	ADJ
ijassa-821	111	68	)	)	PUNCT
ijassa-821	111	69	.	.	PUNCT
ijassa-821	112	1	the	the	DET
ijassa-821	112	2	following	follow	VERB
ijassa-821	112	3	crossovers	crossover	NOUN
ijassa-821	112	4	were	be	AUX
ijassa-821	112	5	described	describe	VERB
ijassa-821	112	6	:	:	PUNCT
ijassa-821	112	7	order	order	NOUN
ijassa-821	112	8	crossover	crossover	NOUN
ijassa-821	112	9	,	,	PUNCT
ijassa-821	112	10	partially	partially	ADV
ijassa-821	112	11	mapped	map	VERB
ijassa-821	112	12	crossover	crossover	NOUN
ijassa-821	112	13	,	,	PUNCT
ijassa-821	112	14	edge	edge	VERB
ijassa-821	112	15	recombination	recombination	NOUN
ijassa-821	112	16	crossover	crossover	NOUN
ijassa-821	112	17	,	,	PUNCT
ijassa-821	112	18	cycle	cycle	NOUN
ijassa-821	112	19	crossover	crossover	NOUN
ijassa-821	112	20	,	,	PUNCT
ijassa-821	112	21	alternating	alternate	VERB
ijassa-821	112	22	edges	edge	NOUN
ijassa-821	112	23	crossover	crossover	NOUN
ijassa-821	112	24	,	,	PUNCT
ijassa-821	112	25	greffenstett	greffenstett	PROPN
ijassa-821	112	26	’s	’s	PART
ijassa-821	112	27	crossover	crossover	NOUN
ijassa-821	112	28	and	and	CCONJ
ijassa-821	112	29	its	its	PRON
ijassa-821	112	30	two	two	NUM
ijassa-821	112	31	modifications	modification	NOUN
ijassa-821	112	32	[	[	X
ijassa-821	112	33	31	31	NUM
ijassa-821	112	34	]	]	PUNCT
ijassa-821	112	35	.	.	PUNCT
ijassa-821	113	1	the	the	DET
ijassa-821	113	2	best	good	ADJ
ijassa-821	113	3	results	result	NOUN
ijassa-821	113	4	among	among	ADP
ijassa-821	113	5	the	the	DET
ijassa-821	113	6	mentioned	mention	VERB
ijassa-821	113	7	algorithms	algorithm	NOUN
ijassa-821	113	8	on	on	ADP
ijassa-821	113	9	the	the	DET
ijassa-821	113	10	vrp	vrp	NOUN
ijassa-821	113	11	test	test	NOUN
ijassa-821	113	12	problems	problem	NOUN
ijassa-821	113	13	of	of	ADP
ijassa-821	113	14	the	the	DET
ijassa-821	113	15	christofides	christofide	NOUN
ijassa-821	113	16	standard	standard	ADJ
ijassa-821	113	17	library	library	NOUN
ijassa-821	114	1	[	[	X
ijassa-821	114	2	11	11	NUM
ijassa-821	114	3	]	]	PUNCT
ijassa-821	114	4	were	be	AUX
ijassa-821	114	5	shown	show	VERB
ijassa-821	114	6	by	by	ADP
ijassa-821	114	7	the	the	DET
ijassa-821	114	8	greffenstett	greffenstett	NOUN
ijassa-821	114	9	’s	’s	PART
ijassa-821	114	10	heuristic	heuristic	ADJ
ijassa-821	114	11	crossover	crossover	NOUN
ijassa-821	114	12	and	and	CCONJ
ijassa-821	114	13	its	its	PRON
ijassa-821	114	14	two	two	NUM
ijassa-821	114	15	modifications	modification	NOUN
ijassa-821	114	16	.	.	PUNCT
ijassa-821	115	1	thus	thus	ADV
ijassa-821	115	2	,	,	PUNCT
ijassa-821	115	3	the	the	DET
ijassa-821	115	4	proposed	propose	VERB
ijassa-821	115	5	kind	kind	NOUN
ijassa-821	115	6	of	of	ADP
ijassa-821	115	7	crossover	crossover	NOUN
ijassa-821	115	8	outperforms	outperform	VERB
ijassa-821	115	9	its	its	PRON
ijassa-821	115	10	alternatives	alternative	NOUN
ijassa-821	115	11	in	in	ADP
ijassa-821	115	12	generating	generate	VERB
ijassa-821	115	13	shorter	short	ADJ
ijassa-821	115	14	routes	route	NOUN
ijassa-821	115	15	,	,	PUNCT
ijassa-821	115	16	and	and	CCONJ
ijassa-821	115	17	it	it	PRON
ijassa-821	115	18	was	be	AUX
ijassa-821	115	19	implemented	implement	VERB
ijassa-821	115	20	in	in	ADP
ijassa-821	115	21	the	the	DET
ijassa-821	115	22	genetic	genetic	ADJ
ijassa-821	115	23	algorithm	algorithm	NOUN
ijassa-821	115	24	for	for	ADP
ijassa-821	115	25	solving	solve	VERB
ijassa-821	115	26	problem	problem	NOUN
ijassa-821	115	27	instances	instance	NOUN
ijassa-821	115	28	for	for	ADP
ijassa-821	115	29	further	further	ADJ
ijassa-821	115	30	research	research	NOUN
ijassa-821	115	31	.	.	PUNCT
ijassa-821	116	1	the	the	DET
ijassa-821	116	2	results	result	NOUN
ijassa-821	116	3	are	be	AUX
ijassa-821	116	4	presented	present	VERB
ijassa-821	116	5	in	in	ADP
ijassa-821	116	6	the	the	DET
ijassa-821	116	7	following	follow	VERB
ijassa-821	116	8	sections	section	NOUN
ijassa-821	116	9	of	of	ADP
ijassa-821	116	10	the	the	DET
ijassa-821	116	11	article	article	NOUN
ijassa-821	116	12	.	.	PUNCT
ijassa-821	117	1	the	the	DET
ijassa-821	117	2	following	follow	VERB
ijassa-821	117	3	scheme	scheme	NOUN
ijassa-821	117	4	presents	present	VERB
ijassa-821	117	5	the	the	DET
ijassa-821	117	6	classic	classic	ADJ
ijassa-821	117	7	greffenstett	greffenstett	NOUN
ijassa-821	117	8	crossover	crossover	ADP
ijassa-821	117	9	operation	operation	NOUN
ijassa-821	117	10	:	:	PUNCT
ijassa-821	117	11	1	1	X
ijassa-821	117	12	.	.	X
ijassa-821	117	13	randomly	randomly	ADV
ijassa-821	117	14	chosen	choose	VERB
ijassa-821	117	15	vertice	vertice	NOUN
ijassa-821	117	16	v	v	NOUN
ijassa-821	117	17	is	be	AUX
ijassa-821	117	18	placed	place	VERB
ijassa-821	117	19	in	in	ADP
ijassa-821	117	20	the	the	DET
ijassa-821	117	21	first	first	ADJ
ijassa-821	117	22	gene	gene	NOUN
ijassa-821	117	23	of	of	ADP
ijassa-821	117	24	the	the	DET
ijassa-821	117	25	children	child	NOUN
ijassa-821	117	26	chromosome	chromosome	VERB
ijassa-821	117	27	2	2	NUM
ijassa-821	117	28	.	.	PUNCT
ijassa-821	118	1	while	while	SCONJ
ijassa-821	118	2	complete	complete	ADJ
ijassa-821	118	3	route	route	NOUN
ijassa-821	118	4	is	be	AUX
ijassa-821	118	5	not	not	PART
ijassa-821	118	6	formed	form	VERB
ijassa-821	118	7	,	,	PUNCT
ijassa-821	118	8	do	do	VERB
ijassa-821	118	9	:	:	PUNCT
ijassa-821	118	10	3	3	X
ijassa-821	118	11	.	.	X
ijassa-821	118	12	compare	compare	VERB
ijassa-821	118	13	the	the	DET
ijassa-821	118	14	length	length	NOUN
ijassa-821	118	15	of	of	ADP
ijassa-821	118	16	two	two	NUM
ijassa-821	118	17	edges	edge	NOUN
ijassa-821	118	18	connected	connect	VERB
ijassa-821	118	19	with	with	ADP
ijassa-821	118	20	v	v	NOUN
ijassa-821	118	21	,	,	PUNCT
ijassa-821	118	22	choose	choose	VERB
ijassa-821	118	23	the	the	DET
ijassa-821	118	24	shortest	short	ADJ
ijassa-821	118	25	among	among	ADP
ijassa-821	118	26	them	they	PRON
ijassa-821	118	27	and	and	CCONJ
ijassa-821	118	28	denote	denote	VERB
ijassa-821	118	29	the	the	DET
ijassa-821	118	30	corresponding	correspond	VERB
ijassa-821	118	31	vertice	vertice	NOUN
ijassa-821	118	32	as	as	ADP
ijassa-821	118	33	vmin	vmin	NOUN
ijassa-821	118	34	4	4	NUM
ijassa-821	118	35	.	.	PUNCT
ijassa-821	119	1	if	if	SCONJ
ijassa-821	119	2	vmin	vmin	NOUN
ijassa-821	119	3	is	be	AUX
ijassa-821	119	4	already	already	ADV
ijassa-821	119	5	in	in	ADP
ijassa-821	119	6	children	child	NOUN
ijassa-821	119	7	’s	’s	PART
ijassa-821	119	8	chromosome	chromosome	NOUN
ijassa-821	119	9	,	,	PUNCT
ijassa-821	119	10	then	then	ADV
ijassa-821	119	11	vmin	vmin	NOUN
ijassa-821	119	12	will	will	AUX
ijassa-821	119	13	be	be	AUX
ijassa-821	119	14	the	the	DET
ijassa-821	119	15	randomly	randomly	ADV
ijassa-821	119	16	chosen	choose	VERB
ijassa-821	119	17	vertice	vertice	NOUN
ijassa-821	119	18	in	in	ADP
ijassa-821	119	19	the	the	DET
ijassa-821	119	20	set	set	NOUN
ijassa-821	119	21	of	of	ADP
ijassa-821	119	22	non	non	ADJ
ijassa-821	119	23	-	-	ADJ
ijassa-821	119	24	used	used	ADJ
ijassa-821	119	25	in	in	ADP
ijassa-821	119	26	the	the	DET
ijassa-821	119	27	current	current	ADJ
ijassa-821	119	28	route	route	NOUN
ijassa-821	119	29	5	5	NUM
ijassa-821	119	30	.	.	PUNCT
ijassa-821	119	31	place	place	NOUN
ijassa-821	119	32	vertice	vertice	NOUN
ijassa-821	119	33	vmin	vmin	NOUN
ijassa-821	119	34	in	in	ADP
ijassa-821	119	35	the	the	DET
ijassa-821	119	36	next	next	ADJ
ijassa-821	119	37	gene	gene	NOUN
ijassa-821	119	38	of	of	ADP
ijassa-821	119	39	children	child	NOUN
ijassa-821	119	40	’s	’s	PART
ijassa-821	119	41	individual	individual	ADJ
ijassa-821	119	42	v	v	NOUN
ijassa-821	119	43	=	=	SYM
ijassa-821	119	44	vmin	vmin	NOUN
ijassa-821	119	45	.	.	PUNCT
ijassa-821	120	1	5	5	NUM
ijassa-821	120	2	.	.	NOUN
ijassa-821	120	3	time	time	NOUN
ijassa-821	120	4	inconsistency	inconsistency	NOUN
ijassa-821	120	5	of	of	ADP
ijassa-821	120	6	heuristic	heuristic	ADJ
ijassa-821	120	7	algorithms	algorithm	NOUN
ijassa-821	120	8	in	in	ADP
ijassa-821	120	9	work	work	NOUN
ijassa-821	120	10	[	[	X
ijassa-821	120	11	5	5	NUM
ijassa-821	120	12	]	]	PUNCT
ijassa-821	120	13	,	,	PUNCT
ijassa-821	120	14	the	the	DET
ijassa-821	120	15	authors	author	NOUN
ijassa-821	120	16	note	note	VERB
ijassa-821	120	17	that	that	SCONJ
ijassa-821	120	18	the	the	DET
ijassa-821	120	19	process	process	NOUN
ijassa-821	120	20	of	of	ADP
ijassa-821	120	21	finding	find	VERB
ijassa-821	120	22	the	the	DET
ijassa-821	120	23	optimal	optimal	ADJ
ijassa-821	120	24	solution	solution	NOUN
ijassa-821	120	25	in	in	ADP
ijassa-821	120	26	genetic	genetic	ADJ
ijassa-821	120	27	algorithms	algorithms	NOUN
ijassa-821	120	28	is	be	AUX
ijassa-821	120	29	guided	guide	VERB
ijassa-821	120	30	exclusively	exclusively	ADV
ijassa-821	120	31	by	by	ADP
ijassa-821	120	32	the	the	DET
ijassa-821	120	33	obtained	obtain	VERB
ijassa-821	120	34	values	value	NOUN
ijassa-821	120	35	of	of	ADP
ijassa-821	120	36	the	the	DET
ijassa-821	120	37	objective	objective	ADJ
ijassa-821	120	38	function	function	NOUN
ijassa-821	120	39	at	at	ADP
ijassa-821	120	40	the	the	DET
ijassa-821	120	41	previous	previous	ADJ
ijassa-821	120	42	points	point	NOUN
ijassa-821	120	43	in	in	ADP
ijassa-821	120	44	the	the	DET
ijassa-821	120	45	solution	solution	NOUN
ijassa-821	120	46	space	space	NOUN
ijassa-821	120	47	.	.	PUNCT
ijassa-821	121	1	and	and	CCONJ
ijassa-821	121	2	assumptions	assumption	VERB
ijassa-821	121	3	about	about	ADP
ijassa-821	121	4	such	such	ADJ
ijassa-821	121	5	properties	property	NOUN
ijassa-821	121	6	of	of	ADP
ijassa-821	121	7	the	the	DET
ijassa-821	121	8	objective	objective	ADJ
ijassa-821	121	9	function	function	NOUN
ijassa-821	121	10	such	such	ADJ
ijassa-821	121	11	as	as	ADP
ijassa-821	121	12	convexity	convexity	NOUN
ijassa-821	121	13	,	,	PUNCT
ijassa-821	121	14	differentiability	differentiability	NOUN
ijassa-821	121	15	,	,	PUNCT
ijassa-821	121	16	and	and	CCONJ
ijassa-821	121	17	bellman	bellman	NOUN
ijassa-821	121	18	’s	’s	PART
ijassa-821	121	19	optimality	optimality	NOUN
ijassa-821	121	20	property	property	NOUN
ijassa-821	121	21	optimality	optimality	NOUN
ijassa-821	121	22	are	be	AUX
ijassa-821	121	23	not	not	PART
ijassa-821	121	24	used	use	VERB
ijassa-821	121	25	.	.	PUNCT
ijassa-821	122	1	formulated	formulate	VERB
ijassa-821	122	2	in	in	ADP
ijassa-821	122	3	[	[	X
ijassa-821	122	4	2	2	NUM
ijassa-821	122	5	]	]	PUNCT
ijassa-821	122	6	principle	principle	NOUN
ijassa-821	122	7	of	of	ADP
ijassa-821	122	8	optimality	optimality	NOUN
ijassa-821	122	9	claims	claim	VERB
ijassa-821	122	10	that	that	SCONJ
ijassa-821	122	11	at	at	ADP
ijassa-821	122	12	any	any	DET
ijassa-821	122	13	period	period	NOUN
ijassa-821	122	14	of	of	ADP
ijassa-821	122	15	time	time	NOUN
ijassa-821	122	16	restriction	restriction	NOUN
ijassa-821	122	17	of	of	ADP
ijassa-821	122	18	multi	multi	ADJ
ijassa-821	122	19	-	-	ADJ
ijassa-821	122	20	period	period	ADJ
ijassa-821	122	21	optimal	optimal	ADJ
ijassa-821	122	22	routing	routing	NOUN
ijassa-821	122	23	plan	plan	NOUN
ijassa-821	122	24	found	find	VERB
ijassa-821	122	25	by	by	ADP
ijassa-821	122	26	exact	exact	ADJ
ijassa-821	122	27	algorithm	algorithm	NOUN
ijassa-821	122	28	for	for	ADP
ijassa-821	122	29	any	any	DET
ijassa-821	122	30	remaining	remain	VERB
ijassa-821	122	31	time	time	NOUN
ijassa-821	122	32	horizon	horizon	NOUN
ijassa-821	122	33	appears	appear	VERB
ijassa-821	122	34	to	to	PART
ijassa-821	122	35	be	be	AUX
ijassa-821	122	36	optimal	optimal	ADJ
ijassa-821	122	37	in	in	ADP
ijassa-821	122	38	current	current	ADJ
ijassa-821	122	39	sub	sub	NOUN
ijassa-821	122	40	-	-	NOUN
ijassa-821	122	41	problem	problem	NOUN
ijassa-821	122	42	.	.	PUNCT
ijassa-821	123	1	it	it	PRON
ijassa-821	123	2	’s	’	VERB
ijassa-821	123	3	worth	worth	ADJ
ijassa-821	123	4	noting	note	VERB
ijassa-821	123	5	,	,	PUNCT
ijassa-821	123	6	restriction	restriction	NOUN
ijassa-821	123	7	of	of	ADP
ijassa-821	123	8	solution	solution	NOUN
ijassa-821	123	9	obtained	obtain	VERB
ijassa-821	123	10	by	by	ADP
ijassa-821	123	11	tour	tour	NOUN
ijassa-821	123	12	improvement	improvement	NOUN
ijassa-821	123	13	heuristic	heuristic	ADJ
ijassa-821	123	14	algorithm	algorithm	NOUN
ijassa-821	123	15	could	could	AUX
ijassa-821	123	16	be	be	AUX
ijassa-821	123	17	not	not	PART
ijassa-821	123	18	optimal	optimal	ADJ
ijassa-821	123	19	in	in	ADP
ijassa-821	123	20	a	a	DET
ijassa-821	123	21	current	current	ADJ
ijassa-821	123	22	subproblem	subproblem	NOUN
ijassa-821	123	23	for	for	ADP
ijassa-821	123	24	at	at	ADV
ijassa-821	123	25	least	least	ADJ
ijassa-821	123	26	one	one	NUM
ijassa-821	123	27	of	of	ADP
ijassa-821	123	28	the	the	DET
ijassa-821	123	29	periods	period	NOUN
ijassa-821	123	30	.	.	PUNCT
ijassa-821	124	1	constructive	constructive	ADJ
ijassa-821	124	2	heuristics	heuristic	NOUN
ijassa-821	124	3	almost	almost	ADV
ijassa-821	124	4	always	always	ADV
ijassa-821	124	5	generate	generate	VERB
ijassa-821	124	6	time	time	NOUN
ijassa-821	124	7	consistent	consistent	ADJ
ijassa-821	124	8	routes	route	NOUN
ijassa-821	124	9	,	,	PUNCT
ijassa-821	124	10	however	however	ADV
ijassa-821	124	11	,	,	PUNCT
ijassa-821	124	12	they	they	PRON
ijassa-821	124	13	do	do	AUX
ijassa-821	124	14	not	not	PART
ijassa-821	124	15	provide	provide	VERB
ijassa-821	124	16	a	a	DET
ijassa-821	124	17	high	high	ADJ
ijassa-821	124	18	level	level	NOUN
ijassa-821	124	19	of	of	ADP
ijassa-821	124	20	efficiency	efficiency	NOUN
ijassa-821	124	21	compared	compare	VERB
ijassa-821	124	22	to	to	ADP
ijassa-821	124	23	iterative	iterative	ADJ
ijassa-821	124	24	ones	one	NOUN
ijassa-821	124	25	.	.	PUNCT
ijassa-821	125	1	using	use	VERB
ijassa-821	125	2	the	the	DET
ijassa-821	125	3	principles	principle	NOUN
ijassa-821	125	4	of	of	ADP
ijassa-821	125	5	dynamic	dynamic	ADJ
ijassa-821	125	6	stability	stability	NOUN
ijassa-821	125	7	described	describe	VERB
ijassa-821	125	8	in	in	ADP
ijassa-821	125	9	[	[	X
ijassa-821	125	10	30	30	NUM
ijassa-821	125	11	]	]	PUNCT
ijassa-821	125	12	,	,	PUNCT
ijassa-821	125	13	we	we	PRON
ijassa-821	125	14	introduce	introduce	VERB
ijassa-821	125	15	the	the	DET
ijassa-821	125	16	following	following	ADJ
ijassa-821	125	17	notation	notation	NOUN
ijassa-821	125	18	.	.	PUNCT
ijassa-821	126	1	let	let	VERB
ijassa-821	126	2	us	we	PRON
ijassa-821	126	3	consider	consider	VERB
ijassa-821	126	4	set	set	NOUN
ijassa-821	126	5	of	of	ADP
ijassa-821	126	6	problem	problem	NOUN
ijassa-821	126	7	instances	instance	VERB
ijassa-821	126	8	p	p	NOUN
ijassa-821	126	9	for	for	ADP
ijassa-821	126	10	the	the	DET
ijassa-821	126	11	travelling	travel	VERB
ijassa-821	126	12	salesman	salesman	ADJ
ijassa-821	126	13	problem	problem	NOUN
ijassa-821	126	14	.	.	PUNCT
ijassa-821	127	1	suppose	suppose	VERB
ijassa-821	127	2	that	that	SCONJ
ijassa-821	127	3	for	for	ADP
ijassa-821	127	4	each	each	DET
ijassa-821	127	5	instance	instance	NOUN
ijassa-821	127	6	p	p	PROPN
ijassa-821	127	7	∈	∈	PROPN
ijassa-821	128	1	p	p	X
ijassa-821	128	2	we	we	PRON
ijassa-821	128	3	can	can	AUX
ijassa-821	128	4	obtain	obtain	VERB
ijassa-821	128	5	a	a	DET
ijassa-821	128	6	set	set	NOUN
ijassa-821	128	7	of	of	ADP
ijassa-821	128	8	different	different	ADJ
ijassa-821	128	9	solutions	solution	NOUN
ijassa-821	128	10	s(p	s(p	PROPN
ijassa-821	128	11	)	)	PUNCT
ijassa-821	128	12	generated	generate	VERB
ijassa-821	128	13	by	by	ADP
ijassa-821	128	14	heuristics	heuristic	NOUN
ijassa-821	128	15	.	.	PUNCT
ijassa-821	129	1	each	each	DET
ijassa-821	129	2	solution	solution	NOUN
ijassa-821	129	3	s(p	s(p	PROPN
ijassa-821	129	4	)	)	PUNCT
ijassa-821	129	5	corresponds	correspond	VERB
ijassa-821	129	6	to	to	ADP
ijassa-821	129	7	an	an	DET
ijassa-821	129	8	order	order	NOUN
ijassa-821	129	9	in	in	SCONJ
ijassa-821	129	10	which	which	DET
ijassa-821	129	11	vertices	vertex	NOUN
ijassa-821	129	12	of	of	ADP
ijassa-821	129	13	the	the	DET
ijassa-821	129	14	problem	problem	NOUN
ijassa-821	129	15	instance	instance	NOUN
ijassa-821	129	16	are	be	AUX
ijassa-821	129	17	visited	visit	VERB
ijassa-821	129	18	in	in	ADP
ijassa-821	129	19	a	a	DET
ijassa-821	129	20	route	route	NOUN
ijassa-821	129	21	.	.	PUNCT
ijassa-821	130	1	we	we	PRON
ijassa-821	130	2	consider	consider	VERB
ijassa-821	130	3	the	the	DET
ijassa-821	130	4	order	order	NOUN
ijassa-821	130	5	of	of	ADP
ijassa-821	130	6	the	the	DET
ijassa-821	130	7	vertices	vertex	NOUN
ijassa-821	130	8	of	of	ADP
ijassa-821	130	9	one	one	NUM
ijassa-821	130	10	route	route	NOUN
ijassa-821	130	11	and	and	CCONJ
ijassa-821	130	12	divide	divide	VERB
ijassa-821	130	13	it	it	PRON
ijassa-821	130	14	into	into	ADP
ijassa-821	130	15	t	t	NOUN
ijassa-821	130	16	parts	part	NOUN
ijassa-821	130	17	so	so	SCONJ
ijassa-821	130	18	that	that	SCONJ
ijassa-821	130	19	the	the	DET
ijassa-821	130	20	number	number	NOUN
ijassa-821	130	21	of	of	ADP
ijassa-821	130	22	vertices	vertex	NOUN
ijassa-821	130	23	that	that	PRON
ijassa-821	130	24	were	be	AUX
ijassa-821	130	25	visited	visit	VERB
ijassa-821	130	26	in	in	ADP
ijassa-821	130	27	the	the	DET
ijassa-821	130	28	first	first	ADJ
ijassa-821	130	29	t	t	PROPN
ijassa-821	130	30	parts	part	NOUN
ijassa-821	130	31	of	of	ADP
ijassa-821	130	32	the	the	DET
ijassa-821	130	33	route	route	NOUN
ijassa-821	130	34	is	be	AUX
ijassa-821	130	35	calculated	calculate	VERB
ijassa-821	130	36	by	by	ADP
ijassa-821	130	37	the	the	DET
ijassa-821	130	38	formula	formula	NOUN
ijassa-821	130	39	n(t	n(t	PROPN
ijassa-821	130	40	,	,	PUNCT
ijassa-821	130	41	s(p	s(p	PROPN
ijassa-821	130	42	)	)	PUNCT
ijassa-821	130	43	)	)	PUNCT
ijassa-821	131	1	=	=	PUNCT
ijassa-821	131	2	bn0t	bn0t	PROPN
ijassa-821	131	3	/	/	SYM
ijassa-821	131	4	t	t	PROPN
ijassa-821	131	5	c	c	X
ijassa-821	131	6	,	,	PUNCT
ijassa-821	131	7	where	where	SCONJ
ijassa-821	131	8	n0	n0	PROPN
ijassa-821	131	9	is	be	AUX
ijassa-821	131	10	the	the	DET
ijassa-821	131	11	size	size	NOUN
ijassa-821	131	12	of	of	ADP
ijassa-821	131	13	the	the	DET
ijassa-821	131	14	problem	problem	NOUN
ijassa-821	131	15	instance	instance	NOUN
ijassa-821	131	16	p	p	X
ijassa-821	131	17	,	,	PUNCT
ijassa-821	131	18	and	and	CCONJ
ijassa-821	131	19	t	t	PROPN
ijassa-821	131	20	—	—	PUNCT
ijassa-821	131	21	parameter	parameter	NOUN
ijassa-821	131	22	defined	define	VERB
ijassa-821	131	23	before	before	ADP
ijassa-821	131	24	the	the	DET
ijassa-821	131	25	experiment	experiment	NOUN
ijassa-821	131	26	.	.	PUNCT
ijassa-821	132	1	thus	thus	ADV
ijassa-821	132	2	,	,	PUNCT
ijassa-821	132	3	each	each	DET
ijassa-821	132	4	part	part	NOUN
ijassa-821	132	5	of	of	ADP
ijassa-821	132	6	the	the	DET
ijassa-821	132	7	route	route	NOUN
ijassa-821	132	8	(	(	PUNCT
ijassa-821	132	9	except	except	SCONJ
ijassa-821	132	10	the	the	DET
ijassa-821	132	11	last	last	ADJ
ijassa-821	132	12	)	)	PUNCT
ijassa-821	132	13	contains	contain	VERB
ijassa-821	132	14	the	the	DET
ijassa-821	132	15	same	same	ADJ
ijassa-821	132	16	number	number	NOUN
ijassa-821	132	17	of	of	ADP
ijassa-821	132	18	vertices	vertex	NOUN
ijassa-821	132	19	.	.	PUNCT
ijassa-821	133	1	by	by	ADP
ijassa-821	133	2	the	the	DET
ijassa-821	133	3	period	period	NOUN
ijassa-821	133	4	t	t	PROPN
ijassa-821	133	5	,	,	PUNCT
ijassa-821	133	6	where	where	SCONJ
ijassa-821	133	7	t	t	NOUN
ijassa-821	133	8	=	=	SYM
ijassa-821	133	9	0	0	NUM
ijassa-821	133	10	,	,	PUNCT
ijassa-821	133	11	1	1	NUM
ijassa-821	133	12	,	,	PUNCT
ijassa-821	133	13	.	.	PUNCT
ijassa-821	133	14	.	.	PUNCT
ijassa-821	133	15	.	.	PUNCT
ijassa-821	134	1	,	,	PUNCT
ijassa-821	134	2	t	t	X
ijassa-821	134	3	−	−	NOUN
ijassa-821	134	4	1	1	NUM
ijassa-821	134	5	,	,	PUNCT
ijassa-821	134	6	we	we	PRON
ijassa-821	134	7	mean	mean	VERB
ijassa-821	134	8	the	the	DET
ijassa-821	134	9	time	time	NOUN
ijassa-821	134	10	interval	interval	NOUN
ijassa-821	134	11	in	in	ADP
ijassa-821	134	12	the	the	DET
ijassa-821	134	13	route	route	NOUN
ijassa-821	134	14	that	that	PRON
ijassa-821	134	15	corresponds	correspond	VERB
ijassa-821	134	16	to	to	ADP
ijassa-821	134	17	the	the	DET
ijassa-821	134	18	part	part	NOUN
ijassa-821	134	19	t	t	PROPN
ijassa-821	134	20	of	of	ADP
ijassa-821	134	21	the	the	DET
ijassa-821	134	22	original	original	ADJ
ijassa-821	134	23	solution	solution	NOUN
ijassa-821	134	24	s(p	s(p	PROPN
ijassa-821	134	25	)	)	PUNCT
ijassa-821	134	26	.	.	PUNCT
ijassa-821	135	1	define	define	VERB
ijassa-821	135	2	s+(t	s+(t	PROPN
ijassa-821	135	3	,	,	PUNCT
ijassa-821	135	4	p	p	NOUN
ijassa-821	135	5	)	)	PUNCT
ijassa-821	135	6	as	as	ADP
ijassa-821	135	7	remaining	remain	VERB
ijassa-821	135	8	consequence	consequence	NOUN
ijassa-821	135	9	of	of	ADP
ijassa-821	135	10	nodes	node	NOUN
ijassa-821	135	11	after	after	ADP
ijassa-821	135	12	period	period	NOUN
ijassa-821	135	13	t	t	PROPN
ijassa-821	135	14	and	and	CCONJ
ijassa-821	135	15	s−(t	s−(t	PROPN
ijassa-821	135	16	,	,	PUNCT
ijassa-821	135	17	p	p	NOUN
ijassa-821	135	18	)	)	PUNCT
ijassa-821	135	19	stands	stand	VERB
ijassa-821	135	20	for	for	ADP
ijassa-821	135	21	such	such	ADJ
ijassa-821	135	22	part	part	NOUN
ijassa-821	135	23	of	of	ADP
ijassa-821	135	24	the	the	DET
ijassa-821	135	25	route	route	NOUN
ijassa-821	135	26	that	that	PRON
ijassa-821	135	27	includes	include	VERB
ijassa-821	135	28	nodes	node	NOUN
ijassa-821	135	29	visited	visit	VERB
ijassa-821	135	30	during	during	ADP
ijassa-821	135	31	periods	period	NOUN
ijassa-821	135	32	τ	τ	PROPN
ijassa-821	135	33	=	=	SYM
ijassa-821	135	34	0	0	NUM
ijassa-821	135	35	,	,	PUNCT
ijassa-821	135	36	1	1	NUM
ijassa-821	135	37	,	,	PUNCT
ijassa-821	135	38	.	.	PUNCT
ijassa-821	135	39	.	.	PUNCT
ijassa-821	136	1	.	.	PUNCT
ijassa-821	137	1	,	,	PUNCT
ijassa-821	137	2	t.	t.	NOUN
ijassa-821	137	3	thus	thus	ADV
ijassa-821	137	4	each	each	DET
ijassa-821	137	5	solution	solution	NOUN
ijassa-821	137	6	can	can	AUX
ijassa-821	137	7	be	be	AUX
ijassa-821	137	8	represented	represent	VERB
ijassa-821	137	9	as	as	ADP
ijassa-821	137	10	s(p	s(p	PROPN
ijassa-821	137	11	)	)	PUNCT
ijassa-821	138	1	=	=	VERB
ijassa-821	138	2	s−(t	s−(t	PROPN
ijassa-821	138	3	,	,	PUNCT
ijassa-821	138	4	p	p	NOUN
ijassa-821	138	5	)	)	PUNCT
ijassa-821	138	6	∪	∪	ADP
ijassa-821	138	7	s+(t	s+(t	PROPN
ijassa-821	138	8	,	,	PUNCT
ijassa-821	138	9	p	p	NOUN
ijassa-821	138	10	)	)	PUNCT
ijassa-821	138	11	.	.	PUNCT
ijassa-821	139	1	copyright	copyright	NOUN
ijassa-821	139	2	©	©	PROPN
ijassa-821	139	3	2020	2020	NUM
ijassa-821	139	4	assa	assa	NOUN
ijassa-821	139	5	.	.	PUNCT
ijassa-821	140	1	adv	adv	PROPN
ijassa-821	140	2	syst	syst	PROPN
ijassa-821	140	3	sci	sci	PROPN
ijassa-821	140	4	appl	appl	PROPN
ijassa-821	140	5	(	(	PUNCT
ijassa-821	140	6	2020	2020	NUM
ijassa-821	140	7	)	)	PUNCT
ijassa-821	140	8	dynamic	dynamic	ADJ
ijassa-821	140	9	adaptation	adaptation	NOUN
ijassa-821	140	10	of	of	ADP
ijassa-821	140	11	genetic	genetic	ADJ
ijassa-821	140	12	algorithm	algorithm	NOUN
ijassa-821	140	13	for	for	ADP
ijassa-821	140	14	solving	solve	VERB
ijassa-821	140	15	routing	routing	NOUN
ijassa-821	140	16	problems	problem	NOUN
ijassa-821	140	17	37	37	NUM
ijassa-821	140	18	for	for	ADP
ijassa-821	140	19	t	t	NOUN
ijassa-821	140	20	=	=	SYM
ijassa-821	140	21	1	1	NUM
ijassa-821	140	22	,	,	PUNCT
ijassa-821	140	23	.	.	PUNCT
ijassa-821	140	24	.	.	PUNCT
ijassa-821	140	25	.	.	PUNCT
ijassa-821	141	1	,	,	PUNCT
ijassa-821	141	2	t	t	PROPN
ijassa-821	141	3	−	−	PROPN
ijassa-821	141	4	1	1	NUM
ijassa-821	141	5	we	we	PRON
ijassa-821	141	6	consider	consider	VERB
ijassa-821	141	7	the	the	DET
ijassa-821	141	8	sub	sub	NOUN
ijassa-821	141	9	-	-	NOUN
ijassa-821	141	10	problem	problem	ADJ
ijassa-821	141	11	p(s−(t	p(s−(t	PROPN
ijassa-821	141	12	,	,	PUNCT
ijassa-821	141	13	p	p	NOUN
ijassa-821	141	14	)	)	PUNCT
ijassa-821	141	15	)	)	PUNCT
ijassa-821	141	16	.	.	PUNCT
ijassa-821	142	1	this	this	DET
ijassa-821	142	2	sub	sub	ADJ
ijassa-821	142	3	-	-	NOUN
ijassa-821	142	4	problem	problem	NOUN
ijassa-821	142	5	differs	differ	VERB
ijassa-821	142	6	from	from	ADP
ijassa-821	142	7	initial	initial	ADJ
ijassa-821	142	8	problem	problem	NOUN
ijassa-821	142	9	instance	instance	NOUN
ijassa-821	142	10	.	.	PUNCT
ijassa-821	143	1	firstly	firstly	ADV
ijassa-821	143	2	,	,	PUNCT
ijassa-821	143	3	nodes	node	NOUN
ijassa-821	143	4	already	already	ADV
ijassa-821	143	5	visited	visit	VERB
ijassa-821	143	6	before	before	ADP
ijassa-821	143	7	period	period	NOUN
ijassa-821	143	8	t	t	PROPN
ijassa-821	143	9	are	be	AUX
ijassa-821	143	10	excluded	exclude	VERB
ijassa-821	143	11	for	for	ADP
ijassa-821	143	12	visit	visit	NOUN
ijassa-821	143	13	in	in	ADP
ijassa-821	143	14	next	next	ADJ
ijassa-821	143	15	periods	period	NOUN
ijassa-821	143	16	.	.	PUNCT
ijassa-821	144	1	secondly	secondly	ADV
ijassa-821	144	2	,	,	PUNCT
ijassa-821	144	3	new	new	ADJ
ijassa-821	144	4	depot	depot	NOUN
ijassa-821	144	5	is	be	AUX
ijassa-821	144	6	located	locate	VERB
ijassa-821	144	7	at	at	ADP
ijassa-821	144	8	the	the	DET
ijassa-821	144	9	last	last	ADJ
ijassa-821	144	10	node	node	NOUN
ijassa-821	144	11	of	of	ADP
ijassa-821	144	12	part	part	NOUN
ijassa-821	144	13	s−(t	s−(t	PROPN
ijassa-821	144	14	,	,	PUNCT
ijassa-821	144	15	p	p	NOUN
ijassa-821	144	16	)	)	PUNCT
ijassa-821	144	17	that	that	PRON
ijassa-821	144	18	belongs	belong	VERB
ijassa-821	144	19	to	to	ADP
ijassa-821	144	20	the	the	DET
ijassa-821	144	21	route	route	NOUN
ijassa-821	144	22	s(p	s(p	PROPN
ijassa-821	144	23	)	)	PUNCT
ijassa-821	144	24	.	.	PUNCT
ijassa-821	145	1	then	then	ADV
ijassa-821	145	2	we	we	PRON
ijassa-821	145	3	obtain	obtain	VERB
ijassa-821	145	4	solution	solution	NOUN
ijassa-821	145	5	s(p(s−(t	s(p(s−(t	NOUN
ijassa-821	145	6	,	,	PUNCT
ijassa-821	145	7	p	p	NOUN
ijassa-821	145	8	)	)	PUNCT
ijassa-821	145	9	)	)	PUNCT
ijassa-821	145	10	)	)	PUNCT
ijassa-821	145	11	for	for	ADP
ijassa-821	145	12	the	the	DET
ijassa-821	145	13	sub	sub	NOUN
ijassa-821	145	14	-	-	NOUN
ijassa-821	145	15	problem	problem	ADJ
ijassa-821	145	16	p(s−(t	p(s−(t	PROPN
ijassa-821	145	17	,	,	PUNCT
ijassa-821	145	18	p	p	NOUN
ijassa-821	145	19	)	)	PUNCT
ijassa-821	145	20	)	)	PUNCT
ijassa-821	145	21	using	use	VERB
ijassa-821	145	22	the	the	DET
ijassa-821	145	23	same	same	ADJ
ijassa-821	145	24	heuristics	heuristic	NOUN
ijassa-821	145	25	.	.	PUNCT
ijassa-821	146	1	definition	definition	NOUN
ijassa-821	146	2	5.1	5.1	NUM
ijassa-821	146	3	:	:	PUNCT
ijassa-821	146	4	solution	solution	NOUN
ijassa-821	146	5	s(p	s(p	PROPN
ijassa-821	146	6	)	)	PUNCT
ijassa-821	146	7	(	(	PUNCT
ijassa-821	146	8	routing	route	VERB
ijassa-821	146	9	plan	plan	NOUN
ijassa-821	146	10	)	)	PUNCT
ijassa-821	146	11	,	,	PUNCT
ijassa-821	146	12	obtained	obtain	VERB
ijassa-821	146	13	by	by	ADP
ijassa-821	146	14	heuristic	heuristic	ADJ
ijassa-821	146	15	algorithm	algorithm	NOUN
ijassa-821	146	16	h	h	NOUN
ijassa-821	146	17	,	,	PUNCT
ijassa-821	146	18	is	be	AUX
ijassa-821	146	19	time	time	NOUN
ijassa-821	146	20	consistent	consistent	ADJ
ijassa-821	146	21	according	accord	VERB
ijassa-821	146	22	to	to	ADP
ijassa-821	146	23	algorithm	algorithm	NOUN
ijassa-821	146	24	h	h	NOUN
ijassa-821	146	25	,	,	PUNCT
ijassa-821	146	26	if	if	SCONJ
ijassa-821	146	27	for	for	ADP
ijassa-821	146	28	each	each	DET
ijassa-821	146	29	t	t	NOUN
ijassa-821	146	30	=	=	SYM
ijassa-821	146	31	1	1	NUM
ijassa-821	146	32	,	,	PUNCT
ijassa-821	146	33	.	.	PUNCT
ijassa-821	146	34	.	.	PUNCT
ijassa-821	147	1	.	.	PUNCT
ijassa-821	148	1	,	,	PUNCT
ijassa-821	148	2	t	t	PROPN
ijassa-821	148	3	−	−	PROPN
ijassa-821	148	4	1	1	NUM
ijassa-821	148	5	and	and	CCONJ
ijassa-821	148	6	each	each	DET
ijassa-821	148	7	s(p(s−(t	s(p(s−(t	NOUN
ijassa-821	148	8	,	,	PUNCT
ijassa-821	148	9	p	p	NOUN
ijassa-821	148	10	)	)	PUNCT
ijassa-821	148	11	)	)	PUNCT
ijassa-821	148	12	)	)	PUNCT
ijassa-821	148	13	generated	generate	VERB
ijassa-821	148	14	by	by	ADP
ijassa-821	148	15	h	h	PROPN
ijassa-821	148	16	,	,	PUNCT
ijassa-821	148	17	the	the	DET
ijassa-821	148	18	following	follow	VERB
ijassa-821	148	19	inequality	inequality	NOUN
ijassa-821	148	20	holds	hold	VERB
ijassa-821	148	21	:	:	PUNCT
ijassa-821	148	22	f(s+(t	f(s+(t	NOUN
ijassa-821	148	23	,	,	PUNCT
ijassa-821	148	24	p	p	NOUN
ijassa-821	148	25	)	)	PUNCT
ijassa-821	148	26	)	)	PUNCT
ijassa-821	148	27	6	6	NUM
ijassa-821	148	28	f(s(p(s−(t	f(s(p(s−(t	NOUN
ijassa-821	148	29	,	,	PUNCT
ijassa-821	148	30	p	p	NOUN
ijassa-821	148	31	)	)	PUNCT
ijassa-821	148	32	)	)	PUNCT
ijassa-821	148	33	)	)	PUNCT
ijassa-821	148	34	)	)	PUNCT
ijassa-821	148	35	,	,	PUNCT
ijassa-821	148	36	(	(	PUNCT
ijassa-821	148	37	5.4	5.4	NUM
ijassa-821	148	38	)	)	PUNCT
ijassa-821	148	39	where	where	SCONJ
ijassa-821	148	40	f	f	PROPN
ijassa-821	148	41	is	be	AUX
ijassa-821	148	42	distance	distance	NOUN
ijassa-821	148	43	value	value	NOUN
ijassa-821	148	44	for	for	ADP
ijassa-821	148	45	corresponding	correspond	VERB
ijassa-821	148	46	route	route	NOUN
ijassa-821	148	47	.	.	PUNCT
ijassa-821	149	1	definition	definition	NOUN
ijassa-821	149	2	5.2	5.2	NUM
ijassa-821	149	3	:	:	PUNCT
ijassa-821	149	4	solution	solution	NOUN
ijassa-821	149	5	s(p	s(p	PROPN
ijassa-821	149	6	)	)	PUNCT
ijassa-821	149	7	(	(	PUNCT
ijassa-821	149	8	routing	route	VERB
ijassa-821	149	9	plan	plan	NOUN
ijassa-821	149	10	)	)	PUNCT
ijassa-821	149	11	,	,	PUNCT
ijassa-821	149	12	obtained	obtain	VERB
ijassa-821	149	13	by	by	ADP
ijassa-821	149	14	heuristic	heuristic	ADJ
ijassa-821	149	15	algorithm	algorithm	NOUN
ijassa-821	149	16	h	h	NOUN
ijassa-821	149	17	,	,	PUNCT
ijassa-821	149	18	is	be	AUX
ijassa-821	149	19	time	time	NOUN
ijassa-821	149	20	inconsistent	inconsistent	ADJ
ijassa-821	149	21	according	accord	VERB
ijassa-821	149	22	to	to	ADP
ijassa-821	149	23	algorithm	algorithm	NOUN
ijassa-821	149	24	h	h	NOUN
ijassa-821	149	25	,	,	PUNCT
ijassa-821	149	26	if	if	SCONJ
ijassa-821	149	27	exists	exist	VERB
ijassa-821	149	28	t	t	NOUN
ijassa-821	149	29	′	′	NOUN
ijassa-821	149	30	and	and	CCONJ
ijassa-821	149	31	s(p(s−(t	s(p(s−(t	ADJ
ijassa-821	149	32	′	′	NUM
ijassa-821	149	33	,	,	PUNCT
ijassa-821	149	34	p	p	NOUN
ijassa-821	149	35	)	)	PUNCT
ijassa-821	149	36	)	)	PUNCT
ijassa-821	149	37	)	)	PUNCT
ijassa-821	150	1	generated	generate	VERB
ijassa-821	150	2	by	by	ADP
ijassa-821	150	3	h	h	NOUN
ijassa-821	150	4	,	,	PUNCT
ijassa-821	150	5	and	and	CCONJ
ijassa-821	150	6	the	the	DET
ijassa-821	150	7	following	follow	VERB
ijassa-821	150	8	inequality	inequality	NOUN
ijassa-821	150	9	holds	hold	VERB
ijassa-821	150	10	:	:	PUNCT
ijassa-821	150	11	f(s+(t	f(s+(t	NOUN
ijassa-821	150	12	,	,	PUNCT
ijassa-821	150	13	p	p	NOUN
ijassa-821	150	14	)	)	PUNCT
ijassa-821	150	15	)	)	PUNCT
ijassa-821	150	16	>	>	X
ijassa-821	150	17	f(s(p(s−(t	f(s(p(s−(t	PROPN
ijassa-821	151	1	′	′	INTJ
ijassa-821	151	2	,	,	PUNCT
ijassa-821	152	1	p	p	NOUN
ijassa-821	152	2	)	)	PUNCT
ijassa-821	152	3	)	)	PUNCT
ijassa-821	152	4	)	)	PUNCT
ijassa-821	152	5	)	)	PUNCT
ijassa-821	152	6	.	.	PUNCT
ijassa-821	153	1	(	(	PUNCT
ijassa-821	153	2	5.5	5.5	NUM
ijassa-821	153	3	)	)	PUNCT
ijassa-821	153	4	the	the	DET
ijassa-821	153	5	property	property	NOUN
ijassa-821	153	6	of	of	ADP
ijassa-821	153	7	time	time	NOUN
ijassa-821	153	8	consistency	consistency	NOUN
ijassa-821	153	9	of	of	ADP
ijassa-821	153	10	the	the	DET
ijassa-821	153	11	solution	solution	NOUN
ijassa-821	153	12	in	in	ADP
ijassa-821	153	13	the	the	DET
ijassa-821	153	14	tsp	tsp	NOUN
ijassa-821	153	15	shows	show	VERB
ijassa-821	153	16	that	that	SCONJ
ijassa-821	153	17	moving	move	VERB
ijassa-821	153	18	according	accord	VERB
ijassa-821	153	19	to	to	ADP
ijassa-821	153	20	the	the	DET
ijassa-821	153	21	initial	initial	ADJ
ijassa-821	153	22	route	route	NOUN
ijassa-821	153	23	plan	plan	NOUN
ijassa-821	153	24	,	,	PUNCT
ijassa-821	153	25	no	no	DET
ijassa-821	153	26	shorter	short	ADJ
ijassa-821	153	27	solution	solution	NOUN
ijassa-821	153	28	will	will	AUX
ijassa-821	153	29	be	be	AUX
ijassa-821	153	30	found	find	VERB
ijassa-821	153	31	than	than	ADP
ijassa-821	153	32	the	the	DET
ijassa-821	153	33	current	current	ADJ
ijassa-821	153	34	one	one	NUM
ijassa-821	153	35	in	in	ADP
ijassa-821	153	36	the	the	DET
ijassa-821	153	37	subproblem	subproblem	NOUN
ijassa-821	153	38	generated	generate	VERB
ijassa-821	153	39	by	by	ADP
ijassa-821	153	40	the	the	DET
ijassa-821	153	41	method	method	NOUN
ijassa-821	153	42	described	describe	VERB
ijassa-821	153	43	above	above	ADV
ijassa-821	153	44	.	.	PUNCT
ijassa-821	154	1	and	and	CCONJ
ijassa-821	154	2	vice	vice	ADV
ijassa-821	154	3	versa	versa	ADV
ijassa-821	154	4	,	,	PUNCT
ijassa-821	154	5	time	time	NOUN
ijassa-821	154	6	inconsistency	inconsistency	NOUN
ijassa-821	154	7	of	of	ADP
ijassa-821	154	8	the	the	DET
ijassa-821	154	9	solution	solution	NOUN
ijassa-821	154	10	means	mean	VERB
ijassa-821	154	11	that	that	SCONJ
ijassa-821	154	12	at	at	ADV
ijassa-821	154	13	least	least	ADJ
ijassa-821	154	14	in	in	ADP
ijassa-821	154	15	one	one	NUM
ijassa-821	154	16	of	of	ADP
ijassa-821	154	17	the	the	DET
ijassa-821	154	18	periods	period	NOUN
ijassa-821	154	19	a	a	DET
ijassa-821	154	20	routing	routing	NOUN
ijassa-821	154	21	plan	plan	NOUN
ijassa-821	154	22	can	can	AUX
ijassa-821	154	23	be	be	AUX
ijassa-821	154	24	generated	generate	VERB
ijassa-821	154	25	that	that	PRON
ijassa-821	154	26	will	will	AUX
ijassa-821	154	27	more	more	ADV
ijassa-821	154	28	profitable	profitable	ADJ
ijassa-821	154	29	than	than	ADP
ijassa-821	154	30	the	the	DET
ijassa-821	154	31	current	current	ADJ
ijassa-821	154	32	one	one	NUM
ijassa-821	154	33	.	.	PUNCT
ijassa-821	155	1	we	we	PRON
ijassa-821	155	2	introduce	introduce	VERB
ijassa-821	155	3	the	the	DET
ijassa-821	155	4	procedure	procedure	NOUN
ijassa-821	155	5	for	for	ADP
ijassa-821	155	6	calculating	calculate	VERB
ijassa-821	155	7	the	the	DET
ijassa-821	155	8	level	level	NOUN
ijassa-821	155	9	of	of	ADP
ijassa-821	155	10	time	time	NOUN
ijassa-821	155	11	consistency	consistency	NOUN
ijassa-821	155	12	of	of	ADP
ijassa-821	155	13	the	the	DET
ijassa-821	155	14	heuristic	heuristic	ADJ
ijassa-821	155	15	algorithm	algorithm	NOUN
ijassa-821	155	16	h	h	NOUN
ijassa-821	155	17	for	for	ADP
ijassa-821	155	18	a	a	DET
ijassa-821	155	19	certain	certain	ADJ
ijassa-821	155	20	class	class	NOUN
ijassa-821	155	21	of	of	ADP
ijassa-821	155	22	vehicle	vehicle	NOUN
ijassa-821	155	23	routing	routing	NOUN
ijassa-821	155	24	problems	problem	NOUN
ijassa-821	155	25	.	.	PUNCT
ijassa-821	156	1	1	1	X
ijassa-821	156	2	.	.	X
ijassa-821	156	3	consider	consider	VERB
ijassa-821	156	4	set	set	VERB
ijassa-821	156	5	p	p	NOUN
ijassa-821	156	6	of	of	ADP
ijassa-821	156	7	problem	problem	NOUN
ijassa-821	156	8	instances	instance	NOUN
ijassa-821	156	9	of	of	ADP
ijassa-821	156	10	certain	certain	ADJ
ijassa-821	156	11	class	class	NOUN
ijassa-821	156	12	in	in	ADP
ijassa-821	156	13	routing	routing	NOUN
ijassa-821	156	14	problems	problem	NOUN
ijassa-821	156	15	.	.	PUNCT
ijassa-821	157	1	2	2	X
ijassa-821	157	2	.	.	X
ijassa-821	157	3	generate	generate	VERB
ijassa-821	157	4	set	set	VERB
ijassa-821	157	5	n	n	PROPN
ijassa-821	157	6	of	of	ADP
ijassa-821	157	7	various	various	ADJ
ijassa-821	157	8	solutions	solution	NOUN
ijassa-821	157	9	for	for	ADP
ijassa-821	157	10	every	every	DET
ijassa-821	157	11	p	p	NOUN
ijassa-821	157	12	∈	∈	PROPN
ijassa-821	157	13	p	p	NOUN
ijassa-821	157	14	by	by	ADP
ijassa-821	157	15	heuristic	heuristic	ADJ
ijassa-821	157	16	algorithm	algorithm	NOUN
ijassa-821	157	17	h	h	NOUN
ijassa-821	157	18	.	.	PUNCT
ijassa-821	158	1	obtained	obtain	VERB
ijassa-821	158	2	solutions	solution	NOUN
ijassa-821	158	3	(	(	PUNCT
ijassa-821	158	4	routing	route	VERB
ijassa-821	158	5	plans	plan	NOUN
ijassa-821	158	6	)	)	PUNCT
ijassa-821	158	7	will	will	AUX
ijassa-821	158	8	be	be	AUX
ijassa-821	158	9	different	different	ADJ
ijassa-821	158	10	from	from	ADP
ijassa-821	158	11	each	each	DET
ijassa-821	158	12	other	other	ADJ
ijassa-821	158	13	due	due	ADP
ijassa-821	158	14	to	to	ADP
ijassa-821	158	15	the	the	DET
ijassa-821	158	16	randomization	randomization	NOUN
ijassa-821	158	17	used	use	VERB
ijassa-821	158	18	in	in	ADP
ijassa-821	158	19	heuristic	heuristic	ADJ
ijassa-821	158	20	operators	operator	NOUN
ijassa-821	158	21	:	:	PUNCT
ijassa-821	158	22	crossover	crossover	NOUN
ijassa-821	158	23	,	,	PUNCT
ijassa-821	158	24	mutation	mutation	NOUN
ijassa-821	158	25	,	,	PUNCT
ijassa-821	158	26	selection	selection	NOUN
ijassa-821	158	27	.	.	PUNCT
ijassa-821	159	1	3	3	X
ijassa-821	159	2	.	.	X
ijassa-821	159	3	perform	perform	VERB
ijassa-821	159	4	m	m	NOUN
ijassa-821	159	5	runs	run	NOUN
ijassa-821	159	6	for	for	ADP
ijassa-821	159	7	each	each	DET
ijassa-821	159	8	solution	solution	NOUN
ijassa-821	159	9	s(p	s(p	PROPN
ijassa-821	159	10	)	)	PUNCT
ijassa-821	159	11	∈	∈	PROPN
ijassa-821	159	12	s(p	s(p	PROPN
ijassa-821	159	13	)	)	PUNCT
ijassa-821	159	14	,	,	PUNCT
ijassa-821	159	15	where	where	SCONJ
ijassa-821	159	16	each	each	DET
ijassa-821	159	17	run	run	NOUN
ijassa-821	159	18	includes	include	VERB
ijassa-821	159	19	checking	check	VERB
ijassa-821	159	20	whether	whether	SCONJ
ijassa-821	159	21	solution	solution	NOUN
ijassa-821	159	22	is	be	AUX
ijassa-821	159	23	time	time	NOUN
ijassa-821	159	24	consistent	consistent	ADJ
ijassa-821	159	25	or	or	CCONJ
ijassa-821	159	26	not	not	PART
ijassa-821	159	27	.	.	PUNCT
ijassa-821	160	1	parameter	parameter	PROPN
ijassa-821	160	2	m	m	PROPN
ijassa-821	160	3	aims	aim	VERB
ijassa-821	160	4	to	to	PART
ijassa-821	160	5	average	average	VERB
ijassa-821	160	6	the	the	DET
ijassa-821	160	7	obtained	obtain	VERB
ijassa-821	160	8	results	result	NOUN
ijassa-821	160	9	of	of	ADP
ijassa-821	160	10	calculation	calculation	NOUN
ijassa-821	160	11	,	,	PUNCT
ijassa-821	160	12	assume	assume	VERB
ijassa-821	160	13	m	m	NOUN
ijassa-821	160	14	=	=	NOUN
ijassa-821	160	15	5	5	X
ijassa-821	160	16	.	.	PUNCT
ijassa-821	161	1	starting	start	VERB
ijassa-821	161	2	with	with	ADP
ijassa-821	161	3	t	t	PROPN
ijassa-821	161	4	=	=	SYM
ijassa-821	161	5	1	1	NUM
ijassa-821	161	6	,	,	PUNCT
ijassa-821	161	7	formulate	formulate	ADJ
ijassa-821	161	8	sub	sub	NOUN
ijassa-821	161	9	-	-	NOUN
ijassa-821	161	10	problem	problem	ADJ
ijassa-821	161	11	p(s−(t	p(s−(t	PROPN
ijassa-821	161	12	,	,	PUNCT
ijassa-821	161	13	p	p	NOUN
ijassa-821	161	14	)	)	PUNCT
ijassa-821	161	15	)	)	PUNCT
ijassa-821	161	16	and	and	CCONJ
ijassa-821	161	17	find	find	VERB
ijassa-821	161	18	its	its	PRON
ijassa-821	161	19	solution	solution	NOUN
ijassa-821	161	20	by	by	ADP
ijassa-821	161	21	algorithm	algorithm	NOUN
ijassa-821	161	22	h	h	NOUN
ijassa-821	161	23	.	.	PUNCT
ijassa-821	162	1	check	check	VERB
ijassa-821	162	2	initial	initial	ADJ
ijassa-821	162	3	solution	solution	NOUN
ijassa-821	162	4	to	to	PART
ijassa-821	162	5	be	be	AUX
ijassa-821	162	6	time	time	NOUN
ijassa-821	162	7	consistent	consistent	ADJ
ijassa-821	162	8	after	after	ADP
ijassa-821	162	9	first	first	ADJ
ijassa-821	162	10	period	period	NOUN
ijassa-821	162	11	.	.	PUNCT
ijassa-821	163	1	if	if	SCONJ
ijassa-821	163	2	inequality	inequality	NOUN
ijassa-821	163	3	(	(	PUNCT
ijassa-821	163	4	5.4	5.4	NUM
ijassa-821	163	5	)	)	PUNCT
ijassa-821	163	6	holds	hold	NOUN
ijassa-821	163	7	,	,	PUNCT
ijassa-821	163	8	move	move	VERB
ijassa-821	163	9	to	to	ADP
ijassa-821	163	10	the	the	DET
ijassa-821	163	11	second	second	ADJ
ijassa-821	163	12	period	period	NOUN
ijassa-821	163	13	.	.	PUNCT
ijassa-821	164	1	if	if	SCONJ
ijassa-821	164	2	not	not	PART
ijassa-821	164	3	,	,	PUNCT
ijassa-821	164	4	mark	mark	VERB
ijassa-821	164	5	the	the	DET
ijassa-821	164	6	period	period	NOUN
ijassa-821	164	7	at	at	ADP
ijassa-821	164	8	which	which	PRON
ijassa-821	164	9	property	property	NOUN
ijassa-821	164	10	of	of	ADP
ijassa-821	164	11	time	time	NOUN
ijassa-821	164	12	consistency	consistency	NOUN
ijassa-821	164	13	is	be	AUX
ijassa-821	164	14	violated	violate	VERB
ijassa-821	164	15	and	and	CCONJ
ijassa-821	164	16	start	start	VERB
ijassa-821	164	17	the	the	DET
ijassa-821	164	18	next	next	ADJ
ijassa-821	164	19	run	run	NOUN
ijassa-821	164	20	.	.	PUNCT
ijassa-821	165	1	let	let	VERB
ijassa-821	165	2	b(s	b(	NOUN
ijassa-821	165	3	,	,	PUNCT
ijassa-821	165	4	t	t	PROPN
ijassa-821	165	5	)	)	PUNCT
ijassa-821	165	6	be	be	VERB
ijassa-821	165	7	the	the	DET
ijassa-821	165	8	number	number	NOUN
ijassa-821	165	9	of	of	ADP
ijassa-821	165	10	runs	run	NOUN
ijassa-821	165	11	,	,	PUNCT
ijassa-821	165	12	in	in	ADP
ijassa-821	165	13	which	which	DET
ijassa-821	165	14	time	time	NOUN
ijassa-821	165	15	consistency	consistency	NOUN
ijassa-821	165	16	is	be	AUX
ijassa-821	165	17	violated	violate	VERB
ijassa-821	165	18	for	for	ADP
ijassa-821	165	19	the	the	DET
ijassa-821	165	20	solution	solution	NOUN
ijassa-821	165	21	s(p	s(p	PROPN
ijassa-821	165	22	)	)	PUNCT
ijassa-821	165	23	for	for	ADP
ijassa-821	165	24	period	period	NOUN
ijassa-821	166	1	t.	t.	NOUN
ijassa-821	166	2	if	if	SCONJ
ijassa-821	166	3	s	s	VERB
ijassa-821	166	4	is	be	AUX
ijassa-821	166	5	optimal	optimal	ADJ
ijassa-821	166	6	,	,	PUNCT
ijassa-821	166	7	then	then	ADV
ijassa-821	166	8	regarding	regard	VERB
ijassa-821	166	9	bellman	bellman	NOUN
ijassa-821	166	10	’s	’s	PART
ijassa-821	166	11	principle	principle	NOUN
ijassa-821	166	12	of	of	ADP
ijassa-821	166	13	optimality	optimality	NOUN
ijassa-821	166	14	we	we	PRON
ijassa-821	166	15	would	would	AUX
ijassa-821	166	16	have	have	VERB
ijassa-821	166	17	the	the	DET
ijassa-821	166	18	following	follow	VERB
ijassa-821	166	19	quality	quality	NOUN
ijassa-821	166	20	:	:	PUNCT
ijassa-821	166	21	t−1∑	t−1∑	NUM
ijassa-821	166	22	t=1	t=1	PROPN
ijassa-821	166	23	b(s	b(	NOUN
ijassa-821	166	24	,	,	PUNCT
ijassa-821	166	25	t	t	PROPN
ijassa-821	166	26	)	)	PUNCT
ijassa-821	166	27	=	=	SYM
ijassa-821	167	1	0	0	X
ijassa-821	167	2	.	.	PUNCT
ijassa-821	168	1	(	(	PUNCT
ijassa-821	168	2	5.6	5.6	NUM
ijassa-821	168	3	)	)	PUNCT
ijassa-821	168	4	definition	definition	NOUN
ijassa-821	168	5	5.3	5.3	NUM
ijassa-821	168	6	:	:	PUNCT
ijassa-821	168	7	experimental	experimental	ADJ
ijassa-821	168	8	level	level	NOUN
ijassa-821	168	9	of	of	ADP
ijassa-821	168	10	time	time	NOUN
ijassa-821	168	11	consistency	consistency	NOUN
ijassa-821	168	12	conh	conh	NOUN
ijassa-821	168	13	for	for	ADP
ijassa-821	168	14	heuristics	heuristic	NOUN
ijassa-821	168	15	h	h	NOUN
ijassa-821	168	16	to	to	PART
ijassa-821	168	17	be	be	AUX
ijassa-821	168	18	the	the	DET
ijassa-821	168	19	value	value	NOUN
ijassa-821	168	20	calculated	calculate	VERB
ijassa-821	168	21	as	as	SCONJ
ijassa-821	168	22	follows	follow	VERB
ijassa-821	168	23	conh	conh	NOUN
ijassa-821	168	24	=	=	SYM
ijassa-821	169	1	1−	1−	NUM
ijassa-821	169	2	1	1	NUM
ijassa-821	169	3	m	m	NOUN
ijassa-821	169	4	|p	|p	NOUN
ijassa-821	169	5	|	|	ADV
ijassa-821	169	6	∑	∑	ADP
ijassa-821	169	7	p∈p	p∈p	X
ijassa-821	169	8	1	1	NUM
ijassa-821	169	9	|n	|n	NOUN
ijassa-821	169	10	|	|	ADV
ijassa-821	169	11	∑	∑	PROPN
ijassa-821	169	12	s(p)∈n	s(p)∈n	PROPN
ijassa-821	169	13	t−1∑	t−1∑	PROPN
ijassa-821	169	14	t	t	PROPN
ijassa-821	169	15	b(s(p	b(s(p	PROPN
ijassa-821	169	16	)	)	PUNCT
ijassa-821	169	17	,	,	PUNCT
ijassa-821	169	18	t	t	PROPN
ijassa-821	169	19	)	)	PUNCT
ijassa-821	169	20	.	.	PUNCT
ijassa-821	170	1	(	(	PUNCT
ijassa-821	170	2	5.7	5.7	NUM
ijassa-821	170	3	)	)	PUNCT
ijassa-821	170	4	the	the	DET
ijassa-821	170	5	experimental	experimental	ADJ
ijassa-821	170	6	level	level	NOUN
ijassa-821	170	7	of	of	ADP
ijassa-821	170	8	time	time	NOUN
ijassa-821	170	9	consistency	consistency	NOUN
ijassa-821	170	10	can	can	AUX
ijassa-821	170	11	vary	vary	VERB
ijassa-821	170	12	for	for	ADP
ijassa-821	170	13	problem	problem	NOUN
ijassa-821	170	14	instances	instance	NOUN
ijassa-821	170	15	but	but	CCONJ
ijassa-821	170	16	one	one	PRON
ijassa-821	170	17	can	can	AUX
ijassa-821	170	18	note	note	VERB
ijassa-821	170	19	that	that	SCONJ
ijassa-821	170	20	0	0	NUM
ijassa-821	170	21	≤	≤	NUM
ijassa-821	170	22	conh	conh	NOUN
ijassa-821	170	23	≤	≤	ADV
ijassa-821	170	24	1	1	NUM
ijassa-821	170	25	.	.	PUNCT
ijassa-821	170	26	high	high	ADJ
ijassa-821	170	27	value	value	NOUN
ijassa-821	170	28	of	of	ADP
ijassa-821	170	29	experimental	experimental	ADJ
ijassa-821	170	30	level	level	NOUN
ijassa-821	170	31	of	of	ADP
ijassa-821	170	32	time	time	NOUN
ijassa-821	170	33	consistency	consistency	NOUN
ijassa-821	170	34	for	for	ADP
ijassa-821	170	35	heuristics	heuristic	NOUN
ijassa-821	170	36	forms	form	NOUN
ijassa-821	170	37	expectation	expectation	NOUN
ijassa-821	170	38	that	that	PRON
ijassa-821	170	39	considered	consider	VERB
ijassa-821	170	40	heuristics	heuristic	NOUN
ijassa-821	170	41	generates	generate	VERB
ijassa-821	170	42	solutions	solution	NOUN
ijassa-821	170	43	which	which	PRON
ijassa-821	170	44	tend	tend	VERB
ijassa-821	170	45	to	to	PART
ijassa-821	170	46	stay	stay	VERB
ijassa-821	170	47	optimal	optimal	ADJ
ijassa-821	170	48	during	during	ADP
ijassa-821	170	49	the	the	DET
ijassa-821	170	50	realization	realization	NOUN
ijassa-821	170	51	of	of	ADP
ijassa-821	170	52	its	its	PRON
ijassa-821	170	53	initial	initial	ADJ
ijassa-821	170	54	routing	routing	NOUN
ijassa-821	170	55	plan	plan	NOUN
ijassa-821	170	56	.	.	PUNCT
ijassa-821	171	1	copyright	copyright	NOUN
ijassa-821	171	2	©	©	PROPN
ijassa-821	171	3	2020	2020	NUM
ijassa-821	171	4	assa	assa	NOUN
ijassa-821	171	5	.	.	PUNCT
ijassa-821	172	1	adv	adv	PROPN
ijassa-821	172	2	syst	syst	PROPN
ijassa-821	172	3	sci	sci	PROPN
ijassa-821	172	4	appl	appl	PROPN
ijassa-821	172	5	(	(	PUNCT
ijassa-821	172	6	2020	2020	NUM
ijassa-821	172	7	)	)	PUNCT
ijassa-821	172	8	38	38	NUM
ijassa-821	172	9	v.	v.	ADP
ijassa-821	172	10	v.	v.	ADP
ijassa-821	172	11	zakharov	zakharov	PROPN
ijassa-821	172	12	,	,	PUNCT
ijassa-821	172	13	a.	a.	NOUN
ijassa-821	172	14	v.	v.	ADP
ijassa-821	172	15	mugayskikh	mugayskikh	NOUN
ijassa-821	172	16	6	6	NUM
ijassa-821	172	17	.	.	PUNCT
ijassa-821	172	18	dynamic	dynamic	ADJ
ijassa-821	172	19	adaptation	adaptation	NOUN
ijassa-821	172	20	of	of	ADP
ijassa-821	172	21	genetic	genetic	ADJ
ijassa-821	172	22	algorithm	algorithm	NOUN
ijassa-821	172	23	the	the	DET
ijassa-821	172	24	concept	concept	NOUN
ijassa-821	172	25	of	of	ADP
ijassa-821	172	26	dynamic	dynamic	ADJ
ijassa-821	172	27	stability	stability	NOUN
ijassa-821	172	28	has	have	AUX
ijassa-821	172	29	been	be	AUX
ijassa-821	172	30	widely	widely	ADV
ijassa-821	172	31	studied	study	VERB
ijassa-821	172	32	in	in	ADP
ijassa-821	172	33	recent	recent	ADJ
ijassa-821	172	34	years	year	NOUN
ijassa-821	172	35	for	for	ADP
ijassa-821	172	36	problems	problem	NOUN
ijassa-821	172	37	of	of	ADP
ijassa-821	172	38	game	game	NOUN
ijassa-821	172	39	theory	theory	NOUN
ijassa-821	172	40	.	.	PUNCT
ijassa-821	173	1	using	use	VERB
ijassa-821	173	2	the	the	DET
ijassa-821	173	3	main	main	ADJ
ijassa-821	173	4	idea	idea	NOUN
ijassa-821	173	5	of	of	ADP
ijassa-821	173	6	the	the	DET
ijassa-821	173	7	algorithm	algorithm	NOUN
ijassa-821	173	8	proposed	propose	VERB
ijassa-821	173	9	in	in	ADP
ijassa-821	173	10	[	[	X
ijassa-821	173	11	40	40	NUM
ijassa-821	173	12	]	]	PUNCT
ijassa-821	173	13	,	,	PUNCT
ijassa-821	173	14	we	we	PRON
ijassa-821	173	15	suggest	suggest	VERB
ijassa-821	173	16	dynamic	dynamic	ADJ
ijassa-821	173	17	adaptation	adaptation	NOUN
ijassa-821	173	18	procedure	procedure	NOUN
ijassa-821	173	19	for	for	ADP
ijassa-821	173	20	the	the	DET
ijassa-821	173	21	class	class	NOUN
ijassa-821	173	22	of	of	ADP
ijassa-821	173	23	the	the	DET
ijassa-821	173	24	travelling	travel	VERB
ijassa-821	173	25	salesman	salesman	NOUN
ijassa-821	173	26	problem	problem	NOUN
ijassa-821	173	27	and	and	CCONJ
ijassa-821	173	28	genetic	genetic	ADJ
ijassa-821	173	29	algorithm	algorithm	NOUN
ijassa-821	173	30	solving	solve	VERB
ijassa-821	173	31	it	it	PRON
ijassa-821	173	32	.	.	PUNCT
ijassa-821	174	1	at	at	ADP
ijassa-821	174	2	the	the	DET
ijassa-821	174	3	initial	initial	ADJ
ijassa-821	174	4	stage	stage	NOUN
ijassa-821	174	5	,	,	PUNCT
ijassa-821	174	6	we	we	PRON
ijassa-821	174	7	generate	generate	VERB
ijassa-821	174	8	a	a	DET
ijassa-821	174	9	set	set	NOUN
ijassa-821	174	10	of	of	ADP
ijassa-821	174	11	n	n	CCONJ
ijassa-821	174	12	different	different	ADJ
ijassa-821	174	13	solutions	solution	NOUN
ijassa-821	174	14	of	of	ADP
ijassa-821	174	15	the	the	DET
ijassa-821	174	16	problem	problem	NOUN
ijassa-821	174	17	instance	instance	NOUN
ijassa-821	174	18	by	by	ADP
ijassa-821	174	19	the	the	DET
ijassa-821	174	20	genetic	genetic	ADJ
ijassa-821	174	21	algorithm	algorithm	NOUN
ijassa-821	174	22	.	.	PUNCT
ijassa-821	175	1	from	from	ADP
ijassa-821	175	2	the	the	DET
ijassa-821	175	3	set	set	NOUN
ijassa-821	175	4	n	n	INTJ
ijassa-821	175	5	we	we	PRON
ijassa-821	175	6	choose	choose	VERB
ijassa-821	175	7	the	the	DET
ijassa-821	175	8	best	good	ADJ
ijassa-821	175	9	solution	solution	NOUN
ijassa-821	175	10	,	,	PUNCT
ijassa-821	175	11	with	with	ADP
ijassa-821	175	12	the	the	DET
ijassa-821	175	13	minimum	minimum	ADJ
ijassa-821	175	14	value	value	NOUN
ijassa-821	175	15	of	of	ADP
ijassa-821	175	16	the	the	DET
ijassa-821	175	17	objective	objective	ADJ
ijassa-821	175	18	function	function	NOUN
ijassa-821	175	19	.	.	PUNCT
ijassa-821	176	1	for	for	ADP
ijassa-821	176	2	it	it	PRON
ijassa-821	176	3	,	,	PUNCT
ijassa-821	176	4	we	we	PRON
ijassa-821	176	5	will	will	AUX
ijassa-821	176	6	obtain	obtain	VERB
ijassa-821	176	7	m	m	NOUN
ijassa-821	176	8	experiments	experiment	NOUN
ijassa-821	176	9	on	on	ADP
ijassa-821	176	10	checking	check	VERB
ijassa-821	176	11	if	if	SCONJ
ijassa-821	176	12	property	property	NOUN
ijassa-821	176	13	of	of	ADP
ijassa-821	176	14	time	time	NOUN
ijassa-821	176	15	consistency	consistency	NOUN
ijassa-821	176	16	holds	hold	VERB
ijassa-821	176	17	.	.	PUNCT
ijassa-821	177	1	if	if	SCONJ
ijassa-821	177	2	this	this	DET
ijassa-821	177	3	property	property	NOUN
ijassa-821	177	4	is	be	AUX
ijassa-821	177	5	violated	violate	VERB
ijassa-821	177	6	,	,	PUNCT
ijassa-821	177	7	starting	start	VERB
ijassa-821	177	8	from	from	ADP
ijassa-821	177	9	the	the	DET
ijassa-821	177	10	period	period	NOUN
ijassa-821	177	11	t	t	NOUN
ijassa-821	177	12	,	,	PUNCT
ijassa-821	177	13	i.e.	i.e.	X
ijassa-821	177	14	after	after	ADP
ijassa-821	177	15	the	the	DET
ijassa-821	177	16	period	period	NOUN
ijassa-821	177	17	t	t	PROPN
ijassa-821	177	18	,	,	PUNCT
ijassa-821	177	19	the	the	DET
ijassa-821	177	20	better	well	ADJ
ijassa-821	177	21	solution	solution	NOUN
ijassa-821	177	22	will	will	AUX
ijassa-821	177	23	be	be	AUX
ijassa-821	177	24	found	find	VERB
ijassa-821	177	25	in	in	ADP
ijassa-821	177	26	the	the	DET
ijassa-821	177	27	current	current	ADJ
ijassa-821	177	28	subproblem	subproblem	NOUN
ijassa-821	177	29	p(s−(t	p(s−(t	PROPN
ijassa-821	177	30	,	,	PUNCT
ijassa-821	177	31	p	p	NOUN
ijassa-821	177	32	)	)	PUNCT
ijassa-821	177	33	)	)	PUNCT
ijassa-821	177	34	.	.	PUNCT
ijassa-821	178	1	to	to	PART
ijassa-821	178	2	reduce	reduce	VERB
ijassa-821	178	3	the	the	DET
ijassa-821	178	4	total	total	ADJ
ijassa-821	178	5	length	length	NOUN
ijassa-821	178	6	of	of	ADP
ijassa-821	178	7	the	the	DET
ijassa-821	178	8	routing	routing	NOUN
ijassa-821	178	9	plan	plan	NOUN
ijassa-821	178	10	through	through	ADP
ijassa-821	178	11	all	all	DET
ijassa-821	178	12	vertices	vertex	NOUN
ijassa-821	178	13	,	,	PUNCT
ijassa-821	178	14	the	the	DET
ijassa-821	178	15	current	current	ADJ
ijassa-821	178	16	routing	routing	NOUN
ijassa-821	178	17	plan	plan	NOUN
ijassa-821	178	18	should	should	AUX
ijassa-821	178	19	be	be	AUX
ijassa-821	178	20	changed	change	VERB
ijassa-821	178	21	according	accord	VERB
ijassa-821	178	22	to	to	ADP
ijassa-821	178	23	the	the	DET
ijassa-821	178	24	new	new	ADJ
ijassa-821	178	25	solution	solution	NOUN
ijassa-821	178	26	obtained	obtain	VERB
ijassa-821	178	27	in	in	ADP
ijassa-821	178	28	the	the	DET
ijassa-821	178	29	considered	consider	VERB
ijassa-821	178	30	subproblem	subproblem	NOUN
ijassa-821	178	31	.	.	PUNCT
ijassa-821	179	1	the	the	DET
ijassa-821	179	2	general	general	ADJ
ijassa-821	179	3	scheme	scheme	NOUN
ijassa-821	179	4	of	of	ADP
ijassa-821	179	5	dynamic	dynamic	ADJ
ijassa-821	179	6	adaptation	adaptation	NOUN
ijassa-821	179	7	is	be	AUX
ijassa-821	179	8	as	as	SCONJ
ijassa-821	179	9	follows	follow	VERB
ijassa-821	179	10	[	[	X
ijassa-821	179	11	28	28	NUM
ijassa-821	179	12	]	]	PUNCT
ijassa-821	179	13	.	.	PUNCT
ijassa-821	180	1	1	1	X
ijassa-821	180	2	.	.	X
ijassa-821	180	3	obtain	obtain	VERB
ijassa-821	180	4	set	set	VERB
ijassa-821	180	5	n	n	PROPN
ijassa-821	180	6	of	of	ADP
ijassa-821	180	7	different	different	ADJ
ijassa-821	180	8	solutions	solution	NOUN
ijassa-821	180	9	generated	generate	VERB
ijassa-821	180	10	by	by	ADP
ijassa-821	180	11	heuristics	heuristic	NOUN
ijassa-821	180	12	h	h	NOUN
ijassa-821	180	13	for	for	ADP
ijassa-821	180	14	p	p	PROPN
ijassa-821	180	15	∈	∈	PROPN
ijassa-821	180	16	p.	p.	NOUN
ijassa-821	180	17	2	2	NUM
ijassa-821	180	18	.	.	X
ijassa-821	180	19	define	define	VERB
ijassa-821	180	20	s1(p	s1(p	NOUN
ijassa-821	180	21	)	)	PUNCT
ijassa-821	180	22	=	=	SYM
ijassa-821	180	23	arg	arg	NOUN
ijassa-821	180	24	min	min	PROPN
ijassa-821	180	25	s(p)∈n	s(p)∈n	PROPN
ijassa-821	180	26	f(s(p	f(s(p	PROPN
ijassa-821	180	27	)	)	PUNCT
ijassa-821	180	28	)	)	PUNCT
ijassa-821	180	29	.	.	PUNCT
ijassa-821	181	1	3	3	X
ijassa-821	181	2	.	.	X
ijassa-821	181	3	from	from	ADP
ijassa-821	181	4	t	t	PROPN
ijassa-821	181	5	=	=	SYM
ijassa-821	181	6	1	1	NUM
ijassa-821	181	7	to	to	ADP
ijassa-821	181	8	t	t	PROPN
ijassa-821	181	9	−	−	PROPN
ijassa-821	181	10	1	1	NUM
ijassa-821	181	11	do	do	AUX
ijassa-821	181	12	4	4	NUM
ijassa-821	181	13	.	.	PUNCT
ijassa-821	181	14	formulate	formulate	VERB
ijassa-821	181	15	sub	sub	NOUN
ijassa-821	181	16	-	-	NOUN
ijassa-821	181	17	problem	problem	NOUN
ijassa-821	181	18	p(s−t	p(s−t	PROPN
ijassa-821	181	19	(	(	PUNCT
ijassa-821	181	20	t	t	PROPN
ijassa-821	181	21	,	,	PUNCT
ijassa-821	181	22	p	p	NOUN
ijassa-821	181	23	)	)	PUNCT
ijassa-821	181	24	)	)	PUNCT
ijassa-821	181	25	,	,	PUNCT
ijassa-821	181	26	obtain	obtain	VERB
ijassa-821	181	27	set	set	VERB
ijassa-821	181	28	n	n	PROPN
ijassa-821	181	29	of	of	ADP
ijassa-821	181	30	solution	solution	NOUN
ijassa-821	181	31	.	.	PUNCT
ijassa-821	182	1	5	5	X
ijassa-821	182	2	.	.	X
ijassa-821	182	3	define	define	VERB
ijassa-821	182	4	s∗t+1(p	s∗t+1(p	NOUN
ijassa-821	182	5	)	)	PUNCT
ijassa-821	182	6	=	=	SYM
ijassa-821	183	1	arg	arg	NOUN
ijassa-821	183	2	min	min	PROPN
ijassa-821	183	3	s(p(s−t	s(p(s−t	PROPN
ijassa-821	183	4	(	(	PUNCT
ijassa-821	183	5	t	t	PROPN
ijassa-821	183	6	,	,	PUNCT
ijassa-821	183	7	p)))∈n	p)))∈n	PROPN
ijassa-821	183	8	f(s(p(s−t	f(s(p(s−t	PROPN
ijassa-821	183	9	(	(	PUNCT
ijassa-821	183	10	t	t	PROPN
ijassa-821	183	11	,	,	PUNCT
ijassa-821	183	12	p	p	NOUN
ijassa-821	183	13	)	)	PUNCT
ijassa-821	183	14	)	)	PUNCT
ijassa-821	183	15	)	)	PUNCT
ijassa-821	183	16	)	)	PUNCT
ijassa-821	183	17	.	.	PUNCT
ijassa-821	184	1	6	6	X
ijassa-821	184	2	.	.	X
ijassa-821	184	3	check	check	VERB
ijassa-821	184	4	if	if	SCONJ
ijassa-821	184	5	the	the	DET
ijassa-821	184	6	property	property	NOUN
ijassa-821	184	7	of	of	ADP
ijassa-821	184	8	time	time	NOUN
ijassa-821	184	9	consistency	consistency	NOUN
ijassa-821	184	10	is	be	AUX
ijassa-821	184	11	valid	valid	ADJ
ijassa-821	184	12	for	for	ADP
ijassa-821	184	13	st(p	st(p	NUM
ijassa-821	184	14	)	)	PUNCT
ijassa-821	184	15	.	.	PUNCT
ijassa-821	185	1	7	7	X
ijassa-821	185	2	.	.	X
ijassa-821	186	1	if	if	SCONJ
ijassa-821	186	2	f(s+t	f(s+t	PROPN
ijassa-821	186	3	(	(	PUNCT
ijassa-821	186	4	t	t	PROPN
ijassa-821	186	5	,	,	PUNCT
ijassa-821	186	6	p	p	NOUN
ijassa-821	186	7	)	)	PUNCT
ijassa-821	186	8	)	)	PUNCT
ijassa-821	186	9	>	>	X
ijassa-821	186	10	f(s∗t+1(p	f(s∗t+1(p	NOUN
ijassa-821	186	11	)	)	PUNCT
ijassa-821	186	12	)	)	PUNCT
ijassa-821	186	13	,	,	PUNCT
ijassa-821	186	14	then	then	ADV
ijassa-821	186	15	routing	route	VERB
ijassa-821	186	16	plan	plan	NOUN
ijassa-821	186	17	should	should	AUX
ijassa-821	186	18	be	be	AUX
ijassa-821	186	19	changed	change	VERB
ijassa-821	186	20	to	to	ADP
ijassa-821	186	21	st+1(p	st+1(p	PROPN
ijassa-821	186	22	)	)	PUNCT
ijassa-821	187	1	=	=	SYM
ijassa-821	187	2	s−t	s−t	X
ijassa-821	187	3	(	(	PUNCT
ijassa-821	187	4	t	t	PROPN
ijassa-821	187	5	,	,	PUNCT
ijassa-821	187	6	p	p	NOUN
ijassa-821	187	7	)	)	PUNCT
ijassa-821	187	8	∪	∪	ADJ
ijassa-821	187	9	s∗t+1(p	s∗t+1(p	NOUN
ijassa-821	187	10	)	)	PUNCT
ijassa-821	187	11	.	.	PUNCT
ijassa-821	188	1	7	7	X
ijassa-821	188	2	.	.	X
ijassa-821	188	3	computational	computational	ADJ
ijassa-821	188	4	results	result	NOUN
ijassa-821	188	5	7.1	7.1	NUM
ijassa-821	188	6	.	.	PUNCT
ijassa-821	189	1	experimental	experimental	ADJ
ijassa-821	189	2	level	level	NOUN
ijassa-821	189	3	of	of	ADP
ijassa-821	189	4	time	time	NOUN
ijassa-821	189	5	consistency	consistency	NOUN
ijassa-821	189	6	of	of	ADP
ijassa-821	189	7	the	the	DET
ijassa-821	189	8	genetic	genetic	ADJ
ijassa-821	189	9	algorithm	algorithm	NOUN
ijassa-821	189	10	with	with	ADP
ijassa-821	189	11	greffenstett	greffenstett	PROPN
ijassa-821	189	12	’s	’s	PART
ijassa-821	189	13	crossover	crossover	NOUN
ijassa-821	189	14	for	for	ADP
ijassa-821	189	15	solving	solve	VERB
ijassa-821	189	16	the	the	DET
ijassa-821	189	17	tsp	tsp	NOUN
ijassa-821	189	18	to	to	PART
ijassa-821	189	19	conduct	conduct	VERB
ijassa-821	189	20	the	the	DET
ijassa-821	189	21	experiment	experiment	NOUN
ijassa-821	189	22	,	,	PUNCT
ijassa-821	189	23	five	five	NUM
ijassa-821	189	24	test	test	NOUN
ijassa-821	189	25	instances	instance	NOUN
ijassa-821	189	26	from	from	ADP
ijassa-821	189	27	the	the	DET
ijassa-821	189	28	standard	standard	ADJ
ijassa-821	189	29	tsplib	tsplib	PROPN
ijassa-821	189	30	library	library	NOUN
ijassa-821	189	31	were	be	AUX
ijassa-821	189	32	considered	consider	VERB
ijassa-821	189	33	and	and	CCONJ
ijassa-821	189	34	a	a	DET
ijassa-821	189	35	genetic	genetic	ADJ
ijassa-821	189	36	algorithm	algorithm	NOUN
ijassa-821	189	37	with	with	ADP
ijassa-821	189	38	a	a	DET
ijassa-821	189	39	greffenstett	greffenstett	NOUN
ijassa-821	189	40	’s	’s	PART
ijassa-821	189	41	heuristic	heuristic	ADJ
ijassa-821	189	42	crossover	crossover	NOUN
ijassa-821	189	43	to	to	PART
ijassa-821	189	44	solve	solve	VERB
ijassa-821	189	45	them	they	PRON
ijassa-821	189	46	was	be	AUX
ijassa-821	189	47	applied	apply	VERB
ijassa-821	189	48	.	.	PUNCT
ijassa-821	190	1	the	the	DET
ijassa-821	190	2	following	follow	VERB
ijassa-821	190	3	set	set	NOUN
ijassa-821	190	4	of	of	ADP
ijassa-821	190	5	parameters	parameter	NOUN
ijassa-821	190	6	was	be	AUX
ijassa-821	190	7	used	use	VERB
ijassa-821	190	8	in	in	ADP
ijassa-821	190	9	the	the	DET
ijassa-821	190	10	computational	computational	ADJ
ijassa-821	190	11	experiment	experiment	NOUN
ijassa-821	190	12	:	:	PUNCT
ijassa-821	190	13	|p	|p	PROPN
ijassa-821	190	14	|	|	ADV
ijassa-821	190	15	=	=	SYM
ijassa-821	190	16	5,m	5,m	NUM
ijassa-821	190	17	=	=	SYM
ijassa-821	190	18	5	5	NUM
ijassa-821	190	19	,	,	PUNCT
ijassa-821	190	20	t	t	NOUN
ijassa-821	190	21	=	=	SYM
ijassa-821	190	22	5	5	NUM
ijassa-821	190	23	,	,	PUNCT
ijassa-821	190	24	|n	|n	NOUN
ijassa-821	190	25	|	|	NOUN
ijassa-821	190	26	=	=	NOUN
ijassa-821	190	27	20	20	NUM
ijassa-821	190	28	.	.	PUNCT
ijassa-821	191	1	for	for	ADP
ijassa-821	191	2	each	each	PRON
ijassa-821	191	3	of	of	ADP
ijassa-821	191	4	the	the	DET
ijassa-821	191	5	test	test	NOUN
ijassa-821	191	6	problems	problem	NOUN
ijassa-821	191	7	,	,	PUNCT
ijassa-821	191	8	20	20	NUM
ijassa-821	191	9	different	different	ADJ
ijassa-821	191	10	solutions	solution	NOUN
ijassa-821	191	11	were	be	AUX
ijassa-821	191	12	generated	generate	VERB
ijassa-821	191	13	.	.	PUNCT
ijassa-821	192	1	the	the	DET
ijassa-821	192	2	number	number	NOUN
ijassa-821	192	3	of	of	ADP
ijassa-821	192	4	runs	run	NOUN
ijassa-821	192	5	for	for	ADP
ijassa-821	192	6	one	one	NUM
ijassa-821	192	7	solution	solution	NOUN
ijassa-821	192	8	s(p	s(p	PROPN
ijassa-821	192	9	)	)	PUNCT
ijassa-821	192	10	equaled	equal	VERB
ijassa-821	192	11	5	5	NUM
ijassa-821	192	12	.	.	PUNCT
ijassa-821	193	1	the	the	DET
ijassa-821	193	2	original	original	ADJ
ijassa-821	193	3	route	route	NOUN
ijassa-821	193	4	was	be	AUX
ijassa-821	193	5	divided	divide	VERB
ijassa-821	193	6	into	into	ADP
ijassa-821	193	7	five	five	NUM
ijassa-821	193	8	periods	period	NOUN
ijassa-821	193	9	.	.	PUNCT
ijassa-821	194	1	the	the	DET
ijassa-821	194	2	period	period	NOUN
ijassa-821	194	3	number	number	NOUN
ijassa-821	194	4	t	t	PROPN
ijassa-821	194	5	was	be	AUX
ijassa-821	194	6	marked	mark	VERB
ijassa-821	194	7	,	,	PUNCT
ijassa-821	194	8	after	after	ADP
ijassa-821	194	9	which	which	PRON
ijassa-821	194	10	the	the	DET
ijassa-821	194	11	solution	solution	NOUN
ijassa-821	194	12	s(p	s(p	PROPN
ijassa-821	194	13	)	)	PUNCT
ijassa-821	194	14	lost	lose	VERB
ijassa-821	194	15	the	the	DET
ijassa-821	194	16	time	time	NOUN
ijassa-821	194	17	consistency	consistency	NOUN
ijassa-821	194	18	property	property	NOUN
ijassa-821	194	19	.	.	PUNCT
ijassa-821	195	1	these	these	DET
ijassa-821	195	2	values	value	NOUN
ijassa-821	195	3	correspond	correspond	VERB
ijassa-821	195	4	to	to	ADP
ijassa-821	195	5	the	the	DET
ijassa-821	195	6	columns	column	NOUN
ijassa-821	195	7	b(s	b(s	PROPN
ijassa-821	195	8	,	,	PUNCT
ijassa-821	195	9	t	t	PROPN
ijassa-821	195	10	)	)	PUNCT
ijassa-821	195	11	in	in	ADP
ijassa-821	195	12	table	table	NOUN
ijassa-821	195	13	7.1	7.1	NUM
ijassa-821	195	14	.	.	PUNCT
ijassa-821	195	15	table	table	NOUN
ijassa-821	195	16	7.1	7.1	NUM
ijassa-821	195	17	.	.	PUNCT
ijassa-821	196	1	the	the	DET
ijassa-821	196	2	experimental	experimental	ADJ
ijassa-821	196	3	level	level	NOUN
ijassa-821	196	4	of	of	ADP
ijassa-821	196	5	time	time	NOUN
ijassa-821	196	6	consistency	consistency	NOUN
ijassa-821	196	7	of	of	ADP
ijassa-821	196	8	the	the	DET
ijassa-821	196	9	ga	ga	PROPN
ijassa-821	196	10	for	for	ADP
ijassa-821	196	11	the	the	DET
ijassa-821	196	12	tsp	tsp	NOUN
ijassa-821	196	13	problem	problem	NOUN
ijassa-821	196	14	instance	instance	NOUN
ijassa-821	196	15	number	number	NOUN
ijassa-821	196	16	of	of	ADP
ijassa-821	196	17	runs	run	NOUN
ijassa-821	196	18	b(s	b(s	PROPN
ijassa-821	196	19	,	,	PUNCT
ijassa-821	196	20	t	t	NOUN
ijassa-821	196	21	)	)	PUNCT
ijassa-821	196	22	number	number	NOUN
ijassa-821	196	23	of	of	ADP
ijassa-821	196	24	time	time	NOUN
ijassa-821	196	25	consistent	consistent	ADJ
ijassa-821	196	26	runst	runst	NOUN
ijassa-821	196	27	=	=	SYM
ijassa-821	196	28	1	1	NUM
ijassa-821	196	29	t	t	NOUN
ijassa-821	196	30	=	=	SYM
ijassa-821	196	31	2	2	NUM
ijassa-821	196	32	t	t	NOUN
ijassa-821	196	33	=	=	SYM
ijassa-821	196	34	3	3	NUM
ijassa-821	196	35	t	t	NOUN
ijassa-821	196	36	=	=	SYM
ijassa-821	196	37	4	4	NUM
ijassa-821	196	38	att48	att48	NOUN
ijassa-821	196	39	100	100	NUM
ijassa-821	196	40	31	31	NUM
ijassa-821	196	41	16	16	NUM
ijassa-821	196	42	26	26	NUM
ijassa-821	196	43	8	8	NUM
ijassa-821	196	44	19	19	NUM
ijassa-821	196	45	eil51	eil51	NOUN
ijassa-821	196	46	100	100	NUM
ijassa-821	196	47	64	64	NUM
ijassa-821	196	48	14	14	NUM
ijassa-821	196	49	11	11	NUM
ijassa-821	196	50	3	3	NUM
ijassa-821	196	51	8	8	NUM
ijassa-821	196	52	berlin52	berlin52	NOUN
ijassa-821	196	53	100	100	NUM
ijassa-821	196	54	19	19	NUM
ijassa-821	196	55	27	27	NUM
ijassa-821	196	56	4	4	NUM
ijassa-821	196	57	4	4	NUM
ijassa-821	196	58	46	46	NUM
ijassa-821	196	59	st70	st70	PROPN
ijassa-821	196	60	100	100	NUM
ijassa-821	196	61	16	16	NUM
ijassa-821	196	62	22	22	NUM
ijassa-821	196	63	4	4	NUM
ijassa-821	196	64	1	1	NUM
ijassa-821	196	65	57	57	NUM
ijassa-821	196	66	eil101	eil101	NOUN
ijassa-821	196	67	100	100	NUM
ijassa-821	196	68	15	15	NUM
ijassa-821	196	69	28	28	NUM
ijassa-821	196	70	3	3	NUM
ijassa-821	196	71	2	2	NUM
ijassa-821	196	72	52	52	NUM
ijassa-821	196	73	sum	sum	NOUN
ijassa-821	196	74	500	500	NUM
ijassa-821	196	75	145	145	NUM
ijassa-821	196	76	107	107	NUM
ijassa-821	196	77	48	48	NUM
ijassa-821	196	78	18	18	NUM
ijassa-821	196	79	182	182	NUM
ijassa-821	196	80	the	the	DET
ijassa-821	196	81	average	average	ADJ
ijassa-821	196	82	level	level	NOUN
ijassa-821	196	83	of	of	ADP
ijassa-821	196	84	experimental	experimental	ADJ
ijassa-821	196	85	level	level	NOUN
ijassa-821	196	86	of	of	ADP
ijassa-821	196	87	time	time	NOUN
ijassa-821	196	88	consistency	consistency	NOUN
ijassa-821	196	89	of	of	ADP
ijassa-821	196	90	the	the	DET
ijassa-821	196	91	genetic	genetic	ADJ
ijassa-821	196	92	algorithm	algorithm	NOUN
ijassa-821	196	93	for	for	ADP
ijassa-821	196	94	solving	solve	VERB
ijassa-821	196	95	the	the	DET
ijassa-821	196	96	tsp	tsp	NOUN
ijassa-821	196	97	equals	equal	VERB
ijassa-821	196	98	0	0	NUM
ijassa-821	196	99	,	,	PUNCT
ijassa-821	196	100	364	364	NUM
ijassa-821	196	101	.	.	PUNCT
ijassa-821	196	102	conga	conga	NOUN
ijassa-821	196	103	=	=	SYM
ijassa-821	196	104	0,364	0,364	NUM
ijassa-821	196	105	.	.	PUNCT
ijassa-821	197	1	copyright	copyright	NOUN
ijassa-821	197	2	©	©	PROPN
ijassa-821	197	3	2020	2020	NUM
ijassa-821	197	4	assa	assa	NOUN
ijassa-821	197	5	.	.	PUNCT
ijassa-821	198	1	adv	adv	PROPN
ijassa-821	198	2	syst	syst	PROPN
ijassa-821	198	3	sci	sci	PROPN
ijassa-821	198	4	appl	appl	PROPN
ijassa-821	198	5	(	(	PUNCT
ijassa-821	198	6	2020	2020	NUM
ijassa-821	198	7	)	)	PUNCT
ijassa-821	198	8	dynamic	dynamic	ADJ
ijassa-821	198	9	adaptation	adaptation	NOUN
ijassa-821	198	10	of	of	ADP
ijassa-821	198	11	genetic	genetic	ADJ
ijassa-821	198	12	algorithm	algorithm	NOUN
ijassa-821	198	13	for	for	ADP
ijassa-821	198	14	solving	solve	VERB
ijassa-821	198	15	routing	routing	NOUN
ijassa-821	198	16	problems	problem	NOUN
ijassa-821	198	17	39	39	NUM
ijassa-821	198	18	this	this	DET
ijassa-821	198	19	value	value	NOUN
ijassa-821	198	20	is	be	AUX
ijassa-821	198	21	quite	quite	ADV
ijassa-821	198	22	low	low	ADJ
ijassa-821	198	23	:	:	PUNCT
ijassa-821	198	24	only	only	ADV
ijassa-821	198	25	a	a	DET
ijassa-821	198	26	third	third	NOUN
ijassa-821	198	27	of	of	ADP
ijassa-821	198	28	the	the	DET
ijassa-821	198	29	solutions	solution	NOUN
ijassa-821	198	30	generated	generate	VERB
ijassa-821	198	31	at	at	ADP
ijassa-821	198	32	the	the	DET
ijassa-821	198	33	initial	initial	ADJ
ijassa-821	198	34	stage	stage	NOUN
ijassa-821	198	35	keep	keep	VERB
ijassa-821	198	36	the	the	DET
ijassa-821	198	37	optimality	optimality	NOUN
ijassa-821	198	38	property	property	NOUN
ijassa-821	198	39	in	in	ADP
ijassa-821	198	40	the	the	DET
ijassa-821	198	41	process	process	NOUN
ijassa-821	198	42	of	of	ADP
ijassa-821	198	43	their	their	PRON
ijassa-821	198	44	implementation	implementation	NOUN
ijassa-821	198	45	.	.	PUNCT
ijassa-821	199	1	this	this	PRON
ijassa-821	199	2	means	mean	VERB
ijassa-821	199	3	that	that	SCONJ
ijassa-821	199	4	there	there	PRON
ijassa-821	199	5	are	be	VERB
ijassa-821	199	6	other	other	ADJ
ijassa-821	199	7	routes	route	NOUN
ijassa-821	199	8	that	that	PRON
ijassa-821	199	9	can	can	AUX
ijassa-821	199	10	be	be	AUX
ijassa-821	199	11	obtained	obtain	VERB
ijassa-821	199	12	dynamically	dynamically	ADV
ijassa-821	199	13	using	use	VERB
ijassa-821	199	14	the	the	DET
ijassa-821	199	15	same	same	ADJ
ijassa-821	199	16	heuristic	heuristic	ADJ
ijassa-821	199	17	algorithm	algorithm	NOUN
ijassa-821	199	18	,	,	PUNCT
ijassa-821	199	19	the	the	DET
ijassa-821	199	20	values	value	NOUN
ijassa-821	199	21	of	of	ADP
ijassa-821	199	22	the	the	DET
ijassa-821	199	23	objective	objective	ADJ
ijassa-821	199	24	function	function	NOUN
ijassa-821	199	25	of	of	ADP
ijassa-821	199	26	which	which	PRON
ijassa-821	199	27	will	will	AUX
ijassa-821	199	28	be	be	AUX
ijassa-821	199	29	less	less	ADJ
ijassa-821	199	30	than	than	ADP
ijassa-821	199	31	in	in	ADP
ijassa-821	199	32	current	current	ADJ
ijassa-821	199	33	solutions	solution	NOUN
ijassa-821	199	34	.	.	PUNCT
ijassa-821	200	1	we	we	PRON
ijassa-821	200	2	calculate	calculate	VERB
ijassa-821	200	3	the	the	DET
ijassa-821	200	4	level	level	NOUN
ijassa-821	200	5	of	of	ADP
ijassa-821	200	6	time	time	NOUN
ijassa-821	200	7	consistency	consistency	NOUN
ijassa-821	200	8	for	for	ADP
ijassa-821	200	9	solutions	solution	NOUN
ijassa-821	200	10	obtained	obtain	VERB
ijassa-821	200	11	using	use	VERB
ijassa-821	200	12	the	the	DET
ijassa-821	200	13	dynamic	dynamic	ADJ
ijassa-821	200	14	adaptation	adaptation	NOUN
ijassa-821	200	15	procedure	procedure	NOUN
ijassa-821	200	16	.	.	PUNCT
ijassa-821	201	1	we	we	PRON
ijassa-821	201	2	will	will	AUX
ijassa-821	201	3	carry	carry	VERB
ijassa-821	201	4	out	out	ADP
ijassa-821	201	5	the	the	DET
ijassa-821	201	6	experiment	experiment	NOUN
ijassa-821	201	7	according	accord	VERB
ijassa-821	201	8	to	to	ADP
ijassa-821	201	9	the	the	DET
ijassa-821	201	10	same	same	ADJ
ijassa-821	201	11	scheme	scheme	NOUN
ijassa-821	201	12	and	and	CCONJ
ijassa-821	201	13	with	with	SCONJ
ijassa-821	201	14	the	the	DET
ijassa-821	201	15	parameters	parameter	NOUN
ijassa-821	201	16	determined	determine	VERB
ijassa-821	201	17	earlier	early	ADV
ijassa-821	201	18	.	.	PUNCT
ijassa-821	202	1	the	the	DET
ijassa-821	202	2	experimental	experimental	ADJ
ijassa-821	202	3	results	result	NOUN
ijassa-821	202	4	are	be	AUX
ijassa-821	202	5	shown	show	VERB
ijassa-821	202	6	in	in	ADP
ijassa-821	202	7	table	table	NOUN
ijassa-821	202	8	7.2	7.2	NUM
ijassa-821	202	9	.	.	PUNCT
ijassa-821	202	10	table	table	NOUN
ijassa-821	202	11	7.2	7.2	NUM
ijassa-821	202	12	.	.	PUNCT
ijassa-821	203	1	the	the	DET
ijassa-821	203	2	experimental	experimental	ADJ
ijassa-821	203	3	level	level	NOUN
ijassa-821	203	4	of	of	ADP
ijassa-821	203	5	time	time	NOUN
ijassa-821	203	6	consistency	consistency	NOUN
ijassa-821	203	7	of	of	ADP
ijassa-821	203	8	the	the	DET
ijassa-821	203	9	dynamic	dynamic	ADJ
ijassa-821	203	10	adaptation	adaptation	NOUN
ijassa-821	203	11	for	for	ADP
ijassa-821	203	12	the	the	DET
ijassa-821	203	13	ga	ga	PROPN
ijassa-821	203	14	for	for	ADP
ijassa-821	203	15	the	the	DET
ijassa-821	203	16	tsp	tsp	NOUN
ijassa-821	203	17	problem	problem	NOUN
ijassa-821	203	18	instance	instance	NOUN
ijassa-821	203	19	number	number	NOUN
ijassa-821	203	20	of	of	ADP
ijassa-821	203	21	runs	run	NOUN
ijassa-821	203	22	b(s	b(s	PROPN
ijassa-821	203	23	,	,	PUNCT
ijassa-821	203	24	t	t	NOUN
ijassa-821	203	25	)	)	PUNCT
ijassa-821	203	26	number	number	NOUN
ijassa-821	203	27	of	of	ADP
ijassa-821	203	28	time	time	NOUN
ijassa-821	203	29	consist	consist	NOUN
ijassa-821	203	30	.	.	PUNCT
ijassa-821	204	1	runst	runst	NOUN
ijassa-821	204	2	=	=	SYM
ijassa-821	204	3	1	1	NUM
ijassa-821	204	4	t	t	NOUN
ijassa-821	204	5	=	=	SYM
ijassa-821	204	6	2	2	NUM
ijassa-821	204	7	t	t	NOUN
ijassa-821	204	8	=	=	SYM
ijassa-821	204	9	3	3	NUM
ijassa-821	204	10	t	t	NOUN
ijassa-821	204	11	=	=	SYM
ijassa-821	204	12	4	4	NUM
ijassa-821	204	13	att48	att48	NOUN
ijassa-821	204	14	100	100	NUM
ijassa-821	204	15	24	24	NUM
ijassa-821	204	16	5	5	NUM
ijassa-821	204	17	11	11	NUM
ijassa-821	204	18	1	1	NUM
ijassa-821	204	19	59	59	NUM
ijassa-821	204	20	eil51	eil51	NOUN
ijassa-821	204	21	100	100	NUM
ijassa-821	204	22	47	47	NUM
ijassa-821	204	23	11	11	NUM
ijassa-821	204	24	7	7	NUM
ijassa-821	204	25	5	5	NUM
ijassa-821	204	26	30	30	NUM
ijassa-821	204	27	berlin52	berlin52	NOUN
ijassa-821	204	28	100	100	NUM
ijassa-821	204	29	2	2	NUM
ijassa-821	204	30	12	12	NUM
ijassa-821	204	31	5	5	NUM
ijassa-821	204	32	3	3	NUM
ijassa-821	204	33	78	78	NUM
ijassa-821	204	34	st70	st70	PROPN
ijassa-821	204	35	100	100	NUM
ijassa-821	204	36	1	1	NUM
ijassa-821	204	37	7	7	NUM
ijassa-821	204	38	5	5	NUM
ijassa-821	204	39	5	5	NUM
ijassa-821	204	40	82	82	NUM
ijassa-821	204	41	eil101	eil101	NOUN
ijassa-821	204	42	100	100	NUM
ijassa-821	204	43	1	1	NUM
ijassa-821	204	44	6	6	NUM
ijassa-821	204	45	4	4	NUM
ijassa-821	204	46	4	4	NUM
ijassa-821	204	47	85	85	NUM
ijassa-821	204	48	sum	sum	NOUN
ijassa-821	204	49	500	500	NUM
ijassa-821	204	50	75	75	NUM
ijassa-821	204	51	41	41	NUM
ijassa-821	204	52	32	32	NUM
ijassa-821	204	53	18	18	NUM
ijassa-821	204	54	334	334	NUM
ijassa-821	204	55	the	the	DET
ijassa-821	204	56	average	average	ADJ
ijassa-821	204	57	value	value	NOUN
ijassa-821	204	58	of	of	ADP
ijassa-821	204	59	the	the	DET
ijassa-821	204	60	experimental	experimental	ADJ
ijassa-821	204	61	level	level	NOUN
ijassa-821	204	62	of	of	ADP
ijassa-821	204	63	time	time	NOUN
ijassa-821	204	64	consistency	consistency	NOUN
ijassa-821	204	65	of	of	ADP
ijassa-821	204	66	a	a	DET
ijassa-821	204	67	dynamically	dynamically	ADV
ijassa-821	204	68	adapted	adapt	VERB
ijassa-821	204	69	genetic	genetic	ADJ
ijassa-821	204	70	algorithm	algorithm	NOUN
ijassa-821	204	71	for	for	ADP
ijassa-821	204	72	solving	solve	VERB
ijassa-821	204	73	the	the	DET
ijassa-821	204	74	tsp	tsp	NOUN
ijassa-821	204	75	problem	problem	NOUN
ijassa-821	204	76	is	be	AUX
ijassa-821	204	77	0.668	0.668	NUM
ijassa-821	204	78	,	,	PUNCT
ijassa-821	204	79	which	which	PRON
ijassa-821	204	80	is	be	AUX
ijassa-821	204	81	almost	almost	ADV
ijassa-821	204	82	two	two	NUM
ijassa-821	204	83	times	time	NOUN
ijassa-821	204	84	higher	high	ADJ
ijassa-821	204	85	than	than	ADP
ijassa-821	204	86	for	for	ADP
ijassa-821	204	87	the	the	DET
ijassa-821	204	88	genetic	genetic	ADJ
ijassa-821	204	89	algorithm	algorithm	NOUN
ijassa-821	204	90	before	before	ADP
ijassa-821	204	91	adaptation	adaptation	NOUN
ijassa-821	204	92	.	.	PUNCT
ijassa-821	205	1	we	we	PRON
ijassa-821	205	2	consider	consider	VERB
ijassa-821	205	3	the	the	DET
ijassa-821	205	4	dependence	dependence	NOUN
ijassa-821	205	5	of	of	ADP
ijassa-821	205	6	the	the	DET
ijassa-821	205	7	number	number	NOUN
ijassa-821	205	8	of	of	ADP
ijassa-821	205	9	time	time	NOUN
ijassa-821	205	10	-	-	PUNCT
ijassa-821	205	11	consistent	consistent	ADJ
ijassa-821	205	12	solutions	solution	NOUN
ijassa-821	205	13	obtained	obtain	VERB
ijassa-821	205	14	during	during	ADP
ijassa-821	205	15	the	the	DET
ijassa-821	205	16	experiment	experiment	NOUN
ijassa-821	205	17	in	in	ADP
ijassa-821	205	18	the	the	DET
ijassa-821	205	19	first	first	ADJ
ijassa-821	205	20	t	t	NOUN
ijassa-821	205	21	periods	period	NOUN
ijassa-821	205	22	on	on	ADP
ijassa-821	205	23	period	period	NOUN
ijassa-821	205	24	t.	t.	NOUN
ijassa-821	205	25	the	the	DET
ijassa-821	205	26	total	total	ADJ
ijassa-821	205	27	number	number	NOUN
ijassa-821	205	28	of	of	ADP
ijassa-821	205	29	runs	run	NOUN
ijassa-821	205	30	performed	perform	VERB
ijassa-821	205	31	is	be	AUX
ijassa-821	205	32	m	m	PROPN
ijassa-821	205	33	|n	|n	ADJ
ijassa-821	205	34	||p	||p	PROPN
ijassa-821	205	35	|	|	NOUN
ijassa-821	205	36	.	.	PUNCT
ijassa-821	206	1	function	function	NOUN
ijassa-821	206	2	(	(	PUNCT
ijassa-821	206	3	8)	8)	NUM
ijassa-821	206	4	is	be	AUX
ijassa-821	206	5	introduced	introduce	VERB
ijassa-821	206	6	which	which	PRON
ijassa-821	206	7	states	state	VERB
ijassa-821	206	8	for	for	ADP
ijassa-821	206	9	the	the	DET
ijassa-821	206	10	number	number	NOUN
ijassa-821	206	11	of	of	ADP
ijassa-821	206	12	time	time	NOUN
ijassa-821	206	13	-	-	PUNCT
ijassa-821	206	14	consistent	consistent	ADJ
ijassa-821	206	15	solutions	solution	NOUN
ijassa-821	206	16	after	after	ADP
ijassa-821	206	17	the	the	DET
ijassa-821	206	18	completion	completion	NOUN
ijassa-821	206	19	of	of	ADP
ijassa-821	206	20	each	each	DET
ijassa-821	206	21	period	period	NOUN
ijassa-821	206	22	.	.	PUNCT
ijassa-821	207	1	c(s	c(	NOUN
ijassa-821	207	2	,	,	PUNCT
ijassa-821	207	3	t	t	NOUN
ijassa-821	207	4	)	)	PUNCT
ijassa-821	208	1	=	=	NOUN
ijassa-821	208	2	m	m	NOUN
ijassa-821	208	3	|n	|n	ADJ
ijassa-821	208	4	||p	||p	PROPN
ijassa-821	208	5	|	|	ADV
ijassa-821	208	6	−	−	NOUN
ijassa-821	208	7	t∑	t∑	ADJ
ijassa-821	208	8	k=0	k=0	PUNCT
ijassa-821	208	9	b(s	b(s	PROPN
ijassa-821	208	10	,	,	PUNCT
ijassa-821	208	11	k	k	NOUN
ijassa-821	208	12	)	)	PUNCT
ijassa-821	208	13	.	.	PUNCT
ijassa-821	209	1	(	(	PUNCT
ijassa-821	209	2	7.8	7.8	NUM
ijassa-821	209	3	)	)	PUNCT
ijassa-821	209	4	fig	fig	NOUN
ijassa-821	209	5	.	.	PUNCT
ijassa-821	210	1	7.1	7.1	NUM
ijassa-821	210	2	.	.	PUNCT
ijassa-821	210	3	number	number	NOUN
ijassa-821	210	4	of	of	ADP
ijassa-821	210	5	time	time	NOUN
ijassa-821	210	6	consistent	consistent	ADJ
ijassa-821	210	7	solution	solution	NOUN
ijassa-821	210	8	after	after	ADP
ijassa-821	210	9	period	period	NOUN
ijassa-821	210	10	t	t	NOUN
ijassa-821	210	11	for	for	ADP
ijassa-821	210	12	the	the	DET
ijassa-821	210	13	genetic	genetic	ADJ
ijassa-821	210	14	algorithm	algorithm	NOUN
ijassa-821	210	15	and	and	CCONJ
ijassa-821	210	16	its	its	PRON
ijassa-821	210	17	dynamic	dynamic	ADJ
ijassa-821	210	18	adaptation	adaptation	NOUN
ijassa-821	210	19	in	in	ADP
ijassa-821	210	20	figure	figure	NOUN
ijassa-821	210	21	7.1	7.1	NUM
ijassa-821	210	22	,	,	PUNCT
ijassa-821	210	23	the	the	DET
ijassa-821	210	24	continuous	continuous	ADJ
ijassa-821	210	25	line	line	NOUN
ijassa-821	210	26	corresponds	correspond	VERB
ijassa-821	210	27	to	to	ADP
ijassa-821	210	28	the	the	DET
ijassa-821	210	29	values	value	NOUN
ijassa-821	210	30	of	of	ADP
ijassa-821	210	31	the	the	DET
ijassa-821	210	32	function	function	NOUN
ijassa-821	210	33	c(s	c(	NOUN
ijassa-821	210	34	,	,	PUNCT
ijassa-821	210	35	t	t	PROPN
ijassa-821	210	36	)	)	PUNCT
ijassa-821	210	37	during	during	ADP
ijassa-821	210	38	calculation	calculation	NOUN
ijassa-821	210	39	the	the	DET
ijassa-821	210	40	experimental	experimental	ADJ
ijassa-821	210	41	level	level	NOUN
ijassa-821	210	42	of	of	ADP
ijassa-821	210	43	the	the	DET
ijassa-821	210	44	time	time	NOUN
ijassa-821	210	45	consistency	consistency	NOUN
ijassa-821	210	46	of	of	ADP
ijassa-821	210	47	the	the	DET
ijassa-821	210	48	genetic	genetic	ADJ
ijassa-821	210	49	algorithm	algorithm	NOUN
ijassa-821	210	50	with	with	ADP
ijassa-821	210	51	the	the	DET
ijassa-821	210	52	greffenstett	greffenstett	NOUN
ijassa-821	210	53	’s	’s	PART
ijassa-821	210	54	heuristic	heuristic	ADJ
ijassa-821	210	55	crossover	crossover	NOUN
ijassa-821	210	56	,	,	PUNCT
ijassa-821	210	57	and	and	CCONJ
ijassa-821	210	58	the	the	DET
ijassa-821	210	59	dashed	dash	VERB
ijassa-821	210	60	line	line	NOUN
ijassa-821	210	61	corresponds	correspond	VERB
ijassa-821	210	62	to	to	ADP
ijassa-821	210	63	the	the	DET
ijassa-821	210	64	values	value	NOUN
ijassa-821	210	65	of	of	ADP
ijassa-821	210	66	this	this	DET
ijassa-821	210	67	function	function	NOUN
ijassa-821	210	68	for	for	ADP
ijassa-821	210	69	the	the	DET
ijassa-821	210	70	dynamic	dynamic	ADJ
ijassa-821	210	71	adaptation	adaptation	NOUN
ijassa-821	210	72	of	of	ADP
ijassa-821	210	73	this	this	DET
ijassa-821	210	74	heuristics	heuristic	NOUN
ijassa-821	210	75	.	.	PUNCT
ijassa-821	211	1	copyright	copyright	NOUN
ijassa-821	211	2	©	©	PROPN
ijassa-821	211	3	2020	2020	NUM
ijassa-821	211	4	assa	assa	NOUN
ijassa-821	211	5	.	.	PUNCT
ijassa-821	212	1	adv	adv	PROPN
ijassa-821	212	2	syst	syst	PROPN
ijassa-821	212	3	sci	sci	PROPN
ijassa-821	212	4	appl	appl	PROPN
ijassa-821	212	5	(	(	PUNCT
ijassa-821	212	6	2020	2020	NUM
ijassa-821	212	7	)	)	PUNCT
ijassa-821	212	8	40	40	NUM
ijassa-821	212	9	v.	v.	ADP
ijassa-821	212	10	v.	v.	CCONJ
ijassa-821	212	11	zakharov	zakharov	PROPN
ijassa-821	212	12	,	,	PUNCT
ijassa-821	212	13	a.	a.	NOUN
ijassa-821	212	14	v.	v.	ADP
ijassa-821	212	15	mugayskikh	mugayskikh	NOUN
ijassa-821	212	16	7.2	7.2	NUM
ijassa-821	212	17	.	.	PUNCT
ijassa-821	212	18	comparison	comparison	NOUN
ijassa-821	212	19	of	of	ADP
ijassa-821	212	20	route	route	NOUN
ijassa-821	212	21	plans	plan	NOUN
ijassa-821	212	22	obtained	obtain	VERB
ijassa-821	212	23	by	by	ADP
ijassa-821	212	24	genetic	genetic	ADJ
ijassa-821	212	25	heuristics	heuristic	NOUN
ijassa-821	212	26	and	and	CCONJ
ijassa-821	212	27	its	its	PRON
ijassa-821	212	28	dynamic	dynamic	ADJ
ijassa-821	212	29	adaptation	adaptation	NOUN
ijassa-821	212	30	procedute	procedute	NOUN
ijassa-821	212	31	using	use	VERB
ijassa-821	212	32	the	the	DET
ijassa-821	212	33	example	example	NOUN
ijassa-821	212	34	of	of	ADP
ijassa-821	212	35	the	the	DET
ijassa-821	212	36	tsp	tsp	NOUN
ijassa-821	212	37	problem	problem	NOUN
ijassa-821	212	38	and	and	CCONJ
ijassa-821	212	39	the	the	DET
ijassa-821	212	40	genetic	genetic	ADJ
ijassa-821	212	41	algorithm	algorithm	NOUN
ijassa-821	212	42	,	,	PUNCT
ijassa-821	212	43	it	it	PRON
ijassa-821	212	44	was	be	AUX
ijassa-821	212	45	shown	show	VERB
ijassa-821	212	46	that	that	SCONJ
ijassa-821	212	47	the	the	DET
ijassa-821	212	48	dynamic	dynamic	ADJ
ijassa-821	212	49	adaptation	adaptation	NOUN
ijassa-821	212	50	procedure	procedure	NOUN
ijassa-821	212	51	allows	allow	VERB
ijassa-821	212	52	to	to	PART
ijassa-821	212	53	obtain	obtain	VERB
ijassa-821	212	54	solutions	solution	NOUN
ijassa-821	212	55	with	with	ADP
ijassa-821	212	56	a	a	DET
ijassa-821	212	57	higher	high	ADJ
ijassa-821	212	58	level	level	NOUN
ijassa-821	212	59	of	of	ADP
ijassa-821	212	60	time	time	NOUN
ijassa-821	212	61	consistency	consistency	NOUN
ijassa-821	212	62	.	.	PUNCT
ijassa-821	213	1	we	we	PRON
ijassa-821	213	2	will	will	AUX
ijassa-821	213	3	check	check	VERB
ijassa-821	213	4	how	how	SCONJ
ijassa-821	213	5	the	the	DET
ijassa-821	213	6	length	length	NOUN
ijassa-821	213	7	of	of	ADP
ijassa-821	213	8	the	the	DET
ijassa-821	213	9	route	route	NOUN
ijassa-821	213	10	plans	plan	VERB
ijassa-821	213	11	changes	change	NOUN
ijassa-821	213	12	with	with	ADP
ijassa-821	213	13	this	this	DET
ijassa-821	213	14	procedure	procedure	NOUN
ijassa-821	213	15	.	.	PUNCT
ijassa-821	214	1	table	table	NOUN
ijassa-821	214	2	7.3	7.3	NUM
ijassa-821	214	3	presents	present	VERB
ijassa-821	214	4	a	a	DET
ijassa-821	214	5	comparison	comparison	NOUN
ijassa-821	214	6	of	of	ADP
ijassa-821	214	7	the	the	DET
ijassa-821	214	8	lengths	length	NOUN
ijassa-821	214	9	of	of	ADP
ijassa-821	214	10	routes	route	NOUN
ijassa-821	214	11	(	(	PUNCT
ijassa-821	214	12	solutions	solution	NOUN
ijassa-821	214	13	)	)	PUNCT
ijassa-821	214	14	generated	generate	VERB
ijassa-821	214	15	by	by	ADP
ijassa-821	214	16	the	the	DET
ijassa-821	214	17	genetic	genetic	ADJ
ijassa-821	214	18	algorithm	algorithm	NOUN
ijassa-821	214	19	and	and	CCONJ
ijassa-821	214	20	its	its	PRON
ijassa-821	214	21	dynamic	dynamic	ADJ
ijassa-821	214	22	adaptation	adaptation	NOUN
ijassa-821	214	23	.	.	PUNCT
ijassa-821	215	1	the	the	DET
ijassa-821	215	2	average	average	ADJ
ijassa-821	215	3	values	value	NOUN
ijassa-821	215	4	of	of	ADP
ijassa-821	215	5	the	the	DET
ijassa-821	215	6	objective	objective	ADJ
ijassa-821	215	7	function	function	NOUN
ijassa-821	215	8	are	be	AUX
ijassa-821	215	9	given	give	VERB
ijassa-821	215	10	for	for	ADP
ijassa-821	215	11	500	500	NUM
ijassa-821	215	12	runs	run	NOUN
ijassa-821	215	13	of	of	ADP
ijassa-821	215	14	algorithms	algorithm	NOUN
ijassa-821	215	15	.	.	PUNCT
ijassa-821	216	1	the	the	DET
ijassa-821	216	2	stopping	stop	VERB
ijassa-821	216	3	criterion	criterion	NOUN
ijassa-821	216	4	for	for	ADP
ijassa-821	216	5	each	each	DET
ijassa-821	216	6	start	start	NOUN
ijassa-821	216	7	of	of	ADP
ijassa-821	216	8	the	the	DET
ijassa-821	216	9	genetic	genetic	ADJ
ijassa-821	216	10	algorithm	algorithm	NOUN
ijassa-821	216	11	with	with	ADP
ijassa-821	216	12	the	the	DET
ijassa-821	216	13	greffenstett	greffenstett	NOUN
ijassa-821	216	14	’s	’s	PART
ijassa-821	216	15	heuristic	heuristic	ADJ
ijassa-821	216	16	crossover	crossover	NOUN
ijassa-821	216	17	was	be	AUX
ijassa-821	216	18	reaching	reach	VERB
ijassa-821	216	19	100	100	NUM
ijassa-821	216	20	generations	generation	NOUN
ijassa-821	216	21	of	of	ADP
ijassa-821	216	22	population	population	NOUN
ijassa-821	216	23	.	.	PUNCT
ijassa-821	217	1	the	the	DET
ijassa-821	217	2	dynamic	dynamic	ADJ
ijassa-821	217	3	adaptation	adaptation	NOUN
ijassa-821	217	4	procedure	procedure	NOUN
ijassa-821	217	5	was	be	AUX
ijassa-821	217	6	carried	carry	VERB
ijassa-821	217	7	out	out	ADP
ijassa-821	217	8	according	accord	VERB
ijassa-821	217	9	to	to	ADP
ijassa-821	217	10	the	the	DET
ijassa-821	217	11	scheme	scheme	NOUN
ijassa-821	217	12	given	give	VERB
ijassa-821	217	13	in	in	ADP
ijassa-821	217	14	algorithm	algorithm	NOUN
ijassa-821	217	15	3	3	NUM
ijassa-821	217	16	,	,	PUNCT
ijassa-821	217	17	with	with	ADP
ijassa-821	217	18	the	the	DET
ijassa-821	217	19	following	follow	VERB
ijassa-821	217	20	set	set	NOUN
ijassa-821	217	21	of	of	ADP
ijassa-821	217	22	parameters	parameter	NOUN
ijassa-821	217	23	:	:	PUNCT
ijassa-821	217	24	t	t	NOUN
ijassa-821	217	25	=	=	SYM
ijassa-821	217	26	5	5	NUM
ijassa-821	217	27	,	,	PUNCT
ijassa-821	217	28	|n	|n	NOUN
ijassa-821	217	29	|	|	NOUN
ijassa-821	217	30	=	=	NOUN
ijassa-821	217	31	20	20	NUM
ijassa-821	217	32	.	.	PUNCT
ijassa-821	218	1	we	we	PRON
ijassa-821	218	2	introduce	introduce	VERB
ijassa-821	218	3	the	the	DET
ijassa-821	218	4	following	following	ADJ
ijassa-821	218	5	notation	notation	NOUN
ijassa-821	218	6	:	:	PUNCT
ijassa-821	218	7	the	the	DET
ijassa-821	218	8	value	value	NOUN
ijassa-821	218	9	lga(p	lga(p	NOUN
ijassa-821	218	10	)	)	PUNCT
ijassa-821	218	11	equals	equal	VERB
ijassa-821	218	12	the	the	DET
ijassa-821	218	13	length	length	NOUN
ijassa-821	218	14	of	of	ADP
ijassa-821	218	15	the	the	DET
ijassa-821	218	16	route	route	NOUN
ijassa-821	218	17	obtained	obtain	VERB
ijassa-821	218	18	by	by	ADP
ijassa-821	218	19	the	the	DET
ijassa-821	218	20	genetic	genetic	ADJ
ijassa-821	218	21	algorithm	algorithm	NOUN
ijassa-821	218	22	for	for	ADP
ijassa-821	218	23	the	the	DET
ijassa-821	218	24	test	test	NOUN
ijassa-821	218	25	problem	problem	NOUN
ijassa-821	218	26	p	p	X
ijassa-821	218	27	,	,	PUNCT
ijassa-821	218	28	ldaga(p	ldaga(p	PROPN
ijassa-821	218	29	)	)	PUNCT
ijassa-821	218	30	is	be	AUX
ijassa-821	218	31	the	the	DET
ijassa-821	218	32	length	length	NOUN
ijassa-821	218	33	of	of	ADP
ijassa-821	218	34	the	the	DET
ijassa-821	218	35	route	route	NOUN
ijassa-821	218	36	obtained	obtain	VERB
ijassa-821	218	37	by	by	ADP
ijassa-821	218	38	using	use	VERB
ijassa-821	218	39	a	a	DET
ijassa-821	218	40	dynamically	dynamically	ADV
ijassa-821	218	41	adapted	adapt	VERB
ijassa-821	218	42	genetic	genetic	ADJ
ijassa-821	218	43	algorithm	algorithm	NOUN
ijassa-821	218	44	.	.	PUNCT
ijassa-821	219	1	the	the	DET
ijassa-821	219	2	last	last	ADJ
ijassa-821	219	3	two	two	NUM
ijassa-821	219	4	columns	column	NOUN
ijassa-821	219	5	of	of	ADP
ijassa-821	219	6	table	table	NOUN
ijassa-821	219	7	3	3	NUM
ijassa-821	219	8	show	show	VERB
ijassa-821	219	9	the	the	DET
ijassa-821	219	10	values	value	NOUN
ijassa-821	219	11	of	of	ADP
ijassa-821	219	12	the	the	DET
ijassa-821	219	13	objective	objective	ADJ
ijassa-821	219	14	function	function	NOUN
ijassa-821	219	15	corresponding	correspond	VERB
ijassa-821	219	16	to	to	ADP
ijassa-821	219	17	the	the	DET
ijassa-821	219	18	effective	effective	ADJ
ijassa-821	219	19	start	start	NOUN
ijassa-821	219	20	.	.	PUNCT
ijassa-821	220	1	an	an	DET
ijassa-821	220	2	effective	effective	ADJ
ijassa-821	220	3	run	run	NOUN
ijassa-821	220	4	of	of	ADP
ijassa-821	220	5	the	the	DET
ijassa-821	220	6	dynamic	dynamic	ADJ
ijassa-821	220	7	adaptation	adaptation	NOUN
ijassa-821	220	8	procedure	procedure	NOUN
ijassa-821	220	9	for	for	ADP
ijassa-821	220	10	the	the	DET
ijassa-821	220	11	problem	problem	NOUN
ijassa-821	220	12	instance	instance	NOUN
ijassa-821	220	13	p	p	NOUN
ijassa-821	220	14	is	be	AUX
ijassa-821	220	15	a	a	DET
ijassa-821	220	16	run	run	NOUN
ijassa-821	220	17	for	for	ADP
ijassa-821	220	18	which	which	PRON
ijassa-821	220	19	the	the	DET
ijassa-821	220	20	value	value	NOUN
ijassa-821	220	21	of	of	ADP
ijassa-821	220	22	lga(p)−	lga(p)−	PROPN
ijassa-821	220	23	ldaga(p	ldaga(p	PROPN
ijassa-821	220	24	)	)	PUNCT
ijassa-821	220	25	is	be	AUX
ijassa-821	220	26	the	the	DET
ijassa-821	220	27	maximum	maximum	NOUN
ijassa-821	220	28	in	in	ADP
ijassa-821	220	29	the	the	DET
ijassa-821	220	30	experiment	experiment	NOUN
ijassa-821	220	31	.	.	PUNCT
ijassa-821	221	1	table	table	NOUN
ijassa-821	221	2	7.3	7.3	NUM
ijassa-821	221	3	.	.	PUNCT
ijassa-821	222	1	comparison	comparison	NOUN
ijassa-821	222	2	of	of	ADP
ijassa-821	222	3	length	length	NOUN
ijassa-821	222	4	of	of	ADP
ijassa-821	222	5	routing	route	VERB
ijassa-821	222	6	plans	plan	NOUN
ijassa-821	222	7	generated	generate	VERB
ijassa-821	222	8	by	by	ADP
ijassa-821	222	9	genetics	genetic	NOUN
ijassa-821	222	10	and	and	CCONJ
ijassa-821	222	11	its	its	PRON
ijassa-821	222	12	dynamic	dynamic	ADJ
ijassa-821	222	13	adaptation	adaptation	NOUN
ijassa-821	222	14	problem	problem	NOUN
ijassa-821	222	15	instance	instance	NOUN
ijassa-821	222	16	mean	mean	VERB
ijassa-821	222	17	length	length	NOUN
ijassa-821	222	18	value	value	NOUN
ijassa-821	222	19	effective	effective	ADJ
ijassa-821	222	20	run	run	VERB
ijassa-821	222	21	genetic	genetic	ADJ
ijassa-821	222	22	heuristics	heuristic	NOUN
ijassa-821	222	23	dynamtic	dynamtic	ADJ
ijassa-821	222	24	adaptation	adaptation	NOUN
ijassa-821	222	25	genetic	genetic	ADJ
ijassa-821	222	26	heuristics	heuristic	NOUN
ijassa-821	222	27	dynamtic	dynamtic	ADJ
ijassa-821	222	28	adaptation	adaptation	NOUN
ijassa-821	222	29	att48	att48	PROPN
ijassa-821	222	30	12270,72	12270,72	PROPN
ijassa-821	222	31	11723,79	11723,79	PROPN
ijassa-821	222	32	11657	11657	NUM
ijassa-821	222	33	10928	10928	NUM
ijassa-821	222	34	eil51	eil51	PROPN
ijassa-821	222	35	493,72	493,72	NOUN
ijassa-821	222	36	464,64	464,64	NUM
ijassa-821	223	1	493	493	NUM
ijassa-821	223	2	448	448	NUM
ijassa-821	223	3	berlin52	berlin52	NOUN
ijassa-821	223	4	8836,31	8836,31	PROPN
ijassa-821	223	5	8257,36	8257,36	NUM
ijassa-821	223	6	8570	8570	NUM
ijassa-821	223	7	7893	7893	NUM
ijassa-821	224	1	st70	st70	PROPN
ijassa-821	224	2	803,25	803,25	NUM
ijassa-821	224	3	758,61	758,61	NOUN
ijassa-821	224	4	765	765	NUM
ijassa-821	224	5	708	708	NUM
ijassa-821	224	6	eil101	eil101	NOUN
ijassa-821	224	7	779,30	779,30	NOUN
ijassa-821	224	8	720,338	720,338	NUM
ijassa-821	224	9	725	725	NUM
ijassa-821	224	10	665	665	NUM
ijassa-821	224	11	table	table	NOUN
ijassa-821	224	12	3	3	NUM
ijassa-821	224	13	shows	show	VERB
ijassa-821	224	14	that	that	SCONJ
ijassa-821	224	15	for	for	SCONJ
ijassa-821	224	16	each	each	PRON
ijassa-821	224	17	of	of	ADP
ijassa-821	224	18	the	the	DET
ijassa-821	224	19	problem	problem	NOUN
ijassa-821	224	20	instances	instance	NOUN
ijassa-821	224	21	considered	consider	VERB
ijassa-821	224	22	,	,	PUNCT
ijassa-821	224	23	the	the	DET
ijassa-821	224	24	average	average	ADJ
ijassa-821	224	25	length	length	NOUN
ijassa-821	224	26	of	of	ADP
ijassa-821	224	27	the	the	DET
ijassa-821	224	28	generated	generate	VERB
ijassa-821	224	29	solutions	solution	NOUN
ijassa-821	224	30	by	by	ADP
ijassa-821	224	31	the	the	DET
ijassa-821	224	32	dynamic	dynamic	ADJ
ijassa-821	224	33	adaptation	adaptation	NOUN
ijassa-821	224	34	algorithm	algorithm	NOUN
ijassa-821	224	35	is	be	AUX
ijassa-821	224	36	less	less	ADJ
ijassa-821	224	37	than	than	ADP
ijassa-821	224	38	the	the	DET
ijassa-821	224	39	classical	classical	ADJ
ijassa-821	224	40	genetic	genetic	ADJ
ijassa-821	224	41	algorithm	algorithm	NOUN
ijassa-821	224	42	with	with	ADP
ijassa-821	224	43	the	the	DET
ijassa-821	224	44	greffenstett	greffenstett	NOUN
ijassa-821	224	45	’s	’s	PART
ijassa-821	224	46	heuristic	heuristic	ADJ
ijassa-821	224	47	crossover	crossover	NOUN
ijassa-821	224	48	.	.	PUNCT
ijassa-821	225	1	the	the	DET
ijassa-821	225	2	percent	percent	NOUN
ijassa-821	225	3	of	of	ADP
ijassa-821	225	4	improvement	improvement	NOUN
ijassa-821	225	5	we	we	PRON
ijassa-821	225	6	calculate	calculate	VERB
ijassa-821	225	7	by	by	ADP
ijassa-821	225	8	the	the	DET
ijassa-821	225	9	equation	equation	NOUN
ijassa-821	225	10	below	below	ADV
ijassa-821	225	11	:	:	PUNCT
ijassa-821	226	1	k	k	X
ijassa-821	226	2	=	=	PUNCT
ijassa-821	226	3	lga(p)−	lga(p)−	PROPN
ijassa-821	226	4	ldaga(p	ldaga(p	PROPN
ijassa-821	226	5	)	)	PUNCT
ijassa-821	226	6	lga(p	lga(p	NOUN
ijassa-821	226	7	)	)	PUNCT
ijassa-821	226	8	100	100	NUM
ijassa-821	226	9	%	%	NOUN
ijassa-821	226	10	.	.	PUNCT
ijassa-821	227	1	(	(	PUNCT
ijassa-821	227	2	7.9	7.9	NUM
ijassa-821	227	3	)	)	PUNCT
ijassa-821	227	4	the	the	DET
ijassa-821	227	5	average	average	ADJ
ijassa-821	227	6	percentage	percentage	NOUN
ijassa-821	227	7	improvement	improvement	NOUN
ijassa-821	227	8	is	be	AUX
ijassa-821	227	9	6	6	NUM
ijassa-821	227	10	,	,	PUNCT
ijassa-821	227	11	01	01	NUM
ijassa-821	227	12	%	%	NOUN
ijassa-821	227	13	.	.	PUNCT
ijassa-821	228	1	the	the	DET
ijassa-821	228	2	maximum	maximum	ADJ
ijassa-821	228	3	improvement	improvement	NOUN
ijassa-821	228	4	value	value	NOUN
ijassa-821	228	5	was	be	AUX
ijassa-821	228	6	obtained	obtain	VERB
ijassa-821	228	7	for	for	ADP
ijassa-821	228	8	the	the	DET
ijassa-821	228	9	problem	problem	NOUN
ijassa-821	228	10	instance	instance	PROPN
ijassa-821	228	11	eil51	eil51	PROPN
ijassa-821	228	12	and	and	CCONJ
ijassa-821	228	13	amounts	amount	VERB
ijassa-821	228	14	to	to	ADP
ijassa-821	228	15	9	9	NUM
ijassa-821	228	16	,	,	PUNCT
ijassa-821	228	17	12	12	NUM
ijassa-821	228	18	%	%	NOUN
ijassa-821	228	19	.	.	PUNCT
ijassa-821	229	1	7.3	7.3	NUM
ijassa-821	229	2	.	.	PUNCT
ijassa-821	230	1	time	time	NOUN
ijassa-821	230	2	analysis	analysis	NOUN
ijassa-821	230	3	for	for	ADP
ijassa-821	230	4	applying	apply	VERB
ijassa-821	230	5	dynamic	dynamic	ADJ
ijassa-821	230	6	adaptation	adaptation	NOUN
ijassa-821	230	7	procedure	procedure	NOUN
ijassa-821	230	8	the	the	DET
ijassa-821	230	9	procedure	procedure	NOUN
ijassa-821	230	10	of	of	ADP
ijassa-821	230	11	dynamic	dynamic	ADJ
ijassa-821	230	12	adaption	adaption	NOUN
ijassa-821	230	13	of	of	ADP
ijassa-821	230	14	a	a	DET
ijassa-821	230	15	genetic	genetic	ADJ
ijassa-821	230	16	algorithm	algorithm	NOUN
ijassa-821	230	17	requires	require	VERB
ijassa-821	230	18	additional	additional	ADJ
ijassa-821	230	19	runs	run	NOUN
ijassa-821	230	20	on	on	ADP
ijassa-821	230	21	each	each	DET
ijassa-821	230	22	period	period	NOUN
ijassa-821	230	23	and	and	CCONJ
ijassa-821	230	24	leads	lead	VERB
ijassa-821	230	25	to	to	ADP
ijassa-821	230	26	increasing	increase	VERB
ijassa-821	230	27	the	the	DET
ijassa-821	230	28	time	time	NOUN
ijassa-821	230	29	to	to	PART
ijassa-821	230	30	get	get	VERB
ijassa-821	230	31	one	one	NUM
ijassa-821	230	32	routing	routing	NOUN
ijassa-821	230	33	plan	plan	NOUN
ijassa-821	230	34	.	.	PUNCT
ijassa-821	231	1	we	we	PRON
ijassa-821	231	2	will	will	AUX
ijassa-821	231	3	carry	carry	VERB
ijassa-821	231	4	out	out	ADP
ijassa-821	231	5	the	the	DET
ijassa-821	231	6	following	follow	VERB
ijassa-821	231	7	experiment	experiment	NOUN
ijassa-821	231	8	.	.	PUNCT
ijassa-821	232	1	let	let	VERB
ijassa-821	232	2	tdyn	tdyn	NOUN
ijassa-821	232	3	be	be	AUX
ijassa-821	232	4	the	the	DET
ijassa-821	232	5	average	average	ADJ
ijassa-821	232	6	duration	duration	NOUN
ijassa-821	232	7	(	(	PUNCT
ijassa-821	232	8	in	in	ADP
ijassa-821	232	9	seconds	second	NOUN
ijassa-821	232	10	)	)	PUNCT
ijassa-821	232	11	of	of	ADP
ijassa-821	232	12	the	the	DET
ijassa-821	232	13	dynamic	dynamic	ADJ
ijassa-821	232	14	adaptation	adaptation	NOUN
ijassa-821	232	15	algorithm	algorithm	NOUN
ijassa-821	232	16	to	to	PART
ijassa-821	232	17	generate	generate	VERB
ijassa-821	232	18	a	a	DET
ijassa-821	232	19	route	route	NOUN
ijassa-821	232	20	.	.	PUNCT
ijassa-821	233	1	let	let	VERB
ijassa-821	233	2	us	we	PRON
ijassa-821	233	3	limit	limit	VERB
ijassa-821	233	4	the	the	DET
ijassa-821	233	5	runtime	runtime	NOUN
ijassa-821	233	6	of	of	ADP
ijassa-821	233	7	classical	classical	ADJ
ijassa-821	233	8	genetic	genetic	ADJ
ijassa-821	233	9	heuristics	heuristic	NOUN
ijassa-821	233	10	to	to	PART
ijassa-821	233	11	tdyn	tdyn	VERB
ijassa-821	233	12	.	.	PUNCT
ijassa-821	234	1	for	for	ADP
ijassa-821	234	2	each	each	DET
ijassa-821	234	3	problem	problem	NOUN
ijassa-821	234	4	instance	instance	NOUN
ijassa-821	234	5	,	,	PUNCT
ijassa-821	234	6	we	we	PRON
ijassa-821	234	7	will	will	AUX
ijassa-821	234	8	make	make	VERB
ijassa-821	234	9	100	100	NUM
ijassa-821	234	10	launches	launch	NOUN
ijassa-821	234	11	of	of	ADP
ijassa-821	234	12	the	the	DET
ijassa-821	234	13	genetic	genetic	ADJ
ijassa-821	234	14	algorithm	algorithm	NOUN
ijassa-821	234	15	and	and	CCONJ
ijassa-821	234	16	its	its	PRON
ijassa-821	234	17	dynamic	dynamic	ADJ
ijassa-821	234	18	adaptation	adaptation	NOUN
ijassa-821	234	19	and	and	CCONJ
ijassa-821	234	20	compare	compare	VERB
ijassa-821	234	21	the	the	DET
ijassa-821	234	22	results	result	NOUN
ijassa-821	234	23	of	of	ADP
ijassa-821	234	24	the	the	DET
ijassa-821	234	25	two	two	NUM
ijassa-821	234	26	methods	method	NOUN
ijassa-821	234	27	with	with	ADP
ijassa-821	234	28	a	a	DET
ijassa-821	234	29	fixed	fix	VERB
ijassa-821	234	30	duration	duration	NOUN
ijassa-821	234	31	of	of	ADP
ijassa-821	234	32	their	their	PRON
ijassa-821	234	33	work	work	NOUN
ijassa-821	234	34	equal	equal	ADJ
ijassa-821	234	35	to	to	ADP
ijassa-821	234	36	tdyn	tdyn	VERB
ijassa-821	234	37	.	.	PUNCT
ijassa-821	235	1	as	as	SCONJ
ijassa-821	235	2	can	can	AUX
ijassa-821	235	3	be	be	AUX
ijassa-821	235	4	clearly	clearly	ADV
ijassa-821	235	5	seen	see	VERB
ijassa-821	235	6	from	from	ADP
ijassa-821	235	7	table	table	NOUN
ijassa-821	235	8	7.4	7.4	NUM
ijassa-821	235	9	,	,	PUNCT
ijassa-821	235	10	with	with	ADP
ijassa-821	235	11	a	a	DET
ijassa-821	235	12	fixed	fix	VERB
ijassa-821	235	13	operating	operating	NOUN
ijassa-821	235	14	time	time	NOUN
ijassa-821	235	15	,	,	PUNCT
ijassa-821	235	16	the	the	DET
ijassa-821	235	17	method	method	NOUN
ijassa-821	235	18	of	of	ADP
ijassa-821	235	19	dynamic	dynamic	ADJ
ijassa-821	235	20	adaptation	adaptation	NOUN
ijassa-821	235	21	of	of	ADP
ijassa-821	235	22	genetic	genetic	ADJ
ijassa-821	235	23	heuristics	heuristic	NOUN
ijassa-821	235	24	is	be	AUX
ijassa-821	235	25	able	able	ADJ
ijassa-821	235	26	to	to	PART
ijassa-821	235	27	generate	generate	VERB
ijassa-821	235	28	better	well	ADJ
ijassa-821	235	29	solutions	solution	NOUN
ijassa-821	235	30	compared	compare	VERB
ijassa-821	235	31	to	to	ADP
ijassa-821	235	32	the	the	DET
ijassa-821	235	33	genetic	genetic	ADJ
ijassa-821	235	34	algorithm	algorithm	NOUN
ijassa-821	235	35	with	with	ADP
ijassa-821	235	36	the	the	DET
ijassa-821	235	37	greffenstett	greffenstett	NOUN
ijassa-821	235	38	’s	’s	PART
ijassa-821	235	39	heuristic	heuristic	ADJ
ijassa-821	235	40	crossover	crossover	NOUN
ijassa-821	235	41	.	.	PUNCT
ijassa-821	236	1	this	this	DET
ijassa-821	236	2	remark	remark	NOUN
ijassa-821	236	3	should	should	AUX
ijassa-821	236	4	be	be	AUX
ijassa-821	236	5	taken	take	VERB
ijassa-821	236	6	into	into	ADP
ijassa-821	236	7	account	account	NOUN
ijassa-821	236	8	in	in	ADP
ijassa-821	236	9	large	large	ADJ
ijassa-821	236	10	-	-	PUNCT
ijassa-821	236	11	scale	scale	NOUN
ijassa-821	236	12	problem	problem	NOUN
ijassa-821	236	13	instances	instance	NOUN
ijassa-821	236	14	,	,	PUNCT
ijassa-821	236	15	when	when	SCONJ
ijassa-821	236	16	the	the	DET
ijassa-821	236	17	generation	generation	NOUN
ijassa-821	236	18	time	time	NOUN
ijassa-821	236	19	of	of	ADP
ijassa-821	236	20	one	one	NUM
ijassa-821	236	21	route	route	NOUN
ijassa-821	236	22	can	can	AUX
ijassa-821	236	23	take	take	VERB
ijassa-821	236	24	copyright	copyright	NOUN
ijassa-821	236	25	©	©	PROPN
ijassa-821	236	26	2020	2020	NUM
ijassa-821	236	27	assa	assa	NOUN
ijassa-821	236	28	.	.	PUNCT
ijassa-821	237	1	adv	adv	PROPN
ijassa-821	237	2	syst	syst	PROPN
ijassa-821	237	3	sci	sci	PROPN
ijassa-821	237	4	appl	appl	PROPN
ijassa-821	237	5	(	(	PUNCT
ijassa-821	237	6	2020	2020	NUM
ijassa-821	237	7	)	)	PUNCT
ijassa-821	237	8	dynamic	dynamic	ADJ
ijassa-821	237	9	adaptation	adaptation	NOUN
ijassa-821	237	10	of	of	ADP
ijassa-821	237	11	genetic	genetic	ADJ
ijassa-821	237	12	algorithm	algorithm	NOUN
ijassa-821	237	13	for	for	ADP
ijassa-821	237	14	solving	solve	VERB
ijassa-821	237	15	routing	routing	NOUN
ijassa-821	237	16	problems	problem	NOUN
ijassa-821	237	17	41	41	NUM
ijassa-821	237	18	table	table	NOUN
ijassa-821	237	19	7.4	7.4	NUM
ijassa-821	237	20	.	.	PUNCT
ijassa-821	237	21	comparison	comparison	NOUN
ijassa-821	237	22	of	of	ADP
ijassa-821	237	23	length	length	NOUN
ijassa-821	237	24	of	of	ADP
ijassa-821	237	25	routing	route	VERB
ijassa-821	237	26	plans	plan	NOUN
ijassa-821	237	27	obtained	obtain	VERB
ijassa-821	237	28	by	by	ADP
ijassa-821	237	29	fixed	fix	VERB
ijassa-821	237	30	runtime	runtime	NOUN
ijassa-821	237	31	tdyn	tdyn	PROPN
ijassa-821	237	32	problem	problem	PROPN
ijassa-821	237	33	instance	instance	NOUN
ijassa-821	237	34	mean	mean	VERB
ijassa-821	237	35	length	length	NOUN
ijassa-821	237	36	value	value	NOUN
ijassa-821	237	37	tdyngenetic	tdyngenetic	ADJ
ijassa-821	237	38	alrorithm	alrorithm	PROPN
ijassa-821	237	39	dynamic	dynamic	ADJ
ijassa-821	237	40	adaptation	adaptation	NOUN
ijassa-821	237	41	att48	att48	PROPN
ijassa-821	237	42	12273,51	12273,51	PROPN
ijassa-821	237	43	11723,79	11723,79	PROPN
ijassa-821	237	44	120,1	120,1	PROPN
ijassa-821	237	45	eil51	eil51	PROPN
ijassa-821	237	46	492,44	492,44	X
ijassa-821	238	1	464,64	464,64	NUM
ijassa-821	239	1	165,5	165,5	NUM
ijassa-821	239	2	berlin52	berlin52	NOUN
ijassa-821	239	3	8820	8820	NUM
ijassa-821	239	4	,	,	PUNCT
ijassa-821	239	5	25	25	NUM
ijassa-821	239	6	8257,36	8257,36	NUM
ijassa-821	239	7	206,35	206,35	NUM
ijassa-821	239	8	st70	st70	PROPN
ijassa-821	239	9	807,37	807,37	NUM
ijassa-821	239	10	758,61	758,61	NOUN
ijassa-821	240	1	1300,4	1300,4	NUM
ijassa-821	240	2	eil101	eil101	PROPN
ijassa-821	240	3	786,54	786,54	NUM
ijassa-821	240	4	720,338	720,338	NUM
ijassa-821	240	5	3403,7	3403,7	NUM
ijassa-821	240	6	tens	ten	NOUN
ijassa-821	240	7	of	of	ADP
ijassa-821	240	8	minutes	minute	NOUN
ijassa-821	240	9	.	.	PUNCT
ijassa-821	241	1	the	the	DET
ijassa-821	241	2	experiment	experiment	NOUN
ijassa-821	241	3	also	also	ADV
ijassa-821	241	4	showed	show	VERB
ijassa-821	241	5	,	,	PUNCT
ijassa-821	241	6	in	in	ADP
ijassa-821	241	7	the	the	DET
ijassa-821	241	8	case	case	NOUN
ijassa-821	241	9	of	of	ADP
ijassa-821	241	10	a	a	DET
ijassa-821	241	11	fixed	fix	VERB
ijassa-821	241	12	runtime	runtime	NOUN
ijassa-821	241	13	for	for	ADP
ijassa-821	241	14	generating	generate	VERB
ijassa-821	241	15	the	the	DET
ijassa-821	241	16	routing	routing	NOUN
ijassa-821	241	17	plan	plan	NOUN
ijassa-821	241	18	,	,	PUNCT
ijassa-821	241	19	it	it	PRON
ijassa-821	241	20	is	be	AUX
ijassa-821	241	21	more	more	ADV
ijassa-821	241	22	profitable	profitable	ADJ
ijassa-821	241	23	to	to	PART
ijassa-821	241	24	use	use	VERB
ijassa-821	241	25	the	the	DET
ijassa-821	241	26	dynamic	dynamic	ADJ
ijassa-821	241	27	adaptation	adaptation	NOUN
ijassa-821	241	28	procedure	procedure	NOUN
ijassa-821	241	29	instead	instead	ADV
ijassa-821	241	30	of	of	ADP
ijassa-821	241	31	the	the	DET
ijassa-821	241	32	classical	classical	ADJ
ijassa-821	241	33	heuristic	heuristic	NOUN
ijassa-821	241	34	,	,	PUNCT
ijassa-821	241	35	distributing	distribute	VERB
ijassa-821	241	36	the	the	DET
ijassa-821	241	37	time	time	NOUN
ijassa-821	241	38	between	between	ADP
ijassa-821	241	39	the	the	DET
ijassa-821	241	40	corresponding	corresponding	ADJ
ijassa-821	241	41	periods	period	NOUN
ijassa-821	241	42	of	of	ADP
ijassa-821	241	43	the	the	DET
ijassa-821	241	44	algorithm	algorithm	NOUN
ijassa-821	241	45	.	.	PUNCT
ijassa-821	242	1	8	8	X
ijassa-821	242	2	.	.	X
ijassa-821	242	3	conclusion	conclusion	NOUN
ijassa-821	242	4	in	in	ADP
ijassa-821	242	5	this	this	DET
ijassa-821	242	6	article	article	NOUN
ijassa-821	242	7	,	,	PUNCT
ijassa-821	242	8	a	a	DET
ijassa-821	242	9	genetic	genetic	ADJ
ijassa-821	242	10	algorithm	algorithm	NOUN
ijassa-821	242	11	with	with	ADP
ijassa-821	242	12	a	a	DET
ijassa-821	242	13	greffenstett	greffenstett	NOUN
ijassa-821	242	14	’s	’s	PART
ijassa-821	242	15	heuristic	heuristic	ADJ
ijassa-821	242	16	crossover	crossover	NOUN
ijassa-821	242	17	solving	solve	VERB
ijassa-821	242	18	the	the	DET
ijassa-821	242	19	tsp	tsp	NOUN
ijassa-821	242	20	problem	problem	NOUN
ijassa-821	242	21	was	be	AUX
ijassa-821	242	22	described	describe	VERB
ijassa-821	242	23	and	and	CCONJ
ijassa-821	242	24	implemented	implement	VERB
ijassa-821	242	25	in	in	ADP
ijassa-821	242	26	java	java	PROPN
ijassa-821	242	27	programming	programming	NOUN
ijassa-821	242	28	language	language	NOUN
ijassa-821	242	29	.	.	PUNCT
ijassa-821	243	1	the	the	DET
ijassa-821	243	2	level	level	NOUN
ijassa-821	243	3	of	of	ADP
ijassa-821	243	4	time	time	NOUN
ijassa-821	243	5	consistency	consistency	NOUN
ijassa-821	243	6	of	of	ADP
ijassa-821	243	7	the	the	DET
ijassa-821	243	8	solutions	solution	NOUN
ijassa-821	243	9	generated	generate	VERB
ijassa-821	243	10	by	by	ADP
ijassa-821	243	11	this	this	DET
ijassa-821	243	12	heuristic	heuristic	NOUN
ijassa-821	243	13	is	be	AUX
ijassa-821	243	14	estimated	estimate	VERB
ijassa-821	243	15	.	.	PUNCT
ijassa-821	244	1	the	the	DET
ijassa-821	244	2	calculations	calculation	NOUN
ijassa-821	244	3	for	for	ADP
ijassa-821	244	4	a	a	DET
ijassa-821	244	5	set	set	NOUN
ijassa-821	244	6	of	of	ADP
ijassa-821	244	7	problem	problem	NOUN
ijassa-821	244	8	problems	problem	NOUN
ijassa-821	244	9	from	from	ADP
ijassa-821	244	10	the	the	DET
ijassa-821	244	11	tsplib	tsplib	PROPN
ijassa-821	244	12	library	library	NOUN
ijassa-821	244	13	demonstrated	demonstrate	VERB
ijassa-821	244	14	that	that	SCONJ
ijassa-821	244	15	the	the	DET
ijassa-821	244	16	genetic	genetic	ADJ
ijassa-821	244	17	algorithm	algorithm	NOUN
ijassa-821	244	18	with	with	ADP
ijassa-821	244	19	the	the	DET
ijassa-821	244	20	greffenstett	greffenstett	NOUN
ijassa-821	244	21	’s	’s	PART
ijassa-821	244	22	heuristic	heuristic	ADJ
ijassa-821	244	23	crossover	crossover	NOUN
ijassa-821	244	24	generates	generate	VERB
ijassa-821	244	25	routes	route	NOUN
ijassa-821	244	26	with	with	ADP
ijassa-821	244	27	a	a	DET
ijassa-821	244	28	low	low	ADJ
ijassa-821	244	29	level	level	NOUN
ijassa-821	244	30	of	of	ADP
ijassa-821	244	31	time	time	NOUN
ijassa-821	244	32	consistency	consistency	NOUN
ijassa-821	244	33	.	.	PUNCT
ijassa-821	245	1	to	to	PART
ijassa-821	245	2	generate	generate	VERB
ijassa-821	245	3	solutions	solution	NOUN
ijassa-821	245	4	with	with	ADP
ijassa-821	245	5	a	a	DET
ijassa-821	245	6	higher	high	ADJ
ijassa-821	245	7	level	level	NOUN
ijassa-821	245	8	of	of	ADP
ijassa-821	245	9	time	time	NOUN
ijassa-821	245	10	solvency	solvency	NOUN
ijassa-821	245	11	,	,	PUNCT
ijassa-821	245	12	a	a	DET
ijassa-821	245	13	dynamic	dynamic	ADJ
ijassa-821	245	14	adaptation	adaptation	NOUN
ijassa-821	245	15	procedure	procedure	NOUN
ijassa-821	245	16	for	for	ADP
ijassa-821	245	17	a	a	DET
ijassa-821	245	18	genetic	genetic	ADJ
ijassa-821	245	19	algorithm	algorithm	NOUN
ijassa-821	245	20	with	with	ADP
ijassa-821	245	21	a	a	DET
ijassa-821	245	22	greffenstett	greffenstett	NOUN
ijassa-821	245	23	’s	’s	PART
ijassa-821	245	24	heuristic	heuristic	ADJ
ijassa-821	245	25	crossover	crossover	NOUN
ijassa-821	245	26	is	be	AUX
ijassa-821	245	27	proposed	propose	VERB
ijassa-821	245	28	.	.	PUNCT
ijassa-821	246	1	as	as	ADP
ijassa-821	246	2	a	a	DET
ijassa-821	246	3	result	result	NOUN
ijassa-821	246	4	,	,	PUNCT
ijassa-821	246	5	the	the	DET
ijassa-821	246	6	level	level	NOUN
ijassa-821	246	7	of	of	ADP
ijassa-821	246	8	time	time	NOUN
ijassa-821	246	9	consistency	consistency	NOUN
ijassa-821	246	10	of	of	ADP
ijassa-821	246	11	the	the	DET
ijassa-821	246	12	new	new	ADJ
ijassa-821	246	13	solutions	solution	NOUN
ijassa-821	246	14	increased	increase	VERB
ijassa-821	246	15	by	by	ADP
ijassa-821	246	16	two	two	NUM
ijassa-821	246	17	times	time	NOUN
ijassa-821	246	18	.	.	PUNCT
ijassa-821	247	1	at	at	ADP
ijassa-821	247	2	the	the	DET
ijassa-821	247	3	same	same	ADJ
ijassa-821	247	4	time	time	NOUN
ijassa-821	247	5	,	,	PUNCT
ijassa-821	247	6	the	the	DET
ijassa-821	247	7	average	average	ADJ
ijassa-821	247	8	value	value	NOUN
ijassa-821	247	9	of	of	ADP
ijassa-821	247	10	the	the	DET
ijassa-821	247	11	route	route	NOUN
ijassa-821	247	12	length	length	NOUN
ijassa-821	247	13	decreased	decrease	VERB
ijassa-821	247	14	by	by	ADP
ijassa-821	247	15	6.01	6.01	NUM
ijassa-821	247	16	%	%	NOUN
ijassa-821	247	17	.	.	PUNCT
ijassa-821	248	1	thus	thus	ADV
ijassa-821	248	2	,	,	PUNCT
ijassa-821	248	3	the	the	DET
ijassa-821	248	4	practical	practical	ADJ
ijassa-821	248	5	application	application	NOUN
ijassa-821	248	6	of	of	ADP
ijassa-821	248	7	the	the	DET
ijassa-821	248	8	proposed	propose	VERB
ijassa-821	248	9	dynamic	dynamic	ADJ
ijassa-821	248	10	approach	approach	NOUN
ijassa-821	248	11	allows	allow	VERB
ijassa-821	248	12	to	to	PART
ijassa-821	248	13	generate	generate	VERB
ijassa-821	248	14	shorter	short	ADJ
ijassa-821	248	15	routes	route	NOUN
ijassa-821	248	16	.	.	PUNCT
ijassa-821	249	1	it	it	PRON
ijassa-821	249	2	was	be	AUX
ijassa-821	249	3	also	also	ADV
ijassa-821	249	4	shown	show	VERB
ijassa-821	249	5	that	that	SCONJ
ijassa-821	249	6	with	with	ADP
ijassa-821	249	7	a	a	DET
ijassa-821	249	8	fixed	fix	VERB
ijassa-821	249	9	restriction	restriction	NOUN
ijassa-821	249	10	on	on	ADP
ijassa-821	249	11	the	the	DET
ijassa-821	249	12	operating	operating	NOUN
ijassa-821	249	13	time	time	NOUN
ijassa-821	249	14	,	,	PUNCT
ijassa-821	249	15	the	the	DET
ijassa-821	249	16	procedure	procedure	NOUN
ijassa-821	249	17	for	for	ADP
ijassa-821	249	18	dynamically	dynamically	ADV
ijassa-821	249	19	adapting	adapt	VERB
ijassa-821	249	20	the	the	DET
ijassa-821	249	21	genetic	genetic	ADJ
ijassa-821	249	22	algorithm	algorithm	NOUN
ijassa-821	249	23	with	with	ADP
ijassa-821	249	24	the	the	DET
ijassa-821	249	25	greffenstett	greffenstett	NOUN
ijassa-821	249	26	’s	’s	PART
ijassa-821	249	27	crossover	crossover	NOUN
ijassa-821	249	28	leads	lead	VERB
ijassa-821	249	29	to	to	PART
ijassa-821	249	30	obtain	obtain	VERB
ijassa-821	249	31	shorter	short	ADJ
ijassa-821	249	32	routes	route	NOUN
ijassa-821	249	33	.	.	PUNCT
ijassa-821	250	1	it	it	PRON
ijassa-821	250	2	is	be	AUX
ijassa-821	250	3	worth	worth	ADJ
ijassa-821	250	4	noting	note	VERB
ijassa-821	250	5	that	that	SCONJ
ijassa-821	250	6	the	the	DET
ijassa-821	250	7	proposed	propose	VERB
ijassa-821	250	8	method	method	NOUN
ijassa-821	250	9	of	of	ADP
ijassa-821	250	10	dynamic	dynamic	ADJ
ijassa-821	250	11	adaptation	adaptation	NOUN
ijassa-821	250	12	can	can	AUX
ijassa-821	250	13	be	be	AUX
ijassa-821	250	14	applied	apply	VERB
ijassa-821	250	15	to	to	ADP
ijassa-821	250	16	other	other	ADJ
ijassa-821	250	17	heuristic	heuristic	ADJ
ijassa-821	250	18	algorithms	algorithm	NOUN
ijassa-821	250	19	for	for	ADP
ijassa-821	250	20	solving	solve	VERB
ijassa-821	250	21	the	the	DET
ijassa-821	250	22	tsp	tsp	NOUN
ijassa-821	250	23	problem	problem	NOUN
ijassa-821	250	24	.	.	PUNCT
ijassa-821	251	1	the	the	DET
ijassa-821	251	2	usage	usage	NOUN
ijassa-821	251	3	of	of	ADP
ijassa-821	251	4	the	the	DET
ijassa-821	251	5	this	this	DET
ijassa-821	251	6	method	method	NOUN
ijassa-821	251	7	to	to	PART
ijassa-821	251	8	solve	solve	VERB
ijassa-821	251	9	vehicle	vehicle	NOUN
ijassa-821	251	10	routing	routing	NOUN
ijassa-821	251	11	problems	problem	NOUN
ijassa-821	251	12	such	such	ADJ
ijassa-821	251	13	as	as	ADP
ijassa-821	251	14	tsptw	tsptw	PROPN
ijassa-821	251	15	,	,	PUNCT
ijassa-821	251	16	irp	irp	NOUN
ijassa-821	251	17	,	,	PUNCT
ijassa-821	251	18	mdvrp	mdvrp	PROPN
ijassa-821	251	19	,	,	PUNCT
ijassa-821	251	20	pdp	pdp	PROPN
ijassa-821	251	21	is	be	AUX
ijassa-821	251	22	possible	possible	ADJ
ijassa-821	251	23	if	if	SCONJ
ijassa-821	251	24	the	the	DET
ijassa-821	251	25	heuristic	heuristic	ADJ
ijassa-821	251	26	algorithm	algorithm	NOUN
ijassa-821	251	27	is	be	AUX
ijassa-821	251	28	able	able	ADJ
ijassa-821	251	29	to	to	PART
ijassa-821	251	30	solve	solve	VERB
ijassa-821	251	31	both	both	DET
ijassa-821	251	32	the	the	DET
ijassa-821	251	33	problem	problem	NOUN
ijassa-821	251	34	itself	itself	PRON
ijassa-821	251	35	and	and	CCONJ
ijassa-821	251	36	its	its	PRON
ijassa-821	251	37	subproblems	subproblem	NOUN
ijassa-821	252	1	[	[	X
ijassa-821	252	2	34	34	NUM
ijassa-821	252	3	,	,	PUNCT
ijassa-821	252	4	35	35	NUM
ijassa-821	252	5	]	]	PUNCT
ijassa-821	252	6	.	.	PUNCT
ijassa-821	253	1	references	reference	NOUN
ijassa-821	253	2	1	1	NUM
ijassa-821	253	3	.	.	PUNCT
ijassa-821	254	1	anbuudayasankar	anbuudayasankar	PROPN
ijassa-821	254	2	s.	s.	PROPN
ijassa-821	254	3	p.	p.	PROPN
ijassa-821	254	4	,	,	PUNCT
ijassa-821	254	5	ganesh	ganesh	PROPN
ijassa-821	254	6	k.	k.	PROPN
ijassa-821	254	7	,	,	PUNCT
ijassa-821	254	8	mohapatra	mohapatra	PROPN
ijassa-821	254	9	s.	s.	PROPN
ijassa-821	254	10	(	(	PUNCT
ijassa-821	254	11	2014	2014	NUM
ijassa-821	254	12	)	)	PUNCT
ijassa-821	254	13	.	.	PUNCT
ijassa-821	255	1	survey	survey	NOUN
ijassa-821	255	2	of	of	ADP
ijassa-821	255	3	methodologies	methodology	NOUN
ijassa-821	255	4	for	for	ADP
ijassa-821	255	5	tsp	tsp	NOUN
ijassa-821	255	6	and	and	CCONJ
ijassa-821	255	7	vrp	vrp	NOUN
ijassa-821	255	8	,	,	PUNCT
ijassa-821	255	9	models	model	NOUN
ijassa-821	255	10	for	for	ADP
ijassa-821	255	11	practical	practical	ADJ
ijassa-821	255	12	routing	routing	NOUN
ijassa-821	255	13	problems	problem	NOUN
ijassa-821	255	14	in	in	ADP
ijassa-821	255	15	logistics	logistic	NOUN
ijassa-821	255	16	,	,	PUNCT
ijassa-821	255	17	springer	springer	NOUN
ijassa-821	255	18	,	,	PUNCT
ijassa-821	255	19	11–42	11–42	NUM
ijassa-821	255	20	.	.	NOUN
ijassa-821	256	1	2	2	NUM
ijassa-821	256	2	.	.	X
ijassa-821	256	3	bellman	bellman	PROPN
ijassa-821	256	4	r.	r.	PROPN
ijassa-821	256	5	(	(	PUNCT
ijassa-821	256	6	1957	1957	NUM
ijassa-821	256	7	)	)	PUNCT
ijassa-821	256	8	.	.	PUNCT
ijassa-821	257	1	dynamic	dynamic	ADJ
ijassa-821	257	2	programming	programming	NOUN
ijassa-821	257	3	,	,	PUNCT
ijassa-821	257	4	princeton	princeton	PROPN
ijassa-821	257	5	:	:	PUNCT
ijassa-821	257	6	princeton	princeton	PROPN
ijassa-821	257	7	university	university	PROPN
ijassa-821	257	8	press	press	NOUN
ijassa-821	257	9	,	,	PUNCT
ijassa-821	257	10	1957	1957	NUM
ijassa-821	257	11	.	.	PUNCT
ijassa-821	257	12	–	–	PUNCT
ijassa-821	257	13	392	392	NUM
ijassa-821	257	14	p.	p.	NOUN
ijassa-821	257	15	3	3	NUM
ijassa-821	257	16	.	.	PUNCT
ijassa-821	258	1	bellman	bellman	PROPN
ijassa-821	258	2	r.	r.	PROPN
ijassa-821	258	3	(	(	PUNCT
ijassa-821	258	4	1962	1962	NUM
ijassa-821	258	5	)	)	PUNCT
ijassa-821	258	6	.	.	PUNCT
ijassa-821	259	1	dynamic	dynamic	ADJ
ijassa-821	259	2	programming	programming	NOUN
ijassa-821	259	3	treatment	treatment	NOUN
ijassa-821	259	4	of	of	ADP
ijassa-821	259	5	the	the	DET
ijassa-821	259	6	travelling	travel	VERB
ijassa-821	259	7	salesman	salesman	NOUN
ijassa-821	259	8	problem	problem	NOUN
ijassa-821	259	9	,	,	PUNCT
ijassa-821	259	10	journal	journal	NOUN
ijassa-821	259	11	of	of	ADP
ijassa-821	259	12	the	the	DET
ijassa-821	259	13	acm	acm	NOUN
ijassa-821	259	14	,	,	PUNCT
ijassa-821	259	15	9	9	NUM
ijassa-821	259	16	,	,	PUNCT
ijassa-821	259	17	61–63	61–63	NUM
ijassa-821	259	18	.	.	NOUN
ijassa-821	260	1	4	4	NUM
ijassa-821	260	2	.	.	X
ijassa-821	260	3	blum	blum	PROPN
ijassa-821	260	4	c.	c.	PROPN
ijassa-821	260	5	,	,	PUNCT
ijassa-821	260	6	roli	roli	PROPN
ijassa-821	260	7	a.	a.	NOUN
ijassa-821	260	8	(	(	PUNCT
ijassa-821	260	9	2003	2003	NUM
ijassa-821	260	10	)	)	PUNCT
ijassa-821	260	11	.	.	PUNCT
ijassa-821	261	1	metaheuristics	metaheuristic	NOUN
ijassa-821	261	2	in	in	ADP
ijassa-821	261	3	combinatorial	combinatorial	ADJ
ijassa-821	261	4	optimization	optimization	NOUN
ijassa-821	261	5	:	:	PUNCT
ijassa-821	261	6	overview	overview	NOUN
ijassa-821	261	7	and	and	CCONJ
ijassa-821	261	8	conceptual	conceptual	ADJ
ijassa-821	261	9	comparison	comparison	NOUN
ijassa-821	261	10	,	,	PUNCT
ijassa-821	261	11	acm	acm	NOUN
ijassa-821	261	12	comput	comput	NOUN
ijassa-821	261	13	.	.	PUNCT
ijassa-821	262	1	surv	surv	PROPN
ijassa-821	262	2	.	.	PUNCT
ijassa-821	262	3	,	,	PUNCT
ijassa-821	262	4	35(3	35(3	NUM
ijassa-821	262	5	)	)	PUNCT
ijassa-821	262	6	,	,	PUNCT
ijassa-821	262	7	268–308	268–308	NUM
ijassa-821	262	8	.	.	PUNCT
ijassa-821	263	1	5	5	NUM
ijassa-821	263	2	.	.	X
ijassa-821	263	3	borisovskiy	borisovskiy	PROPN
ijassa-821	263	4	p.a	p.a	PROPN
ijassa-821	263	5	.	.	PROPN
ijassa-821	263	6	,	,	PUNCT
ijassa-821	263	7	eremeev	eremeev	PROPN
ijassa-821	264	1	a.v	a.v	PROPN
ijassa-821	264	2	.	.	PROPN
ijassa-821	264	3	(	(	PUNCT
ijassa-821	264	4	2004	2004	NUM
ijassa-821	264	5	)	)	PUNCT
ijassa-821	264	6	.	.	PUNCT
ijassa-821	265	1	comparison	comparison	NOUN
ijassa-821	265	2	of	of	ADP
ijassa-821	265	3	some	some	DET
ijassa-821	265	4	evolutionary	evolutionary	ADJ
ijassa-821	265	5	algorithms	algorithm	NOUN
ijassa-821	265	6	,	,	PUNCT
ijassa-821	265	7	automation	automation	NOUN
ijassa-821	265	8	and	and	CCONJ
ijassa-821	265	9	remote	remote	ADJ
ijassa-821	265	10	control	control	NOUN
ijassa-821	265	11	,	,	PUNCT
ijassa-821	265	12	3	3	NUM
ijassa-821	265	13	,	,	PUNCT
ijassa-821	265	14	3–9	3–9	NUM
ijassa-821	265	15	,	,	PUNCT
ijassa-821	265	16	[	[	X
ijassa-821	265	17	in	in	ADP
ijassa-821	265	18	russian	russian	PROPN
ijassa-821	265	19	]	]	PUNCT
ijassa-821	265	20	.	.	PUNCT
ijassa-821	266	1	6	6	X
ijassa-821	266	2	.	.	X
ijassa-821	266	3	chiu	chiu	PROPN
ijassa-821	266	4	k.-m	k.-m	PROPN
ijassa-821	266	5	.	.	PROPN
ijassa-821	266	6	,	,	PUNCT
ijassa-821	266	7	liu	liu	PROPN
ijassa-821	266	8	j.-s	j.-s	PROPN
ijassa-821	266	9	.	.	PUNCT
ijassa-821	267	1	(	(	PUNCT
ijassa-821	267	2	2011	2011	NUM
ijassa-821	267	3	)	)	PUNCT
ijassa-821	267	4	.	.	PUNCT
ijassa-821	268	1	robot	robot	NOUN
ijassa-821	268	2	routing	routing	NOUN
ijassa-821	268	3	using	use	VERB
ijassa-821	268	4	clustering	clustering	NOUN
ijassa-821	268	5	-	-	PUNCT
ijassa-821	268	6	based	base	VERB
ijassa-821	268	7	parallel	parallel	ADJ
ijassa-821	268	8	genetic	genetic	ADJ
ijassa-821	268	9	algorithm	algorithm	NOUN
ijassa-821	268	10	with	with	ADP
ijassa-821	268	11	migration	migration	NOUN
ijassa-821	268	12	,	,	PUNCT
ijassa-821	268	13	proceedings	proceeding	NOUN
ijassa-821	268	14	of	of	ADP
ijassa-821	268	15	merging	merge	VERB
ijassa-821	268	16	fields	field	NOUN
ijassa-821	268	17	of	of	ADP
ijassa-821	268	18	computational	computational	ADJ
ijassa-821	268	19	intelligence	intelligence	NOUN
ijassa-821	268	20	and	and	CCONJ
ijassa-821	268	21	sensor	sensor	NOUN
ijassa-821	268	22	technology	technology	NOUN
ijassa-821	268	23	,	,	PUNCT
ijassa-821	268	24	9	9	NUM
ijassa-821	268	25	,	,	PUNCT
ijassa-821	268	26	42–49	42–49	NUM
ijassa-821	268	27	.	.	PUNCT
ijassa-821	269	1	7	7	X
ijassa-821	269	2	.	.	X
ijassa-821	269	3	christofides	christofides	PROPN
ijassa-821	269	4	n.	n.	PROPN
ijassa-821	269	5	(	(	PUNCT
ijassa-821	269	6	1976	1976	NUM
ijassa-821	269	7	)	)	PUNCT
ijassa-821	269	8	.	.	PUNCT
ijassa-821	270	1	worst	bad	ADJ
ijassa-821	270	2	-	-	PUNCT
ijassa-821	270	3	case	case	NOUN
ijassa-821	270	4	analysis	analysis	NOUN
ijassa-821	270	5	of	of	ADP
ijassa-821	270	6	a	a	DET
ijassa-821	270	7	new	new	ADJ
ijassa-821	270	8	heuristic	heuristic	NOUN
ijassa-821	270	9	for	for	ADP
ijassa-821	270	10	the	the	DET
ijassa-821	270	11	travelling	travel	VERB
ijassa-821	270	12	salesman	salesman	NOUN
ijassa-821	270	13	problem	problem	NOUN
ijassa-821	270	14	,	,	PUNCT
ijassa-821	270	15	technical	technical	ADJ
ijassa-821	270	16	report	report	NOUN
ijassa-821	270	17	388	388	NUM
ijassa-821	270	18	,	,	PUNCT
ijassa-821	270	19	graduate	graduate	NOUN
ijassa-821	270	20	school	school	NOUN
ijassa-821	270	21	of	of	ADP
ijassa-821	270	22	industrial	industrial	ADJ
ijassa-821	270	23	administration	administration	NOUN
ijassa-821	270	24	,	,	PUNCT
ijassa-821	270	25	carnegie	carnegie	NOUN
ijassa-821	270	26	copyright	copyright	NOUN
ijassa-821	270	27	©	©	PROPN
ijassa-821	270	28	2020	2020	NUM
ijassa-821	270	29	assa	assa	NOUN
ijassa-821	270	30	.	.	PUNCT
ijassa-821	271	1	adv	adv	PROPN
ijassa-821	271	2	syst	syst	PROPN
ijassa-821	271	3	sci	sci	PROPN
ijassa-821	271	4	appl	appl	PROPN
ijassa-821	271	5	(	(	PUNCT
ijassa-821	271	6	2020	2020	NUM
ijassa-821	271	7	)	)	PUNCT
ijassa-821	271	8	42	42	NUM
ijassa-821	271	9	v.	v.	ADP
ijassa-821	271	10	v.	v.	ADP
ijassa-821	271	11	zakharov	zakharov	PROPN
ijassa-821	271	12	,	,	PUNCT
ijassa-821	271	13	a.	a.	NOUN
ijassa-821	271	14	v.	v.	ADP
ijassa-821	271	15	mugayskikh	mugayskikh	PROPN
ijassa-821	271	16	mellon	mellon	PROPN
ijassa-821	271	17	university	university	PROPN
ijassa-821	271	18	,	,	PUNCT
ijassa-821	271	19	11	11	NUM
ijassa-821	271	20	p.	p.	NOUN
ijassa-821	271	21	8	8	NUM
ijassa-821	271	22	.	.	PUNCT
ijassa-821	272	1	comarela	comarela	PROPN
ijassa-821	272	2	,	,	PUNCT
ijassa-821	272	3	g.	g.	PROPN
ijassa-821	272	4	,	,	PUNCT
ijassa-821	272	5	goncalves	goncalve	NOUN
ijassa-821	272	6	,	,	PUNCT
ijassa-821	272	7	k.	k.	PROPN
ijassa-821	272	8	,	,	PUNCT
ijassa-821	272	9	pappa	pappa	PROPN
ijassa-821	272	10	,	,	PUNCT
ijassa-821	272	11	g.l	g.l	PROPN
ijassa-821	272	12	.	.	PROPN
ijassa-821	272	13	,	,	PUNCT
ijassa-821	272	14	almeida	almeida	PROPN
ijassa-821	272	15	,	,	PUNCT
ijassa-821	272	16	j.	j.	PROPN
ijassa-821	272	17	,	,	PUNCT
ijassa-821	272	18	almeida	almeida	PROPN
ijassa-821	272	19	,	,	PUNCT
ijassa-821	272	20	v.	v.	PROPN
ijassa-821	272	21	(	(	PUNCT
ijassa-821	272	22	2011	2011	NUM
ijassa-821	272	23	)	)	PUNCT
ijassa-821	272	24	.	.	PUNCT
ijassa-821	273	1	robot	robot	NOUN
ijassa-821	273	2	routing	routing	NOUN
ijassa-821	273	3	in	in	ADP
ijassa-821	273	4	sparse	sparse	ADJ
ijassa-821	273	5	wireless	wireless	ADJ
ijassa-821	273	6	sensor	sensor	NOUN
ijassa-821	273	7	networks	network	NOUN
ijassa-821	273	8	with	with	ADP
ijassa-821	273	9	continuous	continuous	ADJ
ijassa-821	273	10	ant	ant	ADJ
ijassa-821	273	11	colony	colony	NOUN
ijassa-821	273	12	optimization	optimization	NOUN
ijassa-821	273	13	,	,	PUNCT
ijassa-821	273	14	proceedings	proceeding	NOUN
ijassa-821	273	15	of	of	ADP
ijassa-821	273	16	the	the	DET
ijassa-821	273	17	13th	13th	ADJ
ijassa-821	273	18	annual	annual	ADJ
ijassa-821	273	19	conference	conference	NOUN
ijassa-821	273	20	companion	companion	NOUN
ijassa-821	273	21	on	on	ADP
ijassa-821	273	22	genetic	genetic	ADJ
ijassa-821	273	23	and	and	CCONJ
ijassa-821	273	24	evolutionary	evolutionary	ADJ
ijassa-821	273	25	computation	computation	NOUN
ijassa-821	273	26	gecco’11	gecco’11	PROPN
ijassa-821	273	27	,	,	PUNCT
ijassa-821	273	28	new	new	PROPN
ijassa-821	273	29	york	york	PROPN
ijassa-821	273	30	,	,	PUNCT
ijassa-821	273	31	ny	ny	PROPN
ijassa-821	273	32	,	,	PUNCT
ijassa-821	273	33	usa	usa	PROPN
ijassa-821	273	34	,	,	PUNCT
ijassa-821	273	35	acm	acm	PROPN
ijassa-821	273	36	,	,	PUNCT
ijassa-821	273	37	599–606	599–606	NUM
ijassa-821	273	38	.	.	PUNCT
ijassa-821	274	1	9	9	X
ijassa-821	274	2	.	.	X
ijassa-821	274	3	dantzig	dantzig	PROPN
ijassa-821	274	4	g.b	g.b	PROPN
ijassa-821	274	5	.	.	PUNCT
ijassa-821	274	6	(	(	PUNCT
ijassa-821	274	7	1963	1963	NUM
ijassa-821	274	8	)	)	PUNCT
ijassa-821	274	9	.	.	PUNCT
ijassa-821	275	1	linear	linear	ADJ
ijassa-821	275	2	programming	programming	NOUN
ijassa-821	275	3	and	and	CCONJ
ijassa-821	275	4	extensions	extension	NOUN
ijassa-821	275	5	,	,	PUNCT
ijassa-821	275	6	princeton	princeton	PROPN
ijassa-821	275	7	:	:	PUNCT
ijassa-821	275	8	princeton	princeton	PROPN
ijassa-821	275	9	univ	univ	PROPN
ijassa-821	275	10	.	.	PUNCT
ijassa-821	276	1	press	press	NOUN
ijassa-821	276	2	,	,	PUNCT
ijassa-821	276	3	219	219	NUM
ijassa-821	276	4	p.	p.	NOUN
ijassa-821	276	5	10	10	NUM
ijassa-821	276	6	.	.	PUNCT
ijassa-821	277	1	dorigo	dorigo	PROPN
ijassa-821	277	2	m.	m.	PROPN
ijassa-821	277	3	,	,	PUNCT
ijassa-821	277	4	gambardella	gambardella	PROPN
ijassa-821	277	5	l.m	l.m	PROPN
ijassa-821	277	6	.	.	PROPN
ijassa-821	277	7	(	(	PUNCT
ijassa-821	277	8	1997	1997	NUM
ijassa-821	277	9	)	)	PUNCT
ijassa-821	277	10	.	.	PUNCT
ijassa-821	278	1	ant	ant	ADJ
ijassa-821	278	2	colonies	colony	NOUN
ijassa-821	278	3	for	for	ADP
ijassa-821	278	4	the	the	DET
ijassa-821	278	5	travelling	travel	VERB
ijassa-821	278	6	salesman	salesman	NOUN
ijassa-821	278	7	problem	problem	NOUN
ijassa-821	278	8	,	,	PUNCT
ijassa-821	278	9	biosystems	biosystem	NOUN
ijassa-821	278	10	,	,	PUNCT
ijassa-821	278	11	43(2	43(2	NUM
ijassa-821	278	12	)	)	PUNCT
ijassa-821	278	13	,	,	PUNCT
ijassa-821	278	14	73–81	73–81	NUM
ijassa-821	278	15	.	.	NOUN
ijassa-821	278	16	11	11	NUM
ijassa-821	278	17	.	.	PUNCT
ijassa-821	279	1	dorronsoro	dorronsoro	PROPN
ijassa-821	279	2	b.	b.	PROPN
ijassa-821	280	1	the	the	DET
ijassa-821	280	2	vrp	vrp	PROPN
ijassa-821	280	3	web	web	PROPN
ijassa-821	280	4	.	.	PROPN
ijassa-821	280	5	languages	language	NOUN
ijassa-821	280	6	and	and	CCONJ
ijassa-821	280	7	computation	computation	NOUN
ijassa-821	280	8	sciences	sciences	PROPN
ijassa-821	280	9	department	department	PROPN
ijassa-821	280	10	,	,	PUNCT
ijassa-821	280	11	university	university	NOUN
ijassa-821	280	12	of	of	ADP
ijassa-821	280	13	malaga	malaga	NOUN
ijassa-821	280	14	,	,	PUNCT
ijassa-821	280	15	http://www.bernabe.dorronsoro.es/vrp/	http://www.bernabe.dorronsoro.es/vrp/	NOUN
ijassa-821	280	16	12	12	NUM
ijassa-821	280	17	.	.	PUNCT
ijassa-821	281	1	furini	furini	PROPN
ijassa-821	281	2	f.	f.	PROPN
ijassa-821	281	3	,	,	PUNCT
ijassa-821	281	4	persiani	persiani	PROPN
ijassa-821	281	5	c.a	c.a	PROPN
ijassa-821	281	6	.	.	PROPN
ijassa-821	281	7	,	,	PUNCT
ijassa-821	281	8	toth	toth	PROPN
ijassa-821	281	9	p.	p.	PROPN
ijassa-821	281	10	(	(	PUNCT
ijassa-821	281	11	2016	2016	NUM
ijassa-821	281	12	)	)	PUNCT
ijassa-821	281	13	.	.	PUNCT
ijassa-821	282	1	the	the	DET
ijassa-821	282	2	time	time	NOUN
ijassa-821	282	3	dependent	dependent	ADJ
ijassa-821	282	4	travelling	travel	VERB
ijassa-821	282	5	salesman	salesman	NOUN
ijassa-821	282	6	planning	planning	NOUN
ijassa-821	282	7	problem	problem	NOUN
ijassa-821	282	8	in	in	ADP
ijassa-821	282	9	controlled	control	VERB
ijassa-821	282	10	airspace	airspace	NOUN
ijassa-821	282	11	,	,	PUNCT
ijassa-821	282	12	transportation	transportation	NOUN
ijassa-821	282	13	research	research	NOUN
ijassa-821	282	14	part	part	NOUN
ijassa-821	282	15	b	b	NOUN
ijassa-821	282	16	:	:	PUNCT
ijassa-821	282	17	methodological	methodological	ADJ
ijassa-821	282	18	,	,	PUNCT
ijassa-821	282	19	90	90	NUM
ijassa-821	282	20	,	,	PUNCT
ijassa-821	282	21	38–55	38–55	NUM
ijassa-821	282	22	.	.	NOUN
ijassa-821	282	23	13	13	NUM
ijassa-821	282	24	.	.	PUNCT
ijassa-821	283	1	gendreau	gendreau	PROPN
ijassa-821	283	2	m.	m.	NOUN
ijassa-821	283	3	,	,	PUNCT
ijassa-821	283	4	potvin	potvin	PROPN
ijassa-821	283	5	j.-y	j.-y	PROPN
ijassa-821	283	6	.	.	PUNCT
ijassa-821	284	1	(	(	PUNCT
ijassa-821	284	2	2010	2010	NUM
ijassa-821	284	3	)	)	PUNCT
ijassa-821	284	4	.	.	PUNCT
ijassa-821	285	1	handbook	handbook	NOUN
ijassa-821	285	2	of	of	ADP
ijassa-821	285	3	metaheuristics	metaheuristic	NOUN
ijassa-821	285	4	,	,	PUNCT
ijassa-821	285	5	springer	springer	NOUN
ijassa-821	285	6	publishing	publishing	NOUN
ijassa-821	285	7	company	company	NOUN
ijassa-821	285	8	,	,	PUNCT
ijassa-821	285	9	649	649	NUM
ijassa-821	285	10	p.	p.	NOUN
ijassa-821	285	11	14	14	NUM
ijassa-821	285	12	.	.	PUNCT
ijassa-821	286	1	gendreau	gendreau	PROPN
ijassa-821	286	2	m.	m.	NOUN
ijassa-821	286	3	,	,	PUNCT
ijassa-821	286	4	yehertzo	yehertzo	PROPN
ijassa-821	286	5	a.	a.	PROPN
ijassa-821	286	6	,	,	PUNCT
ijassa-821	286	7	laporte	laporte	NOUN
ijassa-821	286	8	g.	g.	PROPN
ijassa-821	286	9	,	,	PUNCT
ijassa-821	286	10	stan	stan	PROPN
ijassa-821	286	11	m.	m.	PROPN
ijassa-821	286	12	(	(	PUNCT
ijassa-821	286	13	1998	1998	NUM
ijassa-821	286	14	)	)	PUNCT
ijassa-821	286	15	.	.	PUNCT
ijassa-821	287	1	a	a	DET
ijassa-821	287	2	generalized	generalize	VERB
ijassa-821	287	3	insertion	insertion	NOUN
ijassa-821	287	4	heuristic	heuristic	NOUN
ijassa-821	287	5	for	for	ADP
ijassa-821	287	6	the	the	DET
ijassa-821	287	7	travelling	travel	VERB
ijassa-821	287	8	salesman	salesman	ADJ
ijassa-821	287	9	problem	problem	NOUN
ijassa-821	287	10	with	with	ADP
ijassa-821	287	11	time	time	NOUN
ijassa-821	287	12	windows	window	NOUN
ijassa-821	287	13	,	,	PUNCT
ijassa-821	287	14	oper	oper	PROPN
ijassa-821	288	1	.	.	PUNCT
ijassa-821	288	2	res	res	PROPN
ijassa-821	288	3	.	.	PROPN
ijassa-821	288	4	,	,	PUNCT
ijassa-821	288	5	46(3	46(3	NOUN
ijassa-821	288	6	)	)	PUNCT
ijassa-821	288	7	,	,	PUNCT
ijassa-821	288	8	330–335	330–335	NUM
ijassa-821	288	9	.	.	PUNCT
ijassa-821	289	1	15	15	NUM
ijassa-821	289	2	.	.	PUNCT
ijassa-821	290	1	granville	granville	PROPN
ijassa-821	290	2	v.	v.	PROPN
ijassa-821	290	3	,	,	PUNCT
ijassa-821	290	4	krivanek	krivanek	PROPN
ijassa-821	290	5	m.	m.	PROPN
ijassa-821	290	6	,	,	PUNCT
ijassa-821	290	7	rasson	rasson	PROPN
ijassa-821	290	8	j.-p	j.-p	PROPN
ijassa-821	290	9	.	.	PUNCT
ijassa-821	291	1	(	(	PUNCT
ijassa-821	291	2	1994	1994	NUM
ijassa-821	291	3	)	)	PUNCT
ijassa-821	291	4	.	.	PUNCT
ijassa-821	292	1	simulated	simulate	VERB
ijassa-821	292	2	annealing	annealing	NOUN
ijassa-821	292	3	:	:	PUNCT
ijassa-821	292	4	a	a	DET
ijassa-821	292	5	proof	proof	NOUN
ijassa-821	292	6	of	of	ADP
ijassa-821	292	7	convergence	convergence	NOUN
ijassa-821	292	8	,	,	PUNCT
ijassa-821	292	9	ieee	ieee	NOUN
ijassa-821	292	10	trans	tran	NOUN
ijassa-821	292	11	.	.	PUNCT
ijassa-821	293	1	pattern	pattern	PROPN
ijassa-821	293	2	anal	anal	PROPN
ijassa-821	293	3	.	.	PUNCT
ijassa-821	294	1	mach	mach	PROPN
ijassa-821	294	2	.	.	PUNCT
ijassa-821	295	1	intell	intell	PROPN
ijassa-821	295	2	.	.	PUNCT
ijassa-821	296	1	,	,	PUNCT
ijassa-821	296	2	16(6	16(6	NUM
ijassa-821	296	3	)	)	PUNCT
ijassa-821	296	4	,	,	PUNCT
ijassa-821	297	1	652–656	652–656	NUM
ijassa-821	297	2	.	.	PUNCT
ijassa-821	298	1	16	16	NUM
ijassa-821	298	2	.	.	PUNCT
ijassa-821	299	1	grefenstette	grefenstette	PROPN
ijassa-821	299	2	j.	j.	PROPN
ijassa-821	299	3	j.	j.	PROPN
ijassa-821	299	4	,	,	PUNCT
ijassa-821	299	5	gopal	gopal	PROPN
ijassa-821	299	6	r.	r.	PROPN
ijassa-821	299	7	,	,	PUNCT
ijassa-821	299	8	rosmaita	rosmaita	PROPN
ijassa-821	299	9	b.	b.	PROPN
ijassa-821	299	10	j.	j.	PROPN
ijassa-821	299	11	,	,	PUNCT
ijassa-821	299	12	van	van	PROPN
ijassa-821	299	13	gucht	gucht	PROPN
ijassa-821	299	14	d.	d.	PROPN
ijassa-821	299	15	(	(	PUNCT
ijassa-821	299	16	1985	1985	NUM
ijassa-821	299	17	)	)	PUNCT
ijassa-821	299	18	.	.	PUNCT
ijassa-821	300	1	genetic	genetic	ADJ
ijassa-821	300	2	algorithms	algorithm	NOUN
ijassa-821	300	3	for	for	ADP
ijassa-821	300	4	the	the	DET
ijassa-821	300	5	traveling	travel	VERB
ijassa-821	300	6	salesman	salesman	NOUN
ijassa-821	300	7	problem	problem	NOUN
ijassa-821	300	8	,	,	PUNCT
ijassa-821	300	9	proceedings	proceeding	NOUN
ijassa-821	300	10	of	of	ADP
ijassa-821	300	11	the	the	DET
ijassa-821	300	12	1st	1st	ADJ
ijassa-821	300	13	international	international	ADJ
ijassa-821	300	14	conference	conference	NOUN
ijassa-821	300	15	on	on	ADP
ijassa-821	300	16	genetic	genetic	ADJ
ijassa-821	300	17	algorithms	algorithm	NOUN
ijassa-821	300	18	,	,	PUNCT
ijassa-821	300	19	hillsdale	hillsdale	PROPN
ijassa-821	300	20	:	:	PUNCT
ijassa-821	300	21	lawrence	lawrence	PROPN
ijassa-821	300	22	erlbaum	erlbaum	PROPN
ijassa-821	300	23	associates	associates	PROPN
ijassa-821	300	24	,	,	PUNCT
ijassa-821	300	25	160–168	160–168	NUM
ijassa-821	300	26	.	.	PUNCT
ijassa-821	301	1	17	17	NUM
ijassa-821	301	2	.	.	PUNCT
ijassa-821	301	3	gutin	gutin	PROPN
ijassa-821	301	4	g.	g.	PROPN
ijassa-821	301	5	,	,	PUNCT
ijassa-821	301	6	punnen	punnen	PROPN
ijassa-821	301	7	a.p	a.p	PROPN
ijassa-821	301	8	.	.	PROPN
ijassa-821	301	9	(	(	PUNCT
ijassa-821	301	10	2002	2002	NUM
ijassa-821	301	11	)	)	PUNCT
ijassa-821	301	12	.	.	PUNCT
ijassa-821	302	1	the	the	DET
ijassa-821	302	2	traveling	travel	VERB
ijassa-821	302	3	salesman	salesman	NOUN
ijassa-821	302	4	problem	problem	NOUN
ijassa-821	302	5	and	and	CCONJ
ijassa-821	302	6	its	its	PRON
ijassa-821	302	7	variations	variation	NOUN
ijassa-821	302	8	,	,	PUNCT
ijassa-821	302	9	kluwer	kluwer	NOUN
ijassa-821	302	10	academi	academi	PROPN
ijassa-821	302	11	,	,	PUNCT
ijassa-821	302	12	837	837	NUM
ijassa-821	302	13	p.	p.	NOUN
ijassa-821	302	14	18	18	NUM
ijassa-821	302	15	.	.	PUNCT
ijassa-821	303	1	gutin	gutin	PROPN
ijassa-821	303	2	g.	g.	PROPN
ijassa-821	303	3	,	,	PUNCT
ijassa-821	303	4	yeo	yeo	PROPN
ijassa-821	303	5	a.	a.	PROPN
ijassa-821	303	6	,	,	PUNCT
ijassa-821	303	7	zverovich	zverovich	PROPN
ijassa-821	303	8	a.	a.	NOUN
ijassa-821	303	9	(	(	PUNCT
ijassa-821	303	10	2002	2002	NUM
ijassa-821	303	11	)	)	PUNCT
ijassa-821	303	12	.	.	PUNCT
ijassa-821	304	1	traveling	travel	VERB
ijassa-821	304	2	salesman	salesman	NOUN
ijassa-821	304	3	should	should	AUX
ijassa-821	304	4	not	not	PART
ijassa-821	304	5	be	be	AUX
ijassa-821	304	6	greedy	greedy	ADJ
ijassa-821	304	7	:	:	PUNCT
ijassa-821	304	8	domination	domination	NOUN
ijassa-821	304	9	analysis	analysis	NOUN
ijassa-821	304	10	of	of	ADP
ijassa-821	304	11	greedy	greedy	ADJ
ijassa-821	304	12	-	-	PUNCT
ijassa-821	304	13	type	type	NOUN
ijassa-821	304	14	heuristics	heuristic	NOUN
ijassa-821	304	15	for	for	ADP
ijassa-821	304	16	the	the	DET
ijassa-821	304	17	tsp	tsp	NOUN
ijassa-821	304	18	,	,	PUNCT
ijassa-821	304	19	discrete	discrete	ADJ
ijassa-821	304	20	applied	apply	VERB
ijassa-821	304	21	mathematics	mathematic	NOUN
ijassa-821	304	22	,	,	PUNCT
ijassa-821	304	23	117(1–3	117(1–3	NUM
ijassa-821	304	24	)	)	PUNCT
ijassa-821	304	25	,	,	PUNCT
ijassa-821	304	26	81–86	81–86	NUM
ijassa-821	304	27	.	.	PROPN
ijassa-821	304	28	19	19	NUM
ijassa-821	304	29	.	.	PUNCT
ijassa-821	304	30	held	hold	VERB
ijassa-821	304	31	m.	m.	NOUN
ijassa-821	304	32	,	,	PUNCT
ijassa-821	304	33	karp	karp	PROPN
ijassa-821	304	34	r.m	r.m	PROPN
ijassa-821	304	35	.	.	PROPN
ijassa-821	305	1	(	(	PUNCT
ijassa-821	305	2	1961	1961	NUM
ijassa-821	305	3	)	)	PUNCT
ijassa-821	305	4	.	.	PUNCT
ijassa-821	306	1	a	a	DET
ijassa-821	306	2	dynamic	dynamic	ADJ
ijassa-821	306	3	programming	programming	NOUN
ijassa-821	306	4	approach	approach	NOUN
ijassa-821	306	5	to	to	ADP
ijassa-821	306	6	sequencing	sequence	VERB
ijassa-821	306	7	problems	problem	NOUN
ijassa-821	306	8	,	,	PUNCT
ijassa-821	306	9	proceedings	proceeding	NOUN
ijassa-821	306	10	of	of	ADP
ijassa-821	306	11	the	the	DET
ijassa-821	306	12	1961	1961	NUM
ijassa-821	306	13	16th	16th	NOUN
ijassa-821	306	14	acm	acm	PROPN
ijassa-821	306	15	national	national	ADJ
ijassa-821	306	16	meeting	meeting	NOUN
ijassa-821	306	17	,	,	PUNCT
ijassa-821	306	18	acm	acm	PROPN
ijassa-821	306	19	,	,	PUNCT
ijassa-821	306	20	201–204	201–204	NUM
ijassa-821	306	21	.	.	PROPN
ijassa-821	307	1	20	20	NUM
ijassa-821	307	2	.	.	PUNCT
ijassa-821	308	1	helsgaun	helsgaun	PROPN
ijassa-821	308	2	k.	k.	PROPN
ijassa-821	308	3	(	(	PUNCT
ijassa-821	308	4	2000	2000	NUM
ijassa-821	308	5	)	)	PUNCT
ijassa-821	308	6	.	.	PUNCT
ijassa-821	309	1	an	an	DET
ijassa-821	309	2	effective	effective	ADJ
ijassa-821	309	3	implementation	implementation	NOUN
ijassa-821	309	4	of	of	ADP
ijassa-821	309	5	the	the	DET
ijassa-821	309	6	lin	lin	PROPN
ijassa-821	309	7	-	-	PUNCT
ijassa-821	309	8	kernighan	kernighan	PROPN
ijassa-821	309	9	traveling	travel	VERB
ijassa-821	309	10	salesman	salesman	NOUN
ijassa-821	309	11	heuristic	heuristic	ADJ
ijassa-821	309	12	,	,	PUNCT
ijassa-821	309	13	european	european	ADJ
ijassa-821	309	14	journal	journal	PROPN
ijassa-821	309	15	of	of	ADP
ijassa-821	309	16	operational	operational	ADJ
ijassa-821	309	17	research	research	NOUN
ijassa-821	309	18	,	,	PUNCT
ijassa-821	309	19	126	126	NUM
ijassa-821	309	20	,	,	PUNCT
ijassa-821	309	21	106–130	106–130	NUM
ijassa-821	309	22	.	.	PUNCT
ijassa-821	310	1	21	21	NUM
ijassa-821	310	2	.	.	PUNCT
ijassa-821	311	1	helsgaun	helsgaun	PROPN
ijassa-821	311	2	k.	k.	PROPN
ijassa-821	311	3	(	(	PUNCT
ijassa-821	311	4	2009	2009	NUM
ijassa-821	311	5	)	)	PUNCT
ijassa-821	311	6	.	.	PUNCT
ijassa-821	312	1	general	general	ADJ
ijassa-821	312	2	k	k	ADJ
ijassa-821	312	3	-	-	PUNCT
ijassa-821	312	4	opt	opt	ADJ
ijassa-821	312	5	submoves	submove	NOUN
ijassa-821	312	6	for	for	ADP
ijassa-821	312	7	the	the	DET
ijassa-821	312	8	lin	lin	PROPN
ijassa-821	312	9	-	-	PUNCT
ijassa-821	312	10	kernighan	kernighan	PROPN
ijassa-821	312	11	tsp	tsp	NOUN
ijassa-821	312	12	heuristic	heuristic	NOUN
ijassa-821	312	13	,	,	PUNCT
ijassa-821	312	14	math	math	NOUN
ijassa-821	312	15	.	.	PUNCT
ijassa-821	313	1	program	program	NOUN
ijassa-821	313	2	.	.	PUNCT
ijassa-821	314	1	comput	comput	NOUN
ijassa-821	314	2	.	.	PUNCT
ijassa-821	314	3	,	,	PUNCT
ijassa-821	314	4	1(2–3	1(2–3	NUM
ijassa-821	314	5	)	)	PUNCT
ijassa-821	314	6	,	,	PUNCT
ijassa-821	314	7	119–163	119–163	NUM
ijassa-821	314	8	.	.	PUNCT
ijassa-821	315	1	22	22	NUM
ijassa-821	315	2	.	.	PUNCT
ijassa-821	316	1	holland	holland	PROPN
ijassa-821	316	2	j.	j.	PROPN
ijassa-821	316	3	h.	h.	PROPN
ijassa-821	316	4	(	(	PUNCT
ijassa-821	316	5	1975	1975	NUM
ijassa-821	316	6	)	)	PUNCT
ijassa-821	316	7	.	.	PUNCT
ijassa-821	317	1	adaptation	adaptation	NOUN
ijassa-821	317	2	in	in	ADP
ijassa-821	317	3	natural	natural	ADJ
ijassa-821	317	4	and	and	CCONJ
ijassa-821	317	5	artificial	artificial	ADJ
ijassa-821	317	6	systems	system	NOUN
ijassa-821	317	7	,	,	PUNCT
ijassa-821	317	8	ann	ann	PROPN
ijassa-821	317	9	arbor	arbor	PROPN
ijassa-821	317	10	:	:	PUNCT
ijassa-821	317	11	the	the	DET
ijassa-821	317	12	university	university	PROPN
ijassa-821	317	13	of	of	ADP
ijassa-821	317	14	michigan	michigan	PROPN
ijassa-821	317	15	press	press	PROPN
ijassa-821	317	16	,	,	PUNCT
ijassa-821	317	17	183	183	NUM
ijassa-821	317	18	p.	p.	NOUN
ijassa-821	317	19	23	23	NUM
ijassa-821	317	20	.	.	PUNCT
ijassa-821	318	1	hurkens	hurkens	PROPN
ijassa-821	318	2	cor	cor	PROPN
ijassa-821	318	3	a.	a.	PROPN
ijassa-821	318	4	j.	j.	PROPN
ijassa-821	318	5	,	,	PUNCT
ijassa-821	318	6	woeginger	woeginger	PROPN
ijassa-821	318	7	g.j	g.j	PROPN
ijassa-821	318	8	.	.	PROPN
ijassa-821	318	9	(	(	PUNCT
ijassa-821	318	10	2004	2004	NUM
ijassa-821	318	11	)	)	PUNCT
ijassa-821	318	12	.	.	PUNCT
ijassa-821	319	1	on	on	ADP
ijassa-821	319	2	the	the	DET
ijassa-821	319	3	nearest	near	ADJ
ijassa-821	319	4	neighbor	neighbor	NOUN
ijassa-821	319	5	rule	rule	NOUN
ijassa-821	319	6	for	for	ADP
ijassa-821	319	7	the	the	DET
ijassa-821	319	8	traveling	travel	VERB
ijassa-821	319	9	salesman	salesman	NOUN
ijassa-821	319	10	problem	problem	NOUN
ijassa-821	319	11	oper	oper	PROPN
ijassa-821	319	12	.	.	PUNCT
ijassa-821	319	13	res	res	PROPN
ijassa-821	319	14	.	.	PUNCT
ijassa-821	320	1	lett	lett	PROPN
ijassa-821	320	2	.	.	PROPN
ijassa-821	320	3	,	,	PUNCT
ijassa-821	320	4	32(1	32(1	NUM
ijassa-821	320	5	)	)	PUNCT
ijassa-821	320	6	,	,	PUNCT
ijassa-821	320	7	1–4	1–4	PROPN
ijassa-821	320	8	.	.	PROPN
ijassa-821	320	9	24	24	NUM
ijassa-821	320	10	.	.	PUNCT
ijassa-821	321	1	johnson	johnson	PROPN
ijassa-821	321	2	d.s	d.s	PROPN
ijassa-821	321	3	.	.	PROPN
ijassa-821	321	4	,	,	PUNCT
ijassa-821	321	5	mcgeoch	mcgeoch	PROPN
ijassa-821	321	6	l.a	l.a	PROPN
ijassa-821	321	7	.	.	PROPN
ijassa-821	321	8	(	(	PUNCT
ijassa-821	321	9	2001	2001	NUM
ijassa-821	321	10	)	)	PUNCT
ijassa-821	321	11	.	.	PUNCT
ijassa-821	322	1	experimental	experimental	ADJ
ijassa-821	322	2	analysis	analysis	NOUN
ijassa-821	322	3	of	of	ADP
ijassa-821	322	4	heuristics	heuristic	NOUN
ijassa-821	322	5	for	for	ADP
ijassa-821	322	6	the	the	DET
ijassa-821	322	7	stsp	stsp	NOUN
ijassa-821	322	8	.	.	PUNCT
ijassa-821	323	1	in	in	ADP
ijassa-821	323	2	local	local	ADJ
ijassa-821	323	3	search	search	NOUN
ijassa-821	323	4	in	in	ADP
ijassa-821	323	5	combinatorial	combinatorial	ADJ
ijassa-821	323	6	optimization	optimization	NOUN
ijassa-821	323	7	,	,	PUNCT
ijassa-821	323	8	wiley	wiley	NOUN
ijassa-821	323	9	and	and	CCONJ
ijassa-821	323	10	sons	son	NOUN
ijassa-821	323	11	,	,	PUNCT
ijassa-821	323	12	80	80	NUM
ijassa-821	323	13	p.	p.	NOUN
ijassa-821	323	14	25	25	NUM
ijassa-821	323	15	.	.	PUNCT
ijassa-821	324	1	khan	khan	PROPN
ijassa-821	324	2	i.h	i.h	PROPN
ijassa-821	324	3	.	.	PUNCT
ijassa-821	324	4	(	(	PUNCT
ijassa-821	324	5	2015	2015	NUM
ijassa-821	324	6	)	)	PUNCT
ijassa-821	324	7	.	.	PUNCT
ijassa-821	325	1	assessing	assess	VERB
ijassa-821	325	2	different	different	ADJ
ijassa-821	325	3	crossover	crossover	NOUN
ijassa-821	325	4	operators	operator	NOUN
ijassa-821	325	5	for	for	ADP
ijassa-821	325	6	travelling	travel	VERB
ijassa-821	325	7	salesman	salesman	ADJ
ijassa-821	325	8	problem	problem	NOUN
ijassa-821	325	9	,	,	PUNCT
ijassa-821	325	10	i.j	i.j	PROPN
ijassa-821	325	11	.	.	NOUN
ijassa-821	325	12	intelligent	intelligent	ADJ
ijassa-821	325	13	systems	system	NOUN
ijassa-821	325	14	and	and	CCONJ
ijassa-821	325	15	applications	application	NOUN
ijassa-821	325	16	,	,	PUNCT
ijassa-821	325	17	1	1	NUM
ijassa-821	325	18	,	,	PUNCT
ijassa-821	325	19	19–25	19–25	NUM
ijassa-821	325	20	.	.	PUNCT
ijassa-821	326	1	26	26	NUM
ijassa-821	326	2	.	.	X
ijassa-821	326	3	knepper	knepper	PROPN
ijassa-821	326	4	,	,	PUNCT
ijassa-821	326	5	r.a	r.a	PROPN
ijassa-821	326	6	.	.	PROPN
ijassa-821	326	7	,	,	PUNCT
ijassa-821	326	8	layton	layton	PROPN
ijassa-821	326	9	,	,	PUNCT
ijassa-821	326	10	t.	t.	PROPN
ijassa-821	326	11	,	,	PUNCT
ijassa-821	326	12	romanishin	romanishin	PROPN
ijassa-821	326	13	,	,	PUNCT
ijassa-821	326	14	j.	j.	PROPN
ijassa-821	326	15	,	,	PUNCT
ijassa-821	326	16	rus	rus	PROPN
ijassa-821	326	17	,	,	PUNCT
ijassa-821	326	18	d.	d.	PROPN
ijassa-821	326	19	(	(	PUNCT
ijassa-821	326	20	2013	2013	NUM
ijassa-821	326	21	)	)	PUNCT
ijassa-821	326	22	.	.	PUNCT
ijassa-821	327	1	ikeabot	ikeabot	PROPN
ijassa-821	327	2	:	:	PUNCT
ijassa-821	327	3	an	an	DET
ijassa-821	327	4	autonomous	autonomous	ADJ
ijassa-821	327	5	multi	multi	ADJ
ijassa-821	327	6	-	-	ADJ
ijassa-821	327	7	robot	robot	ADJ
ijassa-821	327	8	coordinated	coordinate	VERB
ijassa-821	327	9	furniture	furniture	NOUN
ijassa-821	327	10	assembly	assembly	NOUN
ijassa-821	327	11	system	system	NOUN
ijassa-821	327	12	,	,	PUNCT
ijassa-821	327	13	robotics	robotic	NOUN
ijassa-821	327	14	and	and	CCONJ
ijassa-821	327	15	automation	automation	NOUN
ijassa-821	327	16	,	,	PUNCT
ijassa-821	327	17	855–862	855–862	NUM
ijassa-821	327	18	.	.	NOUN
ijassa-821	327	19	27	27	NUM
ijassa-821	327	20	.	.	PUNCT
ijassa-821	328	1	miller	miller	PROPN
ijassa-821	328	2	c.e	c.e	PROPN
ijassa-821	328	3	.	.	PROPN
ijassa-821	328	4	,	,	PUNCT
ijassa-821	328	5	tucker	tucker	PROPN
ijassa-821	328	6	a.	a.	PROPN
ijassa-821	328	7	w.	w.	PROPN
ijassa-821	328	8	,	,	PUNCT
ijassa-821	328	9	and	and	CCONJ
ijassa-821	328	10	zemlin	zemlin	PROPN
ijassa-821	328	11	r.a	r.a	PROPN
ijassa-821	328	12	.	.	PROPN
ijassa-821	328	13	(	(	PUNCT
ijassa-821	328	14	1960	1960	NUM
ijassa-821	328	15	)	)	PUNCT
ijassa-821	328	16	.	.	PUNCT
ijassa-821	329	1	integer	integer	NOUN
ijassa-821	329	2	programming	programming	NOUN
ijassa-821	329	3	formulation	formulation	NOUN
ijassa-821	329	4	of	of	ADP
ijassa-821	329	5	traveling	travel	VERB
ijassa-821	329	6	salesman	salesman	NOUN
ijassa-821	329	7	problems	problem	NOUN
ijassa-821	329	8	j.	j.	PROPN
ijassa-821	329	9	acm	acm	PROPN
ijassa-821	329	10	,	,	PUNCT
ijassa-821	329	11	7(4	7(4	NUM
ijassa-821	329	12	)	)	PUNCT
ijassa-821	329	13	,	,	PUNCT
ijassa-821	329	14	326–329	326–329	NUM
ijassa-821	329	15	.	.	NOUN
ijassa-821	330	1	28	28	NUM
ijassa-821	330	2	.	.	PUNCT
ijassa-821	331	1	mugayskikh	mugayskikh	PROPN
ijassa-821	331	2	a.v	a.v	PROPN
ijassa-821	331	3	.	.	PROPN
ijassa-821	331	4	(	(	PUNCT
ijassa-821	331	5	2015	2015	NUM
ijassa-821	331	6	)	)	PUNCT
ijassa-821	331	7	.	.	PUNCT
ijassa-821	332	1	dynamic	dynamic	ADJ
ijassa-821	332	2	adaptation	adaptation	NOUN
ijassa-821	332	3	of	of	ADP
ijassa-821	332	4	genetic	genetic	ADJ
ijassa-821	332	5	algorithm	algorithm	NOUN
ijassa-821	332	6	for	for	ADP
ijassa-821	332	7	travelling	travel	VERB
ijassa-821	332	8	salesman	salesman	ADJ
ijassa-821	332	9	problem	problem	NOUN
ijassa-821	332	10	,	,	PUNCT
ijassa-821	332	11	control	control	NOUN
ijassa-821	332	12	processes	process	NOUN
ijassa-821	332	13	and	and	CCONJ
ijassa-821	332	14	stability	stability	NOUN
ijassa-821	332	15	,	,	PUNCT
ijassa-821	332	16	2	2	NUM
ijassa-821	332	17	,	,	PUNCT
ijassa-821	332	18	665–670	665–670	NUM
ijassa-821	332	19	,	,	PUNCT
ijassa-821	333	1	[	[	X
ijassa-821	333	2	in	in	ADP
ijassa-821	333	3	russian	russian	PROPN
ijassa-821	333	4	]	]	PUNCT
ijassa-821	333	5	.	.	PUNCT
ijassa-821	334	1	29	29	NUM
ijassa-821	334	2	.	.	PUNCT
ijassa-821	334	3	papadimitriou	papadimitriou	VERB
ijassa-821	334	4	c.h	c.h	PROPN
ijassa-821	334	5	.	.	PROPN
ijassa-821	335	1	and	and	CCONJ
ijassa-821	335	2	steiglitz	steiglitz	PROPN
ijassa-821	335	3	k.	k.	PROPN
ijassa-821	335	4	(	(	PUNCT
ijassa-821	335	5	1982	1982	NUM
ijassa-821	335	6	)	)	PUNCT
ijassa-821	335	7	.	.	PUNCT
ijassa-821	336	1	combinatorial	combinatorial	ADJ
ijassa-821	336	2	optimization	optimization	NOUN
ijassa-821	336	3	:	:	PUNCT
ijassa-821	336	4	algorithms	algorithm	NOUN
ijassa-821	336	5	and	and	CCONJ
ijassa-821	336	6	complexity	complexity	NOUN
ijassa-821	336	7	,	,	PUNCT
ijassa-821	336	8	upper	upper	ADJ
ijassa-821	336	9	saddle	saddle	NOUN
ijassa-821	336	10	river	river	NOUN
ijassa-821	336	11	:	:	PUNCT
ijassa-821	336	12	prentice	prentice	NOUN
ijassa-821	336	13	-	-	PUNCT
ijassa-821	336	14	hall	hall	PROPN
ijassa-821	336	15	,	,	PUNCT
ijassa-821	336	16	inc	inc	PROPN
ijassa-821	336	17	.	.	PROPN
ijassa-821	336	18	496	496	NUM
ijassa-821	337	1	p.	p.	NOUN
ijassa-821	337	2	30	30	NUM
ijassa-821	337	3	.	.	PUNCT
ijassa-821	338	1	petrosyan	petrosyan	PROPN
ijassa-821	338	2	l.a	l.a	PROPN
ijassa-821	338	3	.	.	PROPN
ijassa-821	338	4	,	,	PUNCT
ijassa-821	338	5	zenkevich	zenkevich	PROPN
ijassa-821	338	6	n.a	n.a	PROPN
ijassa-821	338	7	.	.	PROPN
ijassa-821	338	8	(	(	PUNCT
ijassa-821	338	9	2009	2009	NUM
ijassa-821	338	10	)	)	PUNCT
ijassa-821	338	11	.	.	PUNCT
ijassa-821	339	1	principles	principle	NOUN
ijassa-821	339	2	of	of	ADP
ijassa-821	339	3	dynamic	dynamic	ADJ
ijassa-821	339	4	stability	stability	NOUN
ijassa-821	339	5	,	,	PUNCT
ijassa-821	339	6	large	large	ADJ
ijassa-821	339	7	-	-	PUNCT
ijassa-821	339	8	scale	scale	NOUN
ijassa-821	339	9	systems	system	NOUN
ijassa-821	339	10	control	control	NOUN
ijassa-821	339	11	,	,	PUNCT
ijassa-821	339	12	3	3	NUM
ijassa-821	339	13	,	,	PUNCT
ijassa-821	339	14	100–120	100–120	NUM
ijassa-821	339	15	,	,	PUNCT
ijassa-821	339	16	[	[	X
ijassa-821	339	17	in	in	ADP
ijassa-821	339	18	russian	russian	NOUN
ijassa-821	339	19	]	]	PUNCT
ijassa-821	339	20	.	.	PUNCT
ijassa-821	340	1	copyright	copyright	NOUN
ijassa-821	340	2	©	©	PROPN
ijassa-821	340	3	2020	2020	NUM
ijassa-821	340	4	assa	assa	NOUN
ijassa-821	340	5	.	.	PUNCT
ijassa-821	341	1	adv	adv	PROPN
ijassa-821	341	2	syst	syst	PROPN
ijassa-821	341	3	sci	sci	PROPN
ijassa-821	341	4	appl	appl	PROPN
ijassa-821	341	5	(	(	PUNCT
ijassa-821	341	6	2020	2020	NUM
ijassa-821	341	7	)	)	PUNCT
ijassa-821	341	8	dynamic	dynamic	ADJ
ijassa-821	341	9	adaptation	adaptation	NOUN
ijassa-821	341	10	of	of	ADP
ijassa-821	341	11	genetic	genetic	ADJ
ijassa-821	341	12	algorithm	algorithm	NOUN
ijassa-821	341	13	for	for	ADP
ijassa-821	341	14	solving	solve	VERB
ijassa-821	341	15	routing	routing	NOUN
ijassa-821	341	16	problems	problem	NOUN
ijassa-821	341	17	43	43	NUM
ijassa-821	341	18	31	31	NUM
ijassa-821	341	19	.	.	PUNCT
ijassa-821	342	1	puljic	puljic	PROPN
ijassa-821	342	2	k.	k.	PROPN
ijassa-821	342	3	,	,	PUNCT
ijassa-821	342	4	manger	manger	NOUN
ijassa-821	342	5	c.r	c.r	PROPN
ijassa-821	342	6	.	.	PUNCT
ijassa-821	342	7	(	(	PUNCT
ijassa-821	342	8	2013	2013	NUM
ijassa-821	342	9	)	)	PUNCT
ijassa-821	342	10	.	.	PUNCT
ijassa-821	343	1	comparison	comparison	NOUN
ijassa-821	343	2	of	of	ADP
ijassa-821	343	3	eight	eight	NUM
ijassa-821	343	4	evolutionary	evolutionary	ADJ
ijassa-821	343	5	crossover	crossover	NOUN
ijassa-821	343	6	operators	operator	NOUN
ijassa-821	343	7	for	for	ADP
ijassa-821	343	8	the	the	DET
ijassa-821	343	9	vehicle	vehicle	NOUN
ijassa-821	343	10	routing	routing	NOUN
ijassa-821	343	11	problem	problem	NOUN
ijassa-821	343	12	,	,	PUNCT
ijassa-821	343	13	mathematical	mathematical	ADJ
ijassa-821	343	14	communications	communication	NOUN
ijassa-821	343	15	,	,	PUNCT
ijassa-821	343	16	18	18	NUM
ijassa-821	343	17	,	,	PUNCT
ijassa-821	343	18	359–375	359–375	NUM
ijassa-821	343	19	.	.	PUNCT
ijassa-821	344	1	32	32	NUM
ijassa-821	344	2	.	.	PUNCT
ijassa-821	345	1	reinelt	reinelt	PROPN
ijassa-821	345	2	g.	g.	PROPN
ijassa-821	345	3	travelling	travel	VERB
ijassa-821	345	4	salesman	salesman	PROPN
ijassa-821	345	5	problem	problem	NOUN
ijassa-821	345	6	library	library	NOUN
ijassa-821	345	7	,	,	PUNCT
ijassa-821	345	8	http://comopt.ifi.uniheidelberg.de/software/tsplib95/	http://comopt.ifi.uniheidelberg.de/software/tsplib95/	PROPN
ijassa-821	345	9	33	33	NUM
ijassa-821	345	10	.	.	PUNCT
ijassa-821	346	1	sivasoundari	sivasoundari	PROPN
ijassa-821	346	2	a.	a.	PROPN
ijassa-821	346	3	,	,	PUNCT
ijassa-821	346	4	kalaimani	kalaimani	PROPN
ijassa-821	346	5	s.	s.	PROPN
ijassa-821	346	6	(	(	PUNCT
ijassa-821	346	7	2013	2013	NUM
ijassa-821	346	8	)	)	PUNCT
ijassa-821	346	9	.	.	PUNCT
ijassa-821	347	1	wireless	wireless	ADJ
ijassa-821	347	2	surveillance	surveillance	NOUN
ijassa-821	347	3	robot	robot	NOUN
ijassa-821	347	4	with	with	ADP
ijassa-821	347	5	motion	motion	NOUN
ijassa-821	347	6	detection	detection	NOUN
ijassa-821	347	7	and	and	CCONJ
ijassa-821	347	8	live	live	ADJ
ijassa-821	347	9	video	video	NOUN
ijassa-821	347	10	transmission	transmission	NOUN
ijassa-821	347	11	,	,	PUNCT
ijassa-821	347	12	international	international	ADJ
ijassa-821	347	13	journal	journal	NOUN
ijassa-821	347	14	of	of	ADP
ijassa-821	347	15	emerging	emerge	VERB
ijassa-821	347	16	science	science	NOUN
ijassa-821	347	17	and	and	CCONJ
ijassa-821	347	18	engineering	engineering	NOUN
ijassa-821	347	19	,	,	PUNCT
ijassa-821	347	20	1	1	NUM
ijassa-821	347	21	,	,	PUNCT
ijassa-821	347	22	147–165	147–165	NUM
ijassa-821	347	23	.	.	PUNCT
ijassa-821	348	1	34	34	NUM
ijassa-821	348	2	.	.	PUNCT
ijassa-821	349	1	shirokikh	shirokikh	PROPN
ijassa-821	349	2	v.a	v.a	PROPN
ijassa-821	349	3	.	.	PROPN
ijassa-821	349	4	,	,	PUNCT
ijassa-821	349	5	zakharov	zakharov	PROPN
ijassa-821	349	6	v.v	v.v	PROPN
ijassa-821	349	7	.	.	PROPN
ijassa-821	349	8	(	(	PUNCT
ijassa-821	349	9	2015	2015	NUM
ijassa-821	349	10	)	)	PUNCT
ijassa-821	349	11	.	.	PUNCT
ijassa-821	350	1	dynamic	dynamic	ADJ
ijassa-821	350	2	adaptive	adaptive	ADJ
ijassa-821	350	3	large	large	ADJ
ijassa-821	350	4	neighbourhood	neighbourhood	NOUN
ijassa-821	350	5	search	search	NOUN
ijassa-821	350	6	for	for	ADP
ijassa-821	350	7	inventory	inventory	NOUN
ijassa-821	350	8	routing	routing	NOUN
ijassa-821	350	9	problem	problem	NOUN
ijassa-821	350	10	,	,	PUNCT
ijassa-821	350	11	advances	advance	NOUN
ijassa-821	350	12	in	in	ADP
ijassa-821	350	13	intelligent	intelligent	ADJ
ijassa-821	350	14	systems	system	NOUN
ijassa-821	350	15	and	and	CCONJ
ijassa-821	350	16	computing	computing	NOUN
ijassa-821	350	17	,	,	PUNCT
ijassa-821	350	18	springer	springer	NOUN
ijassa-821	350	19	,	,	PUNCT
ijassa-821	350	20	359	359	NUM
ijassa-821	350	21	,	,	PUNCT
ijassa-821	350	22	231–241	231–241	NUM
ijassa-821	350	23	.	.	PUNCT
ijassa-821	351	1	35	35	NUM
ijassa-821	351	2	.	.	PUNCT
ijassa-821	352	1	shirokikh	shirokikh	PROPN
ijassa-821	352	2	v.a	v.a	PROPN
ijassa-821	352	3	.	.	PROPN
ijassa-821	352	4	,	,	PUNCT
ijassa-821	352	5	zakharov	zakharov	PROPN
ijassa-821	352	6	v.v	v.v	PROPN
ijassa-821	352	7	.	.	PROPN
ijassa-821	352	8	(	(	PUNCT
ijassa-821	352	9	2017	2017	NUM
ijassa-821	352	10	)	)	PUNCT
ijassa-821	352	11	.	.	PUNCT
ijassa-821	353	1	heuristic	heuristic	ADJ
ijassa-821	353	2	evaluation	evaluation	NOUN
ijassa-821	353	3	of	of	ADP
ijassa-821	353	4	the	the	DET
ijassa-821	353	5	characteristic	characteristic	ADJ
ijassa-821	353	6	function	function	NOUN
ijassa-821	353	7	in	in	ADP
ijassa-821	353	8	the	the	DET
ijassa-821	353	9	cooperative	cooperative	ADJ
ijassa-821	353	10	inventory	inventory	NOUN
ijassa-821	353	11	routing	routing	NOUN
ijassa-821	353	12	game	game	NOUN
ijassa-821	353	13	,	,	PUNCT
ijassa-821	353	14	journal	journal	NOUN
ijassa-821	353	15	on	on	ADP
ijassa-821	353	16	vehicle	vehicle	NOUN
ijassa-821	353	17	routing	routing	NOUN
ijassa-821	353	18	algorithms	algorithm	NOUN
ijassa-821	353	19	,	,	PUNCT
ijassa-821	353	20	springer	springer	NOUN
ijassa-821	353	21	,	,	PUNCT
ijassa-821	353	22	1–14	1–14	PROPN
ijassa-821	353	23	.	.	PROPN
ijassa-821	354	1	36	36	NUM
ijassa-821	354	2	.	.	PUNCT
ijassa-821	354	3	talbi	talbi	PROPN
ijassa-821	354	4	e.-g	e.-g	PROPN
ijassa-821	354	5	.	.	PUNCT
ijassa-821	355	1	(	(	PUNCT
ijassa-821	355	2	2013	2013	NUM
ijassa-821	355	3	)	)	PUNCT
ijassa-821	355	4	.	.	PUNCT
ijassa-821	356	1	metaheuristics	metaheuristic	NOUN
ijassa-821	356	2	for	for	ADP
ijassa-821	356	3	bi	bi	ADJ
ijassa-821	356	4	-	-	ADJ
ijassa-821	356	5	level	level	ADJ
ijassa-821	356	6	optimization	optimization	NOUN
ijassa-821	356	7	,	,	PUNCT
ijassa-821	356	8	springer	springer	NOUN
ijassa-821	356	9	publishing	publishing	NOUN
ijassa-821	356	10	company	company	NOUN
ijassa-821	356	11	,	,	PUNCT
ijassa-821	356	12	incorporated	incorporate	VERB
ijassa-821	356	13	,	,	PUNCT
ijassa-821	356	14	288	288	NUM
ijassa-821	356	15	p.	p.	NOUN
ijassa-821	356	16	37	37	NUM
ijassa-821	356	17	.	.	PUNCT
ijassa-821	357	1	wang	wang	PROPN
ijassa-821	357	2	,	,	PUNCT
ijassa-821	357	3	y.	y.	PROPN
ijassa-821	357	4	,	,	PUNCT
ijassa-821	357	5	wu	wu	PROPN
ijassa-821	357	6	,	,	PUNCT
ijassa-821	357	7	c.h	c.h	PROPN
ijassa-821	357	8	.	.	PROPN
ijassa-821	357	9	(	(	PUNCT
ijassa-821	357	10	2007	2007	NUM
ijassa-821	357	11	)	)	PUNCT
ijassa-821	357	12	.	.	PUNCT
ijassa-821	358	1	robot	robot	NOUN
ijassa-821	358	2	-	-	PUNCT
ijassa-821	358	3	assisted	assist	VERB
ijassa-821	358	4	sensor	sensor	NOUN
ijassa-821	358	5	network	network	NOUN
ijassa-821	358	6	deployment	deployment	NOUN
ijassa-821	358	7	and	and	CCONJ
ijassa-821	358	8	data	datum	NOUN
ijassa-821	358	9	collection	collection	NOUN
ijassa-821	358	10	,	,	PUNCT
ijassa-821	358	11	proceedings	proceeding	NOUN
ijassa-821	358	12	of	of	ADP
ijassa-821	358	13	the	the	DET
ijassa-821	358	14	2007	2007	NUM
ijassa-821	358	15	ieee	ieee	PROPN
ijassa-821	358	16	international	international	ADJ
ijassa-821	358	17	symposium	symposium	NOUN
ijassa-821	358	18	on	on	ADP
ijassa-821	358	19	computational	computational	ADJ
ijassa-821	358	20	intelligence	intelligence	NOUN
ijassa-821	358	21	in	in	ADP
ijassa-821	358	22	robotics	robotic	NOUN
ijassa-821	358	23	and	and	CCONJ
ijassa-821	358	24	automation	automation	NOUN
ijassa-821	358	25	,	,	PUNCT
ijassa-821	358	26	467–472	467–472	NUM
ijassa-821	358	27	.	.	PUNCT
ijassa-821	359	1	38	38	NUM
ijassa-821	359	2	.	.	PUNCT
ijassa-821	359	3	zachariasen	zachariasen	PROPN
ijassa-821	359	4	m	m	PROPN
ijassa-821	359	5	,	,	PUNCT
ijassa-821	359	6	dam	dam	NOUN
ijassa-821	359	7	m.	m.	NOUN
ijassa-821	359	8	(	(	PUNCT
ijassa-821	359	9	1996	1996	NUM
ijassa-821	359	10	)	)	PUNCT
ijassa-821	359	11	.	.	PUNCT
ijassa-821	360	1	tabu	tabu	NOUN
ijassa-821	360	2	search	search	NOUN
ijassa-821	360	3	on	on	ADP
ijassa-821	360	4	the	the	DET
ijassa-821	360	5	geometric	geometric	ADJ
ijassa-821	360	6	traveling	travel	VERB
ijassa-821	360	7	salesman	salesman	NOUN
ijassa-821	360	8	problem	problem	NOUN
ijassa-821	360	9	,	,	PUNCT
ijassa-821	360	10	proceedings	proceeding	NOUN
ijassa-821	360	11	from	from	ADP
ijassa-821	360	12	metaheuristics	metaheuristic	NOUN
ijassa-821	360	13	international	international	ADJ
ijassa-821	360	14	conference	conference	NOUN
ijassa-821	360	15	,	,	PUNCT
ijassa-821	360	16	colorado	colorado	NOUN
ijassa-821	360	17	,	,	PUNCT
ijassa-821	360	18	1996	1996	NUM
ijassa-821	360	19	,	,	PUNCT
ijassa-821	360	20	571–587	571–587	NUM
ijassa-821	360	21	.	.	NOUN
ijassa-821	360	22	39	39	NUM
ijassa-821	360	23	.	.	PUNCT
ijassa-821	361	1	zakharov	zakharov	PROPN
ijassa-821	361	2	v.v	v.v	PROPN
ijassa-821	361	3	.	.	PROPN
ijassa-821	361	4	,	,	PUNCT
ijassa-821	361	5	dementieva	dementieva	PROPN
ijassa-821	361	6	m.	m.	PROPN
ijassa-821	361	7	(	(	PUNCT
ijassa-821	361	8	2004	2004	NUM
ijassa-821	361	9	)	)	PUNCT
ijassa-821	361	10	.	.	PUNCT
ijassa-821	362	1	multistage	multistage	NOUN
ijassa-821	362	2	cooperative	cooperative	ADJ
ijassa-821	362	3	games	game	NOUN
ijassa-821	362	4	and	and	CCONJ
ijassa-821	362	5	problem	problem	NOUN
ijassa-821	362	6	of	of	ADP
ijassa-821	362	7	time	time	NOUN
ijassa-821	362	8	consistency	consistency	NOUN
ijassa-821	362	9	,	,	PUNCT
ijassa-821	362	10	international	international	ADJ
ijassa-821	362	11	game	game	NOUN
ijassa-821	362	12	theory	theory	NOUN
ijassa-821	362	13	review	review	NOUN
ijassa-821	362	14	,	,	PUNCT
ijassa-821	362	15	6	6	NUM
ijassa-821	362	16	,	,	PUNCT
ijassa-821	362	17	157–170	157–170	NUM
ijassa-821	362	18	.	.	PUNCT
ijassa-821	363	1	40	40	NUM
ijassa-821	363	2	.	.	PUNCT
ijassa-821	364	1	zakharov	zakharov	PROPN
ijassa-821	364	2	v.v	v.v	PROPN
ijassa-821	364	3	.	.	PROPN
ijassa-821	364	4	,	,	PUNCT
ijassa-821	364	5	shchegryaev	shchegryaev	VERB
ijassa-821	364	6	a.n	a.n	PROPN
ijassa-821	364	7	.	.	PROPN
ijassa-821	365	1	(	(	PUNCT
ijassa-821	365	2	2014	2014	NUM
ijassa-821	365	3	)	)	PUNCT
ijassa-821	365	4	.	.	PUNCT
ijassa-821	366	1	multi	multi	ADJ
ijassa-821	366	2	-	-	ADJ
ijassa-821	366	3	period	period	ADJ
ijassa-821	366	4	cooperative	cooperative	ADJ
ijassa-821	366	5	vehicle	vehicle	NOUN
ijassa-821	366	6	routing	routing	NOUN
ijassa-821	366	7	games	game	NOUN
ijassa-821	366	8	,	,	PUNCT
ijassa-821	366	9	contributions	contribution	NOUN
ijassa-821	366	10	to	to	ADP
ijassa-821	366	11	game	game	NOUN
ijassa-821	366	12	theory	theory	NOUN
ijassa-821	366	13	and	and	CCONJ
ijassa-821	366	14	management	management	NOUN
ijassa-821	366	15	,	,	PUNCT
ijassa-821	366	16	7(2	7(2	NUM
ijassa-821	366	17	)	)	PUNCT
ijassa-821	366	18	,	,	PUNCT
ijassa-821	366	19	349–359	349–359	NUM
ijassa-821	366	20	.	.	PUNCT
ijassa-821	367	1	41	41	NUM
ijassa-821	367	2	.	.	PUNCT
ijassa-821	368	1	zakharov	zakharov	PROPN
ijassa-821	368	2	v.v	v.v	PROPN
ijassa-821	368	3	.	.	PROPN
ijassa-821	368	4	,	,	PUNCT
ijassa-821	368	5	shchegryaev	shchegryaev	VERB
ijassa-821	368	6	a.n	a.n	PROPN
ijassa-821	368	7	.	.	PROPN
ijassa-821	369	1	(	(	PUNCT
ijassa-821	369	2	2015	2015	NUM
ijassa-821	369	3	)	)	PUNCT
ijassa-821	369	4	.	.	PUNCT
ijassa-821	370	1	stable	stable	ADJ
ijassa-821	370	2	cooperation	cooperation	NOUN
ijassa-821	370	3	in	in	ADP
ijassa-821	370	4	dynamic	dynamic	ADJ
ijassa-821	370	5	vehicle	vehicle	NOUN
ijassa-821	370	6	routing	routing	NOUN
ijassa-821	370	7	problems	problem	NOUN
ijassa-821	370	8	,	,	PUNCT
ijassa-821	370	9	automation	automation	NOUN
ijassa-821	370	10	and	and	CCONJ
ijassa-821	370	11	remote	remote	ADJ
ijassa-821	370	12	control	control	NOUN
ijassa-821	370	13	,	,	PUNCT
ijassa-821	370	14	springer	springer	NOUN
ijassa-821	370	15	,	,	PUNCT
ijassa-821	370	16	76(5	76(5	NUM
ijassa-821	370	17	)	)	PUNCT
ijassa-821	370	18	,	,	PUNCT
ijassa-821	370	19	935–943	935–943	NUM
ijassa-821	370	20	.	.	PUNCT
ijassa-821	371	1	copyright	copyright	NOUN
ijassa-821	371	2	©	©	PROPN
ijassa-821	371	3	2020	2020	NUM
ijassa-821	371	4	assa	assa	NOUN
ijassa-821	371	5	.	.	PUNCT
ijassa-821	372	1	adv	adv	PROPN
ijassa-821	372	2	syst	syst	PROPN
ijassa-821	372	3	sci	sci	PROPN
ijassa-821	372	4	appl	appl	PROPN
ijassa-821	372	5	(	(	PUNCT
ijassa-821	372	6	2020	2020	NUM
ijassa-821	372	7	)	)	PUNCT
ijassa-821	372	8	introduction	introduction	NOUN
ijassa-821	372	9	travelling	travel	VERB
ijassa-821	372	10	salesman	salesman	ADJ
ijassa-821	372	11	problem	problem	NOUN
ijassa-821	372	12	:	:	PUNCT
ijassa-821	372	13	formulation	formulation	NOUN
ijassa-821	372	14	and	and	CCONJ
ijassa-821	372	15	methods	method	NOUN
ijassa-821	372	16	problem	problem	VERB
ijassa-821	372	17	formulation	formulation	NOUN
ijassa-821	372	18	algorithms	algorithm	NOUN
ijassa-821	372	19	and	and	CCONJ
ijassa-821	372	20	methods	method	NOUN
ijassa-821	372	21	terminology	terminology	NOUN
ijassa-821	372	22	and	and	CCONJ
ijassa-821	372	23	definitions	definition	VERB
ijassa-821	372	24	genetic	genetic	ADJ
ijassa-821	372	25	algorithm	algorithm	NOUN
ijassa-821	372	26	with	with	ADP
ijassa-821	372	27	greffenstte	greffenstte	PROPN
ijassa-821	372	28	's	's	PART
ijassa-821	372	29	crossover	crossover	NOUN
ijassa-821	372	30	time	time	NOUN
ijassa-821	372	31	inconsistency	inconsistency	NOUN
ijassa-821	372	32	of	of	ADP
ijassa-821	372	33	heuristic	heuristic	ADJ
ijassa-821	372	34	algorithms	algorithms	NOUN
ijassa-821	372	35	dynamic	dynamic	ADJ
ijassa-821	372	36	adaptation	adaptation	NOUN
ijassa-821	372	37	of	of	ADP
ijassa-821	372	38	genetic	genetic	ADJ
ijassa-821	372	39	algorithm	algorithm	NOUN
ijassa-821	372	40	computational	computational	ADJ
ijassa-821	372	41	results	result	NOUN
ijassa-821	372	42	experimental	experimental	ADJ
ijassa-821	372	43	level	level	NOUN
ijassa-821	372	44	of	of	ADP
ijassa-821	372	45	time	time	NOUN
ijassa-821	372	46	consistency	consistency	NOUN
ijassa-821	372	47	of	of	ADP
ijassa-821	372	48	the	the	DET
ijassa-821	372	49	genetic	genetic	ADJ
ijassa-821	372	50	algorithm	algorithm	NOUN
ijassa-821	372	51	with	with	ADP
ijassa-821	372	52	greffenstett	greffenstett	PROPN
ijassa-821	372	53	's	's	PART
ijassa-821	372	54	crossover	crossover	NOUN
ijassa-821	372	55	for	for	ADP
ijassa-821	372	56	solving	solve	VERB
ijassa-821	372	57	the	the	DET
ijassa-821	372	58	tsp	tsp	NOUN
ijassa-821	372	59	comparison	comparison	NOUN
ijassa-821	372	60	of	of	ADP
ijassa-821	372	61	route	route	NOUN
ijassa-821	372	62	plans	plan	NOUN
ijassa-821	372	63	obtained	obtain	VERB
ijassa-821	372	64	by	by	ADP
ijassa-821	372	65	genetic	genetic	ADJ
ijassa-821	372	66	heuristics	heuristic	NOUN
ijassa-821	372	67	and	and	CCONJ
ijassa-821	372	68	its	its	PRON
ijassa-821	372	69	dynamic	dynamic	ADJ
ijassa-821	372	70	adaptation	adaptation	NOUN
ijassa-821	372	71	procedute	procedute	NOUN
ijassa-821	372	72	time	time	NOUN
ijassa-821	372	73	analysis	analysis	NOUN
ijassa-821	372	74	for	for	ADP
ijassa-821	372	75	applying	apply	VERB
ijassa-821	372	76	dynamic	dynamic	ADJ
ijassa-821	372	77	adaptation	adaptation	NOUN
ijassa-821	372	78	procedure	procedure	NOUN
ijassa-821	372	79	conclusion	conclusion	NOUN