A novel list-constrained randomized VND approach in GPU for the traveling thief problem

DOI10.1016/j.endm.2018.03.024zbMath1408.90329OpenAlexW2797595597WikidataQ130037631 ScholiaQ130037631MaRDI QIDQ1791955

Eyder Rios, Rodolfo Pereira Araujo, Maria Clicia Castro, Leandro A. J. Marzulo, Igor M. Coelho

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.024

zbMATH Keywords

GRASPlocal searchvariable neighborhood descentgraphics processing unittraveling thief problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• Knapsack

Cites Work

• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: A novel list-constrained randomized VND approach in GPU for the traveling thief problem