{"id":"https://openalex.org/W4415125222","doi":"https://doi.org/10.1109/icmlt65785.2025.11193276","title":"Feature Analysis for Designing Heuristics for the Electric Vehicle Routing Problem with Genetic Programming","display_name":"Feature Analysis for Designing Heuristics for the Electric Vehicle Routing Problem with Genetic Programming","publication_year":2025,"publication_date":"2025-05-23","ids":{"openalex":"https://openalex.org/W4415125222","doi":"https://doi.org/10.1109/icmlt65785.2025.11193276"},"language":"en","primary_location":{"id":"doi:10.1109/icmlt65785.2025.11193276","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlt65785.2025.11193276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 10th International Conference on Machine Learning Technologies (ICMLT)","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/A5027293846","display_name":"Marko \u00d0urasevi\u0107","orcid":"https://orcid.org/0000-0001-8732-4769"},"institutions":[{"id":"https://openalex.org/I181343428","display_name":"University of Zagreb","ror":"https://ror.org/00mv6sv71","country_code":"HR","type":"education","lineage":["https://openalex.org/I181343428"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Marko \u00d0urasevi\u0107","raw_affiliation_strings":["University of Zagreb,Faculty of Electrical Engineering and Computing,Zagreb,Croatia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Zagreb,Faculty of Electrical Engineering and Computing,Zagreb,Croatia","institution_ids":["https://openalex.org/I181343428"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086000818","display_name":"Francisco Javier Gil-Gala","orcid":"https://orcid.org/0000-0002-0606-7009"},"institutions":[{"id":"https://openalex.org/I165339363","display_name":"Universidad de Oviedo","ror":"https://ror.org/006gksa02","country_code":"ES","type":"education","lineage":["https://openalex.org/I165339363"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Francisco Javier Gil-Gala","raw_affiliation_strings":["University of Oviedo,Department of Computing,Gijon,Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oviedo,Department of Computing,Gijon,Spain","institution_ids":["https://openalex.org/I165339363"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.673,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.85941074,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"398","last_page":"406"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9508000016212463,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9508000016212463,"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/heuristics","display_name":"Heuristics","score":0.8439000248908997},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.7698000073432922},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6043000221252441},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6025999784469604},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5519999861717224},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5385000109672546},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5216000080108643},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48539999127388}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8439000248908997},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.7698000073432922},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.611299991607666},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6043000221252441},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6025999784469604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.589900016784668},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5519999861717224},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5216000080108643},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48539999127388},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.43720000982284546},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.42829999327659607},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4262000024318695},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.33719998598098755},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.33160001039505005},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25540000200271606}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icmlt65785.2025.11193276","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlt65785.2025.11193276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 10th International Conference on Machine Learning Technologies (ICMLT)","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":31,"referenced_works":["https://openalex.org/W1510850782","https://openalex.org/W2012493517","https://openalex.org/W2064578828","https://openalex.org/W2072441740","https://openalex.org/W2090159596","https://openalex.org/W2094764575","https://openalex.org/W2140003718","https://openalex.org/W2275596639","https://openalex.org/W2469644863","https://openalex.org/W2590959390","https://openalex.org/W2727324160","https://openalex.org/W2886402280","https://openalex.org/W2915357843","https://openalex.org/W2925063426","https://openalex.org/W2943956374","https://openalex.org/W2945137226","https://openalex.org/W3010138084","https://openalex.org/W3144601194","https://openalex.org/W3154344835","https://openalex.org/W3160725325","https://openalex.org/W3171719859","https://openalex.org/W3196485901","https://openalex.org/W4226322964","https://openalex.org/W4285805330","https://openalex.org/W4288772740","https://openalex.org/W4304161159","https://openalex.org/W4323896969","https://openalex.org/W4379185073","https://openalex.org/W4384007999","https://openalex.org/W4391503405","https://openalex.org/W4402521849"],"related_works":[],"abstract_inverted_index":{"The":[0],"electric":[1],"vehicle":[2],"routing":[3,69],"problem":[4,11,40],"(EVRP)":[5],"is":[6,29,95,148],"an":[7,34,152,190],"important":[8],"combinatorial":[9,24],"optimisation":[10,25],"gaining":[12],"attention":[13],"due":[14],"to":[15,37,83,109,121,130,140,143,150,161,176,202,212,234],"the":[16,39,81,84,90,103,116,126,207,214,218,240,243],"growing":[17],"environmental":[18],"concerns.":[19],"Like":[20],"many":[21],"other":[22],"relevant":[23,209],"problems,":[26],"this":[27],"one":[28],"also":[30,107,223],"NP-hard,":[31],"meaning":[32],"that":[33,62,78,112,157,172,245],"efficient":[35],"algorithm":[36],"solve":[38,65],"optimally":[41],"in":[42,115],"reasonable":[43],"time":[44,230],"does":[45],"not":[46],"exist.":[47],"Therefore,":[48],"these":[49,196,236],"problems":[50],"are":[51,68,73,119,206,222],"often":[52],"solved":[53],"using":[54],"various":[55,66],"heuristic":[56],"methods.":[57],"One":[58],"type":[59],"of":[60,128,155,169,195,242],"heuristics":[61,77,87],"can":[63,88,100,113],"efficiently":[64,146],"EVRPs":[67],"policies":[70],"(RPs).":[71],"RPs":[72,118,145,244],"simple":[74],"greedy":[75],"constructive":[76],"incrementally":[79],"construct":[80,89,162,177],"solution":[82,91],"problem.":[85,117],"These":[86],"simultaneously":[92],"as":[93,228],"it":[94,147],"being":[96],"executed":[97],"since":[98],"they":[99],"quickly":[101],"perform":[102],"next":[104],"decision,":[105],"but":[106],"react":[108],"unexpected":[110],"situations":[111],"occur":[114],"difficult":[120],"design":[122,131,144],"manually,":[123],"which":[124,204],"prompted":[125],"application":[127],"hyper-heuristics":[129],"them":[132,181],"automatically,":[133],"most":[134,208],"notably":[135],"genetic":[136],"programming":[137],"(GP).":[138],"However,":[139],"be":[141,159,174],"able":[142],"required":[149,231],"select":[151],"appropriate":[153],"set":[154,168],"features":[156,171,205],"will":[158],"used":[160,175],"them.":[163],"This":[164],"study":[165],"proposes":[166],"a":[167],"30":[170],"should":[173],"RPs,":[178],"and":[179,239],"divides":[180],"into":[182],"several":[183],"sets":[184,199,221],"based":[185],"on":[186],"their":[187],"characteristics.":[188],"Through":[189],"experimental":[191],"analysis,":[192],"different":[193],"combinations":[194],"terminal":[197,220,237],"node":[198],"were":[200,246],"investigated":[201],"determine":[203],"for":[210],"GP":[211,233],"obtain":[213],"best":[215],"RPs.":[216],"Furthermore,":[217],"examined":[219],"analysed":[224],"considering":[225],"aspects":[226],"such":[227],"execution":[229],"by":[232],"calculate":[235],"nodes":[238],"size":[241],"obtained.":[247]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-14T00:00:00"}