{"id":"https://openalex.org/W2032555824","doi":"https://doi.org/10.1109/cec.2009.4983154","title":"A hybrid Honey Bees Mating Optimization algorithm for the Probabilistic Traveling Salesman Problem","display_name":"A hybrid Honey Bees Mating Optimization algorithm for the Probabilistic Traveling Salesman Problem","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2032555824","doi":"https://doi.org/10.1109/cec.2009.4983154","mag":"2032555824"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","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/A5058880006","display_name":"Yannis Marinakis","orcid":"https://orcid.org/0000-0002-1989-5815"},"institutions":[{"id":"https://openalex.org/I142617266","display_name":"University of Crete","ror":"https://ror.org/00dr28g20","country_code":"GR","type":"education","lineage":["https://openalex.org/I142617266"]},{"id":"https://openalex.org/I55741626","display_name":"Technical University of Crete","ror":"https://ror.org/03f8bz564","country_code":"GR","type":"education","lineage":["https://openalex.org/I55741626"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Yannis Marinakis","raw_affiliation_strings":["Department of Production Engineering and Management, University of Crete, Chania, Greece","Department of Production Engineering and Management, Technical University of Crete, 73100 Chania, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Production Engineering and Management, University of Crete, Chania, Greece","institution_ids":["https://openalex.org/I142617266"]},{"raw_affiliation_string":"Department of Production Engineering and Management, Technical University of Crete, 73100 Chania, Greece","institution_ids":["https://openalex.org/I55741626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046011244","display_name":"Magdalene Marinaki","orcid":"https://orcid.org/0000-0001-7875-0803"},"institutions":[{"id":"https://openalex.org/I142617266","display_name":"University of Crete","ror":"https://ror.org/00dr28g20","country_code":"GR","type":"education","lineage":["https://openalex.org/I142617266"]},{"id":"https://openalex.org/I55741626","display_name":"Technical University of Crete","ror":"https://ror.org/03f8bz564","country_code":"GR","type":"education","lineage":["https://openalex.org/I55741626"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Magdalene Marinaki","raw_affiliation_strings":["Department of Production Engineering and Management, University of Crete, Chania, Greece","Department of Production Engineering and Management, Technical University of Crete, 73100 Chania, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Production Engineering and Management, University of Crete, Chania, Greece","institution_ids":["https://openalex.org/I142617266"]},{"raw_affiliation_string":"Department of Production Engineering and Management, Technical University of Crete, 73100 Chania, Greece","institution_ids":["https://openalex.org/I55741626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058880006"],"corresponding_institution_ids":["https://openalex.org/I142617266","https://openalex.org/I55741626"],"apc_list":null,"apc_paid":null,"fwci":7.5035,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.96776889,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1762","last_page":"1769"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9851999878883362,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8029006719589233},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6935228109359741},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6873945593833923},{"id":"https://openalex.org/keywords/bees-algorithm","display_name":"Bees algorithm","score":0.6440187096595764},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.639924168586731},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.561864972114563},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.547881543636322},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4978005886077881},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4961617887020111},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49355804920196533},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4877474904060364},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4735618829727173},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.45106178522109985},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.44341588020324707},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.4375775158405304},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4346340000629425},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42958009243011475},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4274359345436096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3979231119155884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36047255992889404},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.3452044129371643},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.2473658323287964},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19183236360549927}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8029006719589233},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6935228109359741},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6873945593833923},{"id":"https://openalex.org/C143574069","wikidata":"https://www.wikidata.org/wiki/Q3497720","display_name":"Bees algorithm","level":3,"score":0.6440187096595764},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.639924168586731},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.561864972114563},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.547881543636322},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4978005886077881},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4961617887020111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49355804920196533},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4877474904060364},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4735618829727173},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.45106178522109985},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.44341588020324707},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.4375775158405304},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4346340000629425},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42958009243011475},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4274359345436096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3979231119155884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36047255992889404},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.3452044129371643},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.2473658323287964},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19183236360549927},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2009.4983154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","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":46,"referenced_works":["https://openalex.org/W27366642","https://openalex.org/W46479781","https://openalex.org/W585790089","https://openalex.org/W1500165591","https://openalex.org/W1526340092","https://openalex.org/W1573676079","https://openalex.org/W1576498301","https://openalex.org/W1585652832","https://openalex.org/W1605029243","https://openalex.org/W1750249149","https://openalex.org/W1813153225","https://openalex.org/W1879570979","https://openalex.org/W1957692442","https://openalex.org/W1984036937","https://openalex.org/W1998707332","https://openalex.org/W2017066479","https://openalex.org/W2021473921","https://openalex.org/W2025924944","https://openalex.org/W2027954882","https://openalex.org/W2032200826","https://openalex.org/W2044009541","https://openalex.org/W2045261635","https://openalex.org/W2064535384","https://openalex.org/W2065335627","https://openalex.org/W2069657950","https://openalex.org/W2090275183","https://openalex.org/W2100605418","https://openalex.org/W2104670598","https://openalex.org/W2112686410","https://openalex.org/W2129557546","https://openalex.org/W2129968104","https://openalex.org/W2152195021","https://openalex.org/W2162508334","https://openalex.org/W2164172191","https://openalex.org/W2336259629","https://openalex.org/W2983834557","https://openalex.org/W2997776631","https://openalex.org/W3021430741","https://openalex.org/W3107939723","https://openalex.org/W4246598646","https://openalex.org/W4285719527","https://openalex.org/W4292408555","https://openalex.org/W6601890163","https://openalex.org/W6638372332","https://openalex.org/W6639610521","https://openalex.org/W7065416419"],"related_works":["https://openalex.org/W2146364482","https://openalex.org/W4210470436","https://openalex.org/W3013791021","https://openalex.org/W2128995918","https://openalex.org/W4246557197","https://openalex.org/W2188749193","https://openalex.org/W1604040598","https://openalex.org/W2469984263","https://openalex.org/W2099174039","https://openalex.org/W2653294936"],"abstract_inverted_index":{"The":[0,63,88],"probabilistic":[1,59],"traveling":[2,11,60],"salesman":[3,12,61],"problem":[4,13],"is":[5,52,91,128],"a":[6,26,94,118,126,134,158],"variation":[7],"of":[8,16,57,133,136,138,151],"the":[9,17,55,58,82,86,106,110,131,139,145,154],"classic":[10,107],"and":[14,46,85,116,147],"one":[15],"most":[18],"significant":[19],"stochastic":[20],"routing":[21],"problems.":[22],"In":[23],"this":[24],"paper,":[25],"new":[27,159],"hybrid":[28],"algorithmic":[29],"nature":[30],"inspired":[31],"approach":[32],"based":[33],"on":[34,93],"honey":[35,75],"bees":[36,76],"mating":[37,77],"optimization":[38,78],"(HBMO),":[39],"greedy":[40],"randomized":[41],"adaptive":[42],"search":[43,49],"procedure":[44],"(GRASP)":[45],"expanding":[47],"neighborhood":[48],"strategy":[50],"(ENS)":[51],"proposed":[53,64,89,155],"for":[54],"solution":[56],"problem.":[62],"algorithm":[65,90,115,121,143,156],"has":[66],"two":[67],"additional":[68],"main":[69],"innovative":[70],"features":[71],"compared":[72],"to":[73],"other":[74],"algorithms":[79],"that":[80],"concern":[81],"crossover":[83],"operator":[84],"workers.":[87],"tested":[92],"numerous":[95],"benchmark":[96],"problems":[97],"from":[98,144],"TSPLIB":[99],"with":[100,105,117,130],"very":[101],"satisfactory":[102],"results.":[103],"Comparisons":[104],"GRASP":[108],"algorithm,":[109],"Particle":[111],"Swarm":[112],"Optimization":[113,142],"(PSO)":[114],"Tabu":[119],"Search":[120],"are":[122],"also":[123],"presented.":[124],"Also,":[125],"comparison":[127],"performed":[129],"results":[132],"number":[135],"implementations":[137],"Ant":[140],"Colony":[141],"literature":[146],"in":[148],"6":[149],"out":[150],"10":[152],"cases":[153],"gives":[157],"best":[160],"solution.":[161]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}