{"id":"https://openalex.org/W2143288783","doi":"https://doi.org/10.1109/cec.2006.1688480","title":"A comparison of routing algorithms in a hybrid evolutionary tool for the Inventory and Transportation Problem","display_name":"A comparison of routing algorithms in a hybrid evolutionary tool for the Inventory and Transportation Problem","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2143288783","doi":"https://doi.org/10.1109/cec.2006.1688480","mag":"2143288783"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2006.1688480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference 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/A5026427534","display_name":"Anna I. Esparcia-Alc\u00e1zar","orcid":"https://orcid.org/0000-0002-3855-4039"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A.I. Esparcia-Alcazar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082765183","display_name":"Lidia Lluch-Revert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L. Lluch-Revert","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049414176","display_name":"Manuel Card\u00f3s","orcid":"https://orcid.org/0000-0002-7831-5382"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Cardos","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111640374","display_name":"K.C. Sharman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. Sharman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074118983","display_name":"Carlos Andr\u00e9s Romano","orcid":"https://orcid.org/0000-0003-4453-4891"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Andres-Romano","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5026427534"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4227,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.89392022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1456","last_page":"1462"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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.9973999857902527,"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.9836000204086304,"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/computer-science","display_name":"Computer science","score":0.6435787081718445},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5707500576972961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5646239519119263},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5460382699966431},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5435376763343811},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4853459894657135},{"id":"https://openalex.org/keywords/supply-chain","display_name":"Supply chain","score":0.426455020904541},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4145750105381012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17144343256950378},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10919433832168579}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6435787081718445},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5707500576972961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5646239519119263},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5460382699966431},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5435376763343811},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4853459894657135},{"id":"https://openalex.org/C108713360","wikidata":"https://www.wikidata.org/wiki/Q1824206","display_name":"Supply chain","level":2,"score":0.426455020904541},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4145750105381012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17144343256950378},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10919433832168579},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2006.1688480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1532806734","https://openalex.org/W1551167422","https://openalex.org/W1970491547","https://openalex.org/W1984539415","https://openalex.org/W2014931631","https://openalex.org/W2035731748","https://openalex.org/W2056182059","https://openalex.org/W2075188534","https://openalex.org/W2086194020","https://openalex.org/W2108753073","https://openalex.org/W2118625153","https://openalex.org/W2145952420","https://openalex.org/W4240160161"],"related_works":["https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W4247364272","https://openalex.org/W3133151256","https://openalex.org/W2132920749","https://openalex.org/W2101108574","https://openalex.org/W2157331354","https://openalex.org/W2626773395","https://openalex.org/W1575940985","https://openalex.org/W3131953714"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,47,64],"propose":[4],"new":[5],"advances":[6],"towards":[7],"the":[8,16,22,27,44,54,66,73,80,138,141,149,153],"development":[9],"of":[10,24,32,109,151],"a":[11,33,40,61,102,110,126],"commercial":[12],"tool":[13],"to":[14,52],"address":[15],"inventory":[17,30,161],"and":[18,29,79,100,162],"transportation":[19],"problem,":[20],"i.e.":[21],"problem":[23,155],"minimising":[25,159],"both":[26,93],"transport":[28],"costs":[31],"retail":[34],"chain":[35],"that":[36,92,124],"is":[37,131,143],"supplied":[38],"from":[39],"central":[41],"warehouse.":[42],"On":[43,60],"first":[45],"level,":[46],"employ":[48],"an":[49],"evolutionary":[50],"algorithm":[51,78,82,130],"evolve":[53],"delivery":[55,67],"patterns":[56],"for":[57,137],"each":[58],"shop.":[59],"second":[62],"level":[63],"obtain":[65,96],"routes":[68],"using":[69],"two":[70],"different":[71],"algorithms:":[72],"bi-directional":[74],"multistart":[75],"sweep":[76],"(daisy)":[77],"daisy":[81],"enhanced":[83],"with":[84],"local":[85],"neighbourhood":[86],"search.":[87],"The":[88,105],"experiments":[89],"performed":[90],"show":[91],"methods":[94],"can":[95],"acceptable":[97],"results":[98,106],"consistently":[99],"within":[101],"short":[103],"timescale.":[104],"are":[107],"also":[108],"lower":[111],"cost":[112],"than":[113,158],"those":[114],"obtained":[115],"by":[116],"other":[117],"strategies":[118],"employed":[119],"in":[120,133],"previous":[121],"research,":[122],"showing":[123],"employing":[125],"more":[127],"efficient":[128],"routing":[129],"effective":[132],"reducing":[134],"costs,":[135],"although":[136],"cases":[139],"studied":[140],"reduction":[142],"not":[144],"significant.":[145],"Furthermore,":[146],"they":[147],"confirm":[148],"interest":[150],"addressing":[152],"optimisation":[154],"jointly,":[156],"rather":[157],"separately":[160],"transport.":[163]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}