乐胖代购免代理版

{"id":"https://openalex.org/W2126736140","doi":"https://doi.org/10.1109/icis.2005.19","title":"A shortest-path network problem using an annealed ant system algorithm","display_name":"A shortest-path network problem using an annealed ant system algorithm","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2126736140","doi":"https://doi.org/10.1109/icis.2005.19","mag":"2126736140"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2005.19","pdf_url":null,"source":null,"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/A5053403785","display_name":"Shaohan Liu","orcid":"https://orcid.org/0000-0001-6967-0262"},"institutions":[{"id":"https://openalex.org/I65446980","display_name":"National Chin-Yi University of Technology","ror":"https://ror.org/040bs6h16","country_code":"TW","type":"education","lineage":["https://openalex.org/I65446980"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"None Shao-Han Liu","raw_affiliation_strings":["Dept. of Comput. Sci. & Inf. Eng., Nat. Chin-Yi Inst. of Technol., Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Eng., Nat. Chin-Yi Inst. of Technol., Taichung, Taiwan","institution_ids":["https://openalex.org/I65446980"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113576982","display_name":"Jzau\u2010Sheng Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I65446980","display_name":"National Chin-Yi University of Technology","ror":"https://ror.org/040bs6h16","country_code":"TW","type":"education","lineage":["https://openalex.org/I65446980"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"None Jzau-Sheng Lin","raw_affiliation_strings":["Dept. of Comput. Sci. & Inf. Eng., Nat. Chin-Yi Inst. of Technol., Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Eng., Nat. Chin-Yi Inst. of Technol., Taichung, Taiwan","institution_ids":["https://openalex.org/I65446980"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003695245","display_name":"Zi-Sheng Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I65446980","display_name":"National Chin-Yi University of Technology","ror":"https://ror.org/040bs6h16","country_code":"TW","type":"education","lineage":["https://openalex.org/I65446980"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"None Zi-Sheng Lin","raw_affiliation_strings":["Dept. of Comput. Sci. & Inf. Eng., Nat. Chin-Yi Inst. of Technol., Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Eng., Nat. Chin-Yi Inst. of Technol., Taichung, Taiwan","institution_ids":["https://openalex.org/I65446980"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.814,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":5,"citation_normalized_percentile":{"value":0.705394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":76,"max":77},"biblio":{"volume":null,"issue":null,"first_page":"245","last_page":"250"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9971,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9971,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9967,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9707,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fitness-proportionate-selection","display_name":"Fitness proportionate selection","score":0.68702805},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.63412166},{"id":"https://openalex.org/keywords/roulette","display_name":"Roulette","score":0.5865372},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.5597674},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.48519447}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8695657},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7499945},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6970028},{"id":"https://openalex.org/C99701942","wikidata":"https://www.wikidata.org/wiki/Q5455479","display_name":"Fitness proportionate selection","level":4,"score":0.68702805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6506687},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.63412166},{"id":"https://openalex.org/C195502155","wikidata":"https://www.wikidata.org/wiki/Q2810237","display_name":"Roulette","level":2,"score":0.5865372},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.573771},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.56045866},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.5597674},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5469596},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5396708},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.52964664},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.48519447},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.47685775},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45277765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43778288},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.42155647},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41541338},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2651947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19603756},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17999151},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.15104479},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13622695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12742972},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.122196585},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10797021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2005.19","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W1174849168","https://openalex.org/W1664011265","https://openalex.org/W1728701145","https://openalex.org/W1838996458","https://openalex.org/W2002163643","https://openalex.org/W2024060531","https://openalex.org/W2040677995","https://openalex.org/W2052015350","https://openalex.org/W2056760934","https://openalex.org/W2127630314","https://openalex.org/W2128110222","https://openalex.org/W2150594763","https://openalex.org/W2165562903","https://openalex.org/W2170450136","https://openalex.org/W2171776966","https://openalex.org/W2914275007","https://openalex.org/W4302422232"],"related_works":["https://openalex.org/W2388051136","https://openalex.org/W2370345607","https://openalex.org/W2366342492","https://openalex.org/W2357391150","https://openalex.org/W2354846196","https://openalex.org/W2353596372","https://openalex.org/W2161960576","https://openalex.org/W2156431668","https://openalex.org/W2030169809","https://openalex.org/W1990957023"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"a":[3,41,44,47,96],"shortest-path":[4,34],"network":[5],"problem":[6,35],"using":[7],"an":[8,15],"annealed":[9,66,128],"ant":[10,67,129,145],"system":[11],"algorithm,":[12],"in":[13,46,87,112],"which":[14,26],"annealing":[16],"strategy":[17,146],"is":[18],"embedded":[19],"to":[20,24,54],"calculate":[21],"the":[22,28,37,55,71,88,99,113,117,126,143],"probabilities":[23],"decide":[25],"path":[27],"ants":[29,83,93],"will":[30],"select":[31,95],"next.":[32],"The":[33,77,121],"determines":[36],"shortest":[38,59],"route":[39],"between":[40],"source":[42,89,114],"and":[43,74,106],"destination":[45,100],"transportation-network":[48],"topology.":[49],"In":[50],"this":[51],"approach,":[52],"according":[53],"concrete":[56],"problems":[57],"of":[58],"routing,":[60],"we":[61],"construct":[62],"two":[63],"globally":[64],"optimizing":[65],"algorithms":[68],"that":[69,125,140],"are":[70,84],"concentrated":[72,78,86],"model":[73,79,119],"distributed":[75,118],"model.":[76],"(CM)":[80],"means":[81],"all":[82,92],"initially":[85,105],"node":[90,97,115],"while":[91],"randomly":[94],"except":[98],"as":[101],"their":[102],"starting":[103],"point":[104],"at":[107],"least":[108],"one":[109],"must":[110],"appear":[111],"for":[116],"(DM).":[120],"experimental":[122],"results":[123],"show":[124],"proposed":[127],"algorithm":[130],"with":[131],"roulette":[132,148],"wheel":[133,149],"selection":[134],"can":[135],"obtain":[136],"better":[137],"performance":[138],"than":[139],"generated":[141],"by":[142],"traditional":[144],"with/without":[147],"selection.":[150]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2126736140","counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-14T02:49:11.518602","created_date":"2016-06-24"}