Showing cs.AIShow all
2 papers · 1 filter
cs.AI2020
Ants can orienteer a thief in their robbery
Jonatas B. C. Chagas, Markus Wagner
The Thief Orienteering Problem (ThOP) is a multi-component problem that combines features of two classic combinatorial optimization problems: Orienteering Problem and Knapsack Prob…
cs.AI2019
The double traveling salesman problem with partial last-in-first-out loading constraints
Jonatas B. C. Chagas, Túlio A. M. Toffolo, Marcone J. F. Souza +1
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 pr…