Please use this identifier to cite or link to this item:
http://dspace.lib.uom.gr/handle/2159/24601
Author: | Καλατζαντωνάκης, Παναγιώτης |
Title: | Cooperative vs non-cooperative parallelization strategies for variable neighborhood search metaheuristic: a case study on the capacitated vehicle routing problem |
Date Issued: | 2019 |
Department: | Πρόγραμμα Μεταπτυχιακών Σπουδών Ειδίκευσης στην Εφαρμοσμένη Πληροφορική |
Supervisor: | Σιφαλέρας, Αγγελος |
Abstract: | The Capacitated Vehicle Routing Problem (CVRP) is a well-known NP-hard combinatorial optimization problem with numerous real-world applications in logistics. In this work, we present a literature review with recent successful parallel implementations of Variable Neighborhood Search regarding different variants of vehicle routing problems. We conduct an experimental study for the CVRP using well-known benchmark instances and we present and investigate three parallelization strategies that coordinate the communication of the multiple processors. We experimentally evaluate a non-cooperative and two novel cooperation models, the managed cooperative and the parameterized cooperative strategies. Our results constitute a first proof-of-concept for the benefits of this new parameterized cooperative approach, especially in computationally hard instances. |
Keywords: | Combinatorial Optimization Parallel Metaheuristics Parallel VNS Metaheuristics Algorithm Design Parallel Computing General Variable Neighborhood Search Capacitated Vehicle Routing Problem CVRP |
Information: | Διπλωματική εργασία--Πανεπιστήμιο Μακεδονίας, Θεσσαλονίκη, 2019. |
Rights: | Attribution-NoDerivatives 4.0 Διεθνές |
Appears in Collections: | Π.Μ.Σ. στην Εφαρμοσμένη Πληροφορική (M) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
KalatzantonakisPanagiotisMsc2019.pdf | 4.17 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License