{"id":"https://openalex.org/W4225275723","doi":"https://doi.org/10.1145/3524889.3524891","title":"Research on \"one-to-many\" Vehicle and Cargo Matching Optimization Problem based on Improved Genetic Algorithm","display_name":"Research on \"one-to-many\" Vehicle and Cargo Matching Optimization Problem based on Improved Genetic Algorithm","publication_year":2022,"publication_date":"2022-02-25","ids":{"openalex":"https://openalex.org/W4225275723","doi":"https://doi.org/10.1145/3524889.3524891"},"language":"en","primary_location":{"id":"doi:10.1145/3524889.3524891","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3524889.3524891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th International Conference on Intelligent Information Technology","raw_type":"proceedings-article"},"type":"conference-paper","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/A5077659971","display_name":"Xinyun He","orcid":"https://orcid.org/0000-0002-3697-7302"},"institutions":[{"id":"https://openalex.org/I4210135483","display_name":"Beijing Institute of Graphic Communication","ror":"https://ror.org/03yg3v757","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210135483"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinyun He","raw_affiliation_strings":["Beijing Institute of Graphic Communication, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Institute of Graphic Communication, China","institution_ids":["https://openalex.org/I4210135483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100368712","display_name":"Yuan Zhang","orcid":"https://orcid.org/0000-0002-5230-7739"},"institutions":[{"id":"https://openalex.org/I4210135483","display_name":"Beijing Institute of Graphic Communication","ror":"https://ror.org/03yg3v757","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210135483"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuan Zhang","raw_affiliation_strings":["Beijing Institute of Graphic Communication, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Institute of Graphic Communication, China","institution_ids":["https://openalex.org/I4210135483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101096399","display_name":"Zhu Le","orcid":null},"institutions":[{"id":"https://openalex.org/I4210135483","display_name":"Beijing Institute of Graphic Communication","ror":"https://ror.org/03yg3v757","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210135483"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhu Le","raw_affiliation_strings":["Beijing Institute of Graphic Communication, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Institute of Graphic Communication, China","institution_ids":["https://openalex.org/I4210135483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041265498","display_name":"Yanping Du","orcid":"https://orcid.org/0000-0003-0211-4223"},"institutions":[{"id":"https://openalex.org/I4210135483","display_name":"Beijing Institute of Graphic Communication","ror":"https://ror.org/03yg3v757","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210135483"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanping Du","raw_affiliation_strings":["Beijing Institute of Graphic Communication, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Institute of Graphic Communication, China","institution_ids":["https://openalex.org/I4210135483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210135483"],"apc_list":null,"apc_paid":null,"fwci":0.8287,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65117787,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"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.9987999796867371,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.9944999814033508,"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.6150478720664978},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5858286023139954},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5204408764839172},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.495748370885849},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42645734548568726},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.42344406247138977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3966420292854309},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1698569357395172},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.16102558374404907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1476244032382965},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09403955936431885}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6150478720664978},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5858286023139954},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5204408764839172},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.495748370885849},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42645734548568726},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.42344406247138977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3966420292854309},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1698569357395172},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.16102558374404907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1476244032382965},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09403955936431885},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3524889.3524891","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3524889.3524891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th International Conference on Intelligent Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2093044920","https://openalex.org/W2094913290","https://openalex.org/W2111581650","https://openalex.org/W2801613941","https://openalex.org/W2900896126","https://openalex.org/W2962964363","https://openalex.org/W2972518961","https://openalex.org/W3029622396","https://openalex.org/W3035935841","https://openalex.org/W3047863327","https://openalex.org/W3093107375","https://openalex.org/W3115985349"],"related_works":["https://openalex.org/W2966843068","https://openalex.org/W4256497730","https://openalex.org/W3216926510","https://openalex.org/W2031438593","https://openalex.org/W2765307330","https://openalex.org/W2797503467","https://openalex.org/W183882753","https://openalex.org/W2571901638","https://openalex.org/W1990084143","https://openalex.org/W2049314427"],"abstract_inverted_index":{"The":[0,120,192],"matching":[1,21,29,39,101,110,132,140],"relationship":[2],"between":[3,122],"vehicles":[4,16,96,117,147,206],"and":[5,17,27,47,58,61,69,79,97,103,108,118,125,130,145,181,207,213],"cargo":[6,18,28,48,70,80,98,109,131,139,214],"affects":[7],"the":[8,11,15,33,41,54,65,75,83,90,100,114,126,149,156,161,165,179,182,189,201,209],"merits":[9],"of":[10,43,56,67,77,92,95,116,163,168,204,211],"transportation":[12],"program,":[13],"so":[14,50],"arrangements":[19],"reasonable":[20],"program":[22],"is":[23,134,175,185],"very":[24],"necessary.":[25],"Vehicle":[26],"refers":[30],"to":[31,52,74,154,177,187],"obtaining":[32],"optimal":[34],"allocation":[35,210],"plan":[36],"through":[37],"intelligent":[38],"under":[40,160],"condition":[42,162],"known":[44],"certain":[45],"vehicle":[46,68,78,107,129,212],"information,":[49],"as":[51],"realize":[53],"optimization":[55],"cost":[57],"time":[59],"single-objective":[60],"dual-objective.":[62],"When":[63],"solving":[64],"problem":[66],"matching,":[71],"pay":[72],"attention":[73],"impact":[76],"information":[81],"on":[82,99,113],"results.":[84,191],"Therefore,":[85],"this":[86,123,196],"article":[87,124],"comprehensively":[88],"considers":[89],"effect":[91],"different":[93],"attributes":[94,115],"scheme,":[102],"proposes":[104],"a":[105],"\"one-to-many\"":[106],"model":[111],"based":[112],"cargo.":[119],"difference":[121],"general":[127],"\u201cone-to-many\u201d":[128],"scenario":[133],"that":[135,195],"it":[136],"provides":[137],"feasible":[138],"schemes":[141],"for":[142],"multiple":[143,146],"types":[144],"at":[148],"same":[150],"time,":[151],"in":[152],"order":[153],"get":[155],"highest":[157],"overall":[158],"profit":[159],"meeting":[164],"weight":[166],"limit":[167],"each":[169],"vehicle.":[170],"An":[171],"improved":[172],"Genetic":[173],"algorithm":[174],"used":[176],"solve":[178],"problem,":[180],"greedy":[183],"operator":[184],"introduced":[186],"screen":[188],"initial":[190],"results":[193],"show":[194],"method":[197],"can":[198],"effectively":[199],"increase":[200],"full-load":[202],"rate":[203],"mainline":[205],"rationalize":[208],"resources.":[215]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}