Showing cs.NEShow all
3 papers · 1 filter
cs.NE2021
Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
Jonatas B. C. Chagas, Markus Wagner
We tackle the Thief Orienteering Problem (ThOP), an academic multi-component problem that combines two classical combinatorial problems, namely the Knapsack Problem and the Oriente…
cs.NE2020
A weighted-sum method for solving the bi-objective traveling thief problem
Jonatas B. C. Chagas, Markus Wagner
Many real-world optimization problems have multiple interacting components. Each of these can be NP-hard and they can be in conflict with each other, i.e., the optimal solution for…
cs.NE2020
A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem
Jonatas B. C. Chagas, Julian Blank, Markus Wagner +2
In this paper, we propose a method to solve a bi-objective variant of the well-studied Traveling Thief Problem (TTP). The TTP is a multi-component problem that combines two classic…