π
π
The Cartographer
Exact Approaches for the Travelling Thief Problem
August 01, 2017 Β· Declared Dead Β· π Asia-Pacific Conference on Simulated Evolution and Learning
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann
arXiv ID
1708.00331
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.NE
Citations
38
Venue
Asia-Pacific Conference on Simulated Evolution and Learning
Last Checked
3 months ago
Abstract
Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Traveling 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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted