Three Dimensional Constrained P-Tsp Article Swipe

PDF

Y Sreenuvasulu , R. Vijayalakshmi , Somasekhar Srinivas .V K , M Sundaramurthy ·

YOU? · · 2016 · Open Access · · DOI: https://doi.org/10.9790/5728-1204016983

Many Combinatorial programming problems are NP-hard (Non Linear Polynomial), and we consider one of them called THREE DIMENSIONAL CONSTRAINED P-TSP.Let there be n cities and the distance/cost matrix D(i, j, k) is given from i th city to j th city in k th season.Each of P salesmen starts in first season from Headquarter city '1 'and visits few cities in that season then he enter into next season and visits some more cities in that season and reaches to Headquarter city on or before the last season .The aim of the problem is to find p tours to the p salesmen which covers n-1 cities and the total distance /cost of the tours is minimum subject to the considerations .For this problem we developed a Lexi Search Algorithm using Pattern Recognition Technique .

Related Topics

Mathematics

Combinatorics

Concepts

Mathematics Combinatorics

Metadata

Type: article
Language: en
Landing Page: http://doi.org/10.9790/5728-1204016983
PDF: https://doi.org/10.9790/5728-1204016983
OA Status: bronze
References: 12
Related Works: 10
OpenAlex ID: https://openalex.org/W2508700851

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W2508700851

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.9790/5728-1204016983

Digital Object Identifier
Title: Three Dimensional Constrained P-Tsp

Work title
Type: article

OpenAlex work type
Language: en

Primary language
Publication year: 2016

Year of publication
Publication date: 2016-04-01

Full publication date if available
Authors: Y Sreenuvasulu, R. Vijayalakshmi, Somasekhar Srinivas .V K, M Sundaramurthy

List of authors in order
Landing page: https://doi.org/10.9790/5728-1204016983

Publisher landing page
PDF URL: https://doi.org/10.9790/5728-1204016983

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: bronze

Open access status per OpenAlex
OA URL: https://doi.org/10.9790/5728-1204016983

Direct OA link when available
Concepts: Mathematics, Combinatorics

Top concepts (fields/topics) attached by OpenAlex
Cited by: 0

Total citation count in OpenAlex
References (count): 12

Number of works referenced by this work
Related works (count): 10

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W2508700851
doi	https://doi.org/10.9790/5728-1204016983
ids.doi	https://doi.org/10.9790/5728-1204016983
ids.mag	2508700851
ids.openalex	https://openalex.org/W2508700851
fwci	0.0
type	article
title	Three Dimensional Constrained P-Tsp
biblio.issue	04
biblio.volume	12
biblio.last_page	83
biblio.first_page	69
topics[0].id	https://openalex.org/T10720
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9983999729156494
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1703
topics[0].subfield.display_name	Computational Theory and Mathematics
topics[0].display_name	Complexity and Algorithms in Graphs
topics[1].id	https://openalex.org/T11269
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.9973999857902527
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1702
topics[1].subfield.display_name	Artificial Intelligence
topics[1].display_name	Algorithms and Data Compression
topics[2].id	https://openalex.org/T10996
topics[2].field.id	https://openalex.org/fields/17
topics[2].field.display_name	Computer Science
topics[2].score	0.9968000054359436
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/1704
topics[2].subfield.display_name	Computer Graphics and Computer-Aided Design
topics[2].display_name	Computational Geometry and Mesh Generation
is_xpac	False
apc_list
apc_paid
concepts[0].id	https://openalex.org/C33923547
concepts[0].level	0
concepts[0].score	0.9307945966720581
concepts[0].wikidata	https://www.wikidata.org/wiki/Q395
concepts[0].display_name	Mathematics
concepts[1].id	https://openalex.org/C114614502
concepts[1].level	1
concepts[1].score	0.4022738039493561
concepts[1].wikidata	https://www.wikidata.org/wiki/Q76592
concepts[1].display_name	Combinatorics
keywords[0].id	https://openalex.org/keywords/mathematics
keywords[0].score	0.9307945966720581
keywords[0].display_name	Mathematics
keywords[1].id	https://openalex.org/keywords/combinatorics
keywords[1].score	0.4022738039493561
keywords[1].display_name	Combinatorics
language	en
locations[0].id	doi:10.9790/5728-1204016983
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4210221498
locations[0].source.issn	2278-5728, 2319-765X
locations[0].source.type	journal
locations[0].source.is_oa	False
locations[0].source.issn_l	2278-5728
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	IOSR Journal of Mathematics
locations[0].source.host_organization
locations[0].source.host_organization_name
locations[0].license
locations[0].pdf_url	https://doi.org/10.9790/5728-1204016983
locations[0].version	publishedVersion
locations[0].raw_type	journal-article
locations[0].license_id
locations[0].is_accepted	True
locations[0].is_published	True
locations[0].raw_source_name	IOSR Journal of Mathematics
locations[0].landing_page_url	http://doi.org/10.9790/5728-1204016983
indexed_in	crossref
authorships[0].author.id	https://openalex.org/A5080522718
authorships[0].author.orcid
authorships[0].author.display_name	Y Sreenuvasulu
authorships[0].author_position	first
authorships[0].raw_author_name	Sreenuvasulu Y
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5060622366
authorships[1].author.orcid
authorships[1].author.display_name	R. Vijayalakshmi
authorships[1].author_position	middle
authorships[1].raw_author_name	Vijayalakshmi R
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5078925254
authorships[2].author.orcid
authorships[2].author.display_name	Somasekhar Srinivas .V K
authorships[2].author_position	middle
authorships[2].raw_author_name	Somasekhar Srinivas .V K
authorships[2].is_corresponding	False
authorships[3].author.id	https://openalex.org/A5089612203
authorships[3].author.orcid
authorships[3].author.display_name	M Sundaramurthy
authorships[3].author_position	last
authorships[3].raw_author_name	Sundaramurthy M
authorships[3].is_corresponding	False
has_content.pdf	True
has_content.grobid_xml	True
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://doi.org/10.9790/5728-1204016983
open_access.oa_status	bronze
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	Three Dimensional Constrained P-Tsp
has_fulltext	True
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic.id	https://openalex.org/T10720
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9983999729156494
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1703
primary_topic.subfield.display_name	Computational Theory and Mathematics
primary_topic.display_name	Complexity and Algorithms in Graphs
related_works	https://openalex.org/W1979597421, https://openalex.org/W2007980826, https://openalex.org/W4245490552, https://openalex.org/W4225152035, https://openalex.org/W2061531152, https://openalex.org/W3002753104, https://openalex.org/W2077600819, https://openalex.org/W1587224694, https://openalex.org/W2911598644, https://openalex.org/W2042127053
cited_by_count	0
locations_count	1
best_oa_location.id	doi:10.9790/5728-1204016983
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4210221498
best_oa_location.source.issn	2278-5728, 2319-765X
best_oa_location.source.type	journal
best_oa_location.source.is_oa	False
best_oa_location.source.issn_l	2278-5728
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	IOSR Journal of Mathematics
best_oa_location.source.host_organization
best_oa_location.source.host_organization_name
best_oa_location.license
best_oa_location.pdf_url	https://doi.org/10.9790/5728-1204016983
best_oa_location.version	publishedVersion
best_oa_location.raw_type	journal-article
best_oa_location.license_id
best_oa_location.is_accepted	True
best_oa_location.is_published	True
best_oa_location.raw_source_name	IOSR Journal of Mathematics
best_oa_location.landing_page_url	http://doi.org/10.9790/5728-1204016983
primary_location.id	doi:10.9790/5728-1204016983
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4210221498
primary_location.source.issn	2278-5728, 2319-765X
primary_location.source.type	journal
primary_location.source.is_oa	False
primary_location.source.issn_l	2278-5728
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	IOSR Journal of Mathematics
primary_location.source.host_organization
primary_location.source.host_organization_name
primary_location.license
primary_location.pdf_url	https://doi.org/10.9790/5728-1204016983
primary_location.version	publishedVersion
primary_location.raw_type	journal-article
primary_location.license_id
primary_location.is_accepted	True
primary_location.is_published	True
primary_location.raw_source_name	IOSR Journal of Mathematics
primary_location.landing_page_url	http://doi.org/10.9790/5728-1204016983
publication_date	2016-04-01
publication_year	2016
referenced_works	https://openalex.org/W1601277319, https://openalex.org/W2775409252, https://openalex.org/W2039097929, https://openalex.org/W1515374773, https://openalex.org/W1987916269, https://openalex.org/W1972335984, https://openalex.org/W2018269848, https://openalex.org/W2139935705, https://openalex.org/W2741926850, https://openalex.org/W4302409124, https://openalex.org/W2089338760, https://openalex.org/W2077539478
referenced_works_count	12
abstract_inverted_index..	133
abstract_inverted_index.P	46
abstract_inverted_index.a	125
abstract_inverted_index.i	34
abstract_inverted_index.j	38
abstract_inverted_index.k	42
abstract_inverted_index.n	22
abstract_inverted_index.p	96, 100
abstract_inverted_index.'1	55
abstract_inverted_index.be	21
abstract_inverted_index.he	64
abstract_inverted_index.in	41, 49, 60, 74
abstract_inverted_index.is	31, 93, 114
abstract_inverted_index.j,	29
abstract_inverted_index.k)	30
abstract_inverted_index.of	13, 45, 90, 111
abstract_inverted_index.on	82
abstract_inverted_index.or	83
abstract_inverted_index.th	35, 39, 43
abstract_inverted_index.to	37, 79, 94, 98, 117
abstract_inverted_index.we	10, 123
abstract_inverted_index.aim	89
abstract_inverted_index.and	9, 24, 69, 77, 106
abstract_inverted_index.are	4
abstract_inverted_index.few	58
abstract_inverted_index.n-1	104
abstract_inverted_index.one	12
abstract_inverted_index.the	25, 85, 91, 99, 107, 112, 118
abstract_inverted_index.'and	56
abstract_inverted_index.(Non	6
abstract_inverted_index..For	120
abstract_inverted_index..The	88
abstract_inverted_index.D(i,	28
abstract_inverted_index.Lexi	126
abstract_inverted_index.Many	0
abstract_inverted_index.city	36, 40, 54, 81
abstract_inverted_index.find	95
abstract_inverted_index.from	33, 52
abstract_inverted_index.into	66
abstract_inverted_index.last	86
abstract_inverted_index.more	72
abstract_inverted_index.next	67
abstract_inverted_index.some	71
abstract_inverted_index.that	61, 75
abstract_inverted_index.them	14
abstract_inverted_index.then	63
abstract_inverted_index.this	121
abstract_inverted_index./cost	110
abstract_inverted_index.THREE	16
abstract_inverted_index.enter	65
abstract_inverted_index.first	50
abstract_inverted_index.given	32
abstract_inverted_index.there	20
abstract_inverted_index.total	108
abstract_inverted_index.tours	97, 113
abstract_inverted_index.using	129
abstract_inverted_index.which	102
abstract_inverted_index.Linear	7
abstract_inverted_index.Search	127
abstract_inverted_index.before	84
abstract_inverted_index.called	15
abstract_inverted_index.cities	23, 59, 73, 105
abstract_inverted_index.covers	103
abstract_inverted_index.matrix	27
abstract_inverted_index.season	51, 62, 68, 76, 87
abstract_inverted_index.starts	48
abstract_inverted_index.visits	57, 70
abstract_inverted_index.NP-hard	5
abstract_inverted_index.Pattern	130
abstract_inverted_index.minimum	115
abstract_inverted_index.problem	92, 122
abstract_inverted_index.reaches	78
abstract_inverted_index.subject	116
abstract_inverted_index.consider	11
abstract_inverted_index.distance	109
abstract_inverted_index.problems	3
abstract_inverted_index.salesmen	47, 101
abstract_inverted_index.Algorithm	128
abstract_inverted_index.P-TSP.Let	19
abstract_inverted_index.Technique	132
abstract_inverted_index.developed	124
abstract_inverted_index.CONSTRAINED	18
abstract_inverted_index.DIMENSIONAL	17
abstract_inverted_index.Headquarter	53, 80
abstract_inverted_index.Recognition	131
abstract_inverted_index.programming	2
abstract_inverted_index.season.Each	44
abstract_inverted_index.Polynomial),	8
abstract_inverted_index.Combinatorial	1
abstract_inverted_index.distance/cost	26
abstract_inverted_index.considerations	119
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	4
citation_normalized_percentile.value	0.0742568
citation_normalized_percentile.is_in_top_1_percent	False
citation_normalized_percentile.is_in_top_10_percent	False