{"id":"https://openalex.org/W2292881146","doi":"https://doi.org/10.1109/bmei.2015.7401613","title":"An improved hybrid algorithm for traveling salesman problem","display_name":"An improved hybrid algorithm for traveling salesman problem","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W2292881146","doi":"https://doi.org/10.1109/bmei.2015.7401613","mag":"2292881146"},"language":"en","primary_location":{"id":"doi:10.1109/bmei.2015.7401613","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2015.7401613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 8th International Conference on Biomedical Engineering and Informatics (BMEI)","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/A5004995488","display_name":"Qiuying Bai","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095020","display_name":"Yingkou Institute of Technology","ror":"https://ror.org/00se3rd97","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210095020"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiuying Bai","raw_affiliation_strings":["Department of economic management, Yingkou Institute Technology, Yingkou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of economic management, Yingkou Institute Technology, Yingkou, China","institution_ids":["https://openalex.org/I4210095020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023276819","display_name":"Guizhi Li","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095020","display_name":"Yingkou Institute of Technology","ror":"https://ror.org/00se3rd97","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210095020"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guizhi Li","raw_affiliation_strings":["Department of economic management, Yingkou Institute Technology, Yingkou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of economic management, Yingkou Institute Technology, Yingkou, China","institution_ids":["https://openalex.org/I4210095020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091594631","display_name":"Qiheng Sun","orcid":"https://orcid.org/0009-0001-2851-9950"},"institutions":[{"id":"https://openalex.org/I4210095020","display_name":"Yingkou Institute of Technology","ror":"https://ror.org/00se3rd97","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210095020"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiheng Sun","raw_affiliation_strings":["Department of economic management, Yingkou Institute Technology, Yingkou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of economic management, Yingkou Institute Technology, Yingkou, China","institution_ids":["https://openalex.org/I4210095020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210095020"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"806","last_page":"809"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9977999925613403,"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.9977999925613403,"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.9957000017166138,"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/T13717","display_name":"Advanced Algorithms and Applications","score":0.9574000239372253,"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.8571559190750122},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7390696406364441},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.6966429948806763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6687006950378418},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6128546595573425},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5978236794471741},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5913141965866089},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5547382831573486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5157585144042969},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.47303980588912964},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4630254805088043},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.45679616928100586},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.44042155146598816},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33089569211006165},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.29622286558151245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25426551699638367}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8571559190750122},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7390696406364441},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6966429948806763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6687006950378418},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6128546595573425},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5978236794471741},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5913141965866089},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5547382831573486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5157585144042969},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.47303980588912964},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4630254805088043},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.45679616928100586},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.44042155146598816},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33089569211006165},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.29622286558151245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25426551699638367},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bmei.2015.7401613","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bmei.2015.7401613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 8th International Conference on Biomedical Engineering and Informatics (BMEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1159202373","https://openalex.org/W2001474347","https://openalex.org/W2010334716","https://openalex.org/W2012515029","https://openalex.org/W2065634150","https://openalex.org/W2084507157","https://openalex.org/W2090812374","https://openalex.org/W2104670598","https://openalex.org/W2124993036","https://openalex.org/W2142661676","https://openalex.org/W2287814884","https://openalex.org/W6696126189"],"related_works":["https://openalex.org/W2382755429","https://openalex.org/W2359502741","https://openalex.org/W2006671471","https://openalex.org/W2028764438","https://openalex.org/W2362221182","https://openalex.org/W2808482843","https://openalex.org/W2185228534","https://openalex.org/W2921520325","https://openalex.org/W2098731747","https://openalex.org/W2375184087"],"abstract_inverted_index":{"An":[0],"improved":[1],"artificial":[2,32],"bee":[3,33],"colony":[4,34],"(ABC&VNS)":[5],"to":[6,24,41,49,69,89,101],"settle":[7],"the":[8,26,31,43,47,51,72,80,92,103,109,114],"traveling":[9],"salesman":[10],"problem":[11],"(TSP)":[12],"is":[13,23,66,95,106],"described":[14],"in":[15,62,113],"this":[16],"paper.":[17],"This":[18],"hybrid":[19],"algorithm's":[20],"principal":[21],"character":[22],"incorporate":[25],"solution":[27,117],"construction":[28],"mechanism":[29],"of":[30,46,77,97,116],"(ABC)":[35],"with":[36,108],"variable":[37],"neighborhood":[38,58],"search":[39,73],"(VNS)":[40],"exploit":[42],"intrinsic":[44],"structure":[45],"solutions":[48],"acquire":[50],"high":[52,99],"quality":[53,76],"solution.":[54],"Besides,":[55],"three":[56],"novel":[57],"structures":[59],"are":[60,86],"present,":[61],"which":[63,105],"problem-specific":[64],"knowledge":[65],"utilized":[67],"respectively,":[68],"improve":[70],"both":[71],"efficiency":[74],"and":[75],"VNS.":[78],"Finally,":[79],"experiments":[81],"for":[82],"benchmark":[83],"TSP":[84],"instances":[85],"carried":[87],"out":[88],"verify":[90],"that":[91],"proposed":[93],"algorithm":[94],"capable":[96],"maintaining":[98],"performance":[100],"solve":[102],"TSP,":[104],"compared":[107],"best":[110],"existing":[111],"approaches":[112],"way":[115],"quality.":[118]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}