{"id":"https://openalex.org/W2076708083","doi":"https://doi.org/10.4018/jamc.2011040104","title":"DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning","display_name":"DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2076708083","doi":"https://doi.org/10.4018/jamc.2011040104","mag":"2076708083"},"language":"en","primary_location":{"id":"doi:10.4018/jamc.2011040104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2011040104","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","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/A5069828962","display_name":"Masoud Yaghini","orcid":"https://orcid.org/0000-0002-3239-8362"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Masoud Yaghini","raw_affiliation_strings":["Iran University of Science and Technology, Iran",", Iran University of Science and Technology, , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iran University of Science and Technology, Iran","institution_ids":["https://openalex.org/I67009956"]},{"raw_affiliation_string":", Iran University of Science and Technology, , Iran","institution_ids":["https://openalex.org/I67009956"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051212478","display_name":"Mohsen Momeni","orcid":null},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohsen Momeni","raw_affiliation_strings":["Iran University of Science and Technology, Iran",", Iran University of Science and Technology, , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iran University of Science and Technology, Iran","institution_ids":["https://openalex.org/I67009956"]},{"raw_affiliation_string":", Iran University of Science and Technology, , Iran","institution_ids":["https://openalex.org/I67009956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110033179","display_name":"Mohammadreza Sarmadi","orcid":null},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammadreza Sarmadi","raw_affiliation_strings":["Iran University of Science and Technology, Iran",", Iran University of Science and Technology, , Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iran University of Science and Technology, Iran","institution_ids":["https://openalex.org/I67009956"]},{"raw_affiliation_string":", Iran University of Science and Technology, , Iran","institution_ids":["https://openalex.org/I67009956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5248,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85330026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":"2","first_page":"74","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9952999949455261,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9886999726295471,"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/metaheuristic","display_name":"Metaheuristic","score":0.7565797567367554},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7197390794754028},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6954436898231506},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6743194460868835},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.654097855091095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6512640714645386},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.57777339220047},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5593231916427612},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.5241996049880981},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4824995994567871},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43529239296913147},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.42769643664360046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39772799611091614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3354445993900299},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19384759664535522},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.0657908022403717}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7565797567367554},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7197390794754028},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6954436898231506},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6743194460868835},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.654097855091095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6512640714645386},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.57777339220047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5593231916427612},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.5241996049880981},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4824995994567871},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43529239296913147},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.42769643664360046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39772799611091614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3354445993900299},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19384759664535522},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.0657908022403717},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/jamc.2011040104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2011040104","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jamc00:v:2:y:2011:i:2:p:74-92","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2011040104","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W27366642","https://openalex.org/W78437532","https://openalex.org/W158704887","https://openalex.org/W170314049","https://openalex.org/W201222650","https://openalex.org/W1497256448","https://openalex.org/W1512383952","https://openalex.org/W1519597478","https://openalex.org/W1576498301","https://openalex.org/W1972997295","https://openalex.org/W1997039203","https://openalex.org/W2003407832","https://openalex.org/W2016780612","https://openalex.org/W2024060531","https://openalex.org/W2031585418","https://openalex.org/W2034027189","https://openalex.org/W2037882067","https://openalex.org/W2039766013","https://openalex.org/W2041731592","https://openalex.org/W2046655377","https://openalex.org/W2058937865","https://openalex.org/W2067061580","https://openalex.org/W2084792706","https://openalex.org/W2095134601","https://openalex.org/W2098957104","https://openalex.org/W2107941094","https://openalex.org/W2118727705","https://openalex.org/W2129557546","https://openalex.org/W2150367356","https://openalex.org/W2154929945","https://openalex.org/W2163428398","https://openalex.org/W2167247544","https://openalex.org/W2167885874","https://openalex.org/W2167920923","https://openalex.org/W2171060218","https://openalex.org/W2218699142","https://openalex.org/W2299061662","https://openalex.org/W2324108981","https://openalex.org/W2324472571","https://openalex.org/W2399100674","https://openalex.org/W2572756133","https://openalex.org/W4212899374","https://openalex.org/W4231878220","https://openalex.org/W4251464645","https://openalex.org/W4253741566","https://openalex.org/W4285719527","https://openalex.org/W4292872700","https://openalex.org/W6629566668"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W1521781013","https://openalex.org/W4281608380","https://openalex.org/W1563671713","https://openalex.org/W1583588537","https://openalex.org/W2743078388","https://openalex.org/W4283826969"],"abstract_inverted_index":{"A":[0],"Hamiltonian":[1,29,52],"path":[2,5,30,53],"is":[3,27,33,58,142],"a":[4,42],"in":[6,25],"an":[7],"undirected":[8],"graph,":[9],"which":[10,32],"visits":[11],"each":[12],"node":[13],"exactly":[14],"once":[15],"and":[16,78,90,113,149,160],"returns":[17],"to":[18],"the":[19,28,39,50,62,97,114,119,125,128,139,145,163],"starting":[20],"node.":[21],"Finding":[22],"such":[23],"paths":[24],"graphs":[26],"problem,":[31,74],"NP-complete.":[34],"In":[35],"this":[36,73],"paper,":[37],"for":[38,48,54,118],"first":[40],"time,":[41],"comparative":[43],"study":[44],"on":[45,68,158],"metaheuristic":[46],"algorithms":[47,141],"finding":[49],"shortest":[51],"1071":[55],"Iranian":[56],"cities":[57,64],"conducted.":[59],"These":[60],"are":[61,94,104,121,134,155],"main":[63],"of":[65,82,109,138,147,162],"Iran":[66],"based":[67,157],"social-economic":[69],"characteristics.":[70],"For":[71],"solving":[72],"four":[75],"hybrid":[76],"efficient":[77],"effective":[79],"metaheuristics,":[80],"consisting":[81],"simulated":[83],"annealing,":[84],"ant":[85],"colony":[86],"optimization,":[87],"genetic":[88],"algorithm,":[89],"tabu":[91],"search":[92,99],"algorithms,":[93,127],"combined":[95],"with":[96,131],"local":[98],"methods.":[100],"The":[101,136,153],"algorithms\u2019":[102],"parameters":[103,120],"tuned":[105],"by":[106,144],"sequential":[107],"design":[108],"experiments":[110],"(DOE)":[111],"approach,":[112],"most":[115],"appropriate":[116],"values":[117],"adjusted.":[122],"To":[123],"evaluate":[124],"proposed":[126,140],"standard":[129],"problems":[130],"different":[132],"sizes":[133],"used.":[135],"performance":[137],"analyzed":[143],"quality":[146],"solution":[148],"CPU":[150],"time":[151],"measures.":[152],"results":[154],"compared":[156],"efficiency":[159],"effectiveness":[161],"algorithms.":[164]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}