{"id":"https://openalex.org/W2811006983","doi":"https://doi.org/10.1109/rait.2018.8389060","title":"A modified particle swarm optimization algorithm for solving traveling salesman problem with imprecise cost matrix","display_name":"A modified particle swarm optimization algorithm for solving traveling salesman problem with imprecise cost matrix","publication_year":2018,"publication_date":"2018-03-01","ids":{"openalex":"https://openalex.org/W2811006983","doi":"https://doi.org/10.1109/rait.2018.8389060","mag":"2811006983"},"language":"en","primary_location":{"id":"doi:10.1109/rait.2018.8389060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2018.8389060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","raw_type":"proceedings-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/A5027415998","display_name":"Indadul Khan","orcid":"https://orcid.org/0000-0002-4052-551X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Indadul Khan","raw_affiliation_strings":["Department of Computer Science, Chandrakona Vidyasagar Mahavidyalaya, Paschim-Medinipur, W.B., India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Chandrakona Vidyasagar Mahavidyalaya, Paschim-Medinipur, W.B., India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103866799","display_name":"Sova Pal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sova Pal","raw_affiliation_strings":["Department of Computer Science, Y.S. Palpara Mahavidyalaya, Purba-Medinipur, W.B., India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Y.S. Palpara Mahavidyalaya, Purba-Medinipur, W.B., India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038738272","display_name":"Manas Kumar Maiti","orcid":"https://orcid.org/0009-0002-1033-578X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manas Kumar Maiti","raw_affiliation_strings":["Department of Mathematics, Mahishadal Raj College, Purba-Medinipur, W.B., India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Mahishadal Raj College, Purba-Medinipur, W.B., India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8568,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82527422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955999851226807,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9847999811172485,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7539697885513306},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.650484561920166},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5927743315696716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5314850807189941},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.501654863357544},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4563887119293213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4505510926246643},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4354250729084015}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7539697885513306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.650484561920166},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5927743315696716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5314850807189941},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.501654863357544},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4563887119293213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4505510926246643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4354250729084015},{"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.1109/rait.2018.8389060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2018.8389060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 4th International Conference on Recent Advances in Information Technology (RAIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W83064900","https://openalex.org/W916916340","https://openalex.org/W938178507","https://openalex.org/W1560921017","https://openalex.org/W1714717054","https://openalex.org/W1974579840","https://openalex.org/W1981294782","https://openalex.org/W1982265565","https://openalex.org/W1982521388","https://openalex.org/W1984730352","https://openalex.org/W1985440868","https://openalex.org/W1988684310","https://openalex.org/W2042986967","https://openalex.org/W2046996444","https://openalex.org/W2055360661","https://openalex.org/W2058572000","https://openalex.org/W2074195549","https://openalex.org/W2076539542","https://openalex.org/W2081231516","https://openalex.org/W2083395471","https://openalex.org/W2083562689","https://openalex.org/W2107941094","https://openalex.org/W2118807529","https://openalex.org/W2120365438","https://openalex.org/W2128995918","https://openalex.org/W2131613989","https://openalex.org/W2139059344","https://openalex.org/W2152195021","https://openalex.org/W2160534125","https://openalex.org/W2180560002","https://openalex.org/W2182977007","https://openalex.org/W2211122875","https://openalex.org/W2302174052","https://openalex.org/W2324108981","https://openalex.org/W2331132095","https://openalex.org/W2390905155","https://openalex.org/W2399100674","https://openalex.org/W2462240560","https://openalex.org/W2543580944","https://openalex.org/W2583603977","https://openalex.org/W2606019716","https://openalex.org/W2737797443","https://openalex.org/W3139666781","https://openalex.org/W4211007335","https://openalex.org/W6637605938","https://openalex.org/W6686215563","https://openalex.org/W6702066172","https://openalex.org/W6718865305"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2073288620","https://openalex.org/W2356976268","https://openalex.org/W2495211334"],"abstract_inverted_index":{"Here,":[0],"using":[1,112],"swap":[2,4,76,94],"sequence,":[3],"operation":[5,77,185],"and":[6,58,114,125,174,288,320,327],"different":[7,105,144],"velocity":[8],"update":[9,150],"rules":[10,107,145],"a":[11,37,41,52,85,88,102,136,153,179],"modified":[12,111],"form":[13,305],"of":[14,40,48,63,66,70,81,99,101,108,121,152,192,199,210,234,243,262,286,295,310,325],"Particle":[15],"Swarm":[16],"Optimization(PSO)":[17],"technique":[18,139],"is":[19,43,73,91,141,169,175,186,208,238,246,303,330],"outlined":[20],"to":[21,116,131,148,230,259,291],"solve":[22],"Traveling":[23],"Salesman":[24],"Problem":[25],"(TSP)":[26],"having":[27],"crisp":[28,124,215,255,283],"or":[29,216],"fuzzy":[30,126,217,268],"cost":[31,218,256,269],"matrix.":[32,219,257],"In":[33],"the":[34,56,64,119,156,166,182,190,193,196,200,232,235,244,260,272,293,296,311],"propose":[35],"approach,":[36],"potential":[38],"solution":[39,154,180],"TSP":[42,213,266,319],"represented":[44],"by":[45],"an":[46],"order":[47,90],"nodes":[49,57,69],"in":[50,87,123,155,181,226,271,323],"which":[51],"salesman":[53],"visits":[54],"all":[55],"named":[59,74],"as":[60,75,93],"path.":[61],"Interchange":[62],"positions":[65],"any":[67,71,133,212],"two":[68],"path":[72,86,135,202],"(SO).":[78],"A":[79],"set":[80,168],"SOs":[82],"applied":[83,290],"on":[84,265],"particular":[89],"defined":[92],"sequence(SS).":[95],"Using":[96],"this":[97],"structure":[98],"representation":[100],"probable":[103],"solution,":[104],"perturbed":[106],"PSO":[109],"are":[110,146,228,278,289],"SO":[113],"SS":[115],"find":[117],"out":[118],"solutions":[120],"TSPs":[122,250],"environments.":[127],"During":[128],"search":[129],"process,":[130,162],"improve":[132],"static":[134],"strong":[137],"perturbation":[138],"(K-Opt)":[140],"applied.":[142],"Five":[143],"proposed":[147],"determine":[149],"velocities":[151],"algorithm.":[157,183,236],"Following":[158],"roulette":[159],"wheel":[160],"selection":[161],"one":[163],"rule":[164,167],"from":[165,281],"randomly":[170,279],"selected":[171],"each":[172],"time":[173,329],"used":[176,188,229],"for":[177,195,249,298,314,338],"updating":[178],"K-opt":[184],"again":[187],"at":[189],"end":[191],"algorithm":[194,207,245,297,313],"possible":[197],"improvement":[198],"best":[201],"found":[203,239,304],"so":[204],"far.":[205],"The":[206],"capable":[209],"solving":[211,299,315],"with":[214,251,267],"Different":[220],"sizes":[221,254],"benchmark":[222],"test":[223,231,263,284,292],"problems":[224,264,277,285,317],"available":[225],"TSPLIB":[227,287],"capability":[233,294],"It":[237,302],"that":[240],"success":[241],"rate":[242],"nearly":[247],"100%":[248],"considerably":[252],"large":[253],"Due":[258],"absence":[261],"matrix":[270],"literature,":[273],"here,":[274],"few":[275],"such":[276,300,316],"generated":[280],"some":[282,333],"problems.":[301],"numerical":[306],"experiments":[307],"that,":[308],"efficiency":[309],"said":[312],"(Symmetric":[318],"Asymmetric":[321],"TSP)":[322],"respect":[324],"accuracy":[326],"run":[328],"better":[331],"than":[332],"other":[334],"well":[335],"established":[336],"algorithms":[337],"TSPs.":[339]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}