Comparative Study by Using a Greedy Approach and Advanced Bio-Inspired Strategies in the Context of the Traveling Thief Problem - Artificial Intelligence Applications and Innovations Access content directly
Conference Papers Year : 2022

Comparative Study by Using a Greedy Approach and Advanced Bio-Inspired Strategies in the Context of the Traveling Thief Problem

Julia Garbaruk
  • Function : Author
  • PersonId : 1318751
Doina Logofătu
  • Function : Author
  • PersonId : 1033502
Florin Leon
  • Function : Author
  • PersonId : 1318752

Abstract

Traveling Salesman Problem and Knapsack Problem are perhaps the best-known combinatorial optimization problems that researchers have been racking their brains over for many decades. But they can also be combined into a single multi-component optimization problem, the Traveling Thief Problem, where the optimal solution for each single component does not necessarily correspond to an optimal Traveling Thief Problem solution. The aim of this work is to compare two generic algorithms for solving a Traveling Thief Problem independently of the test instance.
Embargoed file
Embargoed file
0 7 18
Year Month Jours
Avant la publication
Wednesday, January 1, 2025
Embargoed file
Wednesday, January 1, 2025
Please log in to request access to the document

Dates and versions

hal-04317196 , version 1 (01-12-2023)

Licence

Attribution

Identifiers

Cite

Julia Garbaruk, Doina Logofătu, Florin Leon. Comparative Study by Using a Greedy Approach and Advanced Bio-Inspired Strategies in the Context of the Traveling Thief Problem. 18th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Jun 2022, Hersonissos, Greece. pp.383-393, ⟨10.1007/978-3-031-08333-4_31⟩. ⟨hal-04317196⟩
18 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More