The simulation-driven metaheuristic algorithms have been successful in solving numerous
problems compared to their deterministic counterparts. Despite this advantage, the …

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

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 …

This study proposes an end-to-end multiobjective reinforcement learning (MORL) approach
to solve the biobjective traveling thief problems (TTP). A TTP involves a thief visiting cities …

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

Abstract The Thief Orienteering Problem (ThOP) is a multi-component problem that
combines features of two classic combinatorial optimization problems: Orienteering Problem …

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 …

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 …

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 …

This paper approaches the Thief orienteering Problem, a multi-component problem that
combines two combinatorial problems: orienteering Problem (OP) and Knapsack Problem …