5 papers
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…
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…
Ants can orienteer a thief in their robbery
Jonatas B. C. Chagas, Markus Wagner
The Thief Orienteering Problem (ThOP) is a multi-component problem that combines features of two classic combinatorial optimization problems: Orienteering Problem and Knapsack Prob…
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…
The double traveling salesman problem with partial last-in-first-out loading constraints
Jonatas B. C. Chagas, Túlio A. M. Toffolo, Marcone J. F. Souza +1
In this paper, we introduce the Double Traveling Salesman Problem with Partial Last-In-First-Out Loading Constraints (DTSPPL). It is a pickup-and-delivery single-vehicle routing pr…