The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem

dc.contributor.authorKiran, Mustafa Servet
dc.contributor.authorIscan, Hazim
dc.contributor.authorGunduz, Mesut
dc.date.accessioned2020-03-26T18:43:47Z
dc.date.available2020-03-26T18:43:47Z
dc.date.issued2013
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe 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.doi10.1007/s00521-011-0794-0en_US
dc.identifier.endpage21en_US
dc.identifier.issn0941-0643en_US
dc.identifier.issn1433-3058en_US
dc.identifier.issue1en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage9en_US
dc.identifier.urihttps://dx.doi.org/10.1007/s00521-011-0794-0
dc.identifier.urihttps://hdl.handle.net/20.500.12395/29890
dc.identifier.volume23en_US
dc.identifier.wosWOS:000320865100002en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSPRINGER LONDON LTDen_US
dc.relation.ispartofNEURAL COMPUTING & APPLICATIONSen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectArtificial bee colonyen_US
dc.subjectDiscrete optimizationen_US
dc.subjectNeighborhood operatorsen_US
dc.subjectTraveling salesman problemen_US
dc.titleThe analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problemen_US
dc.typeArticleen_US

Dosyalar