Search Results for author:
Found 5 papers, 3 papers with code
Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
In the ThOP, a thief has a time limit to steal items that distributed in a given set of cities.
A weighted-sum method for solving the bi-objective traveling thief problem
Many real-world optimization problems have multiple interacting components.
Ants can orienteer a thief in their robbery
The Thief Orienteering Problem (ThOP) is a multi-component problem that combines features of two classic combinatorial optimization problems: Orienteering Problem and Knapsack Problem.
A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem
In this paper, we propose a method to solve a bi-objective variant of the well-studied Traveling Thief Problem (TTP).
The double traveling salesman problem with partial last-in-first-out loading constraints
After performing all pickup operations, the vehicle begins delivering the items in the delivery area.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
