{"id":"https://openalex.org/W1968478474","doi":"https://doi.org/10.1109/cec.2012.6252941","title":"A discrete artificial bee colony algorithm for the traveling salesman problem with time windows","display_name":"A discrete artificial bee colony algorithm for the traveling salesman problem with time windows","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W1968478474","doi":"https://doi.org/10.1109/cec.2012.6252941","mag":"1968478474"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6252941","doi":"https://doi.org/10.1109/cec.2012.6252941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252941","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1265993","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011342394","display_name":"Korhan Karabulut","orcid":"https://orcid.org/0000-0003-2189-8262","observed_orcids":["https://orcid.org/0000-0003-2189-8262"]},"institutions":[{"id":"https://openalex.org/I59944920","display_name":"Ya\u015far University","ror":"https://ror.org/00dz1eb96","country_code":"TR","type":"education","lineage":["https://openalex.org/I59944920"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Korhan Karabulut","raw_affiliation_strings":["Software Engineering Department, Yasar University, Izmir, Turkey","Software Engineering Department, Yasar University, Selcuk Yasar Campus, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Software Engineering Department, Yasar University, Izmir, Turkey","institution_ids":["https://openalex.org/I59944920"]},{"raw_affiliation_string":"Software Engineering Department, Yasar University, Selcuk Yasar Campus, Izmir, Turkey","institution_ids":["https://openalex.org/I59944920"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089650598","display_name":"M. Fatih Tasgetiren","orcid":"https://orcid.org/0000-0002-5716-575X","observed_orcids":["https://orcid.org/0000-0002-5716-575X"]},"institutions":[{"id":"https://openalex.org/I59944920","display_name":"Ya\u015far University","ror":"https://ror.org/00dz1eb96","country_code":"TR","type":"education","lineage":["https://openalex.org/I59944920"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"M. Fatih Tasgetiren","raw_affiliation_strings":["Industrial Engineering Department, Yasar University, Izmir, Turkey","Industrial Engineering Department Yasar University Selcuk Yasar Campus, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Yasar University, Izmir, Turkey","institution_ids":["https://openalex.org/I59944920"]},{"raw_affiliation_string":"Industrial Engineering Department Yasar University Selcuk Yasar Campus, Izmir, Turkey","institution_ids":["https://openalex.org/I59944920"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I59944920"],"apc_list":null,"apc_paid":null,"fwci":1.5578,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.81703514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.6416000127792358,"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.6416000127792358,"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.35109999775886536,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.001500000013038516,"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/traveling-salesman-problem-with-time-windows","display_name":"traveling salesman problem with time windows","score":0.9279999732971191},{"id":"https://openalex.org/keywords/discrete-artificial-bee-colony-algorithm","display_name":"discrete artificial bee colony algorithm","score":0.902999997138977},{"id":"https://openalex.org/keywords/iterated-greedy-algorithm","display_name":"iterated greedy algorithm","score":0.9430000185966492},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.7120000123977661},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"vehicle routing","score":0.6019999980926514},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.5339999794960022},{"id":"https://openalex.org/keywords/logistics","display_name":"logistics","score":0.6819999814033508}],"concepts":[{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.8240244388580322},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7191979885101318},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6244776248931885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5510200262069702},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5279594659805298},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4988124370574951},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4898652732372284},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48837846517562866},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46044740080833435},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4325612187385559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3183063566684723},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2012.6252941","doi":"https://doi.org/10.1109/cec.2012.6252941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252941","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:1265993","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/1265993","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1265993","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/1265993","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W181374404","https://openalex.org/W1964581121","https://openalex.org/W1968492936","https://openalex.org/W1977129671","https://openalex.org/W1978588057","https://openalex.org/W2006751452","https://openalex.org/W2037754907","https://openalex.org/W2039766013","https://openalex.org/W2040886899","https://openalex.org/W2050817363","https://openalex.org/W2065665769","https://openalex.org/W2086918511","https://openalex.org/W2090069860","https://openalex.org/W2090812374","https://openalex.org/W2093665022","https://openalex.org/W2106980278","https://openalex.org/W2109405343","https://openalex.org/W2120365438","https://openalex.org/W2135644739","https://openalex.org/W2141481566","https://openalex.org/W2143560894","https://openalex.org/W2144317842","https://openalex.org/W2145479420","https://openalex.org/W2153565255","https://openalex.org/W2163873159","https://openalex.org/W2167580870","https://openalex.org/W2169064301","https://openalex.org/W2287814884","https://openalex.org/W2497309204","https://openalex.org/W2502455647"],"related_works":["https://openalex.org/W2280822845","https://openalex.org/W2162935798","https://openalex.org/W4391153743","https://openalex.org/W3204893097","https://openalex.org/W2052396508","https://openalex.org/W2003262034","https://openalex.org/W2766468404","https://openalex.org/W2123233098","https://openalex.org/W2759330500","https://openalex.org/W2086918511"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,29,34,67,78,98],"discrete":[4],"artificial":[5],"bee":[6],"colony":[7],"algorithm":[8,48,60,83,94,111],"(DABC)":[9],"for":[10],"solving":[11],"the":[12,24,52,87,93,102,108,120,125],"traveling":[13],"salesman":[14],"problem":[15,37],"with":[16],"time":[17],"windows":[18],"(TSPTW)":[19],"in":[20,39,66],"order":[21],"to":[22,61,84,115],"minimize":[23],"total":[25],"travel":[26],"cost":[27],"of":[28,57,69,92],"given":[30],"tour.":[31],"TSPTW":[32],"is":[33,112],"difficult":[35],"optimization":[36],"arising":[38],"both":[40],"scheduling":[41],"and":[42,54],"logistic":[43],"applications.":[44],"The":[45,90],"proposed":[46,109],"DABC":[47,110],"basically":[49],"relies":[50,76],"on":[51,77,97],"destruction":[53],"construction":[55],"phases":[56],"iterated":[58],"greedy":[59],"generate":[62],"neighboring":[63],"food":[64],"sources":[65],"framework":[68],"ABC":[70],"algorithm.":[71],"In":[72],"addition,":[73],"it":[74],"also":[75],"classical":[79],"1-opt":[80],"local":[81],"search":[82],"further":[85],"enhance":[86],"solution":[88],"quality.":[89],"performance":[91],"was":[95],"tested":[96],"benchmark":[99],"set":[100],"from":[101,124],"literature.":[103,126],"Experimental":[104],"results":[105],"show":[106],"that":[107],"very":[113],"competitive":[114],"or":[116],"even":[117],"better":[118],"than":[119],"best":[121],"performing":[122],"algorithms":[123]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}