{"id":"https://openalex.org/W2013132841","doi":"https://doi.org/10.1145/1570256.1570269","title":"A concurrent evolutionary approach for rich combinatorial optimization","display_name":"A concurrent evolutionary approach for rich combinatorial optimization","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2013132841","doi":"https://doi.org/10.1145/1570256.1570269","mag":"2013132841"},"language":"en","primary_location":{"id":"doi:10.1145/1570256.1570269","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","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/A5041183626","display_name":"Teodor Gabriel Crainic","orcid":"https://orcid.org/0000-0002-4424-0984"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Teodor Gabriel Crainic","raw_affiliation_strings":["U.Q.A.M., Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"U.Q.A.M., Montreal, PQ, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007792272","display_name":"Gloria Cerasela Cri\u015fan","orcid":"https://orcid.org/0000-0003-1795-2297"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gloria Cerasela Crisan","raw_affiliation_strings":["U.Q.A.M., Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"U.Q.A.M., Montreal, PQ, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034438662","display_name":"Michel Gendreau","orcid":"https://orcid.org/0000-0002-9262-3648"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michel Gendreau","raw_affiliation_strings":["Universit\u00e9 de Montr\u00e9al, Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Montr\u00e9al, Montreal, PQ, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083741114","display_name":"Nadia Lahrichi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nadia Lahrichi","raw_affiliation_strings":["U.Q.A.M., Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"U.Q.A.M., Montreal, PQ, Canada","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088880981","display_name":"Walter Rei","orcid":"https://orcid.org/0000-0001-6626-8251"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Walter Rei","raw_affiliation_strings":["U.Q.A.M., Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"U.Q.A.M., Montreal, PQ, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5041183626"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2697,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.88993178,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2017","last_page":"2022"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9883000254631042,"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.692457377910614},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.677110493183136},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5977067351341248},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5952285528182983},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5897572040557861},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5675916075706482},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4998753070831299},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.49776414036750793},{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.4975629150867462},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4556449353694916},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.4362350106239319},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36763226985931396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3626173734664917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17735430598258972},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1654857099056244},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1410542130470276},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08140677213668823},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.077490895986557}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.692457377910614},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.677110493183136},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5977067351341248},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5952285528182983},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5897572040557861},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5675916075706482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4998753070831299},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.49776414036750793},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.4975629150867462},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4556449353694916},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.4362350106239319},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36763226985931396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3626173734664917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17735430598258972},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1654857099056244},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1410542130470276},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08140677213668823},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.077490895986557},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1570256.1570269","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.polymtl.ca:19749","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/19749/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication de conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W37917650","https://openalex.org/W68587524","https://openalex.org/W145326871","https://openalex.org/W159794904","https://openalex.org/W1496618778","https://openalex.org/W1529634223","https://openalex.org/W1535564545","https://openalex.org/W1585573806","https://openalex.org/W1601649239","https://openalex.org/W1972755385","https://openalex.org/W1975432534","https://openalex.org/W1984594269","https://openalex.org/W2008660757","https://openalex.org/W2018743970","https://openalex.org/W2021117098","https://openalex.org/W2037932849","https://openalex.org/W2073254391","https://openalex.org/W2084172163","https://openalex.org/W2111174053","https://openalex.org/W2134725313","https://openalex.org/W2158000627","https://openalex.org/W2600106627","https://openalex.org/W4255486187","https://openalex.org/W6631698033","https://openalex.org/W6631959747"],"related_works":["https://openalex.org/W3123878210","https://openalex.org/W3144414831","https://openalex.org/W2337677955","https://openalex.org/W1969514800","https://openalex.org/W2597689725","https://openalex.org/W2049828308","https://openalex.org/W2474680198","https://openalex.org/W2363855676","https://openalex.org/W2770186408","https://openalex.org/W4200101239"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,36],"meta-heuristic":[6],"method":[7,31],"based":[8],"on":[9],"the":[10,30],"concurrent":[11],"evolution":[12],"of":[13],"heterogeneous":[14],"populations,":[15],"decomposition/recomposition":[16],"principles":[17],"and":[18,44,54],"specialized":[19],"operators":[20],"to":[21,35],"address":[22],"multi-attribute,":[23],"rich,":[24],"combinatorial":[25],"optimization":[26],"problems.":[27],"We":[28],"illustrate":[29],"through":[32],"an":[33],"application":[34],"rich":[37],"Vehicle":[38],"Routing":[39],"Problem":[40],"that":[41],"considers":[42],"duration":[43],"capacity":[45],"constraints":[46],"as":[47,49],"well":[48],"time":[50],"windows,":[51],"multiple":[52,55],"periods":[53],"depots.":[56]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}