Please use this identifier to cite or link to this item:
http://dspace.lib.uom.gr/handle/2159/24610
Author: | Φώτογλου, Ιωακείμ |
Title: | A reduced variable neighborhood search approach for the traveling thief problem |
Date Issued: | 2019 |
Department: | Πρόγραμμα Μεταπτυχιακών Σπουδών Ειδίκευσης στην Εφαρμοσμένη Πληροφορική |
Supervisor: | Σιφαλέρας, Άγγελος |
Abstract: | While single objective optimization problems have been extensively studied in literature, their narrow scope and very specific field of focus remain a major limiting factor in pragmatic and practical applications. Problems encountered in real-world scenarios are usually a mixture of interdependent and co-relational factors that have dynamic implications in the solution process. In this thesis we examine one such complex problem, the Travelling Thief Problem, derived from the interweaving of two component subproblems; namely the TSP and Knapsack problems, into a coherent interdependent combinatorial optimization problem through the use of the RVNS and VNS metaheuristic methods. |
Keywords: | Reduced Variable Neighborhood Search Variable Neighborhood Search GRASP Traveling Thief Problem Travelling Salesman Problem Knapsack Problem Metaheuristic Method |
Information: | Διπλωματική εργασία--Πανεπιστήμιο Μακεδονίας, Θεσσαλονίκη, 2019. |
Appears in Collections: | Π.Μ.Σ. στην Εφαρμοσμένη Πληροφορική (M) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FotoglouIoakeimMsc2019.pdf | 2.71 MB | Adobe PDF | View/Open |
Items in Psepheda are protected by copyright, with all rights reserved, unless otherwise indicated.