{"id":"https://openalex.org/W2948839968","doi":"https://doi.org/10.4018/ijsir.2019070103","title":"Evolutionary Ant Colony Algorithm Using Firefly Based Transition for Solving Vehicle Routing Problems","display_name":"Evolutionary Ant Colony Algorithm Using Firefly Based Transition for Solving Vehicle Routing Problems","publication_year":2019,"publication_date":"2019-06-03","ids":{"openalex":"https://openalex.org/W2948839968","doi":"https://doi.org/10.4018/ijsir.2019070103","mag":"2948839968"},"language":"en","primary_location":{"id":"doi:10.4018/ijsir.2019070103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijsir.2019070103","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"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 Swarm Intelligence Research","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/A5029207286","display_name":"Rajeev K. Goel","orcid":"https://orcid.org/0000-0001-9580-3196"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rajeev Goel","raw_affiliation_strings":["Ambala College of Engg. and Applied Research, Ambala, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ambala College of Engg. and Applied Research, Ambala, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005847782","display_name":"Raman Maini","orcid":"https://orcid.org/0000-0003-0223-1622"},"institutions":[{"id":"https://openalex.org/I79161377","display_name":"Punjabi University","ror":"https://ror.org/00xdn8y92","country_code":"IN","type":"education","lineage":["https://openalex.org/I79161377"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Raman Maini","raw_affiliation_strings":["Punjabi University, Patiala, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Punjabi University, Patiala, India","institution_ids":["https://openalex.org/I79161377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029207286"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8837,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79664155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":"3","first_page":"46","last_page":"60"},"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.9965999722480774,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9843000173568726,"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/firefly-algorithm","display_name":"Firefly algorithm","score":0.799222469329834},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7922098636627197},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.718478262424469},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6115661859512329},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6061647534370422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5939637422561646},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.575396716594696},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5391595363616943},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4801754057407379},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4486348032951355},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4474334120750427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2952035367488861},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24454742670059204},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.10941532254219055}],"concepts":[{"id":"https://openalex.org/C154982244","wikidata":"https://www.wikidata.org/wiki/Q5451844","display_name":"Firefly algorithm","level":3,"score":0.799222469329834},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7922098636627197},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.718478262424469},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6115661859512329},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6061647534370422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5939637422561646},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.575396716594696},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5391595363616943},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4801754057407379},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4486348032951355},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4474334120750427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2952035367488861},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24454742670059204},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.10941532254219055},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijsir.2019070103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijsir.2019070103","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"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 Swarm Intelligence Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jsir00:v:10:y:2019:i:3:p:46-60","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2019070103","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W274558759","https://openalex.org/W1523741643","https://openalex.org/W1788708300","https://openalex.org/W1905990843","https://openalex.org/W1973997930","https://openalex.org/W1985312622","https://openalex.org/W2018691209","https://openalex.org/W2026636980","https://openalex.org/W2028002822","https://openalex.org/W2029006297","https://openalex.org/W2030558180","https://openalex.org/W2038843313","https://openalex.org/W2050149390","https://openalex.org/W2064578828","https://openalex.org/W2082153300","https://openalex.org/W2093795574","https://openalex.org/W2096305430","https://openalex.org/W2101657530","https://openalex.org/W2111563176","https://openalex.org/W2133962014","https://openalex.org/W2138097482","https://openalex.org/W2144266938","https://openalex.org/W2154035658","https://openalex.org/W2154943049","https://openalex.org/W2162780797","https://openalex.org/W2297395784","https://openalex.org/W2303472634","https://openalex.org/W2464696721","https://openalex.org/W2557042567","https://openalex.org/W2761198757","https://openalex.org/W2783133184","https://openalex.org/W3106441463","https://openalex.org/W4241724078","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W2596852793","https://openalex.org/W2017411971","https://openalex.org/W1588949866","https://openalex.org/W2172069777","https://openalex.org/W1521781013","https://openalex.org/W2109848272","https://openalex.org/W2956620057","https://openalex.org/W2361792200"],"abstract_inverted_index":{"Vehicle":[0],"routing":[1,32,109],"problems":[2,110],"are":[3],"a":[4,44],"classical":[5],"NP-hard":[6],"optimization":[7,16,25,28,38,158],"problem.":[8],"In":[9],"this":[10],"article":[11],"we":[12],"propose":[13],"an":[14,83],"evolutionary":[15],"algorithm":[17,92],"which":[18],"adapts":[19],"the":[20,56,62,68,73,90,96,123,138,141,147],"advantages":[21],"of":[22,59,70,82,89,98,100,140,146,156],"ant":[23,84],"colony":[24,85],"and":[26,34,43,128],"firefly":[27],"to":[29,51,79,115],"solve":[30],"vehicle":[31,108],"problem":[33],"its":[35,129],"variants.":[36],"Firefly":[37],"(FA)":[39],"based":[40],"transition":[41],"rules":[42],"novel":[45],"pheromone":[46,65],"shaking":[47,66],"rule":[48],"is":[49,77,93,126,132],"proposed":[50,91,124,142],"escape":[52],"local":[53],"optima.":[54],"Whereas":[55],"multi-modal":[57],"nature":[58],"FA":[60],"explores":[61],"search":[63],"space,":[64],"avoids":[67],"stagnation":[69],"pheromones":[71],"on":[72],"exploited":[74],"paths.":[75],"This":[76],"expected":[78],"improve":[80],"working":[81],"system":[86],"(ACS).":[87],"Performance":[88],"compared":[94],"with":[95],"performance":[97],"some":[99,145],"other":[101,148],"currently":[102],"available":[103],"meta-heuristic":[104],"approaches":[105,151],"for":[106,152],"solving":[107,153],"(VRP)":[111],"by":[112],"applying":[113],"it":[114],"certain":[116],"standard":[117],"benchmark":[118],"datasets.":[119],"Results":[120],"show":[121],"that":[122],"approach":[125,143],"consistent":[127],"convergence":[130],"rate":[131],"faster.":[133],"The":[134],"results":[135],"also":[136],"demonstrate":[137],"superiority":[139],"over":[144],"existing":[149],"FA-based":[150],"such":[154],"type":[155],"discrete":[157],"problems.":[159]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}