{"id":"https://openalex.org/W3030488317","doi":"https://doi.org/10.1109/access.2020.2997812","title":"A Parallel Genetic Algorithm Framework for Transportation Planning and Logistics Management","display_name":"A Parallel Genetic Algorithm Framework for Transportation Planning and Logistics Management","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3030488317","doi":"https://doi.org/10.1109/access.2020.2997812","mag":"3030488317"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.2997812","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2997812","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09099840.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09099840.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061461040","display_name":"Dmitri I. Arkhipov","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dmitri I. Arkhipov","raw_affiliation_strings":["Department of Computer Science, University of California at Irvine, Irvine, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California at Irvine, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Di Wu","orcid":"https://orcid.org/0000-0001-6093-0654"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]},{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"Di Wu","raw_affiliation_strings":["Department of Computer Science, University of California at Irvine, Irvine, USA","State Key Laboratory of Advanced Design and Manufacturing of Vehicle Body, Hunan University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0001-6093-0654","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California at Irvine, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"State Key Laboratory of Advanced Design and Manufacturing of Vehicle Body, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019612664","display_name":"Tao Wu","orcid":"https://orcid.org/0000-0003-3455-7934"},"institutions":[{"id":"https://openalex.org/I173759888","display_name":"Hunan Normal University","ror":"https://ror.org/053w1zy07","country_code":"CN","type":"education","lineage":["https://openalex.org/I173759888"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tao Wu","raw_affiliation_strings":["Key Laboratory of Geospatial Big Data Mining and Application, Hunan Normal University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0003-3455-7934","affiliations":[{"raw_affiliation_string":"Key Laboratory of Geospatial Big Data Mining and Application, Hunan Normal University, Changsha, China","institution_ids":["https://openalex.org/I173759888"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045530260","display_name":"Amelia Regan","orcid":"https://orcid.org/0000-0003-4220-2148"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amelia C. Regan","raw_affiliation_strings":["Department of Computer Science, University of California at Irvine, Irvine, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California at Irvine, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":4.9186,"has_fulltext":true,"cited_by_count":39,"citation_normalized_percentile":{"value":0.9528425,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"8","issue":null,"first_page":"106506","last_page":"106515"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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.9980999827384949,"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.994700014591217,"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.8296183347702026},{"id":"https://openalex.org/keywords/usable","display_name":"USable","score":0.6311086416244507},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6303611993789673},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5702434778213501},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5300257802009583},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5116577744483948},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4828084707260132},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4732033610343933},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.450370728969574},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4086763262748718},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37350910902023315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3611806035041809},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33856409788131714},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09667336940765381},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08909347653388977}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8296183347702026},{"id":"https://openalex.org/C2780615836","wikidata":"https://www.wikidata.org/wiki/Q2471869","display_name":"USable","level":2,"score":0.6311086416244507},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6303611993789673},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5702434778213501},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5300257802009583},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5116577744483948},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4828084707260132},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4732033610343933},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.450370728969574},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4086763262748718},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37350910902023315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3611806035041809},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33856409788131714},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09667336940765381},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08909347653388977},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2020.2997812","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2997812","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09099840.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:091c1a92fcee456a86df71f735285d27","is_oa":true,"landing_page_url":"https://doaj.org/article/091c1a92fcee456a86df71f735285d27","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 8, Pp 106506-106515 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.2997812","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.2997812","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09099840.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G1365786781","display_name":"\u8fb9\u7f18\u8ba1\u7b97\u4e2d\u5f02\u5e38\u68c0\u6d4b\u53ca\u81ea\u9002\u5e94\u7f51\u7edc\u63a7\u5236\u7814\u7a76","funder_award_id":"61972145","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G1467926431","display_name":null,"funder_award_id":"19I05","funder_id":"https://openalex.org/F4320326938","funder_display_name":"State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing"},{"id":"https://openalex.org/G4233802299","display_name":null,"funder_award_id":"2019YFB1405703","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G576546066","display_name":null,"funder_award_id":"61932010","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320326938","display_name":"State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing","ror":"https://ror.org/02bpap860"},{"id":"https://openalex.org/F4320333111","display_name":"University of California Transportation Center","ror":"https://ror.org/01an7q238"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3030488317.pdf","grobid_xml":"https://content.openalex.org/works/W3030488317.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W620777765","https://openalex.org/W1036195498","https://openalex.org/W1584555100","https://openalex.org/W1623071382","https://openalex.org/W1934278965","https://openalex.org/W1972346388","https://openalex.org/W1978518812","https://openalex.org/W1979964121","https://openalex.org/W2011039300","https://openalex.org/W2042986967","https://openalex.org/W2066335675","https://openalex.org/W2069024107","https://openalex.org/W2073811411","https://openalex.org/W2080143744","https://openalex.org/W2097571405","https://openalex.org/W2102465293","https://openalex.org/W2104344166","https://openalex.org/W2108196201","https://openalex.org/W2119601963","https://openalex.org/W2122410182","https://openalex.org/W2132228172","https://openalex.org/W2133747588","https://openalex.org/W2134954564","https://openalex.org/W2135203439","https://openalex.org/W2163428398","https://openalex.org/W2168167348","https://openalex.org/W2169354676","https://openalex.org/W2202919481","https://openalex.org/W2224959353","https://openalex.org/W2240711723","https://openalex.org/W2596943951","https://openalex.org/W2746418572","https://openalex.org/W2769553056","https://openalex.org/W2883049166","https://openalex.org/W2895485451","https://openalex.org/W2903310598","https://openalex.org/W2903700947","https://openalex.org/W2905170803","https://openalex.org/W2907054614","https://openalex.org/W2908332080","https://openalex.org/W2915564669","https://openalex.org/W2943655105","https://openalex.org/W2953527056","https://openalex.org/W2972733158","https://openalex.org/W2985192995","https://openalex.org/W2987793235","https://openalex.org/W2997842691","https://openalex.org/W3005054504","https://openalex.org/W3013001613","https://openalex.org/W3017800818","https://openalex.org/W4237794778","https://openalex.org/W6619477082","https://openalex.org/W6643553314","https://openalex.org/W6689810854","https://openalex.org/W6776433792"],"related_works":["https://openalex.org/W2982321410","https://openalex.org/W1525389557","https://openalex.org/W2392004567","https://openalex.org/W2940029036","https://openalex.org/W4388292429","https://openalex.org/W2361554335","https://openalex.org/W2756595502","https://openalex.org/W2164188042","https://openalex.org/W68587524","https://openalex.org/W2070426974"],"abstract_inverted_index":{"Small":[0],"to":[1,64,76,117,171,195,238],"medium":[2],"sized":[3],"transportation":[4,72,144],"and":[5,14,73,89,132,138,236],"logistics":[6,74],"companies":[7],"are":[8],"usually":[9],"constrained":[10],"by":[11,186],"limited":[12],"computing":[13],"IT":[15],"professional":[16],"resources":[17,83],"on":[18],"implementing":[19],"an":[20,187],"efficient":[21],"parallel":[22,46,49,97],"metaheuristic":[23],"algorithm":[24,68,159],"for":[25,38,62,70,141,199],"planning":[26],"or":[27],"management":[28],"solutions.":[29],"In":[30],"this":[31,166],"paper":[32],"we":[33],"extend":[34],"the":[35,56,103,119,127,130,150,181,197],"standard":[36,156],"meta-description":[37],"genetic":[39,67,158,193],"algorithms":[40,194],"(GA)":[41],"with":[42,55,154,192],"a":[43,59,100,142,155],"simple":[44,167],"non-trivial":[45],"implementation.":[47,160],"Our":[48,161],"GA":[50],"framework":[51,93,137,182,198,211],"is":[52,99,183,212,234],"chiefly":[53],"concerned":[54],"development":[57],"of":[58,79,102,121,129],"straightforward":[60],"way":[61],"engineers":[63],"modify":[65],"existing":[66],"implementations":[69],"real":[71],"problems":[75],"make":[77],"use":[78],"commonly":[80],"available":[81],"hardware":[82],"without":[84],"completely":[85],"reworking":[86],"complex,":[87],"useful":[88],"usable":[90],"codes.":[91],"The":[92],"presented":[94],"at":[95],"its":[96],"base":[98],"modification":[101],"primitive":[104,215],"parallelization":[105,216,231],"concept,":[106],"but":[107],"if":[108],"implemented":[109,185],"as":[110,232],"described":[111],"it":[112,218,233],"may":[113],"be":[114],"gradually":[115],"extended":[116],"fit":[118],"qualities":[120],"any":[122],"underlying":[123],"problem":[124,148,153],"better":[125,213,221],"(via":[126],"adaptation":[128],"merging":[131],"communications":[133],"functions).We":[134],"present":[135],"our":[136,178,210],"computational":[139],"results":[140,222],"classical":[143],"related":[145],"combinatorial":[146],"optimization":[147],"-":[149],"traveling":[151],"salesman":[152],"sequential":[157],"empirical":[162],"analysis":[163],"shows":[164],"that":[165,180,209],"extension":[168],"can":[169],"lead":[170],"considerable":[172],"solution":[173],"improvements.":[174],"We":[175],"also":[176,227],"tested":[177],"assumptions":[179],"easily":[184],"engineer":[188],"not":[189],"initially":[190],"familiar":[191],"implement":[196],"another":[200],"minimum":[201],"multiprocessor":[202],"scheduling":[203],"problem.":[204],"These":[205],"case":[206],"studies":[207],"verify":[208],"than":[214],"because":[217],"gives":[219],"empirically":[220],"under":[223],"equitable":[224],"conditions.":[225],"It":[226],"outperforms":[228],"fine":[229],"grained":[230],"easier":[235],"faster":[237],"implement.":[239]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}