{"id":"https://openalex.org/W2075453218","doi":"https://doi.org/10.1109/socpar.2010.5685867","title":"A discrete particle swarm optimization with random selection solution for the shortest path problem","display_name":"A discrete particle swarm optimization with random selection solution for the shortest path problem","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2075453218","doi":"https://doi.org/10.1109/socpar.2010.5685867","mag":"2075453218"},"language":"en","primary_location":{"id":"doi:10.1109/socpar.2010.5685867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2010.5685867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference of Soft Computing and Pattern Recognition","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/A5113831602","display_name":"Marina Yusoff","orcid":null},"institutions":[{"id":"https://openalex.org/I82724352","display_name":"Universiti Teknologi MARA","ror":"https://ror.org/05n8tts92","country_code":"MY","type":"education","lineage":["https://openalex.org/I82724352"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Marina Yusoff","raw_affiliation_strings":["Intelligent System Group, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, Shah Alam, Selangor Darul Ehsan, Malaysia","Intelligent System Group, Faculty of Computer and Mathematical Sciences, UniversitiTeknologi MARA, 40450 Shah Alam, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intelligent System Group, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, Shah Alam, Selangor Darul Ehsan, Malaysia","institution_ids":["https://openalex.org/I82724352"]},{"raw_affiliation_string":"Intelligent System Group, Faculty of Computer and Mathematical Sciences, UniversitiTeknologi MARA, 40450 Shah Alam, Selangor, Malaysia","institution_ids":["https://openalex.org/I82724352"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111797066","display_name":"Junaidah Ariffin","orcid":null},"institutions":[{"id":"https://openalex.org/I82724352","display_name":"Universiti Teknologi MARA","ror":"https://ror.org/05n8tts92","country_code":"MY","type":"education","lineage":["https://openalex.org/I82724352"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Junaidah Ariffin","raw_affiliation_strings":["Institute of Infrastructure Engineering & Sustainable Management, Flood-Marine Excellence Centre, Faculty of Civil Engineering, Universiti Teknologi MARA, Shah Alam, Selangor Darul Ehsan, Malaysia","Institute for Infrastructure, Engineering & Sustainable, Management, Flood-Marine, Excellence Centre, Faculty of Civil Engineering, UniversitiTeknologi MARA, 40450 Shah Alam, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Infrastructure Engineering & Sustainable Management, Flood-Marine Excellence Centre, Faculty of Civil Engineering, Universiti Teknologi MARA, Shah Alam, Selangor Darul Ehsan, Malaysia","institution_ids":["https://openalex.org/I82724352"]},{"raw_affiliation_string":"Institute for Infrastructure, Engineering & Sustainable, Management, Flood-Marine, Excellence Centre, Faculty of Civil Engineering, UniversitiTeknologi MARA, 40450 Shah Alam, Selangor, Malaysia","institution_ids":["https://openalex.org/I82724352"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065335604","display_name":"Azlinah Mohamed","orcid":"https://orcid.org/0000-0002-4582-8763"},"institutions":[{"id":"https://openalex.org/I82724352","display_name":"Universiti Teknologi MARA","ror":"https://ror.org/05n8tts92","country_code":"MY","type":"education","lineage":["https://openalex.org/I82724352"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Azlinah Mohamed","raw_affiliation_strings":["Intelligent System Group, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, Shah Alam, Selangor Darul Ehsan, Malaysia","Intelligent System Group, Faculty of Computer and Mathematical Sciences, UniversitiTeknologi MARA, 40450 Shah Alam, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intelligent System Group, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, Shah Alam, Selangor Darul Ehsan, Malaysia","institution_ids":["https://openalex.org/I82724352"]},{"raw_affiliation_string":"Intelligent System Group, Faculty of Computer and Mathematical Sciences, UniversitiTeknologi MARA, 40450 Shah Alam, Selangor, Malaysia","institution_ids":["https://openalex.org/I82724352"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82724352"],"apc_list":null,"apc_paid":null,"fwci":5.4226,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.96076994,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","issue":null,"first_page":"133","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9970999956130981,"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.9970999956130981,"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/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9944000244140625,"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6888796091079712},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6547121405601501},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6442111134529114},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.5672964453697205},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5572084188461304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5172584652900696},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4956735372543335},{"id":"https://openalex.org/keywords/discrete-space","display_name":"Discrete space","score":0.4817235767841339},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4358508586883545},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4224432110786438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41318023204803467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3871021270751953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3367469310760498},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23935508728027344},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21795427799224854}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6888796091079712},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6547121405601501},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6442111134529114},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5672964453697205},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5572084188461304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5172584652900696},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4956735372543335},{"id":"https://openalex.org/C153782549","wikidata":"https://www.wikidata.org/wiki/Q175116","display_name":"Discrete space","level":2,"score":0.4817235767841339},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4358508586883545},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4224432110786438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41318023204803467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3871021270751953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3367469310760498},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23935508728027344},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21795427799224854},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/socpar.2010.5685867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2010.5685867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference of Soft Computing and Pattern Recognition","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":24,"referenced_works":["https://openalex.org/W1487627902","https://openalex.org/W1559814459","https://openalex.org/W1820051232","https://openalex.org/W1830257008","https://openalex.org/W1875348914","https://openalex.org/W1964005729","https://openalex.org/W1964122629","https://openalex.org/W1972839725","https://openalex.org/W1973494611","https://openalex.org/W1978381746","https://openalex.org/W1979957675","https://openalex.org/W2005808083","https://openalex.org/W2017694061","https://openalex.org/W2055545070","https://openalex.org/W2066582699","https://openalex.org/W2077665392","https://openalex.org/W2091635795","https://openalex.org/W2095941092","https://openalex.org/W2106784610","https://openalex.org/W2109364787","https://openalex.org/W2122410182","https://openalex.org/W2125213524","https://openalex.org/W2160365857","https://openalex.org/W2623293810"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2133833450","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277"],"abstract_inverted_index":{"This":[0],"article":[1],"proposes":[2],"a":[3,21,27,52,86],"discrete":[4],"particle":[5],"swarm":[6],"optimization":[7],"(DPSO)":[8],"for":[9],"solution":[10,23,60,94],"of":[11,33,38,47,57],"the":[12,44,48,58,62,100],"shortest":[13],"path":[14],"problem":[15],"(SPP).":[16],"The":[17,36,81,96],"proposed":[18,101],"DPSO":[19,63,82,102],"adopts":[20],"new":[22,59,93],"mapping":[24,40],"which":[25],"incorporates":[26],"graph":[28],"decomposition":[29],"and":[30,61,76,92,106,114],"random":[31],"selection":[32],"priority":[34],"value.":[35],"purpose":[37],"this":[39],"is":[41,83,103],"to":[42,51],"reduce":[43],"searching":[45],"space":[46],"particles,":[49],"leading":[50],"better":[53],"solution.":[54],"Detailed":[55],"descriptions":[56],"algorithm":[64,88],"are":[65],"elaborated.":[66],"Computational":[67],"experiments":[68],"involve":[69],"an":[70],"SPP":[71],"dataset":[72],"from":[73,79],"previous":[74],"research":[75],"road":[77],"network":[78],"Malaysia.":[80],"compared":[84],"with":[85],"genetic":[87],"(GA)":[89],"using":[90],"naive":[91],"mapping.":[95],"results":[97],"indicate":[98],"that":[99],"highly":[104],"competitive":[105],"shows":[107],"good":[108],"performance":[109],"in":[110],"both":[111],"fitness":[112],"value":[113],"processing":[115],"time.":[116]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}