File(s) under permanent embargo
Exact approaches for the travelling thief problem
conference contribution
posted on 2017-01-01, 00:00 authored by J Wu, M Wagner, Sergey PolyakovskiySergey Polyakovskiy, F NeumannMany 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.
History
Event
Simulated Evolution and Learning. Conference (11th : 2017 : Shenzhen, China)Volume
10593Series
Simulated Evolution and Learning ConferencePagination
110 - 121Publisher
SpringerLocation
Shenzhen, ChinaPlace of publication
Cham, SwitzerlandPublisher DOI
Start date
2017-11-10End date
2017-11-13ISSN
0302-9743eISSN
1611-3349ISBN-13
9783319687582Language
engPublication classification
E Conference publication; E1.1 Full written paper - refereedCopyright notice
2017, Springer International Publishing AGEditor/Contributor(s)
Y Shi, K Tan, M Zhang, K Tang, X Li, Q Zhang, Y TanTitle of proceedings
SEAL 2017 : Proceedings of the 11th International Conference on Simulated Evolution and LearningUsage metrics
Categories
No categories selectedKeywords
Travelling Thief Problem (TTP)machine learningartificial intelligenceevolutionary computationgenetic algorithmsevolutionary algorithmsparticle swarm optimizationmultiobjective optimizationgenetic programmingpareto principlecomputing methodologiessearch technologiesmodeling and simulationalgorithm designalgorithm analysisevolutionary optimizationevolutionary learningcs.DScs.NE90C27F.2.2; G.2.1; G.4; G.1.6
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC