Real-world problems often comprise multiple interdependent sub-problems. The
interdependency between sub-problems makes the original problem complex. The …

Unlike other NP-hard problems, the constraints on the traveling tournament problem are so
pressing that it's hardly possible to randomly generate a valid solution, for example, to use in …

We tackle the thief orienteering problem (ThOP), an academic multi-component problem that
combines two classical combinatorial problems, namely the Knapsack Problem and the …

In any metaheuristic, the parameter values strongly affect the efficiency of an algorithm's
search. This research aims to find the optimal parameter values for the Pareto Ant Colony …

We consider the scenario of routing an agent called a thief through a weighted graph G=(V,
E) from a start vertex s to an end vertex t. A set I of items each with weight wi and profit pi is …

We consider the scenario of routing an agent called a thief through a weighted graph G=(V,
E) from a start vertex s to an end vertex t. A set I of items each with weight wi and profit pi is …

Using genetic programming, we fail in evolving an algorithm that correctly multiplies two 5×
5 matrices. We do make progress on the issue however, identifying an experimental setting …

Thief Orienteering Problem (ThOP) is a multi-component problem with two interdependent
sub-problems Knapsack Problem and Orienteering Problem. ACO++, a state-of-the-art …

Stockpiles are essential in the mining value chain, assisting in maximising value and
production. Quality control of taken minerals from the stockpiles is a major concern for …

In the thief orienteering problem an agent called a thief carries a knapsack of capacity W and
has a time limit T to collect a set of items of total weight at most W and maximum profit along …