Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/235
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baş, Emine | - |
dc.contributor.author | Ülker, Erkan | - |
dc.date.accessioned | 2021-12-13T10:23:54Z | - |
dc.date.available | 2021-12-13T10:23:54Z | - |
dc.date.issued | 2021 | - |
dc.identifier.issn | 0269-2821 | - |
dc.identifier.issn | 1573-7462 | - |
dc.identifier.uri | https://doi.org/10.1007/s10462-020-09869-8 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/235 | - |
dc.description.abstract | Heuristic algorithms are often used to find solutions to real complex world problems. These algorithms can provide solutions close to the global optimum at an acceptable time for optimization problems. Social Spider Algorithm (SSA) is one of the newly proposed heuristic algorithms and based on the behavior of the spider. Firstly it has been proposed to solve the continuous optimization problems. In this paper, SSA is rearranged to solve discrete optimization problems. Discrete Social Spider Algorithm (DSSA) is developed by adding explorer spiders and novice spiders in discrete search space. Thus, DSSA's exploration and exploitation capabilities are increased. The performance of the proposed DSSA is investigated on traveling salesman benchmark problems. The Traveling Salesman Problem (TSP) is one of the standard test problems used in the performance analysis of discrete optimization algorithms. DSSA has been tested on a low, middle, and large-scale thirty-eight TSP benchmark datasets. Also, DSSA is compared to eighteen well-known algorithms in the literature. Experimental results show that the performance of proposed DSSA is especially good for low and middle-scale TSP datasets. DSSA can be used as an alternative discrete algorithm for discrete optimization tasks. | en_US |
dc.language.iso | en | en_US |
dc.publisher | SPRINGER | en_US |
dc.relation.ispartof | ARTIFICIAL INTELLIGENCE REVIEW | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Discrete Problems | en_US |
dc.subject | Optimization | en_US |
dc.subject | Social Spider | en_US |
dc.subject | Traveling Salesman Problem | en_US |
dc.subject | Swarm Optimization Algorithm | en_US |
dc.subject | Search Algorithm | en_US |
dc.subject | Selection | en_US |
dc.subject | Behavior | en_US |
dc.subject | Solve | en_US |
dc.title | Discrete social spider algorithm for the traveling salesman problem | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1007/s10462-020-09869-8 | - |
dc.identifier.scopus | 2-s2.0-85087422655 | en_US |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.authorid | Ulker, Erkan/0000-0003-4393-9870 | - |
dc.authorwosid | Ulker, Erkan/ABA-5846-2020 | - |
dc.identifier.volume | 54 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.startpage | 1063 | en_US |
dc.identifier.endpage | 1085 | en_US |
dc.identifier.wos | WOS:000545561900001 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 57213265310 | - |
dc.authorscopusid | 23393979800 | - |
dc.identifier.scopusquality | Q1 | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | embargo_20300101 | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.dept | 02.13. Department of Software Engineering | - |
crisitem.author.dept | 02.03. Department of Computer Engineering | - |
Appears in Collections: | Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
Files in This Item:
File | Size | Format | |
---|---|---|---|
s10462-020-09869-8.pdf Until 2030-01-01 | 1.53 MB | Adobe PDF | View/Open Request a copy |
CORE Recommender
SCOPUSTM
Citations
6
checked on Oct 12, 2024
WEB OF SCIENCETM
Citations
12
checked on Oct 12, 2024
Page view(s)
336
checked on Oct 14, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.