id	sid	tid	token	lemma	pos
cana-832	1	1	communications	communication	NOUN
cana-832	1	2	on	on	ADP
cana-832	1	3	applied	apply	VERB
cana-832	1	4	nonlinear	nonlinear	ADJ
cana-832	1	5	analysis	analysis	NOUN
cana-832	1	6	issn	issn	NOUN
cana-832	1	7	:	:	PUNCT
cana-832	1	8	1074	1074	NUM
cana-832	1	9	-	-	PUNCT
cana-832	1	10	133x	133x	NUM
cana-832	1	11	vol	vol	NOUN
cana-832	1	12	31	31	NUM
cana-832	1	13	no	no	NOUN
cana-832	1	14	.	.	PUNCT
cana-832	2	1	4s	4s	NUM
cana-832	2	2	(	(	PUNCT
cana-832	2	3	2024	2024	NUM
cana-832	2	4	)	)	PUNCT
cana-832	2	5	135	135	NUM
cana-832	2	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	2	7	innovations	innovation	NOUN
cana-832	2	8	in	in	ADP
cana-832	2	9	transport	transport	NOUN
cana-832	2	10	optimization	optimization	NOUN
cana-832	2	11	:	:	PUNCT
cana-832	2	12	topological	topological	ADJ
cana-832	2	13	graphical	graphical	ADJ
cana-832	2	14	methodologies	methodology	NOUN
cana-832	2	15	and	and	CCONJ
cana-832	2	16	computational	computational	ADJ
cana-832	2	17	strategies	strategy	NOUN
cana-832	2	18	dr	dr	PROPN
cana-832	2	19	.	.	PROPN
cana-832	2	20	e.	e.	PROPN
cana-832	2	21	kungumaraj1	kungumaraj1	PROPN
cana-832	2	22	*	*	PROPN
cana-832	2	23	,	,	PUNCT
cana-832	2	24	c.ruby	c.ruby	NOUN
cana-832	2	25	sharmila2	sharmila2	NOUN
cana-832	2	26	,	,	PUNCT
cana-832	2	27	deepak	deepak	PROPN
cana-832	2	28	umrao	umrao	PROPN
cana-832	2	29	sarwe3	sarwe3	PROPN
cana-832	2	30	,	,	PUNCT
cana-832	2	31	n.	n.	PROPN
cana-832	2	32	preethi4	preethi4	PROPN
cana-832	2	33	,	,	PUNCT
cana-832	2	34	mrs.t.jayapriya5	mrs.t.jayapriya5	PROPN
cana-832	2	35	,	,	PUNCT
cana-832	2	36	dr	dr	PROPN
cana-832	2	37	.	.	PROPN
cana-832	2	38	sanjay	sanjay	PROPN
cana-832	2	39	sharma	sharma	PROPN
cana-832	2	40	6	6	NUM
cana-832	2	41	,	,	PUNCT
cana-832	2	42	,	,	PUNCT
cana-832	2	43	dr	dr	PROPN
cana-832	2	44	mithilesh	mithilesh	PROPN
cana-832	2	45	deo	deo	NOUN
cana-832	2	46	pandey7	pandey7	X
cana-832	3	1	1associate	1associate	NUM
cana-832	3	2	professor	professor	NOUN
cana-832	3	3	of	of	ADP
cana-832	3	4	mathematics	mathematic	NOUN
cana-832	3	5	,	,	PUNCT
cana-832	3	6	department	department	NOUN
cana-832	3	7	of	of	ADP
cana-832	3	8	science	science	NOUN
cana-832	3	9	and	and	CCONJ
cana-832	3	10	humanities	humanity	NOUN
cana-832	3	11	,	,	PUNCT
cana-832	3	12	nehru	nehru	PROPN
cana-832	3	13	institute	institute	PROPN
cana-832	3	14	of	of	ADP
cana-832	3	15	engineering	engineering	NOUN
cana-832	3	16	and	and	CCONJ
cana-832	3	17	technology	technology	NOUN
cana-832	3	18	,	,	PUNCT
cana-832	3	19	coimbatore	coimbatore	PROPN
cana-832	3	20	,	,	PUNCT
cana-832	3	21	(	(	PUNCT
cana-832	3	22	corresponding	correspond	VERB
cana-832	3	23	author	author	NOUN
cana-832	3	24	)	)	PUNCT
cana-832	3	25	email	email	NOUN
cana-832	4	1	i	i	PROPN
cana-832	4	2	d	d	PROPN
cana-832	4	3	:	:	PUNCT
cana-832	4	4	kungum99522@gmail.com	kungum99522@gmail.com	X
cana-832	5	1	2assistant	2assistant	NUM
cana-832	5	2	professor	professor	NOUN
cana-832	5	3	,	,	PUNCT
cana-832	5	4	department	department	NOUN
cana-832	5	5	of	of	ADP
cana-832	5	6	mathematics	mathematic	NOUN
cana-832	5	7	,	,	PUNCT
cana-832	5	8	tamilnadu	tamilnadu	ADJ
cana-832	5	9	college	college	NOUN
cana-832	5	10	of	of	ADP
cana-832	5	11	engineering	engineering	PROPN
cana-832	5	12	,	,	PUNCT
cana-832	5	13	coimbatore	coimbatore	NOUN
cana-832	5	14	email	email	NOUN
cana-832	5	15	i	i	PROPN
cana-832	5	16	d	d	PROPN
cana-832	5	17	:	:	PUNCT
cana-832	5	18	sharmi.ruby2011@gmail.com	sharmi.ruby2011@gmail.com	PROPN
cana-832	5	19	3assistant	3assistant	NUM
cana-832	5	20	professor	professor	NOUN
cana-832	5	21	,	,	PUNCT
cana-832	5	22	department	department	NOUN
cana-832	5	23	of	of	ADP
cana-832	5	24	mathematics	mathematics	PROPN
cana-832	5	25	,	,	PUNCT
cana-832	5	26	university	university	NOUN
cana-832	5	27	of	of	ADP
cana-832	5	28	mumbai	mumbai	PROPN
cana-832	5	29	,	,	PUNCT
cana-832	5	30	kalina	kalina	PROPN
cana-832	5	31	,	,	PUNCT
cana-832	5	32	santacruz	santacruz	PROPN
cana-832	5	33	east	east	PROPN
cana-832	5	34	400098	400098	NUM
cana-832	5	35	.	.	PUNCT
cana-832	6	1	email	email	NOUN
cana-832	6	2	i	i	PROPN
cana-832	6	3	d	d	PROPN
cana-832	6	4	:	:	PUNCT
cana-832	6	5	deepak.sarve@mathematics.mu.ac.in	deepak.sarve@mathematics.mu.ac.in	X
cana-832	6	6	4assistant	4assistant	NUM
cana-832	6	7	professor	professor	NOUN
cana-832	6	8	,	,	PUNCT
cana-832	6	9	department	department	NOUN
cana-832	6	10	of	of	ADP
cana-832	6	11	science	science	NOUN
cana-832	6	12	and	and	CCONJ
cana-832	6	13	humanities	humanity	NOUN
cana-832	6	14	,	,	PUNCT
cana-832	6	15	sri	sri	PROPN
cana-832	6	16	krishna	krishna	PROPN
cana-832	6	17	college	college	PROPN
cana-832	6	18	of	of	ADP
cana-832	6	19	engineering	engineering	NOUN
cana-832	6	20	and	and	CCONJ
cana-832	6	21	technology	technology	NOUN
cana-832	6	22	,	,	PUNCT
cana-832	6	23	coimbatore	coimbatore	PROPN
cana-832	6	24	.	.	PUNCT
cana-832	7	1	email	email	NOUN
cana-832	7	2	id:preethin@skcet.ac.in	id:preethin@skcet.ac.in	NOUN
cana-832	7	3	5assistant	5assistant	NUM
cana-832	7	4	professor	professor	NOUN
cana-832	7	5	,	,	PUNCT
cana-832	7	6	department	department	NOUN
cana-832	7	7	of	of	ADP
cana-832	7	8	mathematics	mathematic	NOUN
cana-832	7	9	,	,	PUNCT
cana-832	7	10	m.kumarasamy	m.kumarasamy	ADJ
cana-832	7	11	college	college	NOUN
cana-832	7	12	of	of	ADP
cana-832	7	13	engineering	engineering	PROPN
cana-832	7	14	,	,	PUNCT
cana-832	7	15	karur	karur	PROPN
cana-832	7	16	,	,	PUNCT
cana-832	7	17	tamil	tamil	PROPN
cana-832	7	18	nadu	nadu	PROPN
cana-832	7	19	.	.	PUNCT
cana-832	8	1	email	email	NOUN
cana-832	9	1	i	i	PROPN
cana-832	9	2	d	d	PROPN
cana-832	9	3	:	:	PUNCT
cana-832	10	1	jayapriyathangavel@gmail.com	jayapriyathangavel@gmail.com	X
cana-832	11	1	6assistant	6assistant	NUM
cana-832	11	2	professor	professor	NOUN
cana-832	11	3	,	,	PUNCT
cana-832	11	4	department	department	NOUN
cana-832	11	5	of	of	ADP
cana-832	11	6	mathematics	mathematics	PROPN
cana-832	11	7	,	,	PUNCT
cana-832	11	8	niet	niet	PROPN
cana-832	11	9	,	,	PUNCT
cana-832	11	10	nims	nims	PROPN
cana-832	11	11	university	university	PROPN
cana-832	11	12	rajasthan	rajasthan	PROPN
cana-832	11	13	,	,	PUNCT
cana-832	11	14	jaipur	jaipur	PROPN
cana-832	11	15	.	.	PUNCT
cana-832	12	1	email	email	NOUN
cana-832	12	2	i	i	PROPN
cana-832	12	3	d	d	PROPN
cana-832	12	4	sanjay.sharma1@nimsuniversity.org	sanjay.sharma1@nimsuniversity.org	PROPN
cana-832	12	5	7associate	7associate	NUM
cana-832	12	6	professor	professor	NOUN
cana-832	12	7	,	,	PUNCT
cana-832	12	8	department	department	NOUN
cana-832	12	9	of	of	ADP
cana-832	12	10	applied	apply	VERB
cana-832	12	11	mathematics	mathematic	NOUN
cana-832	12	12	,	,	PUNCT
cana-832	12	13	bhilai	bhilai	PROPN
cana-832	12	14	institute	institute	PROPN
cana-832	12	15	of	of	ADP
cana-832	12	16	technology	technology	PROPN
cana-832	12	17	durg	durg	NOUN
cana-832	12	18	.	.	PUNCT
cana-832	13	1	email	email	NOUN
cana-832	14	1	i	i	PROPN
cana-832	14	2	d	d	PROPN
cana-832	14	3	:	:	PUNCT
cana-832	14	4	mithileshpandey1978@gmail.com	mithileshpandey1978@gmail.com	PROPN
cana-832	14	5	article	article	PROPN
cana-832	14	6	history	history	NOUN
cana-832	14	7	:	:	PUNCT
cana-832	14	8	received	receive	VERB
cana-832	14	9	:	:	PUNCT
cana-832	14	10	18	18	NUM
cana-832	14	11	-	-	PUNCT
cana-832	14	12	04	04	NUM
cana-832	14	13	-	-	PUNCT
cana-832	14	14	2024	2024	NUM
cana-832	14	15	revised	revise	VERB
cana-832	14	16	:	:	PUNCT
cana-832	14	17	02	02	NUM
cana-832	14	18	-	-	PUNCT
cana-832	14	19	06	06	NUM
cana-832	14	20	-	-	PUNCT
cana-832	14	21	2024	2024	NUM
cana-832	14	22	accepted	accept	VERB
cana-832	14	23	:	:	PUNCT
cana-832	14	24	20	20	NUM
cana-832	14	25	-	-	SYM
cana-832	14	26	06	06	NUM
cana-832	14	27	-	-	PUNCT
cana-832	14	28	2024	2024	NUM
cana-832	14	29	abstract	abstract	NOUN
cana-832	14	30	:	:	PUNCT
cana-832	14	31	this	this	DET
cana-832	14	32	article	article	NOUN
cana-832	14	33	presents	present	VERB
cana-832	14	34	a	a	DET
cana-832	14	35	novel	novel	ADJ
cana-832	14	36	approach	approach	NOUN
cana-832	14	37	for	for	ADP
cana-832	14	38	solving	solve	VERB
cana-832	14	39	the	the	DET
cana-832	14	40	transportation	transportation	NOUN
cana-832	14	41	problem(tp	problem(tp	NOUN
cana-832	14	42	)	)	PUNCT
cana-832	14	43	by	by	ADP
cana-832	14	44	leveraging	leverage	VERB
cana-832	14	45	topologized	topologize	VERB
cana-832	14	46	bipartite	bipartite	NOUN
cana-832	14	47	graphs	graph	NOUN
cana-832	14	48	along	along	ADP
cana-832	14	49	with	with	ADP
cana-832	14	50	computational	computational	ADJ
cana-832	14	51	techniques	technique	NOUN
cana-832	14	52	.	.	PUNCT
cana-832	15	1	the	the	DET
cana-832	15	2	methodology	methodology	NOUN
cana-832	15	3	involves	involve	VERB
cana-832	15	4	three	three	NUM
cana-832	15	5	key	key	ADJ
cana-832	15	6	steps	step	NOUN
cana-832	15	7	:	:	PUNCT
cana-832	15	8	the	the	DET
cana-832	15	9	digitization	digitization	NOUN
cana-832	15	10	of	of	ADP
cana-832	15	11	the	the	DET
cana-832	15	12	transportation	transportation	NOUN
cana-832	15	13	problem	problem	NOUN
cana-832	15	14	,	,	PUNCT
cana-832	15	15	the	the	DET
cana-832	15	16	digitization	digitization	NOUN
cana-832	15	17	of	of	ADP
cana-832	15	18	topological	topological	ADJ
cana-832	15	19	spaces	space	NOUN
cana-832	15	20	,	,	PUNCT
cana-832	15	21	and	and	CCONJ
cana-832	15	22	the	the	DET
cana-832	15	23	digitization	digitization	NOUN
cana-832	15	24	of	of	ADP
cana-832	15	25	graphs	graph	NOUN
cana-832	15	26	.	.	PUNCT
cana-832	16	1	the	the	DET
cana-832	16	2	study	study	NOUN
cana-832	16	3	initially	initially	ADV
cana-832	16	4	reconditions	recondition	VERB
cana-832	16	5	the	the	DET
cana-832	16	6	tp	tp	NOUN
cana-832	16	7	into	into	ADP
cana-832	16	8	a	a	DET
cana-832	16	9	graphical	graphical	ADJ
cana-832	16	10	format	format	NOUN
cana-832	16	11	and	and	CCONJ
cana-832	16	12	then	then	ADV
cana-832	16	13	transforms	transform	VERB
cana-832	16	14	it	it	PRON
cana-832	16	15	into	into	ADP
cana-832	16	16	a	a	DET
cana-832	16	17	topologized	topologize	VERB
cana-832	16	18	graphical	graphical	ADJ
cana-832	16	19	illustration	illustration	NOUN
cana-832	16	20	.	.	PUNCT
cana-832	17	1	using	use	VERB
cana-832	17	2	the	the	DET
cana-832	17	3	recommended	recommend	VERB
cana-832	17	4	method	method	NOUN
cana-832	17	5	,	,	PUNCT
cana-832	17	6	it	it	PRON
cana-832	17	7	effectively	effectively	ADV
cana-832	17	8	determines	determine	VERB
cana-832	17	9	the	the	DET
cana-832	17	10	best	good	ADJ
cana-832	17	11	cost	cost	NOUN
cana-832	17	12	for	for	ADP
cana-832	17	13	shipping	shipping	NOUN
cana-832	17	14	goods	good	NOUN
cana-832	17	15	from	from	ADP
cana-832	17	16	supply	supply	NOUN
cana-832	17	17	sockets	socket	NOUN
cana-832	17	18	to	to	ADP
cana-832	17	19	destination	destination	NOUN
cana-832	17	20	sockets	socket	NOUN
cana-832	17	21	.	.	PUNCT
cana-832	18	1	this	this	DET
cana-832	18	2	pioneering	pioneering	ADJ
cana-832	18	3	method	method	NOUN
cana-832	18	4	underscores	underscore	VERB
cana-832	18	5	the	the	DET
cana-832	18	6	importance	importance	NOUN
cana-832	18	7	of	of	ADP
cana-832	18	8	digitalizing	digitalize	VERB
cana-832	18	9	the	the	DET
cana-832	18	10	concepts	concept	NOUN
cana-832	18	11	and	and	CCONJ
cana-832	18	12	relationships	relationship	NOUN
cana-832	18	13	among	among	ADP
cana-832	18	14	topological	topological	ADJ
cana-832	18	15	spaces	space	NOUN
cana-832	18	16	,	,	PUNCT
cana-832	18	17	transportation	transportation	NOUN
cana-832	18	18	issues	issue	NOUN
cana-832	18	19	,	,	PUNCT
cana-832	18	20	and	and	CCONJ
cana-832	18	21	graph	graph	NOUN
cana-832	18	22	theory	theory	NOUN
cana-832	18	23	.	.	PUNCT
cana-832	19	1	moreover	moreover	ADV
cana-832	19	2	,	,	PUNCT
cana-832	19	3	it	it	PRON
cana-832	19	4	paves	pave	VERB
cana-832	19	5	the	the	DET
cana-832	19	6	way	way	NOUN
cana-832	19	7	for	for	ADP
cana-832	19	8	exploring	explore	VERB
cana-832	19	9	various	various	ADJ
cana-832	19	10	solutions	solution	NOUN
cana-832	19	11	to	to	ADP
cana-832	19	12	transportation	transportation	NOUN
cana-832	19	13	challenges	challenge	NOUN
cana-832	19	14	.	.	PUNCT
cana-832	20	1	keywords	keyword	NOUN
cana-832	20	2	:	:	PUNCT
cana-832	20	3	topological	topological	ADJ
cana-832	20	4	graphical	graphical	ADJ
cana-832	20	5	methodologies	methodology	NOUN
cana-832	20	6	;	;	PUNCT
cana-832	20	7	computational	computational	ADJ
cana-832	20	8	strategies	strategy	NOUN
cana-832	20	9	.	.	PUNCT
cana-832	21	1	1	1	X
cana-832	21	2	.	.	X
cana-832	21	3	introduction	introduction	NOUN
cana-832	21	4	in	in	ADP
cana-832	21	5	recent	recent	ADJ
cana-832	21	6	times	time	NOUN
cana-832	21	7	,	,	PUNCT
cana-832	21	8	mathematics	mathematics	PROPN
cana-832	21	9	has	have	AUX
cana-832	21	10	seen	see	VERB
cana-832	21	11	significant	significant	ADJ
cana-832	21	12	applications	application	NOUN
cana-832	21	13	in	in	ADP
cana-832	21	14	two	two	NUM
cana-832	21	15	major	major	ADJ
cana-832	21	16	domains	domain	NOUN
cana-832	21	17	:	:	PUNCT
cana-832	21	18	topology	topology	NOUN
cana-832	21	19	and	and	CCONJ
cana-832	21	20	graph	graph	NOUN
cana-832	21	21	theory	theory	NOUN
cana-832	21	22	.	.	PUNCT
cana-832	22	1	in	in	ADP
cana-832	22	2	2005	2005	NUM
cana-832	22	3	,	,	PUNCT
cana-832	22	4	antonie	antonie	PROPN
cana-832	22	5	vella	vella	PROPN
cana-832	22	6	pioneered	pioneer	VERB
cana-832	22	7	the	the	DET
cana-832	22	8	integration	integration	NOUN
cana-832	22	9	of	of	ADP
cana-832	22	10	topological	topological	ADJ
cana-832	22	11	properties	property	NOUN
cana-832	22	12	into	into	ADP
cana-832	22	13	graph	graph	NOUN
cana-832	22	14	theory	theory	NOUN
cana-832	22	15	.	.	PUNCT
cana-832	23	1	building	build	VERB
cana-832	23	2	on	on	ADP
cana-832	23	3	this	this	DET
cana-832	23	4	foundation	foundation	NOUN
cana-832	23	5	,	,	PUNCT
cana-832	23	6	vimala	vimala	PROPN
cana-832	23	7	and	and	CCONJ
cana-832	23	8	kalpana	kalpana	PROPN
cana-832	23	9	advanced	advance	VERB
cana-832	23	10	the	the	DET
cana-832	23	11	model	model	NOUN
cana-832	23	12	,	,	PUNCT
cana-832	23	13	known	know	VERB
cana-832	23	14	as	as	ADP
cana-832	23	15	the	the	DET
cana-832	23	16	topologized	topologize	VERB
cana-832	23	17	bipartite	bipartite	NOUN
cana-832	23	18	graph	graph	NOUN
cana-832	23	19	(	(	PUNCT
cana-832	23	20	tbg	tbg	NOUN
cana-832	23	21	)	)	PUNCT
cana-832	23	22	,	,	PUNCT
cana-832	23	23	applying	apply	VERB
cana-832	23	24	it	it	PRON
cana-832	23	25	to	to	ADP
cana-832	23	26	challenges	challenge	NOUN
cana-832	23	27	such	such	ADJ
cana-832	23	28	as	as	ADP
cana-832	23	29	matching	matching	NOUN
cana-832	23	30	and	and	CCONJ
cana-832	23	31	coloring	coloring	NOUN
cana-832	23	32	.	.	PUNCT
cana-832	24	1	one	one	NUM
cana-832	24	2	of	of	ADP
cana-832	24	3	the	the	DET
cana-832	24	4	most	most	ADV
cana-832	24	5	common	common	ADJ
cana-832	24	6	uses	use	NOUN
cana-832	24	7	of	of	ADP
cana-832	24	8	measurable	measurable	ADJ
cana-832	24	9	analysis	analysis	NOUN
cana-832	24	10	in	in	ADP
cana-832	24	11	addressing	address	VERB
cana-832	24	12	commercial	commercial	ADJ
cana-832	24	13	problems	problem	NOUN
cana-832	24	14	is	be	AUX
cana-832	24	15	optimizing	optimize	VERB
cana-832	24	16	the	the	DET
cana-832	24	17	circulation	circulation	NOUN
cana-832	24	18	of	of	ADP
cana-832	24	19	goods	good	NOUN
cana-832	24	20	,	,	PUNCT
cana-832	24	21	frequently	frequently	ADV
cana-832	24	22	referred	refer	VERB
cana-832	24	23	to	to	ADP
cana-832	24	24	as	as	ADP
cana-832	24	25	tp	tp	PROPN
cana-832	24	26	.	.	PUNCT
cana-832	25	1	the	the	DET
cana-832	25	2	primary	primary	ADJ
cana-832	25	3	goal	goal	NOUN
cana-832	25	4	is	be	AUX
cana-832	25	5	to	to	PART
cana-832	25	6	decrease	decrease	VERB
cana-832	25	7	delivery	delivery	NOUN
cana-832	25	8	costs	cost	NOUN
cana-832	25	9	while	while	SCONJ
cana-832	25	10	ensuring	ensure	VERB
cana-832	25	11	that	that	SCONJ
cana-832	25	12	the	the	DET
cana-832	25	13	demands	demand	NOUN
cana-832	25	14	of	of	ADP
cana-832	25	15	respective	respective	ADJ
cana-832	25	16	destination	destination	NOUN
cana-832	25	17	are	be	AUX
cana-832	25	18	met	meet	VERB
cana-832	25	19	,	,	PUNCT
cana-832	25	20	and	and	CCONJ
cana-832	25	21	delivery	delivery	NOUN
cana-832	25	22	locations	location	NOUN
cana-832	25	23	operate	operate	VERB
cana-832	25	24	within	within	ADP
cana-832	25	25	their	their	PRON
cana-832	25	26	capacity	capacity	NOUN
cana-832	25	27	.	.	PUNCT
cana-832	26	1	to	to	PART
cana-832	26	2	tackle	tackle	VERB
cana-832	26	3	a	a	DET
cana-832	26	4	transportation	transportation	NOUN
cana-832	26	5	problem	problem	NOUN
cana-832	26	6	effectively	effectively	ADV
cana-832	26	7	,	,	PUNCT
cana-832	26	8	key	key	ADJ
cana-832	26	9	decision	decision	NOUN
cana-832	26	10	parameters	parameter	NOUN
cana-832	26	11	like	like	ADP
cana-832	26	12	supply	supply	NOUN
cana-832	26	13	,	,	PUNCT
cana-832	26	14	demand	demand	NOUN
cana-832	26	15	,	,	PUNCT
cana-832	26	16	communications	communication	NOUN
cana-832	26	17	on	on	ADP
cana-832	26	18	applied	apply	VERB
cana-832	26	19	nonlinear	nonlinear	ADJ
cana-832	26	20	analysis	analysis	NOUN
cana-832	26	21	issn	issn	NOUN
cana-832	26	22	:	:	PUNCT
cana-832	26	23	1074	1074	NUM
cana-832	26	24	-	-	PUNCT
cana-832	26	25	133x	133x	NUM
cana-832	26	26	vol	vol	NOUN
cana-832	26	27	31	31	NUM
cana-832	26	28	no	no	NOUN
cana-832	26	29	.	.	PUNCT
cana-832	27	1	4s	4s	NUM
cana-832	27	2	(	(	PUNCT
cana-832	27	3	2024	2024	NUM
cana-832	27	4	)	)	PUNCT
cana-832	27	5	136	136	NUM
cana-832	27	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	27	7	and	and	CCONJ
cana-832	27	8	unit	unit	NOUN
cana-832	27	9	transportation	transportation	NOUN
cana-832	27	10	costs	cost	NOUN
cana-832	27	11	must	must	AUX
cana-832	27	12	be	be	AUX
cana-832	27	13	defined	define	VERB
cana-832	27	14	with	with	ADP
cana-832	27	15	precision	precision	NOUN
cana-832	27	16	.	.	PUNCT
cana-832	28	1	chanas	chana	NOUN
cana-832	28	2	et	et	PROPN
cana-832	28	3	al	al	PROPN
cana-832	28	4	.	.	PUNCT
cana-832	29	1	[	[	X
cana-832	29	2	2	2	X
cana-832	29	3	]	]	PUNCT
cana-832	29	4	introduced	introduce	VERB
cana-832	29	5	an	an	DET
cana-832	29	6	optimal	optimal	ADJ
cana-832	29	7	solution	solution	NOUN
cana-832	29	8	for	for	ADP
cana-832	29	9	transportation	transportation	NOUN
cana-832	29	10	problems	problem	NOUN
cana-832	29	11	(	(	PUNCT
cana-832	29	12	tp	tp	NOUN
cana-832	29	13	)	)	PUNCT
cana-832	29	14	in	in	ADP
cana-832	29	15	1996	1996	NUM
cana-832	29	16	.	.	PUNCT
cana-832	30	1	kadhim	kadhim	PROPN
cana-832	30	2	et	et	PROPN
cana-832	30	3	al	al	PROPN
cana-832	30	4	.	.	PUNCT
cana-832	31	1	[	[	X
cana-832	31	2	3	3	NUM
cana-832	31	3	]	]	PUNCT
cana-832	31	4	developed	develop	VERB
cana-832	31	5	the	the	DET
cana-832	31	6	modified	modified	ADJ
cana-832	31	7	kruskal	kruskal	NOUN
cana-832	31	8	’s	’s	PART
cana-832	31	9	algorithm	algorithm	NOUN
cana-832	31	10	in	in	ADP
cana-832	31	11	2015	2015	NUM
cana-832	31	12	.	.	PUNCT
cana-832	32	1	kaufmann	kaufmann	PROPN
cana-832	33	1	[	[	X
cana-832	33	2	4	4	X
cana-832	33	3	]	]	PUNCT
cana-832	33	4	presented	present	VERB
cana-832	33	5	a	a	DET
cana-832	33	6	graphical	graphical	ADJ
cana-832	33	7	approach	approach	NOUN
cana-832	33	8	for	for	ADP
cana-832	33	9	tp	tp	NOUN
cana-832	33	10	in	in	ADP
cana-832	33	11	2015	2015	NUM
cana-832	33	12	.	.	PUNCT
cana-832	34	1	koopsman	koopsman	VERB
cana-832	34	2	[	[	X
cana-832	34	3	5	5	NUM
cana-832	34	4	]	]	PUNCT
cana-832	34	5	proposed	propose	VERB
cana-832	34	6	the	the	DET
cana-832	34	7	utilization	utilization	NOUN
cana-832	34	8	of	of	ADP
cana-832	34	9	tp	tp	NOUN
cana-832	34	10	in	in	ADP
cana-832	34	11	1949	1949	NUM
cana-832	34	12	.	.	PUNCT
cana-832	35	1	mesbahuddin	mesbahuddin	NOUN
cana-832	35	2	ahmed	ahmed	PROPN
cana-832	35	3	et	et	PROPN
cana-832	35	4	al	al	PROPN
cana-832	35	5	.	.	PUNCT
cana-832	36	1	[	[	X
cana-832	36	2	6	6	NUM
cana-832	36	3	]	]	PUNCT
cana-832	36	4	offered	offer	VERB
cana-832	36	5	a	a	DET
cana-832	36	6	novel	novel	ADJ
cana-832	36	7	methodology	methodology	NOUN
cana-832	36	8	to	to	ADP
cana-832	36	9	solving	solve	VERB
cana-832	36	10	tp	tp	NOUN
cana-832	36	11	.	.	PUNCT
cana-832	37	1	santhi	santhi	PROPN
cana-832	37	2	et	et	PROPN
cana-832	37	3	al	al	PROPN
cana-832	37	4	.	.	PUNCT
cana-832	38	1	[	[	X
cana-832	38	2	7	7	NUM
cana-832	38	3	,	,	PUNCT
cana-832	38	4	8	8	NUM
cana-832	38	5	]	]	PUNCT
cana-832	38	6	and	and	CCONJ
cana-832	38	7	shungani	shungani	PROPN
cana-832	38	8	poonam	poonam	PROPN
cana-832	38	9	et	et	PROPN
cana-832	38	10	al	al	PROPN
cana-832	38	11	.	.	PUNCT
cana-832	39	1	[	[	X
cana-832	39	2	9	9	NUM
cana-832	39	3	]	]	PUNCT
cana-832	39	4	presented	present	VERB
cana-832	39	5	solutions	solution	NOUN
cana-832	39	6	for	for	ADP
cana-832	39	7	tp	tp	NOUN
cana-832	39	8	in	in	ADP
cana-832	39	9	a	a	DET
cana-832	39	10	fuzzy	fuzzy	ADJ
cana-832	39	11	environment	environment	NOUN
cana-832	39	12	in	in	ADP
cana-832	39	13	2016	2016	NUM
cana-832	39	14	.	.	PUNCT
cana-832	40	1	while	while	SCONJ
cana-832	40	2	many	many	ADJ
cana-832	40	3	researchers	researcher	NOUN
cana-832	40	4	have	have	AUX
cana-832	40	5	proposed	propose	VERB
cana-832	40	6	various	various	ADJ
cana-832	40	7	methods	method	NOUN
cana-832	40	8	to	to	PART
cana-832	40	9	find	find	VERB
cana-832	40	10	optimal	optimal	ADJ
cana-832	40	11	solutions	solution	NOUN
cana-832	40	12	for	for	ADP
cana-832	40	13	tp	tp	NOUN
cana-832	40	14	,	,	PUNCT
cana-832	40	15	there	there	PRON
cana-832	40	16	has	have	AUX
cana-832	40	17	been	be	AUX
cana-832	40	18	limited	limit	VERB
cana-832	40	19	exploration	exploration	NOUN
cana-832	40	20	of	of	ADP
cana-832	40	21	topological	topological	ADJ
cana-832	40	22	perspectives	perspective	NOUN
cana-832	40	23	in	in	ADP
cana-832	40	24	this	this	DET
cana-832	40	25	area	area	NOUN
cana-832	40	26	.	.	PUNCT
cana-832	41	1	therefore	therefore	ADV
cana-832	41	2	,	,	PUNCT
cana-832	41	3	this	this	DET
cana-832	41	4	article	article	NOUN
cana-832	41	5	introduces	introduce	VERB
cana-832	41	6	a	a	DET
cana-832	41	7	novel	novel	ADJ
cana-832	41	8	topological	topological	ADJ
cana-832	41	9	approach	approach	NOUN
cana-832	41	10	to	to	ADP
cana-832	41	11	achieving	achieve	VERB
cana-832	41	12	optimal	optimal	ADJ
cana-832	41	13	solutions	solution	NOUN
cana-832	41	14	for	for	ADP
cana-832	41	15	transportation	transportation	NOUN
cana-832	41	16	problems	problem	NOUN
cana-832	41	17	,	,	PUNCT
cana-832	41	18	building	build	VERB
cana-832	41	19	on	on	ADP
cana-832	41	20	the	the	DET
cana-832	41	21	innovative	innovative	ADJ
cana-832	41	22	approaches	approach	NOUN
cana-832	41	23	of	of	ADP
cana-832	41	24	the	the	DET
cana-832	41	25	topologized	topologize	VERB
cana-832	41	26	graph	graph	NOUN
cana-832	41	27	by	by	ADP
cana-832	41	28	antoine	antoine	PROPN
cana-832	41	29	vella	vella	PROPN
cana-832	42	1	[	[	X
cana-832	42	2	1	1	X
cana-832	42	3	]	]	PUNCT
cana-832	42	4	in	in	ADP
cana-832	42	5	2005	2005	NUM
cana-832	42	6	and	and	CCONJ
cana-832	42	7	vimala	vimala	PROPN
cana-832	42	8	et	et	PROPN
cana-832	42	9	al	al	PROPN
cana-832	42	10	.	.	PUNCT
cana-832	43	1	[	[	X
cana-832	43	2	10	10	NUM
cana-832	43	3	,	,	PUNCT
cana-832	43	4	11	11	NUM
cana-832	43	5	]	]	PUNCT
cana-832	43	6	in	in	ADP
cana-832	43	7	2017	2017	NUM
cana-832	43	8	.	.	PUNCT
cana-832	44	1	the	the	DET
cana-832	44	2	python	python	PROPN
cana-832	44	3	program	program	NOUN
cana-832	44	4	presented	present	VERB
cana-832	44	5	in	in	ADP
cana-832	44	6	this	this	DET
cana-832	44	7	article	article	NOUN
cana-832	44	8	implements	implement	VERB
cana-832	44	9	the	the	DET
cana-832	44	10	topologized	topologize	VERB
cana-832	44	11	graphical	graphical	ADJ
cana-832	44	12	method	method	NOUN
cana-832	44	13	,	,	PUNCT
cana-832	44	14	leveraging	leverage	VERB
cana-832	44	15	graph	graph	NOUN
cana-832	44	16	theory	theory	NOUN
cana-832	44	17	and	and	CCONJ
cana-832	44	18	digitalization	digitalization	NOUN
cana-832	44	19	techniques	technique	NOUN
cana-832	44	20	.	.	PUNCT
cana-832	45	1	this	this	DET
cana-832	45	2	approach	approach	NOUN
cana-832	45	3	offers	offer	VERB
cana-832	45	4	a	a	DET
cana-832	45	5	versatile	versatile	ADJ
cana-832	45	6	solution	solution	NOUN
cana-832	45	7	applicable	applicable	ADJ
cana-832	45	8	to	to	ADP
cana-832	45	9	a	a	DET
cana-832	45	10	wide	wide	ADJ
cana-832	45	11	range	range	NOUN
cana-832	45	12	of	of	ADP
cana-832	45	13	scenarios	scenario	NOUN
cana-832	45	14	,	,	PUNCT
cana-832	45	15	including	include	VERB
cana-832	45	16	transportation	transportation	NOUN
cana-832	45	17	and	and	CCONJ
cana-832	45	18	network	network	NOUN
cana-832	45	19	flow	flow	NOUN
cana-832	45	20	challenges	challenge	NOUN
cana-832	45	21	.	.	PUNCT
cana-832	46	1	by	by	ADP
cana-832	46	2	converting	convert	VERB
cana-832	46	3	the	the	DET
cana-832	46	4	problem	problem	NOUN
cana-832	46	5	into	into	ADP
cana-832	46	6	a	a	DET
cana-832	46	7	topologized	topologize	VERB
cana-832	46	8	graphical	graphical	ADJ
cana-832	46	9	(	(	PUNCT
cana-832	46	10	tg	tg	NOUN
cana-832	46	11	)	)	PUNCT
cana-832	46	12	representation	representation	NOUN
cana-832	46	13	,	,	PUNCT
cana-832	46	14	users	user	NOUN
cana-832	46	15	can	can	AUX
cana-832	46	16	efficiently	efficiently	ADV
cana-832	46	17	discover	discover	VERB
cana-832	46	18	optimal	optimal	ADJ
cana-832	46	19	solutions	solution	NOUN
cana-832	46	20	.	.	PUNCT
cana-832	47	1	this	this	DET
cana-832	47	2	tool	tool	NOUN
cana-832	47	3	proves	prove	VERB
cana-832	47	4	invaluable	invaluable	ADJ
cana-832	47	5	in	in	ADP
cana-832	47	6	fields	field	NOUN
cana-832	47	7	like	like	ADP
cana-832	47	8	logistics	logistic	NOUN
cana-832	47	9	,	,	PUNCT
cana-832	47	10	supply	supply	NOUN
cana-832	47	11	chain	chain	NOUN
cana-832	47	12	management	management	NOUN
cana-832	47	13	,	,	PUNCT
cana-832	47	14	and	and	CCONJ
cana-832	47	15	network	network	NOUN
cana-832	47	16	design	design	NOUN
cana-832	47	17	.	.	PUNCT
cana-832	48	1	this	this	DET
cana-832	48	2	article	article	NOUN
cana-832	48	3	comprises	comprise	VERB
cana-832	48	4	the	the	DET
cana-832	48	5	following	following	ADJ
cana-832	48	6	sections	section	NOUN
cana-832	48	7	:	:	PUNCT
cana-832	48	8	introduction	introduction	NOUN
cana-832	48	9	,	,	PUNCT
cana-832	48	10	preliminaries	preliminary	NOUN
cana-832	48	11	,	,	PUNCT
cana-832	48	12	proposed	propose	VERB
cana-832	48	13	algorithm	algorithm	NOUN
cana-832	48	14	,	,	PUNCT
cana-832	48	15	numerical	numerical	ADJ
cana-832	48	16	illustration	illustration	NOUN
cana-832	48	17	with	with	ADP
cana-832	48	18	computation	computation	NOUN
cana-832	48	19	techniques	technique	NOUN
cana-832	48	20	,	,	PUNCT
cana-832	48	21	conclusion	conclusion	NOUN
cana-832	48	22	and	and	CCONJ
cana-832	48	23	references	reference	NOUN
cana-832	48	24	.	.	PUNCT
cana-832	49	1	2	2	X
cana-832	49	2	.	.	X
cana-832	49	3	preliminaries	preliminary	NOUN
cana-832	49	4	numerous	numerous	ADJ
cana-832	49	5	methods	method	NOUN
cana-832	49	6	have	have	AUX
cana-832	49	7	been	be	AUX
cana-832	49	8	developed	develop	VERB
cana-832	49	9	to	to	PART
cana-832	49	10	achieve	achieve	VERB
cana-832	49	11	the	the	DET
cana-832	49	12	smallest	small	ADJ
cana-832	49	13	transportation	transportation	NOUN
cana-832	49	14	schedules	schedule	NOUN
cana-832	49	15	.	.	PUNCT
cana-832	50	1	it	it	PRON
cana-832	50	2	is	be	AUX
cana-832	50	3	essential	essential	ADJ
cana-832	50	4	to	to	PART
cana-832	50	5	recall	recall	VERB
cana-832	50	6	the	the	DET
cana-832	50	7	basic	basic	ADJ
cana-832	50	8	definitions	definition	NOUN
cana-832	50	9	of	of	ADP
cana-832	50	10	transportation	transportation	NOUN
cana-832	50	11	problem	problem	NOUN
cana-832	50	12	,	,	PUNCT
cana-832	50	13	bipartite	bipartite	NOUN
cana-832	50	14	graph	graph	NOUN
cana-832	50	15	,	,	PUNCT
cana-832	50	16	and	and	CCONJ
cana-832	50	17	topological	topological	ADJ
cana-832	50	18	spaces	space	NOUN
cana-832	50	19	,	,	PUNCT
cana-832	50	20	in	in	ADP
cana-832	50	21	addition	addition	NOUN
cana-832	50	22	to	to	ADP
cana-832	50	23	introducing	introduce	VERB
cana-832	50	24	the	the	DET
cana-832	50	25	concept	concept	NOUN
cana-832	50	26	of	of	ADP
cana-832	50	27	the	the	DET
cana-832	50	28	topologized	topologize	VERB
cana-832	50	29	graph	graph	NOUN
cana-832	50	30	.	.	PUNCT
cana-832	51	1	definition	definition	NOUN
cana-832	51	2	:	:	PUNCT
cana-832	51	3	topologized	topologize	VERB
cana-832	51	4	graph	graph	NOUN
cana-832	51	5	[	[	X
cana-832	51	6	1	1	X
cana-832	51	7	]	]	PUNCT
cana-832	51	8	a	a	DET
cana-832	51	9	topologized	topologize	VERB
cana-832	51	10	graph	graph	NOUN
cana-832	51	11	(	(	PUNCT
cana-832	51	12	tg	tg	INTJ
cana-832	51	13	)	)	PUNCT
cana-832	51	14	is	be	AUX
cana-832	51	15	comprising	comprise	VERB
cana-832	51	16	a	a	DET
cana-832	51	17	topology(τ	topology(τ	NOUN
cana-832	51	18	)	)	PUNCT
cana-832	51	19	of	of	ADP
cana-832	51	20	g	g	PROPN
cana-832	51	21	also	also	ADV
cana-832	51	22	satisfies	satisfy	VERB
cana-832	51	23	the	the	DET
cana-832	51	24	following	follow	VERB
cana-832	51	25	two	two	NUM
cana-832	51	26	conditions	condition	NOUN
cana-832	51	27	(	(	PUNCT
cana-832	51	28	i	i	NOUN
cana-832	51	29	)	)	PUNCT
cana-832	51	30	every	every	DET
cana-832	51	31	one	one	NUM
cana-832	51	32	-	-	PUNCT
cana-832	51	33	point	point	NOUN
cana-832	51	34	set	set	NOUN
cana-832	51	35	is	be	AUX
cana-832	51	36	open	open	ADJ
cana-832	51	37	set	set	VERB
cana-832	51	38	or	or	CCONJ
cana-832	51	39	the	the	DET
cana-832	51	40	closed	closed	ADJ
cana-832	51	41	set	set	NOUN
cana-832	51	42	in	in	ADP
cana-832	51	43	the	the	DET
cana-832	51	44	collection	collection	NOUN
cana-832	51	45	of	of	ADP
cana-832	51	46	subsets	subset	NOUN
cana-832	51	47	of	of	ADP
cana-832	51	48	g.	g.	PROPN
cana-832	51	49	(	(	PUNCT
cana-832	51	50	ii	ii	PROPN
cana-832	51	51	)	)	PUNCT
cana-832	51	52	for	for	ADP
cana-832	51	53	all	all	PRON
cana-832	51	54	g	g	PROPN
cana-832	51	55	∈	∈	PROPN
cana-832	51	56	g	g	NOUN
cana-832	51	57	such	such	ADJ
cana-832	51	58	that	that	PRON
cana-832	51	59	|𝜕(𝑔)|	|𝜕(𝑔)|	ADP
cana-832	51	60	≤	≤	ADV
cana-832	51	61	2	2	NUM
cana-832	51	62	,	,	PUNCT
cana-832	51	63	𝜕(𝑔	𝜕(𝑔	X
cana-832	51	64	)	)	PUNCT
cana-832	51	65	is	be	AUX
cana-832	51	66	symbolized	symbolize	VERB
cana-832	51	67	for	for	ADP
cana-832	51	68	the	the	DET
cana-832	51	69	boundary	boundary	NOUN
cana-832	51	70	of	of	ADP
cana-832	51	71	a	a	DET
cana-832	51	72	vertex	vertex	NOUN
cana-832	51	73	𝑔.	𝑔.	NOUN
cana-832	51	74	at	at	ADP
cana-832	51	75	this	this	DET
cana-832	51	76	point	point	NOUN
cana-832	51	77	the	the	DET
cana-832	51	78	topology	topology	NOUN
cana-832	51	79	is	be	AUX
cana-832	51	80	well	well	ADV
cana-832	51	81	-	-	PUNCT
cana-832	51	82	defined	define	VERB
cana-832	51	83	on	on	ADP
cana-832	51	84	the	the	DET
cana-832	51	85	graph	graph	NOUN
cana-832	51	86	,	,	PUNCT
cana-832	51	87	meanwhile	meanwhile	ADV
cana-832	51	88	the	the	DET
cana-832	51	89	space	space	NOUN
cana-832	51	90	g	g	NOUN
cana-832	51	91	is	be	AUX
cana-832	51	92	the	the	DET
cana-832	51	93	union	union	NOUN
cana-832	51	94	of	of	ADP
cana-832	51	95	vertices	vertex	NOUN
cana-832	51	96	and	and	CCONJ
cana-832	51	97	edges	edge	NOUN
cana-832	51	98	.	.	PUNCT
cana-832	52	1	3	3	X
cana-832	52	2	.	.	X
cana-832	52	3	computational	computational	ADJ
cana-832	52	4	techniques	technique	NOUN
cana-832	52	5	of	of	ADP
cana-832	52	6	topologized	topologize	VERB
cana-832	52	7	graph	graph	NOUN
cana-832	52	8	method	method	NOUN
cana-832	52	9	transportation	transportation	NOUN
cana-832	52	10	problems	problem	NOUN
cana-832	52	11	are	be	AUX
cana-832	52	12	normally	normally	ADV
cana-832	52	13	resolved	resolve	VERB
cana-832	52	14	by	by	ADP
cana-832	52	15	means	mean	NOUN
cana-832	52	16	of	of	ADP
cana-832	52	17	methods	method	NOUN
cana-832	52	18	such	such	ADJ
cana-832	52	19	as	as	ADP
cana-832	52	20	the	the	DET
cana-832	52	21	modi	modi	PROPN
cana-832	52	22	method	method	VERB
cana-832	52	23	,	,	PUNCT
cana-832	52	24	stepping	stepping	ADJ
cana-832	52	25	stone	stone	NOUN
cana-832	52	26	method	method	NOUN
cana-832	52	27	,	,	PUNCT
cana-832	52	28	and	and	CCONJ
cana-832	52	29	zero	zero	NUM
cana-832	52	30	-	-	PUNCT
cana-832	52	31	point	point	NOUN
cana-832	52	32	method	method	NOUN
cana-832	52	33	,	,	PUNCT
cana-832	52	34	among	among	ADP
cana-832	52	35	others	other	NOUN
cana-832	52	36	,	,	PUNCT
cana-832	52	37	which	which	PRON
cana-832	52	38	are	be	AUX
cana-832	52	39	all	all	PRON
cana-832	52	40	numerical	numerical	ADJ
cana-832	52	41	approaches	approach	NOUN
cana-832	52	42	.	.	PUNCT
cana-832	53	1	in	in	ADP
cana-832	53	2	this	this	DET
cana-832	53	3	study	study	NOUN
cana-832	53	4	,	,	PUNCT
cana-832	53	5	we	we	PRON
cana-832	53	6	familiarize	familiarize	VERB
cana-832	53	7	a	a	DET
cana-832	53	8	novel	novel	ADJ
cana-832	53	9	technique	technique	NOUN
cana-832	53	10	for	for	ADP
cana-832	53	11	solving	solve	VERB
cana-832	53	12	tp	tp	NOUN
cana-832	53	13	from	from	ADP
cana-832	53	14	a	a	DET
cana-832	53	15	topological	topological	ADJ
cana-832	53	16	perspective	perspective	NOUN
cana-832	53	17	consuming	consume	VERB
cana-832	53	18	computational	computational	ADJ
cana-832	53	19	techniques	technique	NOUN
cana-832	53	20	.	.	PUNCT
cana-832	54	1	initially	initially	ADV
cana-832	54	2	,	,	PUNCT
cana-832	54	3	we	we	PRON
cana-832	54	4	translate	translate	VERB
cana-832	54	5	the	the	DET
cana-832	54	6	standard	standard	ADJ
cana-832	54	7	transportation	transportation	NOUN
cana-832	54	8	table	table	NOUN
cana-832	54	9	into	into	ADP
cana-832	54	10	a	a	DET
cana-832	54	11	graphical	graphical	ADJ
cana-832	54	12	depiction	depiction	NOUN
cana-832	54	13	,	,	PUNCT
cana-832	54	14	then	then	ADV
cana-832	54	15	transform	transform	VERB
cana-832	54	16	it	it	PRON
cana-832	54	17	into	into	ADP
cana-832	54	18	a	a	DET
cana-832	54	19	tg	tg	PROPN
cana-832	54	20	representation	representation	NOUN
cana-832	54	21	.	.	PUNCT
cana-832	55	1	this	this	DET
cana-832	55	2	innovative	innovative	ADJ
cana-832	55	3	approach	approach	NOUN
cana-832	55	4	marks	mark	VERB
cana-832	55	5	a	a	DET
cana-832	55	6	significant	significant	ADJ
cana-832	55	7	advancement	advancement	NOUN
cana-832	55	8	in	in	ADP
cana-832	55	9	finding	find	VERB
cana-832	55	10	solutions	solution	NOUN
cana-832	55	11	to	to	ADP
cana-832	55	12	transportation	transportation	NOUN
cana-832	55	13	problems	problem	NOUN
cana-832	55	14	.	.	PUNCT
cana-832	56	1	our	our	PRON
cana-832	56	2	proposed	propose	VERB
cana-832	56	3	method	method	NOUN
cana-832	56	4	is	be	AUX
cana-832	56	5	simpler	simple	ADJ
cana-832	56	6	than	than	ADP
cana-832	56	7	existing	exist	VERB
cana-832	56	8	methods	method	NOUN
cana-832	56	9	and	and	CCONJ
cana-832	56	10	yields	yield	VERB
cana-832	56	11	an	an	DET
cana-832	56	12	optimal	optimal	ADJ
cana-832	56	13	solution	solution	NOUN
cana-832	56	14	with	with	ADP
cana-832	56	15	lower	low	ADJ
cana-832	56	16	costs	cost	NOUN
cana-832	56	17	compared	compare	VERB
cana-832	56	18	to	to	ADP
cana-832	56	19	traditional	traditional	ADJ
cana-832	56	20	approaches	approach	NOUN
cana-832	56	21	.	.	PUNCT
cana-832	57	1	3.1	3.1	NUM
cana-832	57	2	recommended	recommend	VERB
cana-832	57	3	algorithm	algorithm	NOUN
cana-832	57	4	the	the	DET
cana-832	57	5	projected	project	VERB
cana-832	57	6	algorithm	algorithm	NOUN
cana-832	57	7	comprises	comprise	VERB
cana-832	57	8	the	the	DET
cana-832	57	9	succeeding	succeed	VERB
cana-832	57	10	steps	step	NOUN
cana-832	57	11	:	:	PUNCT
cana-832	57	12	step	step	NOUN
cana-832	57	13	1	1	NUM
cana-832	57	14	:	:	PUNCT
cana-832	57	15	build	build	VERB
cana-832	57	16	a	a	DET
cana-832	57	17	balanced	balanced	ADJ
cana-832	57	18	transportation	transportation	NOUN
cana-832	57	19	table	table	NOUN
cana-832	57	20	(	(	PUNCT
cana-832	57	21	∑	∑	ADV
cana-832	57	22	𝑎𝑖	𝑎𝑖	ADP
cana-832	57	23	𝑚	𝑚	X
cana-832	57	24	𝑖=1	𝑖=1	PUNCT
cana-832	57	25	=	=	PUNCT
cana-832	57	26	∑	∑	PUNCT
cana-832	57	27	𝑏𝑗	𝑏𝑗	PROPN
cana-832	57	28	𝑛	𝑛	PROPN
cana-832	57	29	𝑗=1	𝑗=1	PROPN
cana-832	57	30	)	)	PUNCT
cana-832	57	31	for	for	ADP
cana-832	57	32	the	the	DET
cana-832	57	33	given	give	VERB
cana-832	57	34	tp	tp	NOUN
cana-832	57	35	.	.	PUNCT
cana-832	57	36	communications	communication	NOUN
cana-832	57	37	on	on	ADP
cana-832	57	38	applied	apply	VERB
cana-832	57	39	nonlinear	nonlinear	ADJ
cana-832	57	40	analysis	analysis	NOUN
cana-832	57	41	issn	issn	NOUN
cana-832	57	42	:	:	PUNCT
cana-832	57	43	1074	1074	NUM
cana-832	57	44	-	-	PUNCT
cana-832	57	45	133x	133x	NUM
cana-832	57	46	vol	vol	NOUN
cana-832	57	47	31	31	NUM
cana-832	57	48	no	no	NOUN
cana-832	57	49	.	.	PUNCT
cana-832	58	1	4s	4s	NUM
cana-832	58	2	(	(	PUNCT
cana-832	58	3	2024	2024	NUM
cana-832	58	4	)	)	PUNCT
cana-832	58	5	137	137	NUM
cana-832	58	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	58	7	step	step	NOUN
cana-832	58	8	2	2	NUM
cana-832	58	9	:	:	PUNCT
cana-832	58	10	if	if	SCONJ
cana-832	58	11	it	it	PRON
cana-832	58	12	is	be	AUX
cana-832	58	13	an	an	DET
cana-832	58	14	unbalanced	unbalanced	ADJ
cana-832	58	15	tp	tp	NOUN
cana-832	58	16	,	,	PUNCT
cana-832	58	17	modify	modify	VERB
cana-832	58	18	into	into	ADP
cana-832	58	19	a	a	DET
cana-832	58	20	well	well	ADV
cana-832	58	21	-	-	PUNCT
cana-832	58	22	adjusted	adjust	VERB
cana-832	58	23	tp	tp	NOUN
cana-832	58	24	by	by	ADP
cana-832	58	25	adding	add	VERB
cana-832	58	26	row	row	NOUN
cana-832	58	27	or	or	CCONJ
cana-832	58	28	column	column	NOUN
cana-832	58	29	with	with	ADP
cana-832	58	30	suitable	suitable	ADJ
cana-832	58	31	supply	supply	NOUN
cana-832	58	32	or	or	CCONJ
cana-832	58	33	demand	demand	VERB
cana-832	58	34	quantity	quantity	NOUN
cana-832	58	35	with	with	ADP
cana-832	58	36	zero	zero	NUM
cana-832	58	37	cost	cost	NOUN
cana-832	58	38	.	.	PUNCT
cana-832	59	1	step	step	NOUN
cana-832	59	2	3	3	NUM
cana-832	59	3	:	:	PUNCT
cana-832	59	4	represent	represent	VERB
cana-832	59	5	the	the	DET
cana-832	59	6	tp	tp	NOUN
cana-832	59	7	in	in	ADP
cana-832	59	8	a	a	DET
cana-832	59	9	diagram	diagram	NOUN
cana-832	59	10	and	and	CCONJ
cana-832	59	11	consider	consider	VERB
cana-832	59	12	available	available	ADJ
cana-832	59	13	&	&	CCONJ
cana-832	59	14	requirement	requirement	NOUN
cana-832	59	15	places	place	NOUN
cana-832	59	16	as	as	SCONJ
cana-832	59	17	vertices	vertex	NOUN
cana-832	59	18	𝑠𝑖	𝑠𝑖	NOUN
cana-832	59	19	&	&	CCONJ
cana-832	59	20	𝑑𝑗	𝑑𝑗	PROPN
cana-832	59	21	and	and	CCONJ
cana-832	59	22	connecting	connect	VERB
cana-832	59	23	lines	line	NOUN
cana-832	59	24	are	be	AUX
cana-832	59	25	denoted	denote	VERB
cana-832	59	26	for	for	ADP
cana-832	59	27	unit	unit	NOUN
cana-832	59	28	arrangement	arrangement	NOUN
cana-832	59	29	cost	cost	NOUN
cana-832	59	30	𝑐𝑖𝑗	𝑐𝑖𝑗	VERB
cana-832	59	31	from	from	ADP
cana-832	59	32	𝑖𝑡ℎ	𝑖𝑡ℎ	NOUN
cana-832	59	33	available	available	ADJ
cana-832	59	34	place	place	NOUN
cana-832	59	35	to	to	PART
cana-832	59	36	𝑗𝑡ℎ	𝑗𝑡ℎ	VERB
cana-832	59	37	requirement	requirement	NOUN
cana-832	59	38	place	place	NOUN
cana-832	59	39	.	.	PUNCT
cana-832	60	1	step	step	NOUN
cana-832	60	2	4	4	NUM
cana-832	60	3	:	:	PUNCT
cana-832	60	4	recognize	recognize	VERB
cana-832	60	5	the	the	DET
cana-832	60	6	foremost	foremost	ADJ
cana-832	60	7	two	two	NUM
cana-832	60	8	minimum	minimum	ADJ
cana-832	60	9	arrangement	arrangement	NOUN
cana-832	60	10	cost	cost	NOUN
cana-832	60	11	of	of	ADP
cana-832	60	12	each	each	DET
cana-832	60	13	row	row	NOUN
cana-832	60	14	&	&	CCONJ
cana-832	60	15	column	column	NOUN
cana-832	60	16	then	then	ADV
cana-832	60	17	modify	modify	VERB
cana-832	60	18	the	the	DET
cana-832	60	19	graphical	graphical	ADJ
cana-832	60	20	depiction	depiction	NOUN
cana-832	60	21	with	with	ADP
cana-832	60	22	the	the	DET
cana-832	60	23	selected	select	VERB
cana-832	60	24	nodes	node	NOUN
cana-832	60	25	.	.	PUNCT
cana-832	61	1	step	step	NOUN
cana-832	61	2	5	5	NUM
cana-832	61	3	:	:	PUNCT
cana-832	61	4	create	create	VERB
cana-832	61	5	a	a	DET
cana-832	61	6	topological	topological	ADJ
cana-832	61	7	space	space	NOUN
cana-832	61	8	consisting	consist	VERB
cana-832	61	9	of	of	ADP
cana-832	61	10	vertices	vertex	NOUN
cana-832	61	11	𝑆𝑖	𝑆𝑖	PROPN
cana-832	61	12	,	,	PUNCT
cana-832	61	13	𝐷𝑗	𝐷𝑗	PROPN
cana-832	61	14	,	,	PUNCT
cana-832	61	15	(	(	PUNCT
cana-832	61	16	𝑖	𝑖	X
cana-832	61	17	,	,	PUNCT
cana-832	61	18	𝑗	𝑗	PROPN
cana-832	61	19	∈	∈	PROPN
cana-832	61	20	𝑁	𝑁	PROPN
cana-832	61	21	,	,	PUNCT
cana-832	61	22	𝑁	𝑁	PROPN
cana-832	61	23	𝑖𝑠	𝑖𝑠	ADJ
cana-832	61	24	𝑡ℎ𝑒	𝑡ℎ𝑒	ADJ
cana-832	61	25	𝑛𝑎𝑡𝑢𝑟𝑎𝑙	𝑛𝑎𝑡𝑢𝑟𝑎𝑙	NOUN
cana-832	61	26	𝑛𝑢𝑚𝑏𝑒𝑟𝑠	𝑛𝑢𝑚𝑏𝑒𝑟𝑠	ADJ
cana-832	61	27	)	)	PUNCT
cana-832	61	28	and	and	CCONJ
cana-832	61	29	connecting	connect	VERB
cana-832	61	30	lines	line	NOUN
cana-832	61	31	𝑒𝑖𝑗	𝑒𝑖𝑗	ADV
cana-832	61	32	of	of	ADP
cana-832	61	33	the	the	DET
cana-832	61	34	improved	improved	ADJ
cana-832	61	35	graph	graph	NOUN
cana-832	61	36	.	.	PUNCT
cana-832	62	1	if	if	SCONJ
cana-832	62	2	the	the	DET
cana-832	62	3	improved	improved	ADJ
cana-832	62	4	graph	graph	NOUN
cana-832	62	5	obliges	oblige	VERB
cana-832	62	6	the	the	DET
cana-832	62	7	two	two	NUM
cana-832	62	8	necessary	necessary	ADJ
cana-832	62	9	conditions	condition	NOUN
cana-832	62	10	of	of	ADP
cana-832	62	11	a	a	DET
cana-832	62	12	tg	tg	PROPN
cana-832	62	13	compute	compute	NOUN
cana-832	62	14	from	from	ADP
cana-832	62	15	the	the	DET
cana-832	62	16	python	python	NOUN
cana-832	62	17	coding	coding	NOUN
cana-832	62	18	,	,	PUNCT
cana-832	62	19	continue	continue	VERB
cana-832	62	20	to	to	ADP
cana-832	62	21	the	the	DET
cana-832	62	22	succeeding	succeed	VERB
cana-832	62	23	step	step	NOUN
cana-832	62	24	;	;	PUNCT
cana-832	62	25	or	or	CCONJ
cana-832	62	26	else	else	ADV
cana-832	62	27	,	,	PUNCT
cana-832	62	28	reschedule	reschedule	VERB
cana-832	62	29	the	the	DET
cana-832	62	30	graph	graph	NOUN
cana-832	62	31	to	to	PART
cana-832	62	32	meet	meet	VERB
cana-832	62	33	these	these	DET
cana-832	62	34	necessary	necessary	ADJ
cana-832	62	35	conditions	condition	NOUN
cana-832	62	36	.	.	PUNCT
cana-832	63	1	step	step	NOUN
cana-832	63	2	6	6	NUM
cana-832	63	3	:	:	PUNCT
cana-832	63	4	categorize	categorize	VERB
cana-832	63	5	the	the	DET
cana-832	63	6	vertex	vertex	NOUN
cana-832	63	7	in	in	ADP
cana-832	63	8	the	the	DET
cana-832	63	9	tg	tg	PROPN
cana-832	63	10	which	which	PRON
cana-832	63	11	consumes	consume	VERB
cana-832	63	12	the	the	DET
cana-832	63	13	minimum	minimum	ADJ
cana-832	63	14	transportation	transportation	NOUN
cana-832	63	15	cost	cost	NOUN
cana-832	63	16	and	and	CCONJ
cana-832	63	17	distribute	distribute	VERB
cana-832	63	18	𝑥𝑖𝑗	𝑥𝑖𝑗	PROPN
cana-832	63	19	=	=	SYM
cana-832	63	20	minimum	minimum	ADJ
cana-832	63	21	{	{	PUNCT
cana-832	63	22	𝑎𝑖	𝑎𝑖	PROPN
cana-832	63	23	,	,	PUNCT
cana-832	63	24	𝑏𝑗	𝑏𝑗	NOUN
cana-832	63	25	}	}	PUNCT
cana-832	63	26	•	•	NUM
cana-832	63	27	sub	sub	NOUN
cana-832	63	28	condition	condition	NOUN
cana-832	63	29	(	(	PUNCT
cana-832	63	30	i	i	NOUN
cana-832	63	31	):	):	PUNCT
cana-832	63	32	if	if	SCONJ
cana-832	63	33	minimum{𝑎𝑖	minimum{𝑎𝑖	PROPN
cana-832	63	34	,	,	PUNCT
cana-832	63	35	𝑏𝑗	𝑏𝑗	NOUN
cana-832	63	36	}	}	PUNCT
cana-832	63	37	=	=	VERB
cana-832	63	38	𝑎𝑖	𝑎𝑖	CCONJ
cana-832	63	39	then	then	ADV
cana-832	63	40	distribute	distribute	VERB
cana-832	63	41	𝑥𝑖𝑗	𝑥𝑖𝑗	PROPN
cana-832	63	42	=	=	PUNCT
cana-832	63	43	𝑎𝑖	𝑎𝑖	ADV
cana-832	63	44	and	and	CCONJ
cana-832	63	45	skip	skip	VERB
cana-832	63	46	the	the	DET
cana-832	63	47	𝑖𝑡ℎ	𝑖𝑡ℎ	NOUN
cana-832	63	48	available	available	ADJ
cana-832	63	49	place	place	NOUN
cana-832	63	50	and	and	CCONJ
cana-832	63	51	decrease	decrease	NOUN
cana-832	63	52	𝑎𝑖	𝑎𝑖	INTJ
cana-832	63	53	at	at	ADP
cana-832	63	54	requirement	requirement	NOUN
cana-832	63	55	place	place	NOUN
cana-832	63	56	𝐷𝑗	𝐷𝑗	PROPN
cana-832	63	57	,	,	PUNCT
cana-832	63	58	then	then	ADV
cana-832	63	59	proceed	proceed	VERB
cana-832	63	60	to	to	ADP
cana-832	63	61	the	the	DET
cana-832	63	62	succeeding	succeed	VERB
cana-832	63	63	step	step	NOUN
cana-832	63	64	.	.	PUNCT
cana-832	64	1	•	•	NUM
cana-832	64	2	sub	sub	NOUN
cana-832	64	3	condition	condition	NOUN
cana-832	64	4	(	(	PUNCT
cana-832	64	5	ii	ii	NOUN
cana-832	64	6	):	):	PUNCT
cana-832	64	7	if	if	SCONJ
cana-832	64	8	minimum{𝑎𝑖	minimum{𝑎𝑖	PROPN
cana-832	64	9	,	,	PUNCT
cana-832	64	10	𝑏𝑗	𝑏𝑗	NOUN
cana-832	64	11	}	}	PUNCT
cana-832	64	12	=	=	SYM
cana-832	64	13	𝑏𝑗	𝑏𝑗	PROPN
cana-832	64	14	then	then	ADV
cana-832	64	15	distribute	distribute	VERB
cana-832	64	16	𝑥𝑖𝑗	𝑥𝑖𝑗	PROPN
cana-832	64	17	=	=	SYM
cana-832	64	18	𝑏𝑗	𝑏𝑗	PROPN
cana-832	64	19	and	and	CCONJ
cana-832	64	20	skip	skip	VERB
cana-832	64	21	the	the	DET
cana-832	64	22	𝑗𝑡ℎ	𝑗𝑡ℎ	ADJ
cana-832	64	23	requirement	requirement	NOUN
cana-832	64	24	place	place	NOUN
cana-832	64	25	and	and	CCONJ
cana-832	64	26	decrease	decrease	VERB
cana-832	64	27	𝑏𝑗	𝑏𝑗	PROPN
cana-832	64	28	at	at	ADP
cana-832	64	29	supply	supply	NOUN
cana-832	64	30	point	point	NOUN
cana-832	64	31	𝑆𝑖	𝑆𝑖	PROPN
cana-832	64	32	,	,	PUNCT
cana-832	64	33	then	then	ADV
cana-832	64	34	progress	progress	VERB
cana-832	64	35	to	to	ADP
cana-832	64	36	the	the	DET
cana-832	64	37	succeeding	succeed	VERB
cana-832	64	38	step	step	NOUN
cana-832	64	39	.	.	PUNCT
cana-832	65	1	•	•	NUM
cana-832	65	2	sub	sub	NOUN
cana-832	65	3	condition	condition	NOUN
cana-832	65	4	(	(	PUNCT
cana-832	65	5	iii	iii	NOUN
cana-832	65	6	):	):	PUNCT
cana-832	65	7	if	if	SCONJ
cana-832	65	8	min{𝑎𝑖	min{𝑎𝑖	NOUN
cana-832	65	9	,	,	PUNCT
cana-832	65	10	𝑏𝑗	𝑏𝑗	NOUN
cana-832	65	11	}	}	PUNCT
cana-832	65	12	=	=	PUNCT
cana-832	65	13	𝑎𝑖	𝑎𝑖	PROPN
cana-832	65	14	=	=	SYM
cana-832	65	15	𝑏𝑗	𝑏𝑗	PROPN
cana-832	65	16	then	then	ADV
cana-832	65	17	distribute	distribute	VERB
cana-832	65	18	𝑥𝑖𝑗	𝑥𝑖𝑗	PROPN
cana-832	65	19	=	=	PUNCT
cana-832	65	20	𝑎𝑖	𝑎𝑖	PROPN
cana-832	65	21	=	=	SYM
cana-832	65	22	𝑏𝑗	𝑏𝑗	PROPN
cana-832	65	23	and	and	CCONJ
cana-832	65	24	skip	skip	VERB
cana-832	65	25	both	both	CCONJ
cana-832	65	26	available	available	ADJ
cana-832	65	27	place	place	NOUN
cana-832	65	28	and	and	CCONJ
cana-832	65	29	requirement	requirement	NOUN
cana-832	65	30	place	place	NOUN
cana-832	65	31	further	far	ADV
cana-832	65	32	proceed	proceed	VERB
cana-832	65	33	to	to	ADP
cana-832	65	34	the	the	DET
cana-832	65	35	succeeding	succeed	VERB
cana-832	65	36	step	step	NOUN
cana-832	65	37	.	.	PUNCT
cana-832	66	1	step	step	NOUN
cana-832	66	2	7	7	NUM
cana-832	66	3	:	:	PUNCT
cana-832	66	4	compute	compute	VERB
cana-832	66	5	new	new	ADJ
cana-832	66	6	available	available	ADJ
cana-832	66	7	and	and	CCONJ
cana-832	66	8	requirement	requirement	NOUN
cana-832	66	9	for	for	ADP
cana-832	66	10	outstanding	outstanding	ADJ
cana-832	66	11	quantities	quantity	NOUN
cana-832	66	12	at	at	ADP
cana-832	66	13	𝑆𝑖	𝑆𝑖	PROPN
cana-832	66	14	&	&	CCONJ
cana-832	66	15	𝐷𝑗	𝐷𝑗	PROPN
cana-832	66	16	and	and	CCONJ
cana-832	66	17	recall	recall	VERB
cana-832	66	18	the	the	DET
cana-832	66	19	procedure	procedure	NOUN
cana-832	66	20	in	in	ADP
cana-832	66	21	step	step	NOUN
cana-832	66	22	6	6	NUM
cana-832	66	23	until	until	ADP
cana-832	66	24	all	all	PRON
cana-832	66	25	available	available	ADJ
cana-832	66	26	and	and	CCONJ
cana-832	66	27	requirement	requirement	NOUN
cana-832	66	28	are	be	AUX
cana-832	66	29	satisfied	satisfied	ADJ
cana-832	66	30	.	.	PUNCT
cana-832	67	1	step	step	NOUN
cana-832	67	2	8	8	NUM
cana-832	67	3	:	:	PUNCT
cana-832	67	4	suppose	suppose	VERB
cana-832	67	5	some	some	DET
cana-832	67	6	numbers	number	NOUN
cana-832	67	7	at	at	ADP
cana-832	67	8	𝑎𝑖	𝑎𝑖	ADP
cana-832	67	9	or	or	CCONJ
cana-832	67	10	𝑏𝑗	𝑏𝑗	PROPN
cana-832	67	11	are	be	AUX
cana-832	67	12	not	not	PART
cana-832	67	13	distributed	distribute	VERB
cana-832	67	14	at	at	ADP
cana-832	67	15	any	any	DET
cana-832	67	16	available	available	ADJ
cana-832	67	17	and	and	CCONJ
cana-832	67	18	requirement	requirement	NOUN
cana-832	67	19	places	place	NOUN
cana-832	67	20	identify	identify	VERB
cana-832	67	21	that	that	DET
cana-832	67	22	specific	specific	ADJ
cana-832	67	23	vertex	vertex	NOUN
cana-832	67	24	,	,	PUNCT
cana-832	67	25	include	include	VERB
cana-832	67	26	a	a	DET
cana-832	67	27	connecting	connect	VERB
cana-832	67	28	line	line	NOUN
cana-832	67	29	and	and	CCONJ
cana-832	67	30	distribute	distribute	VERB
cana-832	67	31	hence	hence	ADV
cana-832	67	32	to	to	PART
cana-832	67	33	fulfil	fulfil	VERB
cana-832	67	34	the	the	DET
cana-832	67	35	residual	residual	ADJ
cana-832	67	36	available	available	ADJ
cana-832	67	37	and	and	CCONJ
cana-832	67	38	requirement	requirement	NOUN
cana-832	67	39	numbers	number	NOUN
cana-832	67	40	.	.	PUNCT
cana-832	68	1	step	step	NOUN
cana-832	68	2	9	9	NUM
cana-832	68	3	:	:	PUNCT
cana-832	68	4	if	if	SCONJ
cana-832	68	5	all	all	PRON
cana-832	68	6	available	available	ADJ
cana-832	68	7	and	and	CCONJ
cana-832	68	8	requirement	requirement	NOUN
cana-832	68	9	places	place	NOUN
cana-832	68	10	have	have	VERB
cana-832	68	11	two	two	NUM
cana-832	68	12	or	or	CCONJ
cana-832	68	13	three	three	NUM
cana-832	68	14	distributions	distribution	NOUN
cana-832	68	15	,	,	PUNCT
cana-832	68	16	this	this	PRON
cana-832	68	17	indicates	indicate	VERB
cana-832	68	18	the	the	DET
cana-832	68	19	best	good	ADJ
cana-832	68	20	solution	solution	NOUN
cana-832	68	21	for	for	ADP
cana-832	68	22	the	the	DET
cana-832	68	23	taken	take	VERB
cana-832	68	24	tp	tp	NOUN
cana-832	68	25	.	.	PUNCT
cana-832	69	1	if	if	SCONJ
cana-832	69	2	not	not	PART
cana-832	69	3	,	,	PUNCT
cana-832	69	4	fine	fine	ADJ
cana-832	69	5	-	-	PUNCT
cana-832	69	6	tune	tune	NOUN
cana-832	69	7	the	the	DET
cana-832	69	8	tg	tg	PROPN
cana-832	69	9	and	and	CCONJ
cana-832	69	10	recall	recall	VERB
cana-832	69	11	steps	step	NOUN
cana-832	69	12	5	5	NUM
cana-832	69	13	through	through	ADP
cana-832	69	14	9	9	NUM
cana-832	69	15	.	.	NOUN
cana-832	69	16	3.2	3.2	NUM
cana-832	69	17	numerical	numerical	ADJ
cana-832	69	18	example	example	NOUN
cana-832	69	19	a	a	DET
cana-832	69	20	transport	transport	NOUN
cana-832	69	21	corporation	corporation	NOUN
cana-832	69	22	is	be	AUX
cana-832	69	23	scheduling	schedule	VERB
cana-832	69	24	to	to	PART
cana-832	69	25	dispense	dispense	VERB
cana-832	69	26	its	its	PRON
cana-832	69	27	preserved	preserve	VERB
cana-832	69	28	automobiles	automobile	NOUN
cana-832	69	29	to	to	ADP
cana-832	69	30	towns	town	NOUN
cana-832	69	31	a	a	DET
cana-832	69	32	,	,	PUNCT
cana-832	69	33	b	b	NOUN
cana-832	69	34	,	,	PUNCT
cana-832	69	35	and	and	CCONJ
cana-832	69	36	c.	c.	PROPN
cana-832	69	37	the	the	DET
cana-832	69	38	company	company	NOUN
cana-832	69	39	's	's	PART
cana-832	69	40	executives	executive	NOUN
cana-832	69	41	have	have	AUX
cana-832	69	42	arranged	arrange	VERB
cana-832	69	43	shipping	shipping	NOUN
cana-832	69	44	tables	table	NOUN
cana-832	69	45	that	that	PRON
cana-832	69	46	outline	outline	VERB
cana-832	69	47	the	the	DET
cana-832	69	48	costs	cost	NOUN
cana-832	69	49	associated	associate	VERB
cana-832	69	50	with	with	ADP
cana-832	69	51	transporting	transport	VERB
cana-832	69	52	from	from	ADP
cana-832	69	53	the	the	DET
cana-832	69	54	warehouses	warehouse	NOUN
cana-832	69	55	(	(	PUNCT
cana-832	69	56	available	available	ADJ
cana-832	69	57	places	place	NOUN
cana-832	69	58	)	)	PUNCT
cana-832	69	59	to	to	ADP
cana-832	69	60	these	these	DET
cana-832	69	61	cities	city	NOUN
cana-832	69	62	(	(	PUNCT
cana-832	69	63	requirement	requirement	NOUN
cana-832	69	64	places	place	NOUN
cana-832	69	65	)	)	PUNCT
cana-832	69	66	.	.	PUNCT
cana-832	70	1	communications	communication	NOUN
cana-832	70	2	on	on	ADP
cana-832	70	3	applied	apply	VERB
cana-832	70	4	nonlinear	nonlinear	ADJ
cana-832	70	5	analysis	analysis	NOUN
cana-832	70	6	issn	issn	NOUN
cana-832	70	7	:	:	PUNCT
cana-832	70	8	1074	1074	NUM
cana-832	70	9	-	-	PUNCT
cana-832	70	10	133x	133x	NUM
cana-832	70	11	vol	vol	NOUN
cana-832	70	12	31	31	NUM
cana-832	70	13	no	no	NOUN
cana-832	70	14	.	.	PUNCT
cana-832	71	1	4s	4s	NUM
cana-832	71	2	(	(	PUNCT
cana-832	71	3	2024	2024	NUM
cana-832	71	4	)	)	PUNCT
cana-832	71	5	138	138	NUM
cana-832	71	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	71	7	the	the	DET
cana-832	71	8	graphical	graphical	ADJ
cana-832	71	9	illustration	illustration	NOUN
cana-832	71	10	of	of	ADP
cana-832	71	11	the	the	DET
cana-832	71	12	tp	tp	NOUN
cana-832	71	13	which	which	PRON
cana-832	71	14	follows	follow	VERB
cana-832	71	15	the	the	DET
cana-832	71	16	improved	improved	ADJ
cana-832	71	17	demonstration	demonstration	NOUN
cana-832	71	18	of	of	ADP
cana-832	71	19	the	the	DET
cana-832	71	20	above	above	NOUN
cana-832	71	21	tp	tp	ADP
cana-832	71	22	using	use	VERB
cana-832	71	23	tbg	tbg	NOUN
cana-832	71	24	.	.	PUNCT
cana-832	72	1	#	#	NOUN
cana-832	72	2	topologized	topologize	VERB
cana-832	72	3	graph	graph	NOUN
cana-832	72	4	:	:	PUNCT
cana-832	72	5	from	from	ADP
cana-832	72	6	pulp	pulp	NOUN
cana-832	72	7	import	import	NOUN
cana-832	72	8	*	*	PUNCT
cana-832	72	9	import	import	NOUN
cana-832	72	10	networkx	networkx	NOUN
cana-832	72	11	as	as	ADP
cana-832	72	12	nx	nx	NUM
cana-832	72	13	from	from	ADP
cana-832	72	14	networkx.algorithms	networkx.algorithms	NUM
cana-832	72	15	import	import	NOUN
cana-832	72	16	bipartite	bipartite	NOUN
cana-832	72	17	#	#	NOUN
cana-832	72	18	sources	source	NOUN
cana-832	72	19	and	and	CCONJ
cana-832	72	20	destinations	destination	NOUN
cana-832	72	21	:	:	PUNCT
cana-832	72	22	list	list	NOUN
cana-832	72	23	available	available	ADJ
cana-832	73	1	=	=	PUNCT
cana-832	73	2	[	[	X
cana-832	73	3	'	'	PUNCT
cana-832	73	4	a1','a2','a3	a1','a2','a3	NOUN
cana-832	73	5	'	'	PART
cana-832	73	6	]	]	PUNCT
cana-832	73	7	requirement	requirement	NOUN
cana-832	74	1	=	=	PUNCT
cana-832	74	2	[	[	X
cana-832	74	3	'	'	PUNCT
cana-832	74	4	r1','r2','r3	r1','r2','r3	PROPN
cana-832	74	5	'	'	PART
cana-832	74	6	]	]	X
cana-832	74	7	#	#	NOUN
cana-832	74	8	in[1	in[1	PROPN
cana-832	74	9	]	]	PUNCT
cana-832	74	10	:	:	PUNCT
cana-832	74	11	g	g	NOUN
cana-832	74	12	=	=	SYM
cana-832	74	13	nx.graph	nx.graph	X
cana-832	74	14	(	(	PUNCT
cana-832	74	15	)	)	PUNCT
cana-832	74	16	#	#	NOUN
cana-832	74	17	in[2	in[2	PROPN
cana-832	74	18	]	]	PUNCT
cana-832	74	19	:	:	PUNCT
cana-832	74	20	g.add_nodes_from(['a1','a2','a3	g.add_nodes_from(['a1','a2','a3	NOUN
cana-832	74	21	'	'	NUM
cana-832	74	22	]	]	X
cana-832	74	23	,	,	PUNCT
cana-832	74	24	bipartite=0	bipartite=0	PROPN
cana-832	74	25	)	)	PUNCT
cana-832	74	26	g.add_nodes_from(['r1','r2','r3'],bipartite=1	g.add_nodes_from(['r1','r2','r3'],bipartite=1	PROPN
cana-832	74	27	)	)	PUNCT
cana-832	74	28	#	#	NOUN
cana-832	74	29	in[3	in[3	PROPN
cana-832	74	30	]	]	X
cana-832	74	31	:	:	PUNCT
cana-832	74	32	g.add_edges_from([('a1',"r2"),('a1',"r3	g.add_edges_from([('a1',"r2"),('a1',"r3	PROPN
cana-832	74	33	"	"	PUNCT
cana-832	74	34	)	)	PUNCT
cana-832	74	35	,	,	PUNCT
cana-832	74	36	(	(	PUNCT
cana-832	74	37	'	'	PUNCT
cana-832	74	38	a2	a2	PROPN
cana-832	74	39	'	'	PUNCT
cana-832	74	40	,	,	PUNCT
cana-832	74	41	"	"	PUNCT
cana-832	74	42	r1"),('a2	r1"),('a2	PROPN
cana-832	74	43	'	'	PUNCT
cana-832	74	44	,	,	PUNCT
cana-832	74	45	"	"	PUNCT
cana-832	74	46	r3"),('a3	r3"),('a3	NOUN
cana-832	74	47	'	'	PART
cana-832	74	48	,	,	PUNCT
cana-832	74	49	"	"	PUNCT
cana-832	74	50	r1"),('a3	r1"),('a3	NOUN
cana-832	74	51	'	'	NUM
cana-832	74	52	,	,	PUNCT
cana-832	74	53	"	"	PUNCT
cana-832	74	54	r2	r2	NOUN
cana-832	74	55	"	"	PUNCT
cana-832	74	56	)	)	PUNCT
cana-832	74	57	]	]	PUNCT
cana-832	74	58	)	)	PUNCT
cana-832	74	59	#	#	NOUN
cana-832	74	60	in[4	in[4	PROPN
cana-832	74	61	]	]	PUNCT
cana-832	74	62	:	:	PUNCT
cana-832	74	63	bipartite.is_bipartite(g	bipartite.is_bipartite(g	PROPN
cana-832	74	64	)	)	PUNCT
cana-832	74	65	#	#	NOUN
cana-832	74	66	in[5	in[5	PROPN
cana-832	74	67	]	]	X
cana-832	74	68	:	:	PUNCT
cana-832	74	69	nx.draw_networkx(g	nx.draw_networkx(g	PROPN
cana-832	74	70	,	,	PUNCT
cana-832	74	71	pos	pos	X
cana-832	74	72	=	=	PUNCT
cana-832	74	73	nx.drawing.layout.bipartite_layout(g	nx.drawing.layout.bipartite_layout(g	X
cana-832	74	74	,	,	PUNCT
cana-832	74	75	[	[	X
cana-832	74	76	'	'	PUNCT
cana-832	74	77	a1','a2','a3	a1','a2','a3	NOUN
cana-832	74	78	'	'	PART
cana-832	74	79	]	]	PUNCT
cana-832	74	80	)	)	PUNCT
cana-832	74	81	,	,	PUNCT
cana-832	74	82	width	width	NOUN
cana-832	74	83	=	=	SYM
cana-832	74	84	2	2	NUM
cana-832	74	85	)	)	PUNCT
cana-832	74	86	communications	communication	NOUN
cana-832	74	87	on	on	ADP
cana-832	74	88	applied	apply	VERB
cana-832	74	89	nonlinear	nonlinear	ADJ
cana-832	74	90	analysis	analysis	NOUN
cana-832	74	91	issn	issn	NOUN
cana-832	74	92	:	:	PUNCT
cana-832	74	93	1074	1074	NUM
cana-832	74	94	-	-	PUNCT
cana-832	74	95	133x	133x	NUM
cana-832	74	96	vol	vol	NOUN
cana-832	74	97	31	31	NUM
cana-832	74	98	no	no	NOUN
cana-832	74	99	.	.	PUNCT
cana-832	75	1	4s	4s	NUM
cana-832	75	2	(	(	PUNCT
cana-832	75	3	2024	2024	NUM
cana-832	75	4	)	)	PUNCT
cana-832	75	5	139	139	NUM
cana-832	75	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	75	7	in	in	ADP
cana-832	75	8	this	this	DET
cana-832	75	9	context	context	NOUN
cana-832	75	10	𝑎1	𝑎1	PROPN
cana-832	75	11	,	,	PUNCT
cana-832	75	12	𝑎2	𝑎2	PROPN
cana-832	75	13	,	,	PUNCT
cana-832	75	14	𝑎3	𝑎3	PROPN
cana-832	75	15	,	,	PUNCT
cana-832	75	16	𝑟1	𝑟1	NOUN
cana-832	75	17	,	,	PUNCT
cana-832	75	18	𝑟2	𝑟2	NOUN
cana-832	75	19	𝑎𝑛𝑑	𝑎𝑛𝑑	ADJ
cana-832	75	20	𝑟3	𝑟3	NOUN
cana-832	75	21	represents	represent	VERB
cana-832	75	22	the	the	DET
cana-832	75	23	vertices	vertex	NOUN
cana-832	75	24	of	of	ADP
cana-832	75	25	the	the	DET
cana-832	75	26	graph	graph	NOUN
cana-832	75	27	corresponding	correspond	VERB
cana-832	75	28	to	to	ADP
cana-832	75	29	the	the	DET
cana-832	75	30	available	available	ADJ
cana-832	75	31	and	and	CCONJ
cana-832	75	32	demand	demand	NOUN
cana-832	75	33	points	point	NOUN
cana-832	75	34	.	.	PUNCT
cana-832	76	1	the	the	DET
cana-832	76	2	connecting	connect	VERB
cana-832	76	3	lines	line	NOUN
cana-832	76	4	𝑙1	𝑙1	PROPN
cana-832	76	5	,	,	PUNCT
cana-832	76	6	𝑙2	𝑙2	PROPN
cana-832	76	7	,	,	PUNCT
cana-832	76	8	𝑙3	𝑙3	ADJ
cana-832	76	9	,	,	PUNCT
cana-832	76	10	𝑙4	𝑙4	PROPN
cana-832	76	11	,	,	PUNCT
cana-832	76	12	𝑙5	𝑙5	ADJ
cana-832	76	13	,	,	PUNCT
cana-832	76	14	𝑙6	𝑙6	PROPN
cana-832	76	15	,	,	PUNCT
cana-832	76	16	𝑙7	𝑙7	PROPN
cana-832	76	17	,	,	PUNCT
cana-832	76	18	𝑙8	𝑙8	NOUN
cana-832	76	19	,	,	PUNCT
cana-832	76	20	𝑙9	𝑙9	PROPN
cana-832	76	21	illustrate	illustrate	VERB
cana-832	76	22	the	the	DET
cana-832	76	23	connection	connection	NOUN
cana-832	76	24	between	between	ADP
cana-832	76	25	the	the	DET
cana-832	76	26	supply	supply	NOUN
cana-832	76	27	and	and	CCONJ
cana-832	76	28	the	the	DET
cana-832	76	29	demand	demand	NOUN
cana-832	76	30	points	point	NOUN
cana-832	76	31	.	.	PUNCT
cana-832	77	1	we	we	PRON
cana-832	77	2	now	now	ADV
cana-832	77	3	need	need	VERB
cana-832	77	4	to	to	PART
cana-832	77	5	verify	verify	VERB
cana-832	77	6	if	if	SCONJ
cana-832	77	7	the	the	DET
cana-832	77	8	graph	graph	NOUN
cana-832	77	9	meets	meet	VERB
cana-832	77	10	the	the	DET
cana-832	77	11	criteria	criterion	NOUN
cana-832	77	12	of	of	ADP
cana-832	77	13	a	a	DET
cana-832	77	14	topologized	topologize	VERB
cana-832	77	15	graph	graph	NOUN
cana-832	77	16	.	.	PUNCT
cana-832	78	1	topology	topology	NOUN
cana-832	78	2	coding	code	VERB
cana-832	78	3	from	from	ADP
cana-832	78	4	typing	type	VERB
cana-832	78	5	import	import	NOUN
cana-832	78	6	set	set	NOUN
cana-832	78	7	,	,	PUNCT
cana-832	78	8	frozenset	frozenset	VERB
cana-832	78	9	def	def	PROPN
cana-832	78	10	generate_topology(subsets	generate_topology(subsets	PROPN
cana-832	78	11	:	:	PUNCT
cana-832	78	12	set[set[str	set[set[str	PROPN
cana-832	78	13	]	]	SYM
cana-832	78	14	]	]	X
cana-832	78	15	)	)	PUNCT
cana-832	78	16	-	-	PUNCT
cana-832	78	17	>	>	X
cana-832	78	18	set[set[frozenset[str	set[set[frozenset[str	PROPN
cana-832	78	19	]	]	PUNCT
cana-832	78	20	]	]	X
cana-832	78	21	]	]	X
cana-832	78	22	:	:	PUNCT
cana-832	78	23	all_topologies	all_topologie	NOUN
cana-832	78	24	=	=	PUNCT
cana-832	78	25	set	set	PROPN
cana-832	78	26	(	(	PUNCT
cana-832	78	27	)	)	PUNCT
cana-832	78	28	for	for	ADP
cana-832	78	29	subset	subset	NOUN
cana-832	78	30	in	in	ADP
cana-832	78	31	subsets	subset	NOUN
cana-832	78	32	:	:	PUNCT
cana-832	78	33	if	if	SCONJ
cana-832	78	34	subset	subset	VERB
cana-832	78	35	=	=	NOUN
cana-832	78	36	=	=	SYM
cana-832	78	37	set	set	NOUN
cana-832	78	38	(	(	PUNCT
cana-832	78	39	):	):	PUNCT
cana-832	78	40	#	#	NOUN
cana-832	78	41	skip	skip	NOUN
cana-832	78	42	the	the	DET
cana-832	78	43	empty	empty	ADJ
cana-832	78	44	set	set	NOUN
cana-832	78	45	continue	continue	VERB
cana-832	78	46	topology	topology	NOUN
cana-832	78	47	=	=	SYM
cana-832	78	48	generate_subset_topology(subset	generate_subset_topology(subset	NOUN
cana-832	78	49	,	,	PUNCT
cana-832	78	50	subsets	subset	NOUN
cana-832	78	51	)	)	PUNCT
cana-832	78	52	all_topologies.add(frozenset(topology	all_topologies.add(frozenset(topology	NOUN
cana-832	78	53	)	)	PUNCT
cana-832	78	54	)	)	PUNCT
cana-832	79	1	return	return	NOUN
cana-832	79	2	all_topologies	all_topologie	NOUN
cana-832	79	3	def	def	VERB
cana-832	79	4	generate_subset_topology(subset	generate_subset_topology(subset	NOUN
cana-832	79	5	:	:	PUNCT
cana-832	79	6	set[str	set[str	PROPN
cana-832	79	7	]	]	PUNCT
cana-832	79	8	,	,	PUNCT
cana-832	79	9	subsets	subset	NOUN
cana-832	79	10	:	:	PUNCT
cana-832	79	11	set[set[str	set[set[str	NOUN
cana-832	79	12	]	]	SYM
cana-832	79	13	]	]	X
cana-832	79	14	)	)	PUNCT
cana-832	79	15	-	-	PUNCT
cana-832	79	16	>	>	X
cana-832	79	17	set[frozenset[str	set[frozenset[str	PROPN
cana-832	79	18	]	]	X
cana-832	79	19	]	]	NOUN
cana-832	79	20	:	:	PUNCT
cana-832	79	21	#	#	NOUN
cana-832	79	22	generate	generate	NOUN
cana-832	79	23	topology	topology	NOUN
cana-832	79	24	by	by	ADP
cana-832	79	25	iteratively	iteratively	ADV
cana-832	79	26	combining	combine	VERB
cana-832	79	27	existing	exist	VERB
cana-832	79	28	subsets	subset	NOUN
cana-832	79	29	topology	topology	NOUN
cana-832	79	30	=	=	SYM
cana-832	79	31	set(subset	set(subset	NOUN
cana-832	79	32	)	)	PUNCT
cana-832	79	33	added_subsets	added_subset	NOUN
cana-832	79	34	=	=	SYM
cana-832	79	35	set(subset	set(subset	NOUN
cana-832	79	36	)	)	PUNCT
cana-832	79	37	while	while	SCONJ
cana-832	79	38	true	true	ADJ
cana-832	79	39	:	:	PUNCT
cana-832	79	40	new_subsets	new_subset	NOUN
cana-832	79	41	=	=	SYM
cana-832	79	42	set	set	PROPN
cana-832	79	43	(	(	PUNCT
cana-832	79	44	)	)	PUNCT
cana-832	79	45	for	for	ADP
cana-832	79	46	a1	a1	NOUN
cana-832	79	47	in	in	ADP
cana-832	79	48	added_subsets	added_subset	NOUN
cana-832	79	49	:	:	PUNCT
cana-832	79	50	for	for	ADP
cana-832	79	51	a2	a2	PROPN
cana-832	79	52	in	in	ADP
cana-832	79	53	subsets	subset	NOUN
cana-832	79	54	:	:	PUNCT
cana-832	79	55	if	if	SCONJ
cana-832	79	56	a2	a2	PROPN
cana-832	79	57	=	=	NOUN
cana-832	79	58	=	=	SYM
cana-832	79	59	set	set	PROPN
cana-832	79	60	(	(	PUNCT
cana-832	79	61	):	):	PUNCT
cana-832	79	62	#	#	NOUN
cana-832	79	63	skip	skip	NOUN
cana-832	79	64	the	the	DET
cana-832	79	65	empty	empty	ADJ
cana-832	79	66	set	set	NOUN
cana-832	79	67	continue	continue	VERB
cana-832	79	68	new_subset	new_subset	NOUN
cana-832	79	69	=	=	SYM
cana-832	79	70	frozenset(a1).union(a2	frozenset(a1).union(a2	PROPN
cana-832	79	71	)	)	PUNCT
cana-832	79	72	if	if	SCONJ
cana-832	79	73	new_subset	new_subset	VERB
cana-832	79	74	not	not	PART
cana-832	79	75	in	in	ADP
cana-832	79	76	topology	topology	NOUN
cana-832	79	77	:	:	PUNCT
cana-832	79	78	new_subsets.add(new_subset	new_subsets.add(new_subset	NOUN
cana-832	79	79	)	)	PUNCT
cana-832	79	80	if	if	SCONJ
cana-832	79	81	not	not	PART
cana-832	79	82	new_subsets	new_subset	NOUN
cana-832	79	83	:	:	PUNCT
cana-832	79	84	break	break	NOUN
cana-832	79	85	topology.update(new_subsets	topology.update(new_subset	NOUN
cana-832	79	86	)	)	PUNCT
cana-832	79	87	added_subsets	added_subset	NOUN
cana-832	80	1	=	=	PRON
cana-832	80	2	new_subsets	new_subset	NOUN
cana-832	80	3	return	return	NOUN
cana-832	80	4	topology	topology	NOUN
cana-832	80	5	def	def	PROPN
cana-832	80	6	is_true_topology(topology	is_true_topology(topology	NOUN
cana-832	80	7	:	:	PUNCT
cana-832	80	8	set[frozenset[str	set[frozenset[str	PROPN
cana-832	80	9	]	]	X
cana-832	80	10	]	]	X
cana-832	80	11	,	,	PUNCT
cana-832	80	12	x	x	X
cana-832	80	13	:	:	PUNCT
cana-832	80	14	set[str	set[str	PROPN
cana-832	80	15	]	]	X
cana-832	80	16	)	)	PUNCT
cana-832	80	17	-	-	PUNCT
cana-832	80	18	>	>	X
cana-832	80	19	bool	bool	NOUN
cana-832	80	20	:	:	PUNCT
cana-832	80	21	#	#	NOUN
cana-832	80	22	check	check	NOUN
cana-832	80	23	if	if	SCONJ
cana-832	80	24	the	the	DET
cana-832	80	25	generated	generate	VERB
cana-832	80	26	topology	topology	NOUN
cana-832	80	27	is	be	AUX
cana-832	80	28	a	a	DET
cana-832	80	29	true	true	ADJ
cana-832	80	30	topology	topology	NOUN
cana-832	80	31	for	for	ADP
cana-832	80	32	x	x	PUNCT
cana-832	80	33	if	if	SCONJ
cana-832	80	34	not	not	PART
cana-832	80	35	{	{	PUNCT
cana-832	80	36	frozenset	frozenset	NOUN
cana-832	80	37	(	(	PUNCT
cana-832	80	38	)	)	PUNCT
cana-832	80	39	,	,	PUNCT
cana-832	80	40	frozenset(x	frozenset(x	PROPN
cana-832	80	41	)	)	PUNCT
cana-832	80	42	}	}	PUNCT
cana-832	80	43	in	in	ADP
cana-832	80	44	topology	topology	NOUN
cana-832	80	45	:	:	PUNCT
cana-832	80	46	return	return	VERB
cana-832	80	47	false	false	ADJ
cana-832	80	48	for	for	ADP
cana-832	80	49	subset1	subset1	NOUN
cana-832	80	50	in	in	ADP
cana-832	80	51	topology	topology	NOUN
cana-832	80	52	:	:	PUNCT
cana-832	80	53	for	for	ADP
cana-832	80	54	subset2	subset2	PROPN
cana-832	80	55	in	in	ADP
cana-832	80	56	topology	topology	NOUN
cana-832	80	57	:	:	PUNCT
cana-832	80	58	if	if	SCONJ
cana-832	80	59	not	not	PART
cana-832	80	60	subset1.intersection(subset2	subset1.intersection(subset2	VERB
cana-832	80	61	)	)	PUNCT
cana-832	80	62	in	in	ADP
cana-832	80	63	topology	topology	NOUN
cana-832	80	64	:	:	PUNCT
cana-832	80	65	return	return	VERB
cana-832	80	66	false	false	ADJ
cana-832	80	67	return	return	NOUN
cana-832	80	68	true	true	ADJ
cana-832	80	69	#	#	NOUN
cana-832	80	70	provide	provide	VERB
cana-832	80	71	your	your	PRON
cana-832	80	72	true	true	ADJ
cana-832	80	73	topology	topology	NOUN
cana-832	80	74	for	for	ADP
cana-832	80	75	x	x	NOUN
cana-832	80	76	communications	communication	NOUN
cana-832	80	77	on	on	ADP
cana-832	80	78	applied	apply	VERB
cana-832	80	79	nonlinear	nonlinear	ADJ
cana-832	80	80	analysis	analysis	NOUN
cana-832	80	81	issn	issn	NOUN
cana-832	80	82	:	:	PUNCT
cana-832	80	83	1074	1074	NUM
cana-832	80	84	-	-	PUNCT
cana-832	80	85	133x	133x	NUM
cana-832	80	86	vol	vol	NOUN
cana-832	80	87	31	31	NUM
cana-832	80	88	no	no	NOUN
cana-832	80	89	.	.	PUNCT
cana-832	81	1	4s	4s	NUM
cana-832	81	2	(	(	PUNCT
cana-832	81	3	2024	2024	NUM
cana-832	81	4	)	)	PUNCT
cana-832	81	5	140	140	NUM
cana-832	81	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	81	7	x	x	SYM
cana-832	81	8	=	=	PRON
cana-832	81	9	{	{	PUNCT
cana-832	81	10	{	{	PUNCT
cana-832	81	11	a1	a1	NOUN
cana-832	81	12	}	}	PUNCT
cana-832	81	13	,	,	PUNCT
cana-832	81	14	{	{	PUNCT
cana-832	81	15	a2	a2	PROPN
cana-832	81	16	}	}	PUNCT
cana-832	81	17	,	,	PUNCT
cana-832	81	18	{	{	PUNCT
cana-832	81	19	a3	a3	NOUN
cana-832	81	20	}	}	PUNCT
cana-832	81	21	,	,	PUNCT
cana-832	81	22	{	{	PUNCT
cana-832	81	23	r1	r1	PROPN
cana-832	81	24	}	}	PUNCT
cana-832	81	25	,	,	PUNCT
cana-832	81	26	{	{	PUNCT
cana-832	81	27	r2	r2	PROPN
cana-832	81	28	}	}	PUNCT
cana-832	81	29	,	,	PUNCT
cana-832	81	30	{	{	PUNCT
cana-832	81	31	r3	r3	NOUN
cana-832	81	32	}	}	PUNCT
cana-832	81	33	}	}	PUNCT
cana-832	81	34	true_topology_subsets	true_topology_subset	NOUN
cana-832	82	1	=	=	PUNCT
cana-832	83	1	[	[	X
cana-832	83	2	{	{	PUNCT
cana-832	83	3	φ	φ	NOUN
cana-832	83	4	}	}	PUNCT
cana-832	83	5	,	,	PUNCT
cana-832	83	6	x	x	PRON
cana-832	83	7	,	,	PUNCT
cana-832	83	8	{	{	PUNCT
cana-832	83	9	a1	a1	NOUN
cana-832	83	10	}	}	PUNCT
cana-832	83	11	,	,	PUNCT
cana-832	83	12	{	{	PUNCT
cana-832	83	13	a3	a3	NOUN
cana-832	83	14	}	}	PUNCT
cana-832	83	15	,	,	PUNCT
cana-832	83	16	{	{	PUNCT
cana-832	83	17	a1	a1	NOUN
cana-832	83	18	,	,	PUNCT
cana-832	83	19	a3	a3	NOUN
cana-832	83	20	}	}	PUNCT
cana-832	83	21	,	,	PUNCT
cana-832	83	22	{	{	PUNCT
cana-832	83	23	a1	a1	NOUN
cana-832	83	24	,	,	PUNCT
cana-832	83	25	l1	l1	PROPN
cana-832	83	26	,	,	PUNCT
cana-832	83	27	r2	r2	PROPN
cana-832	83	28	,	,	PUNCT
cana-832	83	29	l2	l2	NOUN
cana-832	83	30	,	,	PUNCT
cana-832	83	31	r3	r3	PROPN
cana-832	83	32	,	,	PUNCT
cana-832	83	33	l6	l6	NOUN
cana-832	83	34	,	,	PUNCT
cana-832	83	35	a3	a3	NOUN
cana-832	83	36	,	,	PUNCT
cana-832	83	37	l5	l5	PROPN
cana-832	83	38	,	,	PUNCT
cana-832	83	39	r1	r1	PROPN
cana-832	83	40	,	,	PUNCT
cana-832	83	41	l3	l3	PROPN
cana-832	83	42	,	,	PUNCT
cana-832	83	43	a2	a2	PROPN
cana-832	83	44	}	}	PUNCT
cana-832	83	45	,	,	PUNCT
cana-832	83	46	{	{	PUNCT
cana-832	83	47	r1	r1	PROPN
cana-832	83	48	,	,	PUNCT
cana-832	83	49	l3	l3	PROPN
cana-832	83	50	,	,	PUNCT
cana-832	83	51	a2	a2	PROPN
cana-832	83	52	,	,	PUNCT
cana-832	83	53	l4	l4	PROPN
cana-832	83	54	,	,	PUNCT
cana-832	83	55	r3	r3	PROPN
cana-832	83	56	}	}	PUNCT
cana-832	83	57	,	,	PUNCT
cana-832	83	58	{	{	PUNCT
cana-832	83	59	a1,r1	a1,r1	PROPN
cana-832	83	60	,	,	PUNCT
cana-832	83	61	l3	l3	PROPN
cana-832	83	62	,	,	PUNCT
cana-832	83	63	a2	a2	PROPN
cana-832	83	64	,	,	PUNCT
cana-832	83	65	l4	l4	PROPN
cana-832	83	66	,	,	PUNCT
cana-832	83	67	r3	r3	PROPN
cana-832	83	68	}	}	PUNCT
cana-832	83	69	,	,	PUNCT
cana-832	83	70	{	{	PUNCT
cana-832	83	71	a1	a1	NOUN
cana-832	83	72	,	,	PUNCT
cana-832	83	73	a3	a3	NOUN
cana-832	83	74	,	,	PUNCT
cana-832	83	75	r1	r1	PROPN
cana-832	83	76	,	,	PUNCT
cana-832	83	77	l3	l3	PROPN
cana-832	83	78	,	,	PUNCT
cana-832	83	79	a2	a2	PROPN
cana-832	83	80	,	,	PUNCT
cana-832	83	81	l4	l4	PROPN
cana-832	83	82	,	,	PUNCT
cana-832	83	83	r3	r3	PROPN
cana-832	83	84	}	}	PUNCT
cana-832	83	85	,	,	PUNCT
cana-832	83	86	{	{	PUNCT
cana-832	83	87	a3	a3	NOUN
cana-832	83	88	,	,	PUNCT
cana-832	83	89	r1	r1	PROPN
cana-832	83	90	,	,	PUNCT
cana-832	83	91	l3	l3	PROPN
cana-832	83	92	,	,	PUNCT
cana-832	83	93	a2	a2	PROPN
cana-832	83	94	,	,	PUNCT
cana-832	83	95	l4	l4	PROPN
cana-832	83	96	,	,	PUNCT
cana-832	83	97	r3	r3	PROPN
cana-832	83	98	}	}	PUNCT
cana-832	83	99	]	]	PUNCT
cana-832	83	100	topologies	topology	NOUN
cana-832	83	101	=	=	NOUN
cana-832	83	102	generate_topology(true_topology_subsets	generate_topology(true_topology_subset	NOUN
cana-832	83	103	)	)	PUNCT
cana-832	83	104	for	for	ADP
cana-832	83	105	topology	topology	NOUN
cana-832	83	106	in	in	ADP
cana-832	83	107	topologies	topology	NOUN
cana-832	83	108	:	:	PUNCT
cana-832	83	109	print("topology	print("topology	NOUN
cana-832	83	110	:	:	PUNCT
cana-832	83	111	"	"	PUNCT
cana-832	83	112	,	,	PUNCT
cana-832	83	113	topology	topology	NOUN
cana-832	83	114	)	)	PUNCT
cana-832	83	115	print("is	print("is	PUNCT
cana-832	83	116	true	true	ADJ
cana-832	83	117	topology	topology	NOUN
cana-832	83	118	:	:	PUNCT
cana-832	83	119	"	"	PUNCT
cana-832	83	120	,	,	PUNCT
cana-832	83	121	is_true_topology(topology	is_true_topology(topology	NOUN
cana-832	83	122	,	,	PUNCT
cana-832	83	123	x	x	NOUN
cana-832	83	124	)	)	PUNCT
cana-832	83	125	)	)	PUNCT
cana-832	83	126	print	print	NOUN
cana-832	83	127	(	(	PUNCT
cana-832	83	128	)	)	PUNCT
cana-832	83	129	let	let	VERB
cana-832	83	130	x	x	PUNCT
cana-832	83	131	=	=	PUNCT
cana-832	83	132	{	{	PUNCT
cana-832	83	133	𝑎1	𝑎1	PROPN
cana-832	83	134	,	,	PUNCT
cana-832	83	135	𝑎2	𝑎2	PROPN
cana-832	83	136	,	,	PUNCT
cana-832	83	137	𝑎3	𝑎3	PROPN
cana-832	83	138	,	,	PUNCT
cana-832	83	139	𝑟1	𝑟1	NOUN
cana-832	83	140	,	,	PUNCT
cana-832	83	141	𝑟2	𝑟2	NOUN
cana-832	83	142	,	,	PUNCT
cana-832	83	143	𝑟3	𝑟3	NOUN
cana-832	83	144	}	}	PUNCT
cana-832	83	145	be	be	VERB
cana-832	83	146	a	a	DET
cana-832	83	147	topological	topological	ADJ
cana-832	83	148	space	space	NOUN
cana-832	83	149	with	with	ADP
cana-832	83	150	the	the	DET
cana-832	83	151	topology	topology	NOUN
cana-832	83	152	𝜏	𝜏	NOUN
cana-832	83	153	=	=	PUNCT
cana-832	83	154	{	{	PUNCT
cana-832	83	155	{	{	PUNCT
cana-832	83	156	𝜑	𝜑	NOUN
cana-832	83	157	}	}	PUNCT
cana-832	83	158	,	,	PUNCT
cana-832	83	159	𝑋	𝑋	PROPN
cana-832	83	160	,	,	PUNCT
cana-832	83	161	{	{	PUNCT
cana-832	83	162	𝑎1	𝑎1	PROPN
cana-832	83	163	}	}	PUNCT
cana-832	83	164	,	,	PUNCT
cana-832	83	165	{	{	PUNCT
cana-832	83	166	𝑎3	𝑎3	NOUN
cana-832	83	167	}	}	PUNCT
cana-832	83	168	,	,	PUNCT
cana-832	83	169	{	{	PUNCT
cana-832	83	170	𝑎1	𝑎1	PROPN
cana-832	83	171	,	,	PUNCT
cana-832	83	172	𝑎3	𝑎3	PROPN
cana-832	83	173	}	}	PUNCT
cana-832	83	174	,	,	PUNCT
cana-832	83	175	{	{	PUNCT
cana-832	83	176	𝑎1	𝑎1	ADV
cana-832	83	177	,	,	PUNCT
cana-832	83	178	𝑙1	𝑙1	NOUN
cana-832	83	179	,	,	PUNCT
cana-832	83	180	𝑟2	𝑟2	NOUN
cana-832	83	181	,	,	PUNCT
cana-832	83	182	𝑙2	𝑙2	PROPN
cana-832	83	183	,	,	PUNCT
cana-832	83	184	𝑟3	𝑟3	NOUN
cana-832	83	185	,	,	PUNCT
cana-832	83	186	𝑙6	𝑙6	PROPN
cana-832	83	187	,	,	PUNCT
cana-832	83	188	𝑎3	𝑎3	PROPN
cana-832	83	189	,	,	PUNCT
cana-832	83	190	𝑙5	𝑙5	ADJ
cana-832	83	191	,	,	PUNCT
cana-832	83	192	𝑟1	𝑟1	NOUN
cana-832	83	193	,	,	PUNCT
cana-832	83	194	𝑙3	𝑙3	VERB
cana-832	83	195	,	,	PUNCT
cana-832	83	196	𝑎2	𝑎2	PROPN
cana-832	83	197	}	}	PUNCT
cana-832	83	198	,	,	PUNCT
cana-832	83	199	{	{	PUNCT
cana-832	83	200	𝑟1	𝑟1	NOUN
cana-832	83	201	,	,	PUNCT
cana-832	83	202	𝑙3	𝑙3	VERB
cana-832	83	203	,	,	PUNCT
cana-832	83	204	𝑎2	𝑎2	NOUN
cana-832	83	205	,	,	PUNCT
cana-832	83	206	𝑙4	𝑙4	PROPN
cana-832	83	207	,	,	PUNCT
cana-832	83	208	𝑟3	𝑟3	NOUN
cana-832	83	209	}	}	PUNCT
cana-832	83	210	,	,	PUNCT
cana-832	83	211	{	{	PUNCT
cana-832	83	212	𝑎1	𝑎1	PROPN
cana-832	83	213	,	,	PUNCT
cana-832	83	214	𝑟1	𝑟1	NOUN
cana-832	83	215	,	,	PUNCT
cana-832	83	216	𝑙3	𝑙3	VERB
cana-832	83	217	,	,	PUNCT
cana-832	83	218	𝑎2	𝑎2	NOUN
cana-832	83	219	,	,	PUNCT
cana-832	83	220	𝑙4	𝑙4	PROPN
cana-832	83	221	,	,	PUNCT
cana-832	83	222	𝑟3	𝑟3	NOUN
cana-832	83	223	}	}	PUNCT
cana-832	83	224	,	,	PUNCT
cana-832	83	225	{	{	PUNCT
cana-832	83	226	𝑎1	𝑎1	PROPN
cana-832	83	227	,	,	PUNCT
cana-832	83	228	𝑎3	𝑎3	PROPN
cana-832	83	229	,	,	PUNCT
cana-832	83	230	𝑟1	𝑟1	NOUN
cana-832	83	231	,	,	PUNCT
cana-832	83	232	𝑙3	𝑙3	VERB
cana-832	83	233	,	,	PUNCT
cana-832	83	234	𝑎2	𝑎2	NOUN
cana-832	83	235	,	,	PUNCT
cana-832	83	236	𝑙4	𝑙4	PROPN
cana-832	83	237	,	,	PUNCT
cana-832	83	238	𝑟3	𝑟3	NOUN
cana-832	83	239	}	}	PUNCT
cana-832	83	240	,	,	PUNCT
cana-832	83	241	{	{	PUNCT
cana-832	83	242	𝑎3	𝑎3	PROPN
cana-832	83	243	,	,	PUNCT
cana-832	83	244	𝑟1	𝑟1	NOUN
cana-832	83	245	,	,	PUNCT
cana-832	83	246	𝑙3	𝑙3	VERB
cana-832	83	247	,	,	PUNCT
cana-832	83	248	𝑎2	𝑎2	NOUN
cana-832	83	249	,	,	PUNCT
cana-832	83	250	𝑙4	𝑙4	PROPN
cana-832	83	251	,	,	PUNCT
cana-832	83	252	𝑟3	𝑟3	NOUN
cana-832	83	253	}	}	PUNCT
cana-832	83	254	}	}	PUNCT
cana-832	83	255	.	.	PUNCT
cana-832	84	1	subsequently	subsequently	ADV
cana-832	84	2	all	all	DET
cana-832	84	3	one	one	NUM
cana-832	84	4	-	-	PUNCT
cana-832	84	5	point	point	NOUN
cana-832	84	6	sets	set	NOUN
cana-832	84	7	are	be	AUX
cana-832	84	8	one	one	NUM
cana-832	84	9	closed	closed	ADJ
cana-832	84	10	or	or	CCONJ
cana-832	84	11	the	the	DET
cana-832	84	12	other	other	ADJ
cana-832	84	13	open	open	NOUN
cana-832	84	14	in	in	ADP
cana-832	84	15	𝑋	𝑋	PROPN
cana-832	84	16	and	and	CCONJ
cana-832	84	17	each	each	DET
cana-832	84	18	vertex	vertex	NOUN
cana-832	84	19	has	have	VERB
cana-832	84	20	a	a	DET
cana-832	84	21	limit	limit	NOUN
cana-832	84	22	of	of	ADP
cana-832	84	23	2	2	NUM
cana-832	84	24	,	,	PUNCT
cana-832	84	25	the	the	DET
cana-832	84	26	graph	graph	NOUN
cana-832	84	27	encounters	encounter	VERB
cana-832	84	28	the	the	DET
cana-832	84	29	criteria	criterion	NOUN
cana-832	84	30	of	of	ADP
cana-832	84	31	a	a	DET
cana-832	84	32	topologized	topologize	VERB
cana-832	84	33	graph	graph	NOUN
cana-832	84	34	.	.	PUNCT
cana-832	85	1	begin	begin	VERB
cana-832	85	2	the	the	DET
cana-832	85	3	distribution	distribution	NOUN
cana-832	85	4	from	from	ADP
cana-832	85	5	𝑎3	𝑎3	PROPN
cana-832	85	6	,	,	PUNCT
cana-832	85	7	which	which	PRON
cana-832	85	8	has	have	VERB
cana-832	85	9	the	the	DET
cana-832	85	10	lowest	low	ADJ
cana-832	85	11	unit	unit	NOUN
cana-832	85	12	transportation	transportation	NOUN
cana-832	85	13	cost	cost	NOUN
cana-832	85	14	to	to	ADP
cana-832	85	15	𝑟1	𝑟1	NOUN
cana-832	85	16	and	and	CCONJ
cana-832	85	17	𝑟2	𝑟2	NOUN
cana-832	85	18	.	.	PUNCT
cana-832	86	1	follow	follow	VERB
cana-832	86	2	the	the	DET
cana-832	86	3	projected	project	VERB
cana-832	86	4	process	process	NOUN
cana-832	86	5	and	and	CCONJ
cana-832	86	6	distribute	distribute	VERB
cana-832	86	7	all	all	DET
cana-832	86	8	quantities	quantity	NOUN
cana-832	86	9	accordingly	accordingly	ADV
cana-832	86	10	.	.	PUNCT
cana-832	87	1	the	the	DET
cana-832	87	2	final	final	ADJ
cana-832	87	3	distribution	distribution	NOUN
cana-832	87	4	schedule	schedule	NOUN
cana-832	87	5	is	be	AUX
cana-832	87	6	as	as	SCONJ
cana-832	87	7	follows	follow	VERB
cana-832	87	8	:	:	PUNCT
cana-832	87	9	import	import	NOUN
cana-832	87	10	numpy	numpy	NOUN
cana-832	87	11	as	as	ADP
cana-832	87	12	np	np	ADP
cana-832	87	13	def	def	PROPN
cana-832	87	14	get_balanced(available	get_balanced(available	ADJ
cana-832	87	15	,	,	PUNCT
cana-832	87	16	requirement	requirement	NOUN
cana-832	87	17	,	,	PUNCT
cana-832	87	18	costs	cost	NOUN
cana-832	87	19	,	,	PUNCT
cana-832	87	20	penalties	penalty	NOUN
cana-832	87	21	=	=	NOUN
cana-832	87	22	none	none	NOUN
cana-832	87	23	):	):	PUNCT
cana-832	87	24	total	total	ADJ
cana-832	87	25	_	_	PUNCT
cana-832	87	26	available	available	ADJ
cana-832	87	27	=	=	PUNCT
cana-832	87	28	sum(available	sum(available	ADJ
cana-832	87	29	)	)	PUNCT
cana-832	87	30	total_demand	total_demand	NOUN
cana-832	87	31	=	=	SYM
cana-832	87	32	sum(demand	sum(demand	NOUN
cana-832	87	33	)	)	PUNCT
cana-832	87	34	if	if	SCONJ
cana-832	87	35	total	total	ADJ
cana-832	87	36	_	_	PUNCT
cana-832	87	37	available	available	ADJ
cana-832	87	38	<	<	X
cana-832	87	39	total_demand	total_demand	NOUN
cana-832	87	40	:	:	PUNCT
cana-832	87	41	if	if	SCONJ
cana-832	87	42	penalties	penalty	NOUN
cana-832	87	43	is	be	AUX
cana-832	87	44	none	none	NOUN
cana-832	87	45	:	:	PUNCT
cana-832	87	46	raise	raise	VERB
cana-832	87	47	exception	exception	NOUN
cana-832	87	48	(	(	PUNCT
cana-832	87	49	'	'	PUNCT
cana-832	87	50	available	available	ADJ
cana-832	87	51	less	less	ADJ
cana-832	87	52	than	than	ADP
cana-832	87	53	demand	demand	NOUN
cana-832	87	54	,	,	PUNCT
cana-832	87	55	penalties	penalty	NOUN
cana-832	87	56	required	require	VERB
cana-832	87	57	'	'	PUNCT
cana-832	87	58	)	)	PUNCT
cana-832	87	59	new	new	ADJ
cana-832	87	60	_	_	PUNCT
cana-832	87	61	available	available	ADJ
cana-832	87	62	=	=	SYM
cana-832	87	63	available	available	ADJ
cana-832	87	64	+	+	CCONJ
cana-832	88	1	[	[	X
cana-832	88	2	total_demand	total_demand	NUM
cana-832	88	3	total	total	NOUN
cana-832	88	4	_	_	NOUN
cana-832	88	5	available	available	ADJ
cana-832	88	6	]	]	PUNCT
cana-832	88	7	new_costs	new_cost	NOUN
cana-832	88	8	=	=	SYM
cana-832	88	9	costs	cost	VERB
cana-832	88	10	+	+	X
cana-832	89	1	[	[	X
cana-832	89	2	penalties	penalty	NOUN
cana-832	89	3	]	]	PUNCT
cana-832	89	4	return	return	VERB
cana-832	89	5	new	new	ADJ
cana-832	89	6	_	_	ADJ
cana-832	89	7	available	available	ADJ
cana-832	89	8	,	,	PUNCT
cana-832	89	9	demand	demand	NOUN
cana-832	89	10	,	,	PUNCT
cana-832	89	11	new_costs	new_cost	NOUN
cana-832	89	12	if	if	SCONJ
cana-832	89	13	total	total	ADJ
cana-832	89	14	_	_	PUNCT
cana-832	89	15	available	available	ADJ
cana-832	89	16	>	>	X
cana-832	89	17	total_demand	total_demand	NUM
cana-832	89	18	:	:	PUNCT
cana-832	89	19	new_demand	new_demand	NOUN
cana-832	90	1	=	=	SYM
cana-832	90	2	demand	demand	NOUN
cana-832	90	3	+	+	CCONJ
cana-832	91	1	[	[	X
cana-832	91	2	total	total	ADJ
cana-832	91	3	_	_	PUNCT
cana-832	91	4	available	available	ADJ
cana-832	91	5	total_demand	total_demand	NUM
cana-832	91	6	]	]	PUNCT
cana-832	91	7	communications	communication	NOUN
cana-832	91	8	on	on	ADP
cana-832	91	9	applied	apply	VERB
cana-832	91	10	nonlinear	nonlinear	ADJ
cana-832	91	11	analysis	analysis	NOUN
cana-832	91	12	issn	issn	NOUN
cana-832	91	13	:	:	PUNCT
cana-832	91	14	1074	1074	NUM
cana-832	91	15	-	-	PUNCT
cana-832	91	16	133x	133x	NUM
cana-832	91	17	vol	vol	NOUN
cana-832	91	18	31	31	NUM
cana-832	91	19	no	no	NOUN
cana-832	91	20	.	.	PUNCT
cana-832	92	1	4s	4s	NUM
cana-832	92	2	(	(	PUNCT
cana-832	92	3	2024	2024	NUM
cana-832	92	4	)	)	PUNCT
cana-832	92	5	141	141	NUM
cana-832	92	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	92	7	new_costs	new_cost	NOUN
cana-832	92	8	=	=	PUNCT
cana-832	92	9	costs	cost	VERB
cana-832	92	10	+	+	X
cana-832	93	1	[	[	X
cana-832	93	2	[	[	X
cana-832	93	3	0	0	NUM
cana-832	93	4	for	for	ADP
cana-832	93	5	_	_	PROPN
cana-832	93	6	in	in	ADP
cana-832	93	7	demand	demand	NOUN
cana-832	93	8	]	]	X
cana-832	93	9	]	]	X
cana-832	93	10	return	return	NOUN
cana-832	93	11	available	available	ADJ
cana-832	93	12	,	,	PUNCT
cana-832	93	13	new_demand	new_demand	PROPN
cana-832	93	14	,	,	PUNCT
cana-832	93	15	new_costs	new_cost	NOUN
cana-832	93	16	return	return	VERB
cana-832	93	17	available	available	ADJ
cana-832	93	18	,	,	PUNCT
cana-832	93	19	demand	demand	NOUN
cana-832	93	20	,	,	PUNCT
cana-832	93	21	costs	cost	VERB
cana-832	93	22	def	def	ADJ
cana-832	93	23	vogel(available	vogel(available	PROPN
cana-832	93	24	,	,	PUNCT
cana-832	93	25	demand	demand	NOUN
cana-832	93	26	,	,	PUNCT
cana-832	93	27	costs	cost	NOUN
cana-832	93	28	):	):	PUNCT
cana-832	93	29	supply_copy	supply_copy	VERB
cana-832	93	30	=	=	PUNCT
cana-832	93	31	supply.copy	supply.copy	NOUN
cana-832	93	32	(	(	PUNCT
cana-832	93	33	)	)	PUNCT
cana-832	93	34	demand_copy	demand_copy	NOUN
cana-832	93	35	=	=	NOUN
cana-832	93	36	demand.copy	demand.copy	X
cana-832	93	37	(	(	PUNCT
cana-832	93	38	)	)	PUNCT
cana-832	93	39	m	m	NOUN
cana-832	93	40	=	=	NOUN
cana-832	93	41	len(available	len(available	X
cana-832	93	42	)	)	PUNCT
cana-832	93	43	n	n	CCONJ
cana-832	93	44	=	=	NOUN
cana-832	93	45	len(demand	len(demand	X
cana-832	93	46	)	)	PUNCT
cana-832	94	1	i	i	PRON
cana-832	94	2	=	=	NOUN
cana-832	95	1	0	0	NUM
cana-832	95	2	j	j	PROPN
cana-832	95	3	=	=	SYM
cana-832	95	4	0	0	NUM
cana-832	95	5	bfs	bfs	NOUN
cana-832	96	1	=	=	PUNCT
cana-832	97	1	[	[	X
cana-832	97	2	]	]	X
cana-832	97	3	while	while	SCONJ
cana-832	97	4	len(bfs	len(bfs	PROPN
cana-832	97	5	)	)	PUNCT
cana-832	97	6	<	<	X
cana-832	97	7	len(supply	len(supply	PROPN
cana-832	97	8	)	)	PUNCT
cana-832	97	9	+	+	NUM
cana-832	97	10	len(demand	len(demand	NUM
cana-832	97	11	)	)	PUNCT
cana-832	97	12	1	1	NUM
cana-832	97	13	:	:	PUNCT
cana-832	97	14	s	s	X
cana-832	97	15	=	=	PUNCT
cana-832	97	16	available	available	ADJ
cana-832	97	17	_	_	NOUN
cana-832	97	18	copy[i	copy[i	X
cana-832	97	19	]	]	X
cana-832	97	20	d	d	NOUN
cana-832	97	21	=	=	SYM
cana-832	97	22	demand_copy[j	demand_copy[j	PROPN
cana-832	97	23	]	]	X
cana-832	97	24	v	v	NOUN
cana-832	97	25	=	=	SYM
cana-832	97	26	min(s	min(s	PROPN
cana-832	97	27	,	,	PUNCT
cana-832	97	28	d	d	NOUN
cana-832	97	29	)	)	PUNCT
cana-832	97	30	available	available	ADJ
cana-832	97	31	_	_	NOUN
cana-832	97	32	copy[i	copy[i	X
cana-832	97	33	]	]	PUNCT
cana-832	97	34	-=	-=	NOUN
cana-832	97	35	v	v	NOUN
cana-832	97	36	demand_copy[j	demand_copy[j	NOUN
cana-832	97	37	]	]	PUNCT
cana-832	97	38	-=	-=	NOUN
cana-832	97	39	v	v	NOUN
cana-832	97	40	bfs.append(((i	bfs.append(((i	NOUN
cana-832	97	41	,	,	PUNCT
cana-832	97	42	j	j	PROPN
cana-832	97	43	)	)	PUNCT
cana-832	97	44	,	,	PUNCT
cana-832	97	45	v	v	NOUN
cana-832	97	46	)	)	PUNCT
cana-832	97	47	)	)	PUNCT
cana-832	97	48	if	if	SCONJ
cana-832	97	49	available	available	ADJ
cana-832	97	50	_	_	NOUN
cana-832	97	51	copy[i	copy[i	X
cana-832	97	52	]	]	X
cana-832	98	1	=	=	NOUN
cana-832	98	2	=	=	SYM
cana-832	98	3	0	0	PUNCT
cana-832	98	4	and	and	CCONJ
cana-832	98	5	i	i	PRON
cana-832	98	6	<	<	X
cana-832	98	7	len(available	len(available	X
cana-832	98	8	)	)	PUNCT
cana-832	98	9	1	1	NUM
cana-832	98	10	:	:	PUNCT
cana-832	98	11	i	i	PRON
cana-832	98	12	+	+	NOUN
cana-832	98	13	=	=	SYM
cana-832	98	14	1	1	NUM
cana-832	98	15	elif	elif	X
cana-832	98	16	demand_copy[j	demand_copy[j	NOUN
cana-832	98	17	]	]	X
cana-832	98	18	=	=	NOUN
cana-832	98	19	=	=	SYM
cana-832	98	20	0	0	NUM
cana-832	98	21	and	and	CCONJ
cana-832	98	22	j	j	X
cana-832	98	23	<	<	X
cana-832	98	24	len(demand	len(demand	PROPN
cana-832	98	25	)	)	PUNCT
cana-832	98	26	1	1	NUM
cana-832	98	27	:	:	PUNCT
cana-832	98	28	j	j	PROPN
cana-832	99	1	+	+	NOUN
cana-832	99	2	=	=	SYM
cana-832	99	3	1	1	NUM
cana-832	99	4	cost=0	cost=0	PROPN
cana-832	99	5	bfs_arr	bfs_arr	X
cana-832	100	1	=	=	PUNCT
cana-832	101	1	[	[	X
cana-832	101	2	[	[	X
cana-832	101	3	0	0	NUM
cana-832	101	4	for	for	ADP
cana-832	101	5	i	i	PRON
cana-832	101	6	in	in	ADP
cana-832	101	7	range(n	range(n	PROPN
cana-832	101	8	)	)	PUNCT
cana-832	101	9	]	]	PUNCT
cana-832	101	10	for	for	ADP
cana-832	101	11	j	j	PROPN
cana-832	101	12	in	in	ADP
cana-832	101	13	range(m	range(m	NUM
cana-832	101	14	)	)	PUNCT
cana-832	101	15	]	]	PUNCT
cana-832	101	16	for	for	ADP
cana-832	101	17	item	item	NOUN
cana-832	101	18	in	in	ADP
cana-832	101	19	bfs	bfs	NOUN
cana-832	101	20	:	:	PUNCT
cana-832	101	21	bfs_arr[item[0][0]][item[0][1]]=item[1	bfs_arr[item[0][0]][item[0][1]]=item[1	PROPN
cana-832	101	22	]	]	X
cana-832	101	23	print('\n	print('\n	VERB
cana-832	101	24	the	the	DET
cana-832	101	25	initial	initial	ADJ
cana-832	101	26	bfs	bfs	NOUN
cana-832	101	27	is:\n',bfs_arr	is:\n',bfs_arr	NOUN
cana-832	101	28	)	)	PUNCT
cana-832	101	29	for	for	ADP
cana-832	101	30	item	item	NOUN
cana-832	101	31	in	in	ADP
cana-832	101	32	bfs	bfs	NOUN
cana-832	101	33	:	:	PUNCT
cana-832	101	34	cost	cost	NOUN
cana-832	101	35	=	=	SYM
cana-832	101	36	cost+costs[item[0][0]][item[0][1]]*item[1	cost+costs[item[0][0]][item[0][1]]*item[1	PROPN
cana-832	101	37	]	]	X
cana-832	101	38	print('total	print('total	ADJ
cana-832	101	39	bfs	bfs	NOUN
cana-832	101	40	cost	cost	NOUN
cana-832	101	41	is	be	AUX
cana-832	101	42	:	:	PUNCT
cana-832	101	43	'	'	PUNCT
cana-832	101	44	,	,	PUNCT
cana-832	101	45	cost	cost	NOUN
cana-832	101	46	)	)	PUNCT
cana-832	101	47	return	return	NOUN
cana-832	101	48	bfs	bfs	NOUN
cana-832	101	49	in	in	ADP
cana-832	101	50	[	[	X
cana-832	101	51	6	6	NUM
cana-832	101	52	]	]	X
cana-832	101	53	:	:	PUNCT
cana-832	101	54	def	def	ADJ
cana-832	101	55	get_us_and_vs(bfs	get_us_and_vs(bfs	NOUN
cana-832	101	56	,	,	PUNCT
cana-832	101	57	costs	cost	NOUN
cana-832	101	58	):	):	PUNCT
cana-832	101	59	us	we	PRON
cana-832	101	60	=	=	PUNCT
cana-832	102	1	[	[	X
cana-832	102	2	none	none	NOUN
cana-832	102	3	]	]	X
cana-832	102	4	*	*	PUNCT
cana-832	102	5	len(costs	len(cost	NOUN
cana-832	102	6	)	)	PUNCT
cana-832	102	7	vs	vs	ADP
cana-832	102	8	=	=	PUNCT
cana-832	103	1	[	[	X
cana-832	103	2	none	none	NOUN
cana-832	103	3	]	]	PUNCT
cana-832	103	4	*	*	PUNCT
cana-832	103	5	len(costs[0	len(costs[0	NOUN
cana-832	103	6	]	]	X
cana-832	103	7	)	)	PUNCT
cana-832	104	1	us[0	us[0	NOUN
cana-832	104	2	]	]	X
cana-832	104	3	=	=	SYM
cana-832	104	4	0	0	NUM
cana-832	104	5	bfs_copy	bfs_copy	NOUN
cana-832	104	6	=	=	SYM
cana-832	104	7	bfs.copy	bfs.copy	NOUN
cana-832	104	8	(	(	PUNCT
cana-832	104	9	)	)	PUNCT
cana-832	104	10	while	while	SCONJ
cana-832	104	11	len(bfs_copy	len(bfs_copy	VERB
cana-832	104	12	)	)	PUNCT
cana-832	104	13	>	>	X
cana-832	105	1	0	0	NUM
cana-832	105	2	:	:	PUNCT
cana-832	105	3	for	for	ADP
cana-832	105	4	index	index	NOUN
cana-832	105	5	,	,	PUNCT
cana-832	105	6	bv	bv	PROPN
cana-832	105	7	in	in	ADP
cana-832	105	8	enumerate(bfs_copy	enumerate(bfs_copy	PROPN
cana-832	105	9	):	):	PUNCT
cana-832	105	10	i	i	PROPN
cana-832	105	11	,	,	PUNCT
cana-832	105	12	j	j	PROPN
cana-832	106	1	=	=	SYM
cana-832	106	2	bv[0	bv[0	PROPN
cana-832	106	3	]	]	X
cana-832	106	4	if	if	SCONJ
cana-832	106	5	us[i	us[i	PROPN
cana-832	106	6	]	]	PUNCT
cana-832	106	7	is	be	AUX
cana-832	106	8	none	none	NOUN
cana-832	106	9	and	and	CCONJ
cana-832	106	10	vs[j	vs[j	PROPN
cana-832	106	11	]	]	PUNCT
cana-832	106	12	is	be	AUX
cana-832	106	13	none	none	NOUN
cana-832	106	14	:	:	PUNCT
cana-832	106	15	continue	continue	VERB
cana-832	106	16	cost	cost	NOUN
cana-832	106	17	=	=	PUNCT
cana-832	106	18	costs[i][j	costs[i][j	NOUN
cana-832	106	19	]	]	PUNCT
cana-832	106	20	communications	communication	NOUN
cana-832	106	21	on	on	ADP
cana-832	106	22	applied	apply	VERB
cana-832	106	23	nonlinear	nonlinear	ADJ
cana-832	106	24	analysis	analysis	NOUN
cana-832	106	25	issn	issn	NOUN
cana-832	106	26	:	:	PUNCT
cana-832	106	27	1074	1074	NUM
cana-832	106	28	-	-	PUNCT
cana-832	106	29	133x	133x	NUM
cana-832	106	30	vol	vol	NOUN
cana-832	106	31	31	31	NUM
cana-832	106	32	no	no	NOUN
cana-832	106	33	.	.	PUNCT
cana-832	107	1	4s	4s	NUM
cana-832	107	2	(	(	PUNCT
cana-832	107	3	2024	2024	NUM
cana-832	107	4	)	)	PUNCT
cana-832	107	5	142	142	NUM
cana-832	107	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	107	7	if	if	SCONJ
cana-832	107	8	us[i	us[i	PROPN
cana-832	107	9	]	]	PUNCT
cana-832	107	10	is	be	AUX
cana-832	107	11	none	none	NOUN
cana-832	107	12	:	:	PUNCT
cana-832	107	13	us[i	us[i	ADJ
cana-832	107	14	]	]	PUNCT
cana-832	107	15	=	=	SYM
cana-832	107	16	cost	cost	PROPN
cana-832	107	17	vs[j	vs[j	PROPN
cana-832	107	18	]	]	PUNCT
cana-832	107	19	else	else	ADV
cana-832	107	20	:	:	PUNCT
cana-832	107	21	vs[j	vs[j	PROPN
cana-832	107	22	]	]	PUNCT
cana-832	107	23	=	=	SYM
cana-832	107	24	cost	cost	NOUN
cana-832	107	25	us[i	us[i	PROPN
cana-832	107	26	]	]	PUNCT
cana-832	107	27	bfs_copy.pop(index	bfs_copy.pop(index	NOUN
cana-832	107	28	)	)	PUNCT
cana-832	107	29	break	break	VERB
cana-832	107	30	return	return	NOUN
cana-832	107	31	us	we	PRON
cana-832	107	32	,	,	PUNCT
cana-832	107	33	vs	vs	ADP
cana-832	107	34	in	in	ADP
cana-832	107	35	[	[	X
cana-832	107	36	7	7	NUM
cana-832	107	37	]	]	X
cana-832	107	38	:	:	PUNCT
cana-832	107	39	def	def	ADJ
cana-832	107	40	get_ws(bfs	get_ws(bfs	NOUN
cana-832	107	41	,	,	PUNCT
cana-832	107	42	costs	cost	NOUN
cana-832	107	43	,	,	PUNCT
cana-832	107	44	us	we	PRON
cana-832	107	45	,	,	PUNCT
cana-832	107	46	vs	vs	ADP
cana-832	107	47	):	):	PUNCT
cana-832	107	48	ws	ws	NOUN
cana-832	107	49	=	=	PUNCT
cana-832	108	1	[	[	X
cana-832	108	2	]	]	X
cana-832	108	3	for	for	ADP
cana-832	108	4	i	i	PRON
cana-832	108	5	,	,	PUNCT
cana-832	108	6	row	row	NOUN
cana-832	108	7	in	in	ADP
cana-832	108	8	enumerate(costs	enumerate(cost	NOUN
cana-832	108	9	):	):	PUNCT
cana-832	108	10	for	for	ADP
cana-832	108	11	j	j	PROPN
cana-832	108	12	,	,	PUNCT
cana-832	108	13	cost	cost	VERB
cana-832	108	14	in	in	ADP
cana-832	108	15	enumerate(row	enumerate(row	NOUN
cana-832	108	16	):	):	PUNCT
cana-832	108	17	non_basic	non_basic	PROPN
cana-832	108	18	=	=	SYM
cana-832	108	19	all([p[0	all([p[0	NOUN
cana-832	108	20	]	]	PUNCT
cana-832	108	21	!	!	PUNCT
cana-832	109	1	=	=	PUNCT
cana-832	109	2	i	i	PRON
cana-832	109	3	or	or	CCONJ
cana-832	109	4	p[1	p[1	NOUN
cana-832	109	5	]	]	PUNCT
cana-832	109	6	!	!	PUNCT
cana-832	110	1	=	=	SYM
cana-832	110	2	j	j	PROPN
cana-832	110	3	for	for	ADP
cana-832	110	4	p	p	PROPN
cana-832	110	5	,	,	PUNCT
cana-832	110	6	v	v	NOUN
cana-832	110	7	in	in	ADP
cana-832	110	8	bfs	bfs	NOUN
cana-832	110	9	]	]	PUNCT
cana-832	110	10	)	)	PUNCT
cana-832	110	11	if	if	SCONJ
cana-832	110	12	non_basic	non_basic	NOUN
cana-832	110	13	:	:	PUNCT
cana-832	110	14	ws.append(((i	ws.append(((i	PROPN
cana-832	110	15	,	,	PUNCT
cana-832	110	16	j	j	PROPN
cana-832	110	17	)	)	PUNCT
cana-832	110	18	,	,	PUNCT
cana-832	110	19	us[i	us[i	PROPN
cana-832	110	20	]	]	X
cana-832	110	21	+	+	CCONJ
cana-832	110	22	vs[j	vs[j	PROPN
cana-832	110	23	]	]	PUNCT
cana-832	110	24	cost	cost	NOUN
cana-832	110	25	)	)	PUNCT
cana-832	110	26	)	)	PUNCT
cana-832	110	27	return	return	VERB
cana-832	110	28	ws	ws	NOUN
cana-832	110	29	in	in	ADP
cana-832	110	30	[	[	X
cana-832	110	31	8	8	NUM
cana-832	110	32	]	]	SYM
cana-832	110	33	:	:	PUNCT
cana-832	110	34	def	def	ADJ
cana-832	110	35	can_be_improved(ws	can_be_improved(ws	NOUN
cana-832	110	36	):	):	PUNCT
cana-832	110	37	for	for	ADP
cana-832	110	38	p	p	NOUN
cana-832	110	39	,	,	PUNCT
cana-832	110	40	v	v	NOUN
cana-832	110	41	in	in	ADP
cana-832	110	42	ws	ws	NOUN
cana-832	110	43	:	:	PUNCT
cana-832	110	44	if	if	SCONJ
cana-832	110	45	v	v	NOUN
cana-832	110	46	>	>	X
cana-832	110	47	0	0	NUM
cana-832	110	48	:	:	PUNCT
cana-832	110	49	return	return	VERB
cana-832	110	50	true	true	ADJ
cana-832	110	51	return	return	NOUN
cana-832	110	52	false	false	ADJ
cana-832	110	53	in	in	ADP
cana-832	110	54	[	[	X
cana-832	110	55	9	9	NUM
cana-832	110	56	]	]	SYM
cana-832	110	57	:	:	PUNCT
cana-832	110	58	def	def	PROPN
cana-832	110	59	get_entering_variable_position(ws	get_entering_variable_position(ws	PROPN
cana-832	110	60	):	):	PUNCT
cana-832	110	61	ws_copy	ws_copy	NOUN
cana-832	110	62	=	=	SYM
cana-832	110	63	ws.copy	ws.copy	NOUN
cana-832	110	64	(	(	PUNCT
cana-832	110	65	)	)	PUNCT
cana-832	110	66	ws_copy.sort(key	ws_copy.sort(key	X
cana-832	111	1	=	=	SYM
cana-832	111	2	lambda	lambda	NOUN
cana-832	111	3	w	w	NOUN
cana-832	111	4	:	:	PUNCT
cana-832	111	5	w[1	w[1	NOUN
cana-832	111	6	]	]	PUNCT
cana-832	111	7	)	)	PUNCT
cana-832	111	8	return	return	VERB
cana-832	111	9	ws_copy[-1][0	ws_copy[-1][0	PROPN
cana-832	111	10	]	]	PUNCT
cana-832	111	11	in	in	ADP
cana-832	111	12	[	[	X
cana-832	111	13	11	11	NUM
cana-832	111	14	]	]	SYM
cana-832	111	15	:	:	PUNCT
cana-832	111	16	def	def	PROPN
cana-832	111	17	get_loop(bv_positions	get_loop(bv_position	NOUN
cana-832	111	18	,	,	PUNCT
cana-832	111	19	ev_position	ev_position	NOUN
cana-832	111	20	):	):	PUNCT
cana-832	111	21	def	def	PROPN
cana-832	111	22	inner(loop	inner(loop	PROPN
cana-832	111	23	):	):	PUNCT
cana-832	111	24	if	if	SCONJ
cana-832	111	25	len(loop	len(loop	NOUN
cana-832	111	26	)	)	PUNCT
cana-832	111	27	>	>	X
cana-832	112	1	3	3	NUM
cana-832	112	2	:	:	PUNCT
cana-832	112	3	can_be_closed	can_be_closed	ADJ
cana-832	112	4	=	=	PUNCT
cana-832	112	5	len(get_possible_next_nodes(loop	len(get_possible_next_nodes(loop	NOUN
cana-832	112	6	,	,	PUNCT
cana-832	112	7	[	[	X
cana-832	112	8	ev_position	ev_position	NOUN
cana-832	112	9	]	]	PUNCT
cana-832	112	10	)	)	PUNCT
cana-832	112	11	)	)	PUNCT
cana-832	113	1	=	=	PUNCT
cana-832	113	2	=	=	SYM
cana-832	113	3	1	1	NUM
cana-832	113	4	communications	communication	NOUN
cana-832	113	5	on	on	ADP
cana-832	113	6	applied	apply	VERB
cana-832	113	7	nonlinear	nonlinear	ADJ
cana-832	113	8	analysis	analysis	NOUN
cana-832	113	9	issn	issn	NOUN
cana-832	113	10	:	:	PUNCT
cana-832	113	11	1074	1074	NUM
cana-832	113	12	-	-	PUNCT
cana-832	113	13	133x	133x	NUM
cana-832	113	14	vol	vol	NOUN
cana-832	113	15	31	31	NUM
cana-832	113	16	no	no	NOUN
cana-832	113	17	.	.	PUNCT
cana-832	114	1	4s	4s	NUM
cana-832	114	2	(	(	PUNCT
cana-832	114	3	2024	2024	NUM
cana-832	114	4	)	)	PUNCT
cana-832	114	5	143	143	NUM
cana-832	114	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	114	7	if	if	SCONJ
cana-832	114	8	can_be_closed	can_be_close	VERB
cana-832	114	9	:	:	PUNCT
cana-832	114	10	return	return	NOUN
cana-832	114	11	loop	loop	NOUN
cana-832	114	12	not_visited	not_visite	VERB
cana-832	114	13	=	=	SYM
cana-832	114	14	list(set(bv_positions	list(set(bv_positions	PROPN
cana-832	114	15	)	)	PUNCT
cana-832	114	16	set(loop	set(loop	NOUN
cana-832	114	17	)	)	PUNCT
cana-832	114	18	)	)	PUNCT
cana-832	114	19	possible_next_nodes	possible_next_node	NOUN
cana-832	114	20	=	=	SYM
cana-832	114	21	get_possible_next_nodes(loop	get_possible_next_nodes(loop	PROPN
cana-832	114	22	,	,	PUNCT
cana-832	114	23	not_visited	not_visited	ADJ
cana-832	114	24	)	)	PUNCT
cana-832	114	25	for	for	ADP
cana-832	114	26	next_node	next_node	NUM
cana-832	114	27	in	in	ADP
cana-832	114	28	possible_next_nodes	possible_next_node	NOUN
cana-832	114	29	:	:	PUNCT
cana-832	114	30	new_loop	new_loop	NOUN
cana-832	114	31	=	=	SYM
cana-832	114	32	inner(loop	inner(loop	PROPN
cana-832	114	33	+	+	PROPN
cana-832	115	1	[	[	X
cana-832	115	2	next_node	next_node	X
cana-832	115	3	]	]	PUNCT
cana-832	115	4	)	)	PUNCT
cana-832	115	5	if	if	SCONJ
cana-832	115	6	new_loop	new_loop	NOUN
cana-832	115	7	:	:	PUNCT
cana-832	115	8	return	return	VERB
cana-832	115	9	new_loop	new_loop	NOUN
cana-832	115	10	return	return	NOUN
cana-832	115	11	inner([ev_position	inner([ev_position	PROPN
cana-832	115	12	]	]	PUNCT
cana-832	115	13	)	)	PUNCT
cana-832	115	14	in	in	ADP
cana-832	115	15	[	[	X
cana-832	115	16	12	12	NUM
cana-832	115	17	]	]	X
cana-832	115	18	:	:	PUNCT
cana-832	115	19	def	def	PROPN
cana-832	115	20	loop_pivoting(bfs	loop_pivoting(bfs	PROPN
cana-832	115	21	,	,	PUNCT
cana-832	115	22	loop	loop	NOUN
cana-832	115	23	):	):	PUNCT
cana-832	115	24	even_cells	even_cell	NOUN
cana-832	115	25	=	=	SYM
cana-832	115	26	loop[0::2	loop[0::2	PROPN
cana-832	115	27	]	]	PUNCT
cana-832	115	28	odd_cells	odd_cell	NOUN
cana-832	115	29	=	=	SYM
cana-832	115	30	loop[1::2	loop[1::2	X
cana-832	115	31	]	]	X
cana-832	115	32	get_bv	get_bv	PUNCT
cana-832	115	33	=	=	SYM
cana-832	116	1	lambda	lambda	NOUN
cana-832	116	2	pos	pos	NOUN
cana-832	116	3	:	:	PUNCT
cana-832	116	4	next(v	next(v	ADP
cana-832	116	5	for	for	ADP
cana-832	116	6	p	p	PRON
cana-832	116	7	,	,	PUNCT
cana-832	116	8	v	v	NOUN
cana-832	116	9	in	in	ADP
cana-832	116	10	bfs	bfs	NOUN
cana-832	116	11	if	if	SCONJ
cana-832	116	12	p	p	PROPN
cana-832	116	13	=	=	NOUN
cana-832	116	14	=	=	SYM
cana-832	116	15	pos	pos	NOUN
cana-832	116	16	)	)	PUNCT
cana-832	116	17	leaving_position	leaving_position	NOUN
cana-832	116	18	=	=	SYM
cana-832	116	19	sorted(odd_cells	sorted(odd_cell	NOUN
cana-832	116	20	,	,	PUNCT
cana-832	116	21	key	key	ADJ
cana-832	116	22	=	=	ADJ
cana-832	116	23	get_bv)[0	get_bv)[0	NOUN
cana-832	116	24	]	]	X
cana-832	116	25	leaving_value	leaving_value	PROPN
cana-832	116	26	=	=	SYM
cana-832	116	27	get_bv(leaving_position	get_bv(leaving_position	PROPN
cana-832	116	28	)	)	PUNCT
cana-832	116	29	new_bfs	new_bfs	NOUN
cana-832	116	30	=	=	PUNCT
cana-832	117	1	[	[	X
cana-832	117	2	]	]	X
cana-832	117	3	for	for	ADP
cana-832	117	4	p	p	NOUN
cana-832	117	5	,	,	PUNCT
cana-832	117	6	v	v	NOUN
cana-832	117	7	in	in	ADP
cana-832	117	8	[	[	PUNCT
cana-832	117	9	bv	bv	PROPN
cana-832	117	10	for	for	ADP
cana-832	117	11	bv	bv	PROPN
cana-832	117	12	in	in	ADP
cana-832	117	13	bfs	bfs	NOUN
cana-832	117	14	if	if	SCONJ
cana-832	117	15	bv[0	bv[0	PROPN
cana-832	117	16	]	]	PUNCT
cana-832	117	17	!	!	PUNCT
cana-832	118	1	=	=	PUNCT
cana-832	118	2	leaving_position	leaving_position	NOUN
cana-832	118	3	]	]	PUNCT
cana-832	119	1	+	+	CCONJ
cana-832	119	2	[	[	X
cana-832	119	3	(	(	PUNCT
cana-832	119	4	loop[0	loop[0	PROPN
cana-832	119	5	]	]	PUNCT
cana-832	119	6	,	,	PUNCT
cana-832	119	7	0	0	NUM
cana-832	119	8	)	)	PUNCT
cana-832	119	9	]	]	X
cana-832	119	10	:	:	PUNCT
cana-832	119	11	if	if	SCONJ
cana-832	119	12	p	p	NOUN
cana-832	119	13	in	in	ADP
cana-832	119	14	even_cells	even_cell	NOUN
cana-832	119	15	:	:	PUNCT
cana-832	119	16	v	v	ADP
cana-832	119	17	+	+	PROPN
cana-832	119	18	=	=	X
cana-832	119	19	leaving_value	leaving_value	ADJ
cana-832	119	20	elif	elif	PROPN
cana-832	119	21	p	p	X
cana-832	119	22	in	in	ADP
cana-832	119	23	odd_cells	odd_cell	NOUN
cana-832	119	24	:	:	PUNCT
cana-832	119	25	v	v	NUM
cana-832	119	26	-=	-=	NOUN
cana-832	119	27	leaving_value	leaving_value	PROPN
cana-832	119	28	new_bfs.append((p	new_bfs.append((p	NOUN
cana-832	119	29	,	,	PUNCT
cana-832	119	30	v	v	NOUN
cana-832	119	31	)	)	PUNCT
cana-832	119	32	)	)	PUNCT
cana-832	119	33	return	return	VERB
cana-832	119	34	new_bfs	new_bfs	NOUN
cana-832	119	35	in	in	ADP
cana-832	119	36	[	[	X
cana-832	119	37	13	13	NUM
cana-832	119	38	]	]	NUM
cana-832	119	39	:	:	PUNCT
cana-832	119	40	def	def	PROPN
cana-832	119	41	transportation_method(supply	transportation_method(supply	PROPN
cana-832	119	42	,	,	PUNCT
cana-832	119	43	demand	demand	NOUN
cana-832	119	44	,	,	PUNCT
cana-832	119	45	costs	cost	NOUN
cana-832	119	46	,	,	PUNCT
cana-832	119	47	penalties	penalty	NOUN
cana-832	119	48	=	=	PUNCT
cana-832	119	49	none	none	NOUN
cana-832	119	50	):	):	PUNCT
cana-832	119	51	balanced_supply	balanced_supply	ADV
cana-832	119	52	,	,	PUNCT
cana-832	119	53	balanced_demand	balanced_demand	PROPN
cana-832	119	54	,	,	PUNCT
cana-832	119	55	balanced_costs	balanced_cost	NOUN
cana-832	119	56	=	=	SYM
cana-832	119	57	get_balanced	get_balance	VERB
cana-832	119	58	(	(	PUNCT
cana-832	119	59	supply	supply	NOUN
cana-832	119	60	,	,	PUNCT
cana-832	119	61	demand	demand	NOUN
cana-832	119	62	,	,	PUNCT
cana-832	119	63	costs	cost	NOUN
cana-832	119	64	)	)	PUNCT
cana-832	119	65	def	def	ADJ
cana-832	119	66	inner(bfs	inner(bfs	NOUN
cana-832	119	67	):	):	PUNCT
cana-832	119	68	us	we	PRON
cana-832	119	69	,	,	PUNCT
cana-832	119	70	vs	vs	ADP
cana-832	119	71	=	=	SYM
cana-832	119	72	get_us_and_vs(bfs	get_us_and_vs(bfs	NOUN
cana-832	119	73	,	,	PUNCT
cana-832	119	74	balanced_costs	balanced_cost	NOUN
cana-832	119	75	)	)	PUNCT
cana-832	119	76	ws	ws	NOUN
cana-832	119	77	=	=	SYM
cana-832	119	78	get_ws(bfs	get_ws(bfs	NOUN
cana-832	119	79	,	,	PUNCT
cana-832	119	80	balanced_costs	balanced_cost	NOUN
cana-832	119	81	,	,	PUNCT
cana-832	119	82	us	we	PRON
cana-832	119	83	,	,	PUNCT
cana-832	119	84	vs	vs	ADP
cana-832	119	85	)	)	PUNCT
cana-832	119	86	if	if	SCONJ
cana-832	119	87	can_be_improved(ws	can_be_improved(ws	NOUN
cana-832	119	88	):	):	PUNCT
cana-832	119	89	ev_position	ev_position	NOUN
cana-832	119	90	=	=	SYM
cana-832	119	91	get_entering_variable_position(ws	get_entering_variable_position(ws	NOUN
cana-832	119	92	)	)	PUNCT
cana-832	119	93	loop	loop	NOUN
cana-832	119	94	=	=	NOUN
cana-832	119	95	get_loop([p	get_loop([p	NOUN
cana-832	119	96	for	for	ADP
cana-832	119	97	p	p	NOUN
cana-832	119	98	,	,	PUNCT
cana-832	119	99	v	v	NOUN
cana-832	119	100	in	in	ADP
cana-832	119	101	bfs	bfs	NOUN
cana-832	119	102	]	]	PUNCT
cana-832	119	103	,	,	PUNCT
cana-832	119	104	ev_position	ev_position	NOUN
cana-832	119	105	)	)	PUNCT
cana-832	119	106	return	return	NOUN
cana-832	119	107	inner(loop_pivoting(bfs	inner(loop_pivoting(bfs	NOUN
cana-832	119	108	,	,	PUNCT
cana-832	119	109	loop	loop	NOUN
cana-832	119	110	)	)	PUNCT
cana-832	119	111	)	)	PUNCT
cana-832	119	112	return	return	VERB
cana-832	119	113	bfs	bfs	NOUN
cana-832	119	114	basic_variables	basic_variable	NOUN
cana-832	119	115	=	=	PUNCT
cana-832	119	116	inner(vogel(balanced_supply	inner(vogel(balanced_supply	ADV
cana-832	119	117	,	,	PUNCT
cana-832	119	118	balanced_demand	balanced_demand	PROPN
cana-832	119	119	,	,	PUNCT
cana-832	119	120	costs	cost	NOUN
cana-832	119	121	)	)	PUNCT
cana-832	119	122	)	)	PUNCT
cana-832	119	123	ans	an	NOUN
cana-832	119	124	=	=	SYM
cana-832	119	125	np.zeros((len(costs	np.zeros((len(cost	NOUN
cana-832	119	126	)	)	PUNCT
cana-832	119	127	,	,	PUNCT
cana-832	119	128	len(costs[0	len(costs[0	NOUN
cana-832	119	129	]	]	X
cana-832	119	130	)	)	PUNCT
cana-832	119	131	)	)	PUNCT
cana-832	119	132	)	)	PUNCT
cana-832	119	133	for	for	ADP
cana-832	119	134	(	(	PUNCT
cana-832	119	135	i	i	PROPN
cana-832	119	136	,	,	PUNCT
cana-832	119	137	j	j	PROPN
cana-832	119	138	)	)	PUNCT
cana-832	119	139	,	,	PUNCT
cana-832	119	140	v	v	NOUN
cana-832	119	141	in	in	ADP
cana-832	119	142	basic_variables	basic_variable	NOUN
cana-832	119	143	:	:	PUNCT
cana-832	119	144	ans[i][j	ans[i][j	X
cana-832	119	145	]	]	X
cana-832	119	146	=	=	SYM
cana-832	119	147	int(v	int(v	PROPN
cana-832	119	148	)	)	PUNCT
cana-832	119	149	return	return	NOUN
cana-832	119	150	ans	an	NOUN
cana-832	119	151	in	in	ADP
cana-832	119	152	[	[	X
cana-832	119	153	16	16	NUM
cana-832	119	154	]	]	X
cana-832	119	155	:	:	PUNCT
cana-832	119	156	def	def	ADJ
cana-832	119	157	get_total_cost(costs	get_total_cost(cost	NOUN
cana-832	119	158	,	,	PUNCT
cana-832	119	159	ans	an	NOUN
cana-832	119	160	):	):	PUNCT
cana-832	119	161	communications	communication	NOUN
cana-832	119	162	on	on	ADP
cana-832	119	163	applied	apply	VERB
cana-832	119	164	nonlinear	nonlinear	ADJ
cana-832	119	165	analysis	analysis	NOUN
cana-832	119	166	issn	issn	NOUN
cana-832	119	167	:	:	PUNCT
cana-832	119	168	1074	1074	NUM
cana-832	119	169	-	-	PUNCT
cana-832	119	170	133x	133x	NUM
cana-832	119	171	vol	vol	NOUN
cana-832	119	172	31	31	NUM
cana-832	119	173	no	no	NOUN
cana-832	119	174	.	.	PUNCT
cana-832	120	1	4s	4s	NUM
cana-832	120	2	(	(	PUNCT
cana-832	120	3	2024	2024	NUM
cana-832	120	4	)	)	PUNCT
cana-832	121	1	144	144	NUM
cana-832	121	2	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	121	3	total_cost	total_cost	NOUN
cana-832	121	4	=	=	SYM
cana-832	121	5	0	0	NUM
cana-832	121	6	for	for	ADP
cana-832	121	7	i	i	PRON
cana-832	121	8	,	,	PUNCT
cana-832	121	9	row	row	NOUN
cana-832	121	10	in	in	ADP
cana-832	121	11	enumerate(costs	enumerate(cost	NOUN
cana-832	121	12	):	):	PUNCT
cana-832	121	13	for	for	ADP
cana-832	121	14	j	j	PROPN
cana-832	121	15	,	,	PUNCT
cana-832	121	16	cost	cost	VERB
cana-832	121	17	in	in	ADP
cana-832	121	18	enumerate(row	enumerate(row	NOUN
cana-832	121	19	):	):	PUNCT
cana-832	121	20	total_cost	total_cost	PROPN
cana-832	121	21	+	+	NOUN
cana-832	121	22	=	=	NOUN
cana-832	121	23	cost	cost	NOUN
cana-832	121	24	*	*	PUNCT
cana-832	121	25	ans[i][j	ans[i][j	NOUN
cana-832	121	26	]	]	PUNCT
cana-832	121	27	return	return	VERB
cana-832	121	28	total_cost	total_cost	NOUN
cana-832	121	29	in	in	ADP
cana-832	121	30	[	[	X
cana-832	121	31	20	20	NUM
cana-832	121	32	]	]	SYM
cana-832	121	33	:	:	PUNCT
cana-832	121	34	m	m	NOUN
cana-832	121	35	=	=	NOUN
cana-832	121	36	int(input("enter	int(input("enter	NOUN
cana-832	121	37	m	m	NOUN
cana-832	121	38	:	:	PUNCT
cana-832	121	39	"	"	PUNCT
cana-832	121	40	)	)	PUNCT
cana-832	121	41	)	)	PUNCT
cana-832	122	1	n	n	CCONJ
cana-832	122	2	=	=	SYM
cana-832	122	3	int(input("enter	int(input("enter	NOUN
cana-832	122	4	n	n	NOUN
cana-832	122	5	:	:	PUNCT
cana-832	122	6	"	"	PUNCT
cana-832	122	7	)	)	PUNCT
cana-832	122	8	)	)	PUNCT
cana-832	123	1	print("enter	print("enter	NOUN
cana-832	123	2	all	all	DET
cana-832	123	3	costs	cost	NOUN
cana-832	123	4	in	in	ADP
cana-832	123	5	one	one	NUM
cana-832	123	6	line	line	NOUN
cana-832	123	7	"	"	PUNCT
cana-832	123	8	)	)	PUNCT
cana-832	123	9	entries	entry	NOUN
cana-832	123	10	=	=	SYM
cana-832	123	11	list(map(int	list(map(int	NUM
cana-832	123	12	,	,	PUNCT
cana-832	123	13	input().split	input().split	NUM
cana-832	123	14	(	(	PUNCT
cana-832	123	15	)	)	PUNCT
cana-832	123	16	)	)	PUNCT
cana-832	123	17	)	)	PUNCT
cana-832	124	1	costs	cost	VERB
cana-832	124	2	=	=	SYM
cana-832	124	3	np.array(entries).reshape(m	np.array(entries).reshape(m	PROPN
cana-832	124	4	,	,	PUNCT
cana-832	124	5	n	n	CCONJ
cana-832	124	6	)	)	PUNCT
cana-832	124	7	print('\n	print('\n	VERB
cana-832	124	8	the	the	DET
cana-832	124	9	costs	cost	NOUN
cana-832	124	10	are:\n',costs	are:\n',cost	NOUN
cana-832	124	11	)	)	PUNCT
cana-832	124	12	print('\n	print('\n	PROPN
cana-832	124	13	'	'	PUNCT
cana-832	124	14	)	)	PUNCT
cana-832	124	15	supply	supply	NOUN
cana-832	124	16	=	=	SYM
cana-832	124	17	list(map(int	list(map(int	NUM
cana-832	124	18	,	,	PUNCT
cana-832	124	19	input("enter	input("enter	VERB
cana-832	124	20	the	the	DET
cana-832	124	21	supply	supply	NOUN
cana-832	124	22	values	value	VERB
cana-832	124	23	:	:	PUNCT
cana-832	124	24	"	"	PUNCT
cana-832	124	25	)	)	PUNCT
cana-832	124	26	.strip().split()))[:m	.strip().split()))[:m	SYM
cana-832	124	27	]	]	X
cana-832	124	28	print('\n	print('\n	PROPN
cana-832	124	29	'	'	PUNCT
cana-832	124	30	)	)	PUNCT
cana-832	124	31	demand	demand	NOUN
cana-832	124	32	=	=	SYM
cana-832	124	33	list(map(int	list(map(int	PUNCT
cana-832	124	34	,	,	PUNCT
cana-832	124	35	input("enter	input("enter	VERB
cana-832	124	36	the	the	DET
cana-832	124	37	demand	demand	NOUN
cana-832	124	38	values	value	VERB
cana-832	124	39	:	:	PUNCT
cana-832	124	40	"	"	PUNCT
cana-832	124	41	)	)	PUNCT
cana-832	124	42	.strip().split()))[:n	.strip().split()))[:n	X
cana-832	124	43	]	]	X
cana-832	124	44	print('\n	print('\n	PROPN
cana-832	124	45	'	'	PUNCT
cana-832	124	46	)	)	PUNCT
cana-832	124	47	ans	an	NOUN
cana-832	124	48	=	=	SYM
cana-832	124	49	transportation_method(supply	transportation_method(supply	PROPN
cana-832	124	50	,	,	PUNCT
cana-832	124	51	demand	demand	NOUN
cana-832	124	52	,	,	PUNCT
cana-832	124	53	costs	cost	NOUN
cana-832	124	54	)	)	PUNCT
cana-832	124	55	print('\n	print('\n	PROPN
cana-832	124	56	'	'	PUNCT
cana-832	124	57	)	)	PUNCT
cana-832	124	58	print('\n	print('\n	VERB
cana-832	124	59	the	the	DET
cana-832	124	60	optimal	optimal	ADJ
cana-832	124	61	solution	solution	NOUN
cana-832	124	62	is:\n',ans	is:\n',an	NOUN
cana-832	124	63	)	)	PUNCT
cana-832	124	64	print('total	print('total	ADJ
cana-832	124	65	optimal	optimal	ADJ
cana-832	124	66	cost	cost	NOUN
cana-832	124	67	:	:	PUNCT
cana-832	124	68	'	'	PUNCT
cana-832	124	69	,	,	PUNCT
cana-832	124	70	get_total_cost(costs	get_total_cost(cost	NOUN
cana-832	124	71	,	,	PUNCT
cana-832	124	72	ans	an	NOUN
cana-832	124	73	)	)	PUNCT
cana-832	124	74	)	)	PUNCT
cana-832	124	75	output	output	NOUN
cana-832	124	76	:	:	PUNCT
cana-832	124	77	enter	enter	VERB
cana-832	124	78	m:3	m:3	X
cana-832	124	79	enter	enter	VERB
cana-832	124	80	n:3	n:3	AUX
cana-832	124	81	enter	enter	VERB
cana-832	124	82	all	all	DET
cana-832	124	83	costs	cost	NOUN
cana-832	124	84	in	in	ADP
cana-832	124	85	one	one	NUM
cana-832	124	86	line	line	NOUN
cana-832	124	87	6	6	NUM
cana-832	124	88	8	8	NUM
cana-832	124	89	10	10	NUM
cana-832	124	90	7	7	NUM
cana-832	124	91	11	11	NUM
cana-832	124	92	11	11	NUM
cana-832	124	93	4	4	NUM
cana-832	124	94	5	5	NUM
cana-832	124	95	12	12	NUM
cana-832	124	96	the	the	DET
cana-832	124	97	costs	cost	NOUN
cana-832	124	98	are	be	AUX
cana-832	124	99	:	:	PUNCT
cana-832	125	1	[	[	X
cana-832	125	2	[	[	PUNCT
cana-832	125	3	6	6	NUM
cana-832	125	4	.	.	NOUN
cana-832	125	5	8	8	NUM
cana-832	125	6	.	.	X
cana-832	125	7	10	10	NUM
cana-832	125	8	.	.	PUNCT
cana-832	125	9	]	]	X
cana-832	126	1	[	[	PUNCT
cana-832	126	2	7	7	NUM
cana-832	126	3	.	.	NOUN
cana-832	126	4	11	11	NUM
cana-832	126	5	.	.	X
cana-832	126	6	11	11	NUM
cana-832	126	7	.	.	PUNCT
cana-832	126	8	]	]	X
cana-832	127	1	[	[	PUNCT
cana-832	127	2	4	4	NUM
cana-832	127	3	.	.	NOUN
cana-832	127	4	5	5	NUM
cana-832	127	5	.	.	NOUN
cana-832	127	6	12	12	NUM
cana-832	127	7	.	.	PUNCT
cana-832	127	8	]	]	X
cana-832	127	9	]	]	PUNCT
cana-832	127	10	enter	enter	VERB
cana-832	127	11	the	the	DET
cana-832	127	12	supply	supply	NOUN
cana-832	127	13	values	value	NOUN
cana-832	127	14	:	:	PUNCT
cana-832	127	15	150	150	NUM
cana-832	127	16	175	175	NUM
cana-832	127	17	275	275	NUM
cana-832	127	18	enter	enter	VERB
cana-832	127	19	the	the	DET
cana-832	127	20	demand	demand	NOUN
cana-832	127	21	values	value	NOUN
cana-832	127	22	:	:	PUNCT
cana-832	127	23	200	200	NUM
cana-832	127	24	100	100	NUM
cana-832	127	25	300	300	NUM
cana-832	127	26	the	the	DET
cana-832	127	27	initial	initial	ADJ
cana-832	127	28	bfs	bfs	NOUN
cana-832	127	29	is	be	AUX
cana-832	127	30	:	:	PUNCT
cana-832	128	1	[	[	X
cana-832	128	2	[	[	X
cana-832	128	3	150.0	150.0	NUM
cana-832	128	4	,	,	PUNCT
cana-832	128	5	0	0	NUM
cana-832	128	6	,	,	PUNCT
cana-832	128	7	0	0	NUM
cana-832	128	8	]	]	PUNCT
cana-832	128	9	,	,	PUNCT
cana-832	128	10	[	[	X
cana-832	128	11	50.0	50.0	NUM
cana-832	128	12	,	,	PUNCT
cana-832	128	13	100.0	100.0	NUM
cana-832	128	14	,	,	PUNCT
cana-832	128	15	25.0	25.0	NUM
cana-832	128	16	]	]	PUNCT
cana-832	128	17	,	,	PUNCT
cana-832	128	18	[	[	X
cana-832	128	19	0	0	NUM
cana-832	128	20	,	,	PUNCT
cana-832	128	21	0	0	NUM
cana-832	128	22	,	,	PUNCT
cana-832	128	23	275.0	275.0	NUM
cana-832	128	24	]	]	PUNCT
cana-832	128	25	]	]	X
cana-832	128	26	total	total	ADJ
cana-832	128	27	bfs	bfs	NOUN
cana-832	128	28	cost	cost	NOUN
cana-832	128	29	is	be	AUX
cana-832	128	30	:	:	PUNCT
cana-832	128	31	5925.0	5925.0	NUM
cana-832	128	32	the	the	DET
cana-832	128	33	optimal	optimal	ADJ
cana-832	128	34	solution	solution	NOUN
cana-832	128	35	is	be	AUX
cana-832	128	36	:	:	PUNCT
cana-832	129	1	[	[	X
cana-832	129	2	[	[	PUNCT
cana-832	129	3	25	25	NUM
cana-832	129	4	.	.	NOUN
cana-832	129	5	0	0	NUM
cana-832	129	6	.	.	X
cana-832	129	7	125	125	NUM
cana-832	129	8	.	.	PUNCT
cana-832	129	9	]	]	PUNCT
cana-832	130	1	[	[	PUNCT
cana-832	130	2	0	0	NUM
cana-832	130	3	.	.	NOUN
cana-832	130	4	0	0	NUM
cana-832	130	5	.	.	X
cana-832	130	6	175	175	NUM
cana-832	130	7	.	.	PUNCT
cana-832	130	8	]	]	PUNCT
cana-832	131	1	[	[	X
cana-832	131	2	175	175	NUM
cana-832	131	3	.	.	NOUN
cana-832	131	4	100	100	NUM
cana-832	131	5	.	.	NUM
cana-832	131	6	0	0	NUM
cana-832	131	7	.	.	NUM
cana-832	131	8	]	]	X
cana-832	131	9	]	]	X
cana-832	131	10	total	total	ADJ
cana-832	131	11	optimal	optimal	ADJ
cana-832	131	12	cost	cost	NOUN
cana-832	131	13	:	:	PUNCT
cana-832	131	14	4550.0	4550.0	NUM
cana-832	131	15	communications	communication	NOUN
cana-832	131	16	on	on	ADP
cana-832	131	17	applied	apply	VERB
cana-832	131	18	nonlinear	nonlinear	ADJ
cana-832	131	19	analysis	analysis	NOUN
cana-832	131	20	issn	issn	NOUN
cana-832	131	21	:	:	PUNCT
cana-832	131	22	1074	1074	NUM
cana-832	131	23	-	-	PUNCT
cana-832	131	24	133x	133x	NUM
cana-832	131	25	vol	vol	NOUN
cana-832	131	26	31	31	NUM
cana-832	131	27	no	no	NOUN
cana-832	131	28	.	.	PUNCT
cana-832	132	1	4s	4s	NUM
cana-832	132	2	(	(	PUNCT
cana-832	132	3	2024	2024	NUM
cana-832	132	4	)	)	PUNCT
cana-832	132	5	145	145	NUM
cana-832	132	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	132	7	the	the	DET
cana-832	132	8	table	table	NOUN
cana-832	132	9	below	below	ADV
cana-832	132	10	shows	show	VERB
cana-832	132	11	the	the	DET
cana-832	132	12	optimal	optimal	ADJ
cana-832	132	13	distribution	distribution	NOUN
cana-832	132	14	based	base	VERB
cana-832	132	15	on	on	ADP
cana-832	132	16	the	the	DET
cana-832	132	17	earlier	early	ADV
cana-832	132	18	described	describe	VERB
cana-832	132	19	procedure	procedure	NOUN
cana-832	132	20	:	:	PUNCT
cana-832	132	21	the	the	DET
cana-832	132	22	total	total	ADJ
cana-832	132	23	transportation	transportation	NOUN
cana-832	132	24	cost	cost	NOUN
cana-832	132	25	=	=	SYM
cana-832	132	26	8	8	NUM
cana-832	132	27	∗	∗	NOUN
cana-832	132	28	25	25	NUM
cana-832	133	1	+	+	CCONJ
cana-832	133	2	10	10	NUM
cana-832	133	3	∗	∗	NOUN
cana-832	133	4	125	125	NUM
cana-832	133	5	+	+	CCONJ
cana-832	133	6	11	11	NUM
cana-832	133	7	∗	∗	NOUN
cana-832	133	8	175	175	NUM
cana-832	133	9	+	+	CCONJ
cana-832	133	10	4	4	NUM
cana-832	133	11	∗	∗	NOUN
cana-832	133	12	200	200	NUM
cana-832	133	13	+	+	SYM
cana-832	133	14	5	5	NUM
cana-832	133	15	∗	∗	NOUN
cana-832	133	16	75	75	NUM
cana-832	133	17	=	=	SYM
cana-832	133	18	4550	4550	NUM
cana-832	133	19	.	.	PUNCT
cana-832	134	1	4	4	NUM
cana-832	134	2	conclusion	conclusion	NOUN
cana-832	134	3	the	the	DET
cana-832	134	4	research	research	NOUN
cana-832	134	5	article	article	NOUN
cana-832	134	6	has	have	AUX
cana-832	134	7	introduced	introduce	VERB
cana-832	134	8	a	a	DET
cana-832	134	9	novel	novel	NOUN
cana-832	134	10	and	and	CCONJ
cana-832	134	11	promising	promising	ADJ
cana-832	134	12	approach	approach	NOUN
cana-832	134	13	to	to	ADP
cana-832	134	14	solving	solve	VERB
cana-832	134	15	transportation	transportation	NOUN
cana-832	134	16	problems	problem	NOUN
cana-832	134	17	through	through	ADP
cana-832	134	18	the	the	DET
cana-832	134	19	application	application	NOUN
cana-832	134	20	of	of	ADP
cana-832	134	21	the	the	DET
cana-832	134	22	topologized	topologize	VERB
cana-832	134	23	graphical	graphical	ADJ
cana-832	134	24	method	method	NOUN
cana-832	134	25	and	and	CCONJ
cana-832	134	26	computational	computational	ADJ
cana-832	134	27	techniques	technique	NOUN
cana-832	134	28	.	.	PUNCT
cana-832	135	1	this	this	DET
cana-832	135	2	study	study	NOUN
cana-832	135	3	has	have	AUX
cana-832	135	4	highlighted	highlight	VERB
cana-832	135	5	the	the	DET
cana-832	135	6	significance	significance	NOUN
cana-832	135	7	of	of	ADP
cana-832	135	8	digitalization	digitalization	NOUN
cana-832	135	9	in	in	ADP
cana-832	135	10	optimizing	optimize	VERB
cana-832	135	11	logistics	logistic	NOUN
cana-832	135	12	,	,	PUNCT
cana-832	135	13	supply	supply	NOUN
cana-832	135	14	chain	chain	NOUN
cana-832	135	15	management	management	NOUN
cana-832	135	16	,	,	PUNCT
cana-832	135	17	and	and	CCONJ
cana-832	135	18	network	network	NOUN
cana-832	135	19	design	design	NOUN
cana-832	135	20	.	.	PUNCT
cana-832	136	1	the	the	DET
cana-832	136	2	utilization	utilization	NOUN
cana-832	136	3	of	of	ADP
cana-832	136	4	topological	topological	ADJ
cana-832	136	5	spaces	space	NOUN
cana-832	136	6	and	and	CCONJ
cana-832	136	7	graph	graph	NOUN
cana-832	136	8	theory	theory	NOUN
cana-832	136	9	has	have	AUX
cana-832	136	10	provided	provide	VERB
cana-832	136	11	a	a	DET
cana-832	136	12	fresh	fresh	ADJ
cana-832	136	13	perspective	perspective	NOUN
cana-832	136	14	on	on	ADP
cana-832	136	15	addressing	address	VERB
cana-832	136	16	transportation	transportation	NOUN
cana-832	136	17	problems	problem	NOUN
cana-832	136	18	,	,	PUNCT
cana-832	136	19	opening	open	VERB
cana-832	136	20	up	up	ADP
cana-832	136	21	new	new	ADJ
cana-832	136	22	avenues	avenue	NOUN
cana-832	136	23	for	for	ADP
cana-832	136	24	optimization	optimization	NOUN
cana-832	136	25	.	.	PUNCT
cana-832	137	1	by	by	ADP
cana-832	137	2	transforming	transform	VERB
cana-832	137	3	these	these	DET
cana-832	137	4	problems	problem	NOUN
cana-832	137	5	into	into	ADP
cana-832	137	6	topologized	topologize	VERB
cana-832	137	7	graphical	graphical	ADJ
cana-832	137	8	representations	representation	NOUN
cana-832	137	9	,	,	PUNCT
cana-832	137	10	the	the	DET
cana-832	137	11	research	research	NOUN
cana-832	137	12	has	have	AUX
cana-832	137	13	demonstrated	demonstrate	VERB
cana-832	137	14	the	the	DET
cana-832	137	15	efficiency	efficiency	NOUN
cana-832	137	16	and	and	CCONJ
cana-832	137	17	versatility	versatility	NOUN
cana-832	137	18	of	of	ADP
cana-832	137	19	this	this	DET
cana-832	137	20	approach	approach	NOUN
cana-832	137	21	in	in	ADP
cana-832	137	22	finding	find	VERB
cana-832	137	23	optimal	optimal	ADJ
cana-832	137	24	solutions	solution	NOUN
cana-832	137	25	.	.	PUNCT
cana-832	138	1	the	the	DET
cana-832	138	2	python	python	NOUN
cana-832	138	3	coding	coding	NOUN
cana-832	138	4	established	establish	VERB
cana-832	138	5	as	as	ADP
cana-832	138	6	portion	portion	NOUN
cana-832	138	7	of	of	ADP
cana-832	138	8	this	this	DET
cana-832	138	9	research	research	NOUN
cana-832	138	10	offers	offer	VERB
cana-832	138	11	a	a	DET
cana-832	138	12	practical	practical	ADJ
cana-832	138	13	tool	tool	NOUN
cana-832	138	14	for	for	ADP
cana-832	138	15	implementing	implement	VERB
cana-832	138	16	the	the	DET
cana-832	138	17	topologized	topologize	VERB
cana-832	138	18	graphical	graphical	ADJ
cana-832	138	19	method	method	NOUN
cana-832	138	20	,	,	PUNCT
cana-832	138	21	making	make	VERB
cana-832	138	22	it	it	PRON
cana-832	138	23	accessible	accessible	ADJ
cana-832	138	24	and	and	CCONJ
cana-832	138	25	applicable	applicable	ADJ
cana-832	138	26	to	to	ADP
cana-832	138	27	a	a	DET
cana-832	138	28	wide	wide	ADJ
cana-832	138	29	range	range	NOUN
cana-832	138	30	of	of	ADP
cana-832	138	31	scenarios	scenario	NOUN
cana-832	138	32	.	.	PUNCT
cana-832	139	1	overall	overall	ADJ
cana-832	139	2	,	,	PUNCT
cana-832	139	3	this	this	DET
cana-832	139	4	research	research	NOUN
cana-832	139	5	contributes	contribute	VERB
cana-832	139	6	valuable	valuable	ADJ
cana-832	139	7	insights	insight	NOUN
cana-832	139	8	and	and	CCONJ
cana-832	139	9	a	a	DET
cana-832	139	10	practical	practical	ADJ
cana-832	139	11	solution	solution	NOUN
cana-832	139	12	to	to	PART
cana-832	139	13	address	address	VERB
cana-832	139	14	transportation	transportation	NOUN
cana-832	139	15	problems	problem	NOUN
cana-832	139	16	using	use	VERB
cana-832	139	17	digitalization	digitalization	NOUN
cana-832	139	18	and	and	CCONJ
cana-832	139	19	mathematical	mathematical	ADJ
cana-832	139	20	techniques	technique	NOUN
cana-832	139	21	in	in	ADP
cana-832	139	22	real	real	ADJ
cana-832	139	23	-	-	PUNCT
cana-832	139	24	world	world	NOUN
cana-832	139	25	problem	problem	NOUN
cana-832	139	26	-	-	PUNCT
cana-832	139	27	solving	solving	NOUN
cana-832	139	28	.	.	PUNCT
cana-832	140	1	it	it	PRON
cana-832	140	2	is	be	AUX
cana-832	140	3	expected	expect	VERB
cana-832	140	4	that	that	SCONJ
cana-832	140	5	this	this	DET
cana-832	140	6	research	research	NOUN
cana-832	140	7	will	will	AUX
cana-832	140	8	stimulate	stimulate	VERB
cana-832	140	9	further	further	ADJ
cana-832	140	10	exploration	exploration	NOUN
cana-832	140	11	and	and	CCONJ
cana-832	140	12	application	application	NOUN
cana-832	140	13	of	of	ADP
cana-832	140	14	topological	topological	ADJ
cana-832	140	15	methods	method	NOUN
cana-832	140	16	in	in	ADP
cana-832	140	17	optimization	optimization	NOUN
cana-832	140	18	and	and	CCONJ
cana-832	140	19	computational	computational	ADJ
cana-832	140	20	fields	field	NOUN
cana-832	140	21	.	.	PUNCT
cana-832	141	1	references	reference	NOUN
cana-832	141	2	:	:	PUNCT
cana-832	142	1	[	[	X
cana-832	142	2	1	1	X
cana-832	142	3	]	]	X
cana-832	142	4	antoine	antoine	PROPN
cana-832	142	5	vella	vella	PROPN
cana-832	142	6	.	.	PUNCT
cana-832	143	1	a	a	DET
cana-832	143	2	,	,	PUNCT
cana-832	143	3	fundamendally	fundamendally	ADV
cana-832	143	4	topological	topological	ADJ
cana-832	143	5	perspective	perspective	NOUN
cana-832	143	6	on	on	ADP
cana-832	143	7	graph	graph	NOUN
cana-832	143	8	theory	theory	NOUN
cana-832	143	9	.	.	PUNCT
cana-832	144	1	ph.d	ph.d	PROPN
cana-832	144	2	.	.	PROPN
cana-832	144	3	,	,	PUNCT
cana-832	144	4	thesis	thesis	NOUN
cana-832	144	5	,	,	PUNCT
cana-832	144	6	waterloo	waterloo	PROPN
cana-832	144	7	,	,	PUNCT
cana-832	144	8	ontario	ontario	PROPN
cana-832	144	9	,	,	PUNCT
cana-832	144	10	canada	canada	PROPN
cana-832	144	11	;	;	PUNCT
cana-832	144	12	2005	2005	NUM
cana-832	144	13	.	.	PUNCT
cana-832	145	1	[	[	X
cana-832	145	2	2	2	NUM
cana-832	145	3	]	]	X
cana-832	145	4	chanas	chana	NOUN
cana-832	145	5	.	.	PUNCT
cana-832	146	1	s	s	X
cana-832	146	2	,	,	PUNCT
cana-832	146	3	kuchta	kuchta	X
cana-832	146	4	.	.	PUNCT
cana-832	147	1	d	d	X
cana-832	147	2	,	,	PUNCT
cana-832	147	3	a	a	DET
cana-832	147	4	concept	concept	NOUN
cana-832	147	5	of	of	ADP
cana-832	147	6	the	the	DET
cana-832	147	7	optimal	optimal	ADJ
cana-832	147	8	solution	solution	NOUN
cana-832	147	9	of	of	ADP
cana-832	147	10	the	the	DET
cana-832	147	11	transportation	transportation	NOUN
cana-832	147	12	problem	problem	NOUN
cana-832	147	13	with	with	ADP
cana-832	147	14	fuzzy	fuzzy	ADJ
cana-832	147	15	cost	cost	NOUN
cana-832	147	16	coefficients	coefficient	NOUN
cana-832	147	17	,	,	PUNCT
cana-832	147	18	fuzzy	fuzzy	ADJ
cana-832	147	19	sets	set	NOUN
cana-832	147	20	and	and	CCONJ
cana-832	147	21	systems	system	NOUN
cana-832	147	22	,	,	PUNCT
cana-832	147	23	issn	issn	PROPN
cana-832	147	24	0165	0165	NUM
cana-832	147	25	-	-	SYM
cana-832	147	26	0114	0114	NUM
cana-832	147	27	,	,	PUNCT
cana-832	147	28	volume	volume	NOUN
cana-832	147	29	82	82	NUM
cana-832	147	30	,	,	PUNCT
cana-832	147	31	issue	issue	NOUN
cana-832	147	32	3	3	NUM
cana-832	147	33	,	,	PUNCT
cana-832	147	34	1996	1996	NUM
cana-832	147	35	,	,	PUNCT
cana-832	147	36	pages	page	NOUN
cana-832	147	37	299	299	NUM
cana-832	147	38	-	-	SYM
cana-832	147	39	305	305	NUM
cana-832	147	40	,	,	PUNCT
cana-832	147	41	1996	1996	NUM
cana-832	147	42	.	.	PUNCT
cana-832	148	1	[	[	X
cana-832	148	2	3	3	X
cana-832	148	3	]	]	X
cana-832	148	4	kadhim	kadhim	PROPN
cana-832	148	5	b.s	b.s	PROPN
cana-832	148	6	.	.	PROPN
cana-832	148	7	aljanabi	aljanabi	PROPN
cana-832	148	8	and	and	CCONJ
cana-832	148	9	anwar	anwar	PROPN
cana-832	148	10	nsaif	nsaif	PROPN
cana-832	148	11	jasim	jasim	PROPN
cana-832	148	12	,	,	PUNCT
cana-832	148	13	an	an	DET
cana-832	148	14	approach	approach	NOUN
cana-832	148	15	for	for	ADP
cana-832	148	16	solving	solve	VERB
cana-832	148	17	transportation	transportation	NOUN
cana-832	148	18	problem	problem	NOUN
cana-832	148	19	using	use	VERB
cana-832	148	20	modified	modify	VERB
cana-832	148	21	kruskal	kruskal	NOUN
cana-832	148	22	’s	’s	PART
cana-832	148	23	algorithm	algorithm	NOUN
cana-832	148	24	,	,	PUNCT
cana-832	148	25	international	international	ADJ
cana-832	148	26	journal	journal	NOUN
cana-832	148	27	of	of	ADP
cana-832	148	28	science	science	NOUN
cana-832	148	29	and	and	CCONJ
cana-832	148	30	research	research	NOUN
cana-832	148	31	,	,	PUNCT
cana-832	148	32	vol.4	vol.4	PROPN
cana-832	148	33	,	,	PUNCT
cana-832	148	34	issue	issue	NOUN
cana-832	148	35	7	7	NUM
cana-832	148	36	,	,	PUNCT
cana-832	148	37	july	july	PROPN
cana-832	148	38	2015	2015	NUM
cana-832	148	39	.	.	PUNCT
cana-832	149	1	[	[	X
cana-832	149	2	4	4	NUM
cana-832	149	3	]	]	X
cana-832	149	4	kaufmann	kaufmann	PROPN
cana-832	149	5	.	.	PUNCT
cana-832	149	6	a.	a.	PROPN
cana-832	149	7	,	,	PUNCT
cana-832	149	8	introduction	introduction	NOUN
cana-832	149	9	a	a	DET
cana-832	149	10	la	la	X
cana-832	149	11	theorie	theorie	PROPN
cana-832	149	12	des	des	PROPN
cana-832	149	13	sonsensembles	sonsensemble	NOUN
cana-832	149	14	flous	flous	ADJ
cana-832	149	15	,	,	PUNCT
cana-832	149	16	masson	masson	PROPN
cana-832	149	17	paris	paris	PROPN
cana-832	149	18	,	,	PUNCT
cana-832	149	19	vol	vol	NOUN
cana-832	149	20	.	.	PROPN
cana-832	149	21	1	1	NUM
cana-832	149	22	,	,	PUNCT
cana-832	149	23	41189	41189	NUM
cana-832	149	24	,	,	PUNCT
cana-832	149	25	1973	1973	NUM
cana-832	149	26	.	.	PUNCT
cana-832	150	1	[	[	X
cana-832	150	2	5	5	NUM
cana-832	150	3	]	]	X
cana-832	150	4	koopsman	koopsman	NOUN
cana-832	150	5	.	.	PUNCT
cana-832	151	1	c.	c.	PROPN
cana-832	151	2	tjalling	tjalling	PROPN
cana-832	151	3	.	.	PUNCT
cana-832	151	4	,	,	PUNCT
cana-832	151	5	utilization	utilization	NOUN
cana-832	151	6	of	of	ADP
cana-832	151	7	the	the	DET
cana-832	151	8	transportation	transportation	NOUN
cana-832	151	9	system	system	NOUN
cana-832	151	10	,	,	PUNCT
cana-832	151	11	econometrica	econometrica	PROPN
cana-832	151	12	,	,	PUNCT
cana-832	151	13	vol.17	vol.17	ADJ
cana-832	151	14	,	,	PUNCT
cana-832	151	15	pp	pp	ADJ
cana-832	151	16	.	.	PUNCT
cana-832	152	1	136	136	NUM
cana-832	152	2	-	-	SYM
cana-832	152	3	146	146	NUM
cana-832	152	4	,	,	PUNCT
cana-832	152	5	july	july	PROPN
cana-832	152	6	1949	1949	NUM
cana-832	152	7	.	.	PUNCT
cana-832	153	1	[	[	X
cana-832	153	2	6	6	NUM
cana-832	153	3	]	]	PUNCT
cana-832	153	4	mollah	mollah	ADJ
cana-832	153	5	mesbahuddin	mesbahuddin	NOUN
cana-832	153	6	ahmed	ahmed	PROPN
cana-832	153	7	et.al	et.al	PROPN
cana-832	153	8	.	.	PROPN
cana-832	153	9	,	,	PUNCT
cana-832	153	10	a	a	DET
cana-832	153	11	new	new	ADJ
cana-832	153	12	approach	approach	NOUN
cana-832	153	13	to	to	PART
cana-832	153	14	solve	solve	VERB
cana-832	153	15	transportation	transportation	NOUN
cana-832	153	16	problems	problem	NOUN
cana-832	153	17	,	,	PUNCT
cana-832	153	18	open	open	ADJ
cana-832	153	19	journal	journal	NOUN
cana-832	153	20	of	of	ADP
cana-832	153	21	optimization	optimization	NOUN
cana-832	153	22	,	,	PUNCT
cana-832	153	23	vol	vol	NOUN
cana-832	153	24	5	5	NUM
cana-832	153	25	,	,	PUNCT
cana-832	153	26	pp	pp	ADP
cana-832	153	27	2230	2230	NUM
cana-832	153	28	,	,	PUNCT
cana-832	153	29	2016	2016	NUM
cana-832	153	30	.	.	PUNCT
cana-832	154	1	[	[	X
cana-832	154	2	7	7	NUM
cana-832	154	3	]	]	PUNCT
cana-832	154	4	priyadharsini	priyadharsini	NOUN
cana-832	154	5	.	.	PUNCT
cana-832	155	1	s	s	X
cana-832	155	2	,	,	PUNCT
cana-832	155	3	kungumaraj.e	kungumaraj.e	PUNCT
cana-832	155	4	and	and	CCONJ
cana-832	155	5	santhi	santhi	ADJ
cana-832	155	6	.	.	PUNCT
cana-832	156	1	r	r	X
cana-832	156	2	,	,	PUNCT
cana-832	156	3	an	an	DET
cana-832	156	4	evaluation	evaluation	NOUN
cana-832	156	5	of	of	ADP
cana-832	156	6	triangular	triangular	NOUN
cana-832	156	7	neutrosophic	neutrosophic	ADJ
cana-832	156	8	pert	pert	ADJ
cana-832	156	9	analysis	analysis	NOUN
cana-832	156	10	for	for	ADP
cana-832	156	11	real	real	ADJ
cana-832	156	12	-	-	PUNCT
cana-832	156	13	life	life	NOUN
cana-832	156	14	project	project	NOUN
cana-832	156	15	time	time	NOUN
cana-832	156	16	and	and	CCONJ
cana-832	156	17	cost	cost	NOUN
cana-832	156	18	estimation	estimation	NOUN
cana-832	156	19	,	,	PUNCT
cana-832	156	20	vol.63	vol.63	ADJ
cana-832	156	21	,	,	PUNCT
cana-832	156	22	nuetrosophic	nuetrosophic	ADJ
cana-832	156	23	sets	set	NOUN
cana-832	156	24	and	and	CCONJ
cana-832	156	25	systems	system	NOUN
cana-832	156	26	,	,	PUNCT
cana-832	156	27	pp	pp	ADP
cana-832	156	28	62	62	NUM
cana-832	156	29	-	-	SYM
cana-832	156	30	81	81	NUM
cana-832	156	31	,	,	PUNCT
cana-832	156	32	2024	2024	NUM
cana-832	156	33	.	.	PUNCT
cana-832	157	1	communications	communication	NOUN
cana-832	157	2	on	on	ADP
cana-832	157	3	applied	apply	VERB
cana-832	157	4	nonlinear	nonlinear	ADJ
cana-832	157	5	analysis	analysis	NOUN
cana-832	157	6	issn	issn	NOUN
cana-832	157	7	:	:	PUNCT
cana-832	157	8	1074	1074	NUM
cana-832	157	9	-	-	PUNCT
cana-832	157	10	133x	133x	NUM
cana-832	157	11	vol	vol	NOUN
cana-832	157	12	31	31	NUM
cana-832	157	13	no	no	NOUN
cana-832	157	14	.	.	PUNCT
cana-832	158	1	4s	4s	NUM
cana-832	158	2	(	(	PUNCT
cana-832	158	3	2024	2024	NUM
cana-832	158	4	)	)	PUNCT
cana-832	158	5	146	146	NUM
cana-832	158	6	https://internationalpubls.com	https://internationalpubls.com	X
cana-832	159	1	[	[	X
cana-832	159	2	8	8	NUM
cana-832	159	3	]	]	X
cana-832	159	4	santhi	santhi	ADJ
cana-832	159	5	.	.	PUNCT
cana-832	160	1	r	r	NOUN
cana-832	160	2	and	and	CCONJ
cana-832	160	3	kungumaraj	kungumaraj	ADJ
cana-832	160	4	.	.	PUNCT
cana-832	161	1	e	e	X
cana-832	161	2	,	,	PUNCT
cana-832	161	3	topological	topological	ADJ
cana-832	161	4	solution	solution	NOUN
cana-832	161	5	of	of	ADP
cana-832	161	6	a	a	DET
cana-832	161	7	transportation	transportation	NOUN
cana-832	161	8	problem	problem	NOUN
cana-832	161	9	using	use	VERB
cana-832	161	10	topologized	topologize	VERB
cana-832	161	11	graph	graph	NOUN
cana-832	161	12	,	,	PUNCT
cana-832	161	13	iaetsd	iaetsd	ADJ
cana-832	161	14	journal	journal	NOUN
cana-832	161	15	for	for	ADP
cana-832	161	16	advanced	advanced	ADJ
cana-832	161	17	research	research	NOUN
cana-832	161	18	in	in	ADP
cana-832	161	19	applied	apply	VERB
cana-832	161	20	sciences	science	NOUN
cana-832	161	21	,	,	PUNCT
cana-832	161	22	volume	volume	NOUN
cana-832	161	23	vi	vi	PROPN
cana-832	161	24	,	,	PUNCT
cana-832	161	25	issue	issue	NOUN
cana-832	161	26	vi	vi	PROPN
cana-832	161	27	,	,	PUNCT
cana-832	161	28	pp	pp	ADV
cana-832	161	29	30	30	NUM
cana-832	161	30	-	-	SYM
cana-832	161	31	38	38	NUM
cana-832	161	32	,	,	PUNCT
cana-832	161	33	june	june	PROPN
cana-832	161	34	2019	2019	NUM
cana-832	161	35	.	.	PUNCT
cana-832	162	1	[	[	X
cana-832	162	2	9	9	NUM
cana-832	162	3	]	]	PUNCT
cana-832	162	4	shugani	shugani	PROPN
cana-832	162	5	poonam	poonam	PROPN
cana-832	162	6	,	,	PUNCT
cana-832	162	7	abbas	abbas	PROPN
cana-832	162	8	s.	s.	PROPN
cana-832	162	9	h.	h.	PROPN
cana-832	162	10	and	and	CCONJ
cana-832	162	11	gupta	gupta	PROPN
cana-832	162	12	v.k	v.k	PROPN
cana-832	162	13	.	.	PROPN
cana-832	162	14	,	,	PUNCT
cana-832	162	15	fuzzy	fuzzy	ADJ
cana-832	162	16	transportation	transportation	NOUN
cana-832	162	17	problem	problem	NOUN
cana-832	162	18	of	of	ADP
cana-832	162	19	triangular	triangular	NOUN
cana-832	162	20	numbers	number	NOUN
cana-832	162	21	with	with	ADP
cana-832	162	22	αcut	αcut	ADJ
cana-832	162	23	and	and	CCONJ
cana-832	162	24	ranking	ranking	ADJ
cana-832	162	25	technique	technique	NOUN
cana-832	162	26	,	,	PUNCT
cana-832	162	27	iosr	iosr	ADJ
cana-832	162	28	journal	journal	NOUN
cana-832	162	29	of	of	ADP
cana-832	162	30	engineering	engineering	NOUN
cana-832	162	31	,	,	PUNCT
cana-832	162	32	vol.2(5),pp	vol.2(5),pp	CCONJ
cana-832	162	33	1162	1162	NUM
cana-832	162	34	1164	1164	NUM
cana-832	162	35	may	may	PROPN
cana-832	162	36	2012	2012	NUM
cana-832	162	37	.	.	PUNCT
cana-832	163	1	[	[	X
cana-832	163	2	10	10	NUM
cana-832	163	3	]	]	PUNCT
cana-832	163	4	vimala.s	vimala.s	NOUN
cana-832	163	5	and	and	CCONJ
cana-832	163	6	kalpana.s	kalpana.s	PROPN
cana-832	163	7	,	,	PUNCT
cana-832	163	8	matching	matching	NOUN
cana-832	163	9	and	and	CCONJ
cana-832	163	10	coloring	coloring	NOUN
cana-832	163	11	in	in	ADP
cana-832	163	12	topologized	topologize	VERB
cana-832	163	13	bipartite	bipartite	NOUN
cana-832	163	14	graph	graph	NOUN
cana-832	163	15	,	,	PUNCT
cana-832	163	16	international	international	ADJ
cana-832	163	17	journal	journal	NOUN
cana-832	163	18	of	of	ADP
cana-832	163	19	innovative	innovative	ADJ
cana-832	163	20	research	research	NOUN
cana-832	163	21	in	in	ADP
cana-832	163	22	science	science	NOUN
cana-832	163	23	,	,	PUNCT
cana-832	163	24	engineering	engineering	NOUN
cana-832	163	25	and	and	CCONJ
cana-832	163	26	technology	technology	NOUN
cana-832	163	27	vol.6	vol.6	PROPN
cana-832	163	28	,	,	PUNCT
cana-832	163	29	issue	issue	NOUN
cana-832	163	30	4	4	NUM
cana-832	163	31	,	,	PUNCT
cana-832	163	32	pp	pp	ADV
cana-832	163	33	7079	7079	NUM
cana-832	163	34	-	-	SYM
cana-832	163	35	7086	7086	NUM
cana-832	163	36	,	,	PUNCT
cana-832	163	37	apr	apr	NOUN
cana-832	163	38	2017	2017	NUM
cana-832	163	39	.	.	PUNCT
cana-832	164	1	[	[	X
cana-832	164	2	11	11	NUM
cana-832	164	3	]	]	X
cana-832	164	4	vimala	vimala	X
cana-832	164	5	.	.	PUNCT
cana-832	164	6	s	s	PROPN
cana-832	164	7	and	and	CCONJ
cana-832	164	8	kalpana	kalpana	PROPN
cana-832	164	9	.	.	PUNCT
cana-832	165	1	s	s	PART
cana-832	165	2	,	,	PUNCT
cana-832	165	3	topologied	topologie	VERB
cana-832	165	4	bipartite	bipartite	NOUN
cana-832	165	5	graph	graph	NOUN
cana-832	165	6	,	,	PUNCT
cana-832	165	7	asian	asian	ADJ
cana-832	165	8	research	research	NOUN
cana-832	165	9	journal	journal	NOUN
cana-832	165	10	of	of	ADP
cana-832	165	11	math	math	NOUN
cana-832	165	12	ematics	ematic	NOUN
cana-832	165	13	,	,	PUNCT
cana-832	165	14	issn	issn	PROPN
cana-832	165	15	2456	2456	NUM
cana-832	165	16	-	-	PUNCT
cana-832	165	17	477x	477x	PROPN
cana-832	165	18	,	,	PUNCT
cana-832	165	19	vol.4(1	vol.4(1	NOUN
cana-832	165	20	)	)	PUNCT
cana-832	165	21	,	,	PUNCT
cana-832	165	22	pp	pp	ADP
cana-832	165	23	1	1	NUM
cana-832	165	24	-	-	SYM
cana-832	165	25	10	10	NUM
cana-832	165	26	,	,	PUNCT
cana-832	165	27	may	may	PROPN
cana-832	165	28	2017	2017	NUM
cana-832	165	29	.	.	PUNCT