A discrete artificial bee colony algorithm for the traveling salesman problem with time windows

dc.contributor.author	Karabulut, K.
dc.contributor.author	Tasgetiren, M.F.
dc.date.accessioned	2021-01-25T20:50:56Z
dc.date.available	2021-01-25T20:50:56Z
dc.date.issued	2012
dc.identifier	10.1109/CEC.2012.6252941
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866874921&doi=10.1109%2fCEC.2012.6252941&partnerID=40&md5=991da5eb3c5d61e667a0b852958fbe1b
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10555
dc.description.abstract	This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a given tour. TSPTW is a difficult optimization problem arising in bot
dc.language.iso	English
dc.publisher	2012 IEEE Congress on Evolutionary Computation, CEC 2012
dc.title	A discrete artificial bee colony algorithm for the traveling salesman problem with time windows
dc.type	Conference Paper
dc.description.affiliations	Software Engineering Department, Yasar University, Selcuk Yasar Campus, Izmir, Turkey; Industrial Engineering Department, Yasar University, Selcuk Yasar Campus, Izmir, Turkey

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.