The first proposed deterministic algorithm picks items on tours calculated by a Traveling Salesman Problem Solver greedily. We propose different kind of algorithms to solve the Bi-Objective Traveling Thief Problem.

The objective space of the Bi-Objective Traveling Thief Problem has through the interaction of two discrete subproblems some interesting properties which are investigated. The interdependence of these two components builds an interwoven system where solving one subproblem separately does not solve the overall problem. This publication investigates characteristics of and algorithms for the quite new and complex Bi-Objective Traveling Thief Problem, where the well-known Traveling Salesman Problem and Binary Knapsack Problem interact.