Ants can orienteer a thief in their robbery

04/15/2020
by   Jonatas B. C. Chagas, et al.
1

We address the Thief Orienteering Problem (ThOP), a multi-component problem that combines features of two classic combinatorial optimization problems, namely the Orienteering Problem and Knapsack Problem. Due to the given time constraint and the interaction of the load-dependent movement speed with the chosen route, the ThOP is complex and challenging. We propose a two-phase, swarm-intelligence based approach together with a new randomized packing heuristic. To identify the impact of the respective components, we use automated algorithm configuration. The resulting configurations outperform existing work on more than 90 improvement of over 300

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2020

Boosting Ant Colony Optimization via Solution Prediction and Machine Learning

This paper introduces an enhanced meta-heuristic (ML-ACO) that combines ...
research
12/20/2015

Towards Integrated Glance To Restructuring in Combinatorial Optimization

The paper focuses on a new class of combinatorial problems which consist...
research
11/26/2022

Learning Branching Heuristics from Graph Neural Networks

Backtracking has been widely used for solving problems in artificial int...
research
12/11/2012

Study: Symmetry breaking for ASP

In their nature configuration problems are combinatorial (optimization) ...
research
06/03/2013

Evolutionary Approach for the Containers Bin-Packing Problem

This paper deals with the resolution of combinatorial optimization probl...
research
02/25/2022

A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry

The bin packing problem exists widely in real logistic scenarios (e.g., ...

Please sign up or login with your details

Forgot password? Click here to reset