{"id":"https://openalex.org/W2329392810","doi":"https://doi.org/10.1109/codit.2014.6996875","title":"A Robust optimization approach for the Vehicle Routing problem with uncertain travel cost","display_name":"A Robust optimization approach for the Vehicle Routing problem with uncertain travel cost","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2329392810","doi":"https://doi.org/10.1109/codit.2014.6996875","mag":"2329392810"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2014.6996875","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"preprint","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/A5087395856","display_name":"Elyn L. Solano\u2010Charris","orcid":"https://orcid.org/0000-0002-0549-7058"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]},{"id":"https://openalex.org/I157650460","display_name":"Universidad de La Sabana","ror":"https://ror.org/02sqgkj21","country_code":"CO","type":"education","lineage":["https://openalex.org/I157650460"]}],"countries":["CO","FR"],"is_corresponding":true,"raw_author_name":"Elyn L. Solano-Charris","raw_affiliation_strings":["AMLI-EICEA, Universidad de La Sabana, Cundinamarca, Colombia","ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes CEDEX, France"],"affiliations":[{"raw_affiliation_string":"AMLI-EICEA, Universidad de La Sabana, Cundinamarca, Colombia","institution_ids":["https://openalex.org/I157650460"]},{"raw_affiliation_string":"ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes CEDEX, France","institution_ids":["https://openalex.org/I140494188"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017877687","display_name":"Christian Prins","orcid":"https://orcid.org/0000-0002-0184-0357"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christian Prins","raw_affiliation_strings":["ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes CEDEX, France"],"affiliations":[{"raw_affiliation_string":"ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes CEDEX, France","institution_ids":["https://openalex.org/I140494188"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043894517","display_name":"Andr\u00e9a Cynthia Santos","orcid":"https://orcid.org/0000-0003-2497-4072"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Andrea Cynthia Santos","raw_affiliation_strings":["ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes CEDEX, France"],"affiliations":[{"raw_affiliation_string":"ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes CEDEX, France","institution_ids":["https://openalex.org/I140494188"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087395856"],"corresponding_institution_ids":["https://openalex.org/I140494188","https://openalex.org/I157650460"],"apc_list":null,"apc_paid":null,"fwci":1.8713,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88308237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6879255175590515},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6490832567214966},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6466042399406433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6378656625747681},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6227510571479797},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5755882263183594},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5560205578804016},{"id":"https://openalex.org/keywords/arc-routing","display_name":"Arc routing","score":0.5318460464477539},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5301364660263062},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43720579147338867},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4190444350242615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19977030158042908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18432936072349548},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07695937156677246}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6879255175590515},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6490832567214966},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6466042399406433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6378656625747681},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6227510571479797},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5755882263183594},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5560205578804016},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.5318460464477539},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5301364660263062},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43720579147338867},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4190444350242615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19977030158042908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18432936072349548},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07695937156677246},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit.2014.6996875","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2014.6996875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02302632v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02302632","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Control, Decision, and Information Technology (CODIT\u201914), 2014, Metz, Brazil. 2014","raw_type":"Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1513472112","https://openalex.org/W1966197373","https://openalex.org/W1972715957","https://openalex.org/W1975378161","https://openalex.org/W1976579723","https://openalex.org/W1990275757","https://openalex.org/W2011116939","https://openalex.org/W2023964406","https://openalex.org/W2026220041","https://openalex.org/W2030293819","https://openalex.org/W2049287714","https://openalex.org/W2052338628","https://openalex.org/W2055424670","https://openalex.org/W2075567596","https://openalex.org/W2078276584","https://openalex.org/W2078858191","https://openalex.org/W2089105401","https://openalex.org/W2093579479","https://openalex.org/W2096305430","https://openalex.org/W2111563176","https://openalex.org/W2118578357","https://openalex.org/W2127331687","https://openalex.org/W2145847830","https://openalex.org/W2146870367","https://openalex.org/W2165775468","https://openalex.org/W2171328669","https://openalex.org/W2496394318","https://openalex.org/W3023540311","https://openalex.org/W4253347690","https://openalex.org/W4301034488"],"related_works":["https://openalex.org/W1822681810","https://openalex.org/W2059958986","https://openalex.org/W2737096452","https://openalex.org/W2473635752","https://openalex.org/W2355014420","https://openalex.org/W1563136009","https://openalex.org/W2006251942","https://openalex.org/W1989850675","https://openalex.org/W2826570026","https://openalex.org/W3215808204"],"abstract_inverted_index":{"The":[0,37],"Robust":[1],"Vehicle":[2],"Routing":[3],"problem":[4],"(RVRP)":[5],"with":[6],"discrete":[7,71,114],"scenarios":[8,72,115,127],"is":[9,39,61],"studied":[10],"here":[11],"to":[12,40,91],"handle":[13],"uncertain":[14],"traveling":[15],"time,":[16],"where":[17],"a":[18,21,33,42,67,105,146],"scenario":[19],"represents":[20],"possible":[22],"discretization":[23],"of":[24,44,49,70,95,107,142],"the":[25,47,50,64,74,79,93,96,100,133,140],"travel":[26],"time":[27],"observed":[28],"on":[29,78,83],"each":[30],"arc":[31,76],"at":[32],"given":[34],"traffic":[35],"hour.":[36],"goal":[38],"build":[41],"set":[43,69],"routes":[45],"considering":[46,66],"minimization":[48],"worst":[51],"total":[52],"cost":[53],"over":[54],"all":[55],"scenarios.":[56],"A":[57],"Genetic":[58],"Algorithm":[59],"(GA)":[60],"proposed":[62,97],"for":[63,99],"RVRP":[65],"bounded":[68],"and":[73,85,112,125,138],"asymmetric":[75],"costs":[77],"transportation":[80],"network.":[81],"Tests":[82],"small":[84],"medium":[86],"size":[87],"instances":[88],"are":[89,116,128],"presented":[90],"evaluate":[92],"performance":[94],"GA":[98,134],"RVRP.":[101],"On":[102],"small-size":[103],"instances,":[104,120],"maximum":[106],"20":[108,123,126],"customers,":[109,122],"3":[110],"vehicles":[111,124],"30":[113],"handled.":[117],"For":[118],"medium-size":[119],"100":[121],"tested.":[129],"Computational":[130],"results":[131],"indicate":[132],"produces":[135],"good":[136],"solutions":[137],"retrives":[139],"majority":[141],"proven":[143],"optima":[144],"in":[145],"moderate":[147],"computational":[148],"time.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}