{"id":"https://openalex.org/W4251923474","doi":"https://doi.org/10.1504/ijmor.2017.10007860","title":"A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem","display_name":"A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W4251923474","doi":"https://doi.org/10.1504/ijmor.2017.10007860"},"language":"en","primary_location":{"id":"doi:10.1504/ijmor.2017.10007860","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2017.10007860","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037279956","display_name":"Rajat Kumar Pal","orcid":"https://orcid.org/0000-0001-9838-6500"},"institutions":[{"id":"https://openalex.org/I106542073","display_name":"University of Calcutta","ror":"https://ror.org/01e7v7w47","country_code":"IN","type":"education","lineage":["https://openalex.org/I106542073"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Rajat Kumar Pal","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Calcutta, Calcutta-700 098, West Bengal, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Calcutta, Calcutta-700 098, West Bengal, India","institution_ids":["https://openalex.org/I106542073"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028543826","display_name":"Chiranjit Changdar","orcid":"https://orcid.org/0000-0002-7657-927X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chiranjit Changdar","raw_affiliation_strings":["Department of Computer Science, Raja N.L. Khan Women's College, Midnapore, West Bengal, 721102, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Raja N.L. Khan Women's College, Midnapore, West Bengal, 721102, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030065253","display_name":"G.S. Mahapatra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G.S. Mahapatra","raw_affiliation_strings":["Department of Mathematics, National Institute of Technology Puducherry, Karaikal-609605, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Institute of Technology Puducherry, Karaikal-609605, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037279956"],"corresponding_institution_ids":["https://openalex.org/I106542073"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.36261886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"3","first_page":"310","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9671000242233276,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9023000001907349,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9081234931945801},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6789789199829102},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6740542650222778},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6622030138969421},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5619659423828125},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5571842193603516},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5463094115257263},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5088267922401428},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.48054009675979614},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.46787190437316895},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.46012330055236816},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4479227066040039},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42336955666542053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40488678216934204},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1859789490699768}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9081234931945801},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6789789199829102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6740542650222778},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6622030138969421},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5619659423828125},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5571842193603516},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5463094115257263},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5088267922401428},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.48054009675979614},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.46787190437316895},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.46012330055236816},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4479227066040039},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42336955666542053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40488678216934204},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1859789490699768},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmor.2017.10007860","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2017.10007860","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W4389782626","https://openalex.org/W2908391583","https://openalex.org/W2359992618","https://openalex.org/W2369428395","https://openalex.org/W2981400081","https://openalex.org/W2980689483","https://openalex.org/W4376138746","https://openalex.org/W1997193297"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"advanced":[4],"ant":[5,113],"colony":[6],"optimisation":[7],"approach":[8],"to":[9,73,143],"solve":[10],"sub-tour":[11],"constant":[12],"travelling":[13],"salesman":[14,66],"problem":[15,123],"(SCTSP)":[16],"with":[17,42,149],"time":[18,54,62,71],"limit":[19,72],"in":[20],"fuzzy":[21,128],"environment.":[22],"In":[23,48,77,104],"SCTSP,":[24],"there":[25],"is":[26,114,124],"a":[27,60,69,82,93,117],"set":[28],"of":[29,45,55,85],"sub-tours":[30],"(two":[31],"cities":[32],"for":[33,100,154],"each":[34],"sub-tour).":[35],"A":[36],"traveller":[37],"must":[38,57],"complete":[39,74],"his/her":[40,75],"tour":[41],"predetermined":[43,61],"sequence":[44],"distinct":[46],"sub-tours.":[47],"this":[49,78],"proposed":[50,122],"model,":[51],"the":[52,65,86,102,107],"total":[53],"travel":[56,129],"not":[58],"exceed":[59],"limit,":[63],"i.e.,":[64],"should":[67],"maintain":[68],"maximum":[70],"tour.":[76],"paper,":[79],"we":[80],"present":[81],"modified":[83],"form":[84],"basic":[87],"ACO":[88],"algorithm,":[89],"obtained":[90],"by":[91,111,116,126],"introducing":[92],"new":[94],"operation":[95,99],"known":[96],"as":[97],"restoring":[98,105],"solving":[101],"problem.":[103],"operation,":[106],"low-quality":[108],"path/solution":[109],"given":[110],"any":[112],"replaced":[115],"nearest":[118],"better":[119],"solution.":[120],"The":[121],"solved":[125],"considering":[127],"costs":[130],"and":[131,136],"time.":[132],"Fuzzy":[133],"credibility":[134],"measure":[135],"graded":[137],"mean":[138],"integration":[139],"method":[140],"are":[141,152],"used":[142],"obtain":[144],"optimal":[145],"decision.":[146],"Computational":[147],"results":[148],"different":[150],"datasets":[151],"presented":[153],"illustration.":[155]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}