The paper formalizes the Double Traveling Salesman Problem with Partial Last-In-First-Out Loading, proposes two ILP models and a biased random-key genetic algorithm, and evaluates them on 1,080 instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The double traveling salesman problem with partial last-in-first-out loading constraints
The paper formalizes the Double Traveling Salesman Problem with Partial Last-In-First-Out Loading, proposes two ILP models and a biased random-key genetic algorithm, and evaluates them on 1,080 instances.