A Sequence-Based Hyper-Heuristic for Traveling Thieves

A Sequence-Based Hyper-Heuristic for Traveling Thieves

A plethora of combinatorial optimization problems can be linked to real-life decision scenarios. Even nowadays, more diverse and complex problems are popping up. One of these problems is the traveling thief problem (TTP), which combines elements from the knapsack and traveling salesperson problems....

Full description

Bibliographic Details
Main Authors: Daniel Rodríguez, Jorge M. Cruz-Duarte, José Carlos Ortiz-Bayliss, Ivan Amaya
Format: Article
Language:English
Published: MDPI AG 2022-12-01
Series:Applied Sciences
Subjects:
hyper-heuristic
traveling thief problem
combinatorial optimization
Online Access:https://www.mdpi.com/2076-3417/13/1/56

Similar Items

Similar Items