{"id":"https://openalex.org/W4285816131","doi":"https://doi.org/10.1145/3544109.3544365","title":"Research on Logistics allocation path Optimization in E-business Based on Ant Colony Algorithm","display_name":"Research on Logistics allocation path Optimization in E-business Based on Ant Colony Algorithm","publication_year":2022,"publication_date":"2022-04-14","ids":{"openalex":"https://openalex.org/W4285816131","doi":"https://doi.org/10.1145/3544109.3544365"},"language":"en","primary_location":{"id":"doi:10.1145/3544109.3544365","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3544109.3544365","pdf_url":null,"source":{"id":"https://openalex.org/S4363608047","display_name":"2022 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers","raw_type":"proceedings-article"},"type":"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/A5100408729","display_name":"Hua Zhang","orcid":"https://orcid.org/0000-0003-0734-1329"},"institutions":[{"id":"https://openalex.org/I4210111616","display_name":"Wuhan Business University","ror":"https://ror.org/0282ggx30","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210111616"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hua Zhang","raw_affiliation_strings":["Wuhan Business and Trade Vocational College, China"],"affiliations":[{"raw_affiliation_string":"Wuhan Business and Trade Vocational College, China","institution_ids":["https://openalex.org/I4210111616"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100408729"],"corresponding_institution_ids":["https://openalex.org/I4210111616"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1584507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"842","last_page":"846"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14139","display_name":"E-commerce and Technology Innovations","score":0.9194999933242798,"subfield":{"id":"https://openalex.org/subfields/1403","display_name":"Business and International Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T14139","display_name":"E-commerce and Technology Innovations","score":0.9194999933242798,"subfield":{"id":"https://openalex.org/subfields/1403","display_name":"Business and International Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8426411151885986},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8063327074050903},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6858734488487244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6284969449043274},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5667197704315186},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5173632502555847},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5123473405838013},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4995851516723633},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.45987290143966675},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4242510199546814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39026930928230286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2537577152252197},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.153425395488739}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8426411151885986},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8063327074050903},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6858734488487244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6284969449043274},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5667197704315186},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5173632502555847},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5123473405838013},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4995851516723633},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45987290143966675},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4242510199546814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39026930928230286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2537577152252197},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.153425395488739},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3544109.3544365","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3544109.3544365","pdf_url":null,"source":{"id":"https://openalex.org/S4363608047","display_name":"2022 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers","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":0,"referenced_works":[],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2017411971","https://openalex.org/W2369428395","https://openalex.org/W2406404685","https://openalex.org/W2172069777","https://openalex.org/W2956620057","https://openalex.org/W1997193297"],"abstract_inverted_index":{"Logistics":[0],"distribution":[1,26],"is":[2,53,71,98,142,157,162],"one":[3],"of":[4,9,77,105,134,171],"the":[5,75,81,94,102,130,138,152,168],"most":[6],"critical":[7],"links":[8],"e-business,":[10],"but":[11],"its":[12,78,146],"path":[13,132,170],"optimization":[14,40,57,131],"has":[15],"been":[16,118],"proved":[17,158],"to":[18,55,73,101,144],"be":[19],"a":[20],"NP":[21],"hard":[22],"problem.":[23,124],"Traditional":[24],"logistics":[25,136,173],"decisions":[27],"mostly":[28],"adopt":[29],"centralized":[30],"decision-making":[31],"methods":[32],"or":[33],"some":[34,62],"simplified":[35],"algorithms,":[36],"such":[37],"as":[38],"discrete":[39],"algorithm":[41,115,141],"and":[42,51,88,149,164],"heuristic":[43],"algorithm.":[44],"They":[45],"can":[46],"only":[47,65],"solve":[48],"local":[49],"problems,":[50],"it":[52,156],"difficult":[54,72],"achieve":[56],"under":[58],"global":[59],"control.":[60],"Moreover,":[61],"algorithms":[63],"are":[64],"suitable":[66],"for":[67],"specific":[68],"occasions,":[69],"It":[70],"guarantee":[74],"validity":[76],"solution.":[79],"Using":[80],"well-known":[82],"relativity":[83],"between":[84],"traveling":[85,95,122],"salesman":[86,96,123],"problem":[87,97,133],"ant":[89,106,113,139],"colony":[90,114,140],"search":[91,107],"food":[92,108],"process,":[93],"solved":[99],"according":[100],"artificial":[103],"simulation":[104],"process.":[109],"At":[110],"present,":[111],"many":[112],"problems":[116],"have":[117],"successfully":[119],"used":[120],"in":[121,166],"In":[125],"this":[126,160],"paper,":[127],"aiming":[128],"at":[129],"e-business":[135,172],"distribution,":[137],"improved":[143],"improve":[145],"searching":[147],"ability":[148],"speed":[150],"up":[151],"convergence.":[153],"Through":[154],"simulation,":[155],"that":[159],"method":[161],"feasible":[163],"effective":[165],"solving":[167],"optimal":[169],"distribution.":[174]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}