{"id":"https://openalex.org/W4389041298","doi":"https://doi.org/10.1109/csit61576.2023.10324172","title":"Solving Large Scale Uniform Traveling Salesman Problem by Using Partial Solution Expansion Method","display_name":"Solving Large Scale Uniform Traveling Salesman Problem by Using Partial Solution Expansion Method","publication_year":2023,"publication_date":"2023-10-19","ids":{"openalex":"https://openalex.org/W4389041298","doi":"https://doi.org/10.1109/csit61576.2023.10324172"},"language":"en","primary_location":{"id":"doi:10.1109/csit61576.2023.10324172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/csit61576.2023.10324172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5047002481","display_name":"Roman Kutelmakh","orcid":"https://orcid.org/0009-0008-6499-1161"},"institutions":[{"id":"https://openalex.org/I98435010","display_name":"Lviv Polytechnic National University","ror":"https://ror.org/0542q3127","country_code":"UA","type":"education","lineage":["https://openalex.org/I98435010"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Roman Kutelmakh","raw_affiliation_strings":["Lviv Polytechnic National University,Software department,Lviv,Ukraine","Software department, Lviv Polytechnic National University, Lviv, Ukraine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lviv Polytechnic National University,Software department,Lviv,Ukraine","institution_ids":["https://openalex.org/I98435010"]},{"raw_affiliation_string":"Software department, Lviv Polytechnic National University, Lviv, Ukraine","institution_ids":["https://openalex.org/I98435010"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088530992","display_name":"Roman Bazylevych","orcid":"https://orcid.org/0000-0002-7949-1353"},"institutions":[{"id":"https://openalex.org/I98435010","display_name":"Lviv Polytechnic National University","ror":"https://ror.org/0542q3127","country_code":"UA","type":"education","lineage":["https://openalex.org/I98435010"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Roman Bazylevych","raw_affiliation_strings":["Lviv Polytechnic National University,Software department,Lviv,Ukraine","Software department, Lviv Polytechnic National University, Lviv, Ukraine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lviv Polytechnic National University,Software department,Lviv,Ukraine","institution_ids":["https://openalex.org/I98435010"]},{"raw_affiliation_string":"Software department, Lviv Polytechnic National University, Lviv, Ukraine","institution_ids":["https://openalex.org/I98435010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078068032","display_name":"Bhanu Prasad","orcid":"https://orcid.org/0009-0005-4199-6902"},"institutions":[{"id":"https://openalex.org/I8248082","display_name":"Florida Agricultural and Mechanical University","ror":"https://ror.org/00c4wc133","country_code":"US","type":"education","lineage":["https://openalex.org/I8248082"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhanu Prasad","raw_affiliation_strings":["Florida A&#x0026;M University,Department of Computer and Information Sciences,Tallahassee,Florida,USA,32307"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Florida A&#x0026;M University,Department of Computer and Information Sciences,Tallahassee,Florida,USA,32307","institution_ids":["https://openalex.org/I8248082"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4356,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61395095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9959999918937683,"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.9959999918937683,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9621000289916992,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9170107841491699},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.5805327296257019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5655286312103271},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5260172486305237},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4644337594509125},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4324682950973511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2815815210342407},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15133586525917053}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9170107841491699},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.5805327296257019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5655286312103271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5260172486305237},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4644337594509125},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4324682950973511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2815815210342407},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15133586525917053},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/csit61576.2023.10324172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/csit61576.2023.10324172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT)","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":4,"referenced_works":["https://openalex.org/W2810479212","https://openalex.org/W4381949659","https://openalex.org/W6794178306","https://openalex.org/W6941249815"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2495211334"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,58],"new":[3],"method":[4,24,41],"for":[5,12,57],"obtaining":[6],"an":[7],"initial":[8],"and":[9,27,62],"non-optimal":[10],"solution":[11,45,53],"traveling":[13],"salesman":[14],"problem":[15,30],"in":[16,48],"which":[17],"the":[18,28,38,52],"points":[19,61],"are":[20],"distributed":[21],"uniformly.":[22],"This":[23,40],"is":[25,31,42,54,63],"approximate,":[26],"whole":[29],"divided":[32],"into":[33],"smaller":[34],"subproblems":[35],"to":[36,66],"generate":[37],"solution.":[39],"called":[43],"\u201cpartial":[44],"expansion":[46],"method\u201d":[47],"this":[49],"research":[50],"as":[51],"initially":[55],"generated":[56],"subset":[59],"of":[60],"gradually":[64],"expanded":[65],"other":[67],"subsets.":[68]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
