URI | http://purl.tuc.gr/dl/dias/03A9F388-85C4-4D37-86D6-12B931FFAEFE | - |
Αναγνωριστικό | https://doi.org/10.1007/978-3-642-32650-9_16 | - |
Γλώσσα | en | - |
Τίτλος | A hybrid particle swarm optimization algorithm for the open vehicle routing problem | en |
Δημιουργός | Marinakis Ioannis | en |
Δημιουργός | Μαρινακης Ιωαννης | el |
Δημιουργός | Marinaki Magdalini | en |
Δημιουργός | Μαρινακη Μαγδαληνη | el |
Εκδότης | Springer Verlag | en |
Περίληψη | This paper introduces a new hybrid algorithmic nature inspired approach based on Particle Swarm Optimization, for successfully solving one of the most popular supply chain management problems, the Open Vehicle Routing Problem. The Open Vehicle Routing Problem (OVRP) is a variant of the classic vehicle routing problem in which the vehicles do not return in the depot after the service of the customers. The proposed algorithm for the solution of the Open Vehicle Routing Problem, the Hybrid Particle Swarm Optimization (HybPSO), combines a Particle Swarm Optimization (PSO) Algorithm, the Variable Neighborhood Search (VNS) Strategy and a Path Relinking (PR) Strategy. The algorithm is suitable for solving large-scale open vehicle routing problems within short computational time. Two sets of benchmark instances are used in order to test the proposed algorithm. | en |
Τύπος | Περίληψη Δημοσίευσης σε Συνέδριο | el |
Τύπος | Conference Paper Abstract | en |
Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
Ημερομηνία | 2015-10-28 | - |
Ημερομηνία Δημοσίευσης | 2012 | - |
Βιβλιογραφική Αναφορά | Y. Marinakis and M. Marinaki, “A Hybrid Particle Swarm Optimization Algorithm for the Open Vehicle Routing Problem”, in 8th International Conference on Swarm Intelligence, 2012, pp. 180-187. DOI: 10.1007/978-3-642-32650-9_16 | en |