{"title":"求解模糊概率条件下多级供应链定位路由问题的一种高效帝国主义竞争算法","authors":"A. Golmohammadi, Ashraf Norouzi","doi":"10.52547/jii.1.1.83","DOIUrl":null,"url":null,"abstract":"issues alone are a NP-hard problem, then location routing problem can be combined problem and It requires the use of meta-heuristic algorithms to solve.","PeriodicalId":446973,"journal":{"name":"Industrial Innovations: Requirements and Strategies","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Efficient Imperialist Competitive Algorithm for Solving Location Routing Problem in the Multi-Level Supply Chain Under Fuzzy and Probabilistic Condition\",\"authors\":\"A. Golmohammadi, Ashraf Norouzi\",\"doi\":\"10.52547/jii.1.1.83\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"issues alone are a NP-hard problem, then location routing problem can be combined problem and It requires the use of meta-heuristic algorithms to solve.\",\"PeriodicalId\":446973,\"journal\":{\"name\":\"Industrial Innovations: Requirements and Strategies\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Industrial Innovations: Requirements and Strategies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52547/jii.1.1.83\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Industrial Innovations: Requirements and Strategies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52547/jii.1.1.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Imperialist Competitive Algorithm for Solving Location Routing Problem in the Multi-Level Supply Chain Under Fuzzy and Probabilistic Condition
issues alone are a NP-hard problem, then location routing problem can be combined problem and It requires the use of meta-heuristic algorithms to solve.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
