Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem

7 Feb 2018 • Junhua Wu • Sergey Polyakovskiy • Markus Wagner • Frank Neumann

This research proposes a novel indicator-based hybrid evolutionary approach that combines approximate and exact algorithms. We apply it to a new bi-criteria formulation of the travelling thief problem, which is known to the Evolutionary Computation community as a benchmark multi-component optimisation problem that interconnects two classical NP-hard problems: the travelling salesman problem and the 0-1 knapsack problem... (read more)

PDF Abstract

Code

Add Remove Mark official

No code implementations yet. Submit your code now

Tasks

Add Remove

Results from the Paper

Edit

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

METHOD	TYPE
🤖 No Methods Found	Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet

Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem

Code

Add Remove Mark official

Tasks

Add Remove

Datasets

Results from the Paper

Edit

Methods used in the Paper

Add Remove

Edit Social Preview

Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem Edit social preview

Code Edit Add Remove Mark official

Tasks Edit Add Remove

Datasets Edit

Results from the Paper Edit

Methods used in the Paper Edit Add Remove

Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem

Code

Add Remove Mark official

Tasks

Add Remove

Datasets

Results from the Paper

Edit

Methods used in the Paper

Add Remove