{"id":"https://openalex.org/W2362075990","doi":null,"title":"A discrete particle swarm optimization algorithm for task assignment problem","display_name":"A discrete particle swarm optimization algorithm for task assignment problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2362075990","mag":"2362075990"},"language":"en","primary_location":{"id":"mag:2362075990","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-ZNGD200803029.htm","pdf_url":null,"source":{"id":"https://openalex.org/S4306515398","display_name":"Journal of Central South University(Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Central South University(Science and Technology)","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5100711520","display_name":"Weihua Gui","orcid":"https://orcid.org/0000-0002-5337-6445","observed_orcids":["https://orcid.org/0000-0002-5337-6445","https://orcid.org/0000-0003-0312-436X","https://orcid.org/0000-0002-4374-4291"]},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weihua Gui","raw_affiliation_strings":["School of Information Science and Engineering, Central South University, ChangSha 410083, China"],"raw_orcid":"https://orcid.org/0000-0002-5337-6445","affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Central South University, ChangSha 410083, China","institution_ids":["https://openalex.org/I139660479"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100711520"],"corresponding_institution_ids":["https://openalex.org/I139660479"],"apc_list":null,"apc_paid":null,"fwci":0.281,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5805409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9945999979972839,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9945999979972839,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.002199999988079071,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.00039999998989515007,"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/task-assignment-problem","display_name":"task assignment problem","score":0.8209999799728394},{"id":"https://openalex.org/keywords/pickup-and-delivery","display_name":"pickup and delivery","score":0.7350000143051147},{"id":"https://openalex.org/keywords/discrete-particle-swarm-optimization","display_name":"discrete particle swarm optimization","score":0.9729999899864197},{"id":"https://openalex.org/keywords/arctangent-function","display_name":"arctangent function","score":0.734000027179718},{"id":"https://openalex.org/keywords/solution-feasibility","display_name":"solution feasibility","score":0.7580000162124634},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8090000152587891},{"id":"https://openalex.org/keywords/convergence-performance","display_name":"convergence performance","score":0.531000018119812}],"concepts":[{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.7162693738937378},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.7131842970848083},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6409322023391724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6358548402786255},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5886706709861755},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5499706268310547},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5414606928825378},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5370103120803833},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5327406525611877},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.532322108745575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4680718183517456},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44500118494033813},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.4373970627784729},{"id":"https://openalex.org/C110407247","wikidata":"https://www.wikidata.org/wiki/Q122508","display_name":"Inertia","level":2,"score":0.4333045780658722},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.41170644760131836},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.41109609603881836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3790299594402313},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11768338084220886},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1117141842842102},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2362075990","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-ZNGD200803029.htm","pdf_url":null,"source":{"id":"https://openalex.org/S4306515398","display_name":"Journal of Central South University(Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Central South University(Science and Technology)","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4943999946117401}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2465222815","https://openalex.org/W2410599967","https://openalex.org/W2386419047","https://openalex.org/W2157339215","https://openalex.org/W2557901928","https://openalex.org/W2354831197","https://openalex.org/W2085914503","https://openalex.org/W2003085167","https://openalex.org/W3175861029","https://openalex.org/W2379006275"],"abstract_inverted_index":{"Mathematical":[0],"description":[1],"of":[2,35,38,43,45,51,67,85,115,125,137],"task":[3,14,47,96,105,172],"assignment":[4,15,48,97,106,173],"problem":[5,16,29,107],"was":[6,30,56,73,89],"given":[7],"by":[8],"describing":[9],"the":[10,27,33,46,59,65,68,78,83,92,103,109,116,126,135,143,154],"pickup":[11,93],"and":[12,41,94,133,146,157,164,175],"delivery":[13,95],"in":[17,58,98,108],"transportation,and":[18],"a":[19,99],"discrete":[20],"particle":[21],"swarm":[22],"optimization":[23,144,177],"algorithm(DPSO)":[24],"for":[25],"solving":[26,138,170],"above":[28],"proposed.Based":[31],"on":[32],"analysis":[34],"convergence":[36,66],"performance":[37],"standard":[39],"PSO":[40],"distribution":[42],"solutions":[44],"problem,the":[49],"strategy":[50],"nonlinearly":[52],"decreasing":[53],"inertia":[54],"weight":[55],"adopted":[57],"velocity":[60],"update":[61],"formula":[62,80],"to":[63,75,81,91,153,169],"improve":[64],"algorithm,and":[69],"an":[70],"arctangent":[71],"function":[72],"introduced":[74],"further":[76],"adjust":[77],"position":[79],"ensure":[82],"feasibility":[84],"solutions.The":[86],"proposed":[87,117,149,160],"DPSO":[88,118,150],"applied":[90,168],"railway":[100],"freight":[101],"station.Solving":[102],"same":[104,110],"experimental":[111],"condition,the":[112],"successful":[113],"rate":[114],"is":[119,121,151,162],"76%,and":[120],"higher":[122],"than":[123],"those":[124],"other":[127,171],"two":[128],"DPSO,which":[129],"are":[130],"only":[131],"40%":[132],"4%.In":[134],"experiment":[136],"different":[139],"scale":[140],"problems,by":[141],"comparing":[142],"results":[145],"computing":[147],"time,the":[148],"superior":[152],"enumeration":[155],"method":[156],"genetic":[158],"algorithm.The":[159],"algorithm":[161],"simple":[163],"feasible,and":[165],"can":[166],"be":[167],"problems":[174],"combinational":[176],"problems.":[178]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-09-27T08:07:27.782135","created_date":"2016-06-24T00:00:00"}