{"id":"https://openalex.org/W2157441599","doi":"https://doi.org/10.1109/iita.2009.396","title":"Hybrid Particle Swarm Algorithm for Grain Logistics Vehicle Routing Problem","display_name":"Hybrid Particle Swarm Algorithm for Grain Logistics Vehicle Routing Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2157441599","doi":"https://doi.org/10.1109/iita.2009.396","mag":"2157441599"},"language":"en","primary_location":{"id":"doi:10.1109/iita.2009.396","doi":"https://doi.org/10.1109/iita.2009.396","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iita.2009.396","pdf_url":null,"source":{"id":"https://openalex.org/S4306418940","display_name":"Intelligent Information Technology Application","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Third International Symposium on Intelligent Information Technology Application","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2157441599"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5100296363","display_name":"Yuhua Zhu","orcid":"https://orcid.org/0009-0005-8099-1530","observed_orcids":["https://orcid.org/0009-0005-8099-1530"]},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuhua Zhu","raw_affiliation_strings":["School of Journalism and Communication, Henan University of Technology, Zhengzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Journalism and Communication, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036962529","display_name":"Hongyi Ge","orcid":"https://orcid.org/0000-0002-9969-8861","observed_orcids":["https://orcid.org/0000-0002-9969-8861"]},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongyi Ge","raw_affiliation_strings":["College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tong Zhen","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tong Zhen","raw_affiliation_strings":["College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I36152291"],"apc_list":null,"apc_paid":null,"fwci":4.2986,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.92546174,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"364","last_page":"367"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.00019999999494757503,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0,"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/grain-logistics","display_name":"grain logistics","score":0.75},{"id":"https://openalex.org/keywords/vehicle-routing-problem-with-time-windows","display_name":"vehicle routing problem with time windows","score":0.9850000143051147},{"id":"https://openalex.org/keywords/hybrid-particle-swarm-optimization","display_name":"hybrid particle swarm optimization","score":0.9739999771118164},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9990000128746033},{"id":"https://openalex.org/keywords/distribution-cost-reduction","display_name":"distribution cost reduction","score":0.6840000152587891}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.9029829502105713},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7912724018096924},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7726715803146362},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6475386023521423},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.6235337853431702},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5959599614143372},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5030257105827332},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43594563007354736},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.421579509973526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22480660676956177},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iita.2009.396","doi":"https://doi.org/10.1109/iita.2009.396","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iita.2009.396","pdf_url":null,"source":{"id":"https://openalex.org/S4306418940","display_name":"Intelligent Information Technology Application","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Third International Symposium on Intelligent Information Technology Application","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.8970999717712402}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1982974168","https://openalex.org/W2016007475","https://openalex.org/W2024060531","https://openalex.org/W2062015398","https://openalex.org/W2111563176","https://openalex.org/W2114939271","https://openalex.org/W2149156031","https://openalex.org/W2152195021","https://openalex.org/W2370495080","https://openalex.org/W2402846924","https://openalex.org/W4231132678"],"related_works":["https://openalex.org/W2085420623","https://openalex.org/W2103322327","https://openalex.org/W2362396499","https://openalex.org/W2148919008","https://openalex.org/W2362451489","https://openalex.org/W2018615351","https://openalex.org/W2374340480","https://openalex.org/W2296609492","https://openalex.org/W2323755377","https://openalex.org/W2028172705"],"abstract_inverted_index":{"In":[0,95],"this":[1,93],"study,":[2],"we":[3],"consider":[4],"the":[5,14,29,37,42,47,60,63,101,106,117,125],"application":[6],"of":[7,28,50,62,71,109,127],"a":[8,26,74],"hybrid":[9,75,107],"particle":[10,76],"swarm":[11,77],"algorithm":[12,84,108,119],"to":[13,40,68,87,97],"grain":[15,72,89,113],"logistics":[16,90,114],"vehicle":[17,32],"routing":[18,33],"problem":[19,34],"with":[20,55,80],"time":[21],"windows":[22],"(VRPTW).":[23],"VRPTW":[24],"is":[25,39,85,120],"variant":[27],"well-known":[30],"well-studied":[31],"(VRP),":[35],"which":[36],"objective":[38],"use":[41],"limited":[43],"vehicles":[44],"so":[45],"that":[46,105],"maximum":[48],"number":[49],"jobs":[51],"can":[52,111,123],"be":[53],"completed":[54],"minimum":[56],"cost.":[57],"Aiming":[58],"at":[59],"characteristics":[61],"large":[64],"batch":[65],"and":[66,122],"multi-point":[67,69],"transportation":[70],"logistics,":[73],"optimization":[78],"(PSO)":[79],"simulated":[81],"annealing":[82],"(SA)":[83],"proposed":[86,118],"solve":[88,112],"VRPTM":[91,115],"in":[92],"paper.":[94],"contrast":[96],"other":[98],"existing":[99],"algorithms,":[100],"experimental":[102],"results":[103],"manifest":[104],"PSO":[110],"quickly,":[116],"effective,":[121],"reduce":[124],"cost":[126],"distribution.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}