The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem
dc.contributor.author | Kiran, Mustafa Servet | |
dc.contributor.author | Iscan, Hazim | |
dc.contributor.author | Gunduz, Mesut | |
dc.date.accessioned | 2020-03-26T18:43:47Z | |
dc.date.available | 2020-03-26T18:43:47Z | |
dc.date.issued | 2013 | |
dc.department | Selçuk Üniversitesi | en_US |
dc.description.abstract | The artificial bee colony (ABC) algorithm, inspired intelligent behaviors of real honey bee colonies, was introduced by Karaboga for numerical function optimization. The basic ABC has high performance and accuracy, if the solution space of the problem is continuous. But when the solution space of the problem is discrete, the basic ABC algorithm should be modified to solve this class optimization problem. In this study, we focused on analysis of discrete ABC with neighborhood operator for well-known traveling salesman problem and different discrete neighborhood operators are replaced with solution updating equations of the basic ABC. Experimental computations show that the promising results are obtained by the discrete version of the basic ABC and which neighborhood operator is better than the others. Also, the results obtained by discrete ABC were enriched with 2- and 3-opt heuristic approaches in order to increase quality of the solutions. | en_US |
dc.identifier.doi | 10.1007/s00521-011-0794-0 | en_US |
dc.identifier.endpage | 21 | en_US |
dc.identifier.issn | 0941-0643 | en_US |
dc.identifier.issn | 1433-3058 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.scopusquality | Q1 | en_US |
dc.identifier.startpage | 9 | en_US |
dc.identifier.uri | https://dx.doi.org/10.1007/s00521-011-0794-0 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/29890 | |
dc.identifier.volume | 23 | en_US |
dc.identifier.wos | WOS:000320865100002 | en_US |
dc.identifier.wosquality | Q2 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | SPRINGER LONDON LTD | en_US |
dc.relation.ispartof | NEURAL COMPUTING & APPLICATIONS | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Artificial bee colony | en_US |
dc.subject | Discrete optimization | en_US |
dc.subject | Neighborhood operators | en_US |
dc.subject | Traveling salesman problem | en_US |
dc.title | The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem | en_US |
dc.type | Article | en_US |