dc.contributor.author | Karabulut, K. | |
dc.contributor.author | Tasgetiren, M.F. | |
dc.date.accessioned | 2021-01-25T19:32:42Z | |
dc.date.available | 2021-01-25T19:32:42Z | |
dc.date.issued | 2020 | |
dc.identifier | 10.1016/j.cie.2019.106109 | |
dc.identifier.issn | 0360-8352 | |
dc.identifier.uri | https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/7351 | |
dc.description.abstract | The team orienteering problem with time windows (TOPTW) is a highly constrained NP-hard problem having many practical applications in vehicle routing and production scheduling. The TOPTW is an extended variant of the Orienteering Problem (OP), where each | |
dc.description.sponsorship | National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [51435009] | |
dc.language.iso | English | |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | |
dc.title | An evolution strategy approach to the team orienteering problem with time windows | |
dc.type | Article | |
dc.relation.volume | 139 | |
dc.description.woscategory | Computer Science, Interdisciplinary Applications; Engineering, Industrial | |
dc.description.wosresearcharea | Computer Science; Engineering | |
dc.identifier.wosid | WOS:000509784000005 | |