{"title":"旅行商问题的改进SPV人工蜂群算法","authors":"Ashay Shrivastava, Manish Gupta, Shashank Swami","doi":"10.1109/ICCUBEA.2015.176","DOIUrl":null,"url":null,"abstract":"Artificial Bee Colony (ABC) Algorithm is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself.. In this proposed work, enhanced ABC algorithm with SPV for travelling salesman problem is used. In this modified bee colony algorithm, additional phase in the form of mutation is used and SPV rule is used in this work for improving local search. After modification, proposed algorithm is implemented on standard travelling salesman problem for checking the efficiency of proposed work. The experimental results are compared with ABC algorithm and ABC with SPV algorithm.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"235 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Enhanced Artificial Bee Colony Algorithm with SPV for Travelling Salesman Problem\",\"authors\":\"Ashay Shrivastava, Manish Gupta, Shashank Swami\",\"doi\":\"10.1109/ICCUBEA.2015.176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Artificial Bee Colony (ABC) Algorithm is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself.. In this proposed work, enhanced ABC algorithm with SPV for travelling salesman problem is used. In this modified bee colony algorithm, additional phase in the form of mutation is used and SPV rule is used in this work for improving local search. After modification, proposed algorithm is implemented on standard travelling salesman problem for checking the efficiency of proposed work. The experimental results are compared with ABC algorithm and ABC with SPV algorithm.\",\"PeriodicalId\":325841,\"journal\":{\"name\":\"2015 International Conference on Computing Communication Control and Automation\",\"volume\":\"235 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Computing Communication Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCUBEA.2015.176\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computing Communication Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCUBEA.2015.176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhanced Artificial Bee Colony Algorithm with SPV for Travelling Salesman Problem
Artificial Bee Colony (ABC) Algorithm is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself.. In this proposed work, enhanced ABC algorithm with SPV for travelling salesman problem is used. In this modified bee colony algorithm, additional phase in the form of mutation is used and SPV rule is used in this work for improving local search. After modification, proposed algorithm is implemented on standard travelling salesman problem for checking the efficiency of proposed work. The experimental results are compared with ABC algorithm and ABC with SPV algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
