Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://ruomo.lib.uom.gr/handle/7000/589
Πλήρης εγγραφή μεταδεδομένων
Πεδίο DC | Τιμή | Γλώσσα |
---|---|---|
dc.contributor.author | Kalatzantonakis, Panagiotis | - |
dc.contributor.author | Sifaleras, Angelo | - |
dc.contributor.author | Samaras, Nikolaos | - |
dc.contributor.editor | Matsatsinis, Nikolaos F. | - |
dc.contributor.editor | Marinakis, Yannis | - |
dc.contributor.editor | Pardalos, Panos M. | - |
dc.date.accessioned | 2020-01-22T11:10:15Z | - |
dc.date.available | 2020-01-22T11:10:15Z | - |
dc.date.issued | 2020 | - |
dc.identifier | 10.1007/978-3-030-38629-0_19 | en_US |
dc.identifier.isbn | 978-3-030-38628-3 | en_US |
dc.identifier.isbn | 978-3-030-38629-0 | en_US |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.issn | 1611-3349 | en_US |
dc.identifier.uri | https://doi.org/10.1007/978-3-030-38629-0_19 | en_US |
dc.identifier.uri | https://ruomo.lib.uom.gr/handle/7000/589 | - |
dc.description.abstract | It is generally accepted that cooperation-based strategies in parallel metaheuristics exhibit better performances in contrast with non-cooperative approaches. In this paper, we study how the cooperation between processes affects the performance and solution quality of parallel algorithms. The purpose of this study is to provide researchers with a practical starting point for designing better cooperation strategies in parallel metaheuristics. To achieve that, we propose two parallel models based on the general variable neighborhood search (GVNS) to solve the capacitated vehicle routing problem (CVRP). Both models scan the search space by using multiple search processes in parallel. The first model lacks communication, while on the other hand, the second model follows a strategy based on information exchange. The received solutions are utilized to guide the search. We conduct an experimental study using well-known benchmark instances of the CVRP, in which the usefulness of communication throughout the search process is assessed. The findings confirm that careful design of the cooperation strategy in parallel metaheuristics can yield better results. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartofseries | Lecture Notes in Computer Science | en_US |
dc.subject | FRASCATI::Natural sciences::Mathematics::Applied Mathematics | en_US |
dc.subject | FRASCATI::Natural sciences::Computer and information sciences | en_US |
dc.subject.other | Parallel metaheuristics | en_US |
dc.subject.other | Variable neighborhood search | en_US |
dc.subject.other | Cooperation strategies | en_US |
dc.subject.other | Vehicle routing problem | en_US |
dc.subject.other | Intelligent optimization methods | en_US |
dc.title | On a Cooperative VNS Parallelization Strategy for the Capacitated Vehicle Routing Problem | en_US |
dc.type | Conference paper | en_US |
dc.contributor.department | Τμήμα Εφαρμοσμένης Πληροφορικής | en_US |
local.identifier.volume | 11968 | en_US |
local.identifier.firstpage | 231 | en_US |
local.identifier.lastpage | 239 | en_US |
local.identifier.volumetitle | Learning and Intelligent Optimization. LION 2019 | en_US |
Εμφανίζεται στις Συλλογές: | Τμήμα Εφαρμοσμένης Πληροφορικής |
Αρχεία σε αυτό το Τεκμήριο:
Αρχείο | Περιγραφή | Μέγεθος | Μορφότυπος | |
---|---|---|---|---|
On_a_Cooperative_VNS_Parallelization_Strategy_for_the_CVRP.pdf | 157,06 kB | Adobe PDF | Προβολή/Ανοιγμα |
Τα τεκμήρια στο Αποθετήριο προστατεύονται από πνευματικά δικαιώματα, εκτός αν αναφέρεται κάτι διαφορετικό.