{"title":"改进的洗牌青蛙跳跃算法在物流配送车辆调度问题中的应用","authors":"Li Yan, Xiu-fen Kong, Rui-qing Hao","doi":"10.1109/BMEI.2011.6098776","DOIUrl":null,"url":null,"abstract":"To solve the Logistics Distribution Vehicle Routing Problem(VRP), the Modified Shuffled Frog leaping Algorithm(MSFLA) is advanced. The Greedy Method is applied to solve the VRP with step-by-step answers, which turns VRP into Traveling Salesman Problem(TSP)seeking for route K. Then SFLA was used to offer solution to TSP. But the traditional model of SFLA is not fit for discrete combinatorial optimization problems. So the traditional one is be improved, and the memetic algorithm is brought in. The computational results demonetrate that compared to ant colony optimization, local search algorithm, genetic algorithm and the hybrid genetic algorithm, SFLA is faster. It has a stronger ability to achieve the most optimistic result, and is easier to be implemented.","PeriodicalId":89462,"journal":{"name":"Proceedings of the ... International Conference on Biomedical Engineering and Informatics. International Conference on Biomedical Engineering and Informatics","volume":" 1","pages":"2277-2280"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/BMEI.2011.6098776","citationCount":"4","resultStr":"{\"title\":\"Modified shuffled frog leaping algorithm applying on logistics distribution vehicle rounting problem\",\"authors\":\"Li Yan, Xiu-fen Kong, Rui-qing Hao\",\"doi\":\"10.1109/BMEI.2011.6098776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve the Logistics Distribution Vehicle Routing Problem(VRP), the Modified Shuffled Frog leaping Algorithm(MSFLA) is advanced. The Greedy Method is applied to solve the VRP with step-by-step answers, which turns VRP into Traveling Salesman Problem(TSP)seeking for route K. Then SFLA was used to offer solution to TSP. But the traditional model of SFLA is not fit for discrete combinatorial optimization problems. So the traditional one is be improved, and the memetic algorithm is brought in. The computational results demonetrate that compared to ant colony optimization, local search algorithm, genetic algorithm and the hybrid genetic algorithm, SFLA is faster. It has a stronger ability to achieve the most optimistic result, and is easier to be implemented.\",\"PeriodicalId\":89462,\"journal\":{\"name\":\"Proceedings of the ... International Conference on Biomedical Engineering and Informatics. International Conference on Biomedical Engineering and Informatics\",\"volume\":\" 1\",\"pages\":\"2277-2280\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1109/BMEI.2011.6098776\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... International Conference on Biomedical Engineering and Informatics. International Conference on Biomedical Engineering and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BMEI.2011.6098776\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... International Conference on Biomedical Engineering and Informatics. International Conference on Biomedical Engineering and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BMEI.2011.6098776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Modified shuffled frog leaping algorithm applying on logistics distribution vehicle rounting problem
To solve the Logistics Distribution Vehicle Routing Problem(VRP), the Modified Shuffled Frog leaping Algorithm(MSFLA) is advanced. The Greedy Method is applied to solve the VRP with step-by-step answers, which turns VRP into Traveling Salesman Problem(TSP)seeking for route K. Then SFLA was used to offer solution to TSP. But the traditional model of SFLA is not fit for discrete combinatorial optimization problems. So the traditional one is be improved, and the memetic algorithm is brought in. The computational results demonetrate that compared to ant colony optimization, local search algorithm, genetic algorithm and the hybrid genetic algorithm, SFLA is faster. It has a stronger ability to achieve the most optimistic result, and is easier to be implemented.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
