Ants can orienteer a thief in their robbery
JBC Chagas, M Wagner - Operations Research Letters, 2020 - Elsevier
Abstract The Thief Orienteering Problem (ThOP) is a multi-component problem that
combines features of two classic combinatorial optimization problems: Orienteering Problem …
combines features of two classic combinatorial optimization problems: Orienteering Problem …
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach
JBC Chagas, M Wagner - Optimization Letters, 2022 - Springer
We tackle the thief orienteering problem (ThOP), an academic multi-component problem that
combines two classical combinatorial problems, namely the Knapsack Problem and the …
combines two classical combinatorial problems, namely the Knapsack Problem and the …
The thief orienteering problem: Formulation and heuristic approaches
AG Santos, JBC Chagas - 2018 IEEE Congress on …, 2018 - ieeexplore.ieee.org
This paper introduces the Thief Orienteering Problem (ThOP), a multi-component problem
that combines two classic combinatorial problems: Orienteering Problem (OP) and …
that combines two classic combinatorial problems: Orienteering Problem (OP) and …
A genetic algorithm for the thief orienteering problem
LM Faêda, AG Santos - 2020 IEEE Congress on Evolutionary …, 2020 - ieeexplore.ieee.org
This paper approaches the Thief orienteering Problem, a multi-component problem that
combines two combinatorial problems: orienteering Problem (OP) and Knapsack Problem …
combines two combinatorial problems: orienteering Problem (OP) and Knapsack Problem …
A new hybrid ant colony algorithms for the traveling thief problem
The Traveling Thief Problem (TTP) is a new problem recently proposed in the literature. The
TTP combines two well-known optimization problems: the knapsack problem (KP) and the …
TTP combines two well-known optimization problems: the knapsack problem (KP) and the …
Ants can solve the team orienteering problem
L Ke, C Archetti, Z Feng - Computers & Industrial Engineering, 2008 - Elsevier
The team orienteering problem (TOP) involves finding a set of paths from the starting point to
the ending point such that the total collected reward received from visiting a subset of …
the ending point such that the total collected reward received from visiting a subset of …
Stealing items more efficiently with ants: a swarm intelligence approach to the travelling thief problem
M Wagner - … Intelligence: 10th International Conference, ANTS 2016 …, 2016 - Springer
The travelling thief problem (TTP) is an academic combinatorial optimisation problem in
which its two components, namely the travelling salesperson problem (TSP) and the …
which its two components, namely the travelling salesperson problem (TSP) and the …
Solving travelling thief problems using coordination based methods
A travelling thief problem (TTP) is a proxy to real-life problems such as postal collection. TTP
comprises an entanglement of a travelling salesman problem (TSP) and a knapsack …
comprises an entanglement of a travelling salesman problem (TSP) and a knapsack …
An ant colony approach to the orienteering problem
This paper develops an ant colony optimization approach to the orienteering problem, a
general version of the well-known traveling salesman problem with many relevant …
general version of the well-known traveling salesman problem with many relevant …
A cooperative coordination solver for travelling thief problems
M Namazi, C Sanderson, MA Newton… - arXiv preprint arXiv …, 2019 - arxiv.org
The travelling thief problem (TTP) is a representative of multi-component optimisation
problems with interacting components. TTP combines the knapsack problem (KP) and the …
problems with interacting components. TTP combines the knapsack problem (KP) and the …