{"id":"https://openalex.org/W1949104182","doi":"https://doi.org/10.1109/iccp.2015.7312619","title":"Route assignment using multi-objective evolutionary search","display_name":"Route assignment using multi-objective evolutionary search","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W1949104182","doi":"https://doi.org/10.1109/iccp.2015.7312619","mag":"1949104182"},"language":"en","primary_location":{"id":"doi:10.1109/iccp.2015.7312619","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp.2015.7312619","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)","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/A5009798916","display_name":"Camelia Chira","orcid":"https://orcid.org/0000-0002-1949-1298"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Camelia Chira","raw_affiliation_strings":["Department of Computer Science, Technical University of Cluj-Napoca, Cluj, Romania","Department of Computer Science, Technical University of Cluj-Napoca, 400027, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Cluj-Napoca, Cluj, Romania","institution_ids":["https://openalex.org/I158333966"]},{"raw_affiliation_string":"Department of Computer Science, Technical University of Cluj-Napoca, 400027, Romania","institution_ids":["https://openalex.org/I158333966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028225369","display_name":"Ana L. C. Bazzan","orcid":"https://orcid.org/0000-0002-2803-9607"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ana L. C. Bazzan","raw_affiliation_strings":["Instituto de Informatica- UFRGS, Caixa Postal 15064, 91.501-970 Porto Alegre, RS, Brazil","Instituto de Inform\u00e1tica, UFRGS, Caixa Postal 15064, 91.501-970 Porto Alegre, RS, Brazil#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Informatica- UFRGS, Caixa Postal 15064, 91.501-970 Porto Alegre, RS, Brazil","institution_ids":["https://openalex.org/I130442723"]},{"raw_affiliation_string":"Instituto de Inform\u00e1tica, UFRGS, Caixa Postal 15064, 91.501-970 Porto Alegre, RS, Brazil#TAB#","institution_ids":["https://openalex.org/I130442723"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.32,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.86701465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"7","issue":null,"first_page":"141","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9670000076293945,"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/T12095","display_name":"Vehicle emissions and performance","score":0.9621000289916992,"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/computer-science","display_name":"Computer science","score":0.7387182712554932},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5970202088356018},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5270650386810303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48341071605682373},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.48181524872779846},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.4483003318309784},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.4322546124458313},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21097403764724731},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.20399555563926697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1477004885673523},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10459139943122864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7387182712554932},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5970202088356018},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5270650386810303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48341071605682373},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.48181524872779846},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.4483003318309784},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.4322546124458313},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21097403764724731},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.20399555563926697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1477004885673523},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10459139943122864},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","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":1,"locations":[{"id":"doi:10.1109/iccp.2015.7312619","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp.2015.7312619","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6299999952316284,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1520469672","https://openalex.org/W1526040632","https://openalex.org/W1534470046","https://openalex.org/W1942465025","https://openalex.org/W2006294405","https://openalex.org/W2011282943","https://openalex.org/W2021195401","https://openalex.org/W2027779047","https://openalex.org/W2032998217","https://openalex.org/W2091440166","https://openalex.org/W2126105956","https://openalex.org/W2234912118","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2807758032","https://openalex.org/W4224254130","https://openalex.org/W2152103536","https://openalex.org/W2107643127","https://openalex.org/W413879896","https://openalex.org/W1983530038","https://openalex.org/W2972374246","https://openalex.org/W3205006318","https://openalex.org/W3088340659","https://openalex.org/W2975379457"],"abstract_inverted_index":{"Traffic":[0],"assignment":[1,38,65],"aims":[2],"to":[3,50,77,128],"assign":[4],"trips":[5],"in":[6,36,43,63,84,133],"a":[7,68,88,115],"road":[8,117],"network":[9,86,136],"such":[10],"that":[11],"the":[12,55,85,103,121],"travel":[13],"time":[14],"of":[15,29,48,57,61,91,102,125,135],"each":[16],"car":[17],"is":[18,39,75,108],"minimized":[19],"given":[20],"multiple":[21],"alternative":[22,30],"routes":[23,31,62,94],"and":[24,97,123],"origin-destination":[25],"pairs.":[26],"The":[27,100],"number":[28,60],"between":[32,95],"two":[33],"points":[34],"considered":[35,107],"traffic":[37,64],"an":[40,45],"important":[41],"factor":[42],"discovering":[44],"optimal":[46],"distribution":[47],"cars":[49],"routes.":[51],"This":[52],"paper":[53],"investigates":[54],"influence":[56],"using":[58,110],"different":[59,89,126],"modeled":[66],"as":[67],"multi-objective":[69,104],"optimization":[70],"problem.":[71],"An":[72],"evolutionary":[73,105],"algorithm":[74],"used":[76],"find":[78],"route":[79,131],"solutions":[80],"for":[81,114],"all":[82],"users":[83],"considering":[87],"set":[90],"best":[92],"possible":[93],"origin":[96],"destination":[98],"points.":[99],"performance":[101],"models":[106],"assessed":[109],"several":[111],"parameter":[112],"settings":[113,127],"non-trivial":[116],"network.":[118],"Results":[119],"show":[120],"limitations":[122],"advantages":[124],"detect":[129],"efficient":[130],"assignments":[132],"terms":[134],"performance.":[137]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}