Exact Approaches for the Travelling Thief Problem

08/01/2017
by   Junhua Wu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2014

Evolutionary Optimization for Decision Making under Uncertainty

Optimizing decision problems under uncertainty can be done using a varie...
research
01/23/2018

Heuristic algorithms for the Maximum Colorful Subtree problem

In metabolomics, small molecules are structurally elucidated using tande...
research
04/22/2017

A hybrid primal heuristic for Robust Multiperiod Network Design

We investigate the Robust Multiperiod Network Design Problem, a generali...
research
03/29/2019

How to Estimate the Ability of a Metaheuristic Algorithm to Guide Heuristics During Optimization

Metaheuristics are general methods that guide application of concrete he...
research
07/11/2018

On error representation in exact-decisions number types

Accuracy-driven computation is a strategy widely used in exact-decisions...
research
07/10/2020

Solving the Clustered Traveling Salesman Problem via TSP methods

The Clustered Traveling Salesman Problem (CTSP) is a variant of the popu...

Please sign up or login with your details

Forgot password? Click here to reset