Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/138617
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Exact approaches for the travelling thief problem |
Author: | Wu, J. Wagner, M. Polyakovskiy, S. Neumann, F. |
Citation: | Lecture Notes in Artificial Intelligence, 2017 / Shi, Y., Tan, K.C., Zhang, M., Tang, K., Li, X., Zhang, Q., Tan, Y., Middendorf, M., Jin, Y. (ed./s), vol.10593, pp.110-121 |
Publisher: | Springer |
Publisher Place: | Cham, Switzerland |
Issue Date: | 2017 |
Series/Report no.: | Lecture Notes in Computer Science; 10593 |
ISBN: | 9783319687582 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | 11th International Conference on Simulated Evolution and Learning (SEAL) (10 Nov 2017 - 13 Nov 2017 : Shenzhen, China) |
Editor: | Shi, Y. Tan, K.C. Zhang, M. Tang, K. Li, X. Zhang, Q. Tan, Y. Middendorf, M. Jin, Y. |
Statement of Responsibility: | Junhua Wu, Markus Wagner, Sergey Polyakovskiy, and Frank Neumann |
Abstract: | Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Travelling Thief Problem (TTP). However, the accuracy of such approaches is unknown due to their inability to find global optima. In this paper, we propose three exact algorithms and a hybrid approach to the TTP. We compare these with state-of-the-art approaches to gather a comprehensive overview on the accuracy of heuristic methods for solving small TTP instances. |
Rights: | © Springer International Publishing AG 2017 |
DOI: | 10.1007/978-3-319-68759-9_10 |
Grant ID: | http://purl.org/au-research/grants/arc/DP130104395 http://purl.org/au-research/grants/arc/DE160100850 |
Published version: | https://link.springer.com/book/10.1007/978-3-319-68759-9 |
Appears in Collections: | Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.