A discrete artificial bee colony algorithm for the team orienteering problem with time windows
| dc.contributor.author | Korhan Karabulut | |
| dc.contributor.author | M. Fatih Tasgetiren | |
| dc.date.accessioned | 2025-10-06T17:52:45Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | This paper presents a discrete artificial bee colony algorithm (DABC) for solving the team orienteering problem with time windows (TOPTW). The proposed algorithm employs a destruction and construction procedure to generate neighboring food sources in the framework of the DABC algorithm. In addition a variable neighborhood descent (VND) algorithm is developed to enhance the solution quality. The performance of the algorithm was tested on a benchmark set from the literature. Experimental results show that the proposed DABC algorithm is competitive to the best performing algorithms from the literature. Ultimately 11 instances are further improved by the proposed DABC algorithm. © 2013 IEEE. © 2013 Elsevier B.V. All rights reserved. | |
| dc.description.sponsorship | IEEE Computational Intelligence Society | |
| dc.identifier.doi | 10.1109/CIPLS.2013.6595206 | |
| dc.identifier.isbn | 9781467359054 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84885008529&doi=10.1109%2FCIPLS.2013.6595206&partnerID=40&md5=402d48554b4598c6b17b4a765c55480b | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/10075 | |
| dc.language.iso | English | |
| dc.relation.ispartof | 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems CIPLS 2013 - 2013 IEEE Symposium Series on Computational Intelligence SSCI 2013 | |
| dc.subject | Artificial Bee Colony Algorithm, Heuristic Optimization, Iterated Greedy Algorithm, Swarm Intelligence, Team Orienteering Problem With Time Windows, Artificial Bee Colony Algorithms, Heuristic Optimization, Iterated Greedy Algorithm, Swarm Intelligence, Time Windows, Artificial Intelligence, Benchmarking, Algorithms | |
| dc.subject | Artificial bee colony algorithms, Heuristic optimization, Iterated greedy algorithm, Swarm Intelligence, Time windows, Artificial intelligence, Benchmarking, Algorithms | |
| dc.title | A discrete artificial bee colony algorithm for the team orienteering problem with time windows | |
| dc.type | Conference Object | |
| dspace.entity.type | Publication | |
| gdc.bip.impulseclass | C4 | |
| gdc.bip.influenceclass | C4 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.endpage | 106 | |
| gdc.description.startpage | 99 | |
| gdc.identifier.openalex | W2162935798 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 4.0 | |
| gdc.oaire.influence | 3.0960343E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.popularity | 2.1023077E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 2.8855 | |
| gdc.openalex.normalizedpercentile | 0.92 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 6 | |
| gdc.plumx.crossrefcites | 5 | |
| gdc.plumx.mendeley | 13 | |
| gdc.plumx.scopuscites | 11 | |
| oaire.citation.endPage | 106 | |
| oaire.citation.startPage | 99 | |
| person.identifier.scopus-author-id | Karabulut- Korhan (17346083500), Tasgetiren- M. Fatih (6505799356) | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |