乐胖代购免代理版

{"id":"https://openalex.org/W4285805283","doi":"https://doi.org/10.1145/3520304.3528782","title":"Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows","display_name":"Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows","publication_year":2022,"publication_date":"2022-07-09","ids":{"openalex":"https://openalex.org/W4285805283","doi":"https://doi.org/10.1145/3520304.3528782"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3520304.3528782","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5065942450","display_name":"Miros\u0142aw B\u0142ocho","orcid":"https://orcid.org/0000-0002-7224-3701"},"institutions":[{"id":"https://openalex.org/I4210151481","display_name":"\u0141ukasiewicz Research Network - Institute of Welding","ror":"https://ror.org/05xx8bb48","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210129336","https://openalex.org/I4210151481"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Miroslaw Blocho","raw_affiliation_strings":["Future Processing, Gliwice, Poland"],"affiliations":[{"raw_affiliation_string":"Future Processing, Gliwice, Poland","institution_ids":["https://openalex.org/I4210151481"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049582497","display_name":"Tomasz Jastrz\u0105b","orcid":"https://orcid.org/0000-0002-7854-9058"},"institutions":[{"id":"https://openalex.org/I119004910","display_name":"Silesian University of Technology","ror":"https://ror.org/02dyjk442","country_code":"PL","type":"funder","lineage":["https://openalex.org/I119004910"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tomasz Jastrzab","raw_affiliation_strings":["Silesian University of Technology, Gliwice, Poland"],"affiliations":[{"raw_affiliation_string":"Silesian University of Technology, Gliwice, Poland","institution_ids":["https://openalex.org/I119004910"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041796575","display_name":"Jakub Nalepa","orcid":"https://orcid.org/0000-0002-4026-1569"},"institutions":[{"id":"https://openalex.org/I119004910","display_name":"Silesian University of Technology","ror":"https://ror.org/02dyjk442","country_code":"PL","type":"funder","lineage":["https://openalex.org/I119004910"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jakub Nalepa","raw_affiliation_strings":["Silesian University of Technology, Gliwice, Poland"],"affiliations":[{"raw_affiliation_string":"Silesian University of Technology, Gliwice, Poland","institution_ids":["https://openalex.org/I119004910"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.545,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.466039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":59,"max":69},"biblio":{"volume":null,"issue":null,"first_page":"176","last_page":"179"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9985,"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.9985,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9976,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9966,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.94144344},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7640241},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle Routing Problem","score":0.6350459},{"id":"https://openalex.org/keywords/memetics","display_name":"Memetics","score":0.6179079},{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.48377702}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.94144344},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7640241},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6563344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.65165776},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6350459},{"id":"https://openalex.org/C51620047","wikidata":"https://www.wikidata.org/wiki/Q23399","display_name":"Memetics","level":2,"score":0.6179079},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.57639134},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.54431885},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.49746993},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.48377702},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.47174987},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4672615},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.446276},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4168152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30955076},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2795745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20629129},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13359833},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3520304.3528782","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320324727","funder_display_name":"Silesian University of Technology","award_id":"02/080/RGJ22/0026"}],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W1493761729","https://openalex.org/W2022485595","https://openalex.org/W2039410851","https://openalex.org/W2098677401","https://openalex.org/W2105511939","https://openalex.org/W2108968575","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W2560965638","https://openalex.org/W2892336140","https://openalex.org/W3008693879","https://openalex.org/W3215760358"],"related_works":["https://openalex.org/W3034910425","https://openalex.org/W2388961298","https://openalex.org/W2278624910","https://openalex.org/W2163647484","https://openalex.org/W2152512538","https://openalex.org/W2123894366","https://openalex.org/W2122102648","https://openalex.org/W2024203849","https://openalex.org/W1998981559","https://openalex.org/W1990478250"],"abstract_inverted_index":{"Solving":[0],"rich":[1],"vehicle":[2],"routing":[3],"problems":[4,22],"has":[5],"become":[6],"an":[7],"important":[8],"research":[9],"avenue":[10],"due":[11],"to":[12,70,86],"a":[13,71,123],"plethora":[14],"of":[15,28,65,78],"their":[16],"practical":[17],"applications.":[18],"Such":[19],"discrete":[20],"optimization":[21,44,129],"commonly":[23],"deal":[24],"with":[25],"multiple":[26],"aspects":[27],"intelligent":[29],"transportation":[30],"systems":[31],"through":[32,126],"mapping":[33],"them":[34],"into":[35,122],"the":[36,43,51,62,76,80,89,107,119,128],"objectives":[37],"which":[38,110],"should":[39],"be":[40],"targeted":[41],"by":[42],"algorithm.":[45],"In":[46],"this":[47,57],"paper,":[48],"we":[49],"introduce":[50],"cooperative":[52],"co-evolutionary":[53],"memetic":[54,108],"algorithm":[55,104],"for":[56],"task.":[58],"It":[59],"benefits":[60],"from":[61,75],"simultaneous":[63],"evolution":[64],"several":[66],"subpopulations,":[67],"each":[68,112],"corresponding":[69],"single":[72],"objective,":[73],"and":[74,115],"process":[77],"migrating":[79],"best":[81],"individuals":[82],"across":[83],"such":[84],"subpopulations":[85],"effectively":[87],"guide":[88],"search":[90],"process.":[91],"The":[92],"experimental":[93],"study":[94],"performed":[95],"over":[96],"widely-used":[97],"benchmark":[98],"test":[99],"cases":[100],"indicates":[101],"that":[102,117],"our":[103],"significantly":[105],"outperforms":[106],"techniques":[109],"tackle":[111],"objective":[113],"separately":[114],"those":[116],"turn":[118],"multi-objective":[120],"problem":[121],"single-objective":[124],"one":[125],"weighting":[127],"criteria.":[130]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4285805283","counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-03-20T02:09:37.528438","created_date":"2022-07-19"}