• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A populated iterated greedy algorithm with inver-over operator for traveling salesman problem

Thumbnail
Date
2013
Author
Tasgetiren, M.F.
Buyukdagli, O.
Kizilay, D.
Karabulut, K.
Metadata
Show full item record
Abstract
In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction and construction. The basic id
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893333397&doi=10.1007%2f978-3-319-03753-0_1&partnerID=40&md5=988706f69cf221dd5c9d4b83983cf176
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10471
Collections
  • Scopus İndeksli Yayınlar Koleksiyonu





Creative Commons License
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV
 

 




| Politika | Rehber | İletişim |

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy LanguageThis CollectionBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy Language

My Account

LoginRegister

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV