Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
EN  |  EL

Αναζήτηση

Πλοήγηση

Ο Χώρος μου

A hybrid particle swarm optimization algorithm for the vehicle routing problem

Marinakis Ioannis, Marinaki Magdalini, Dounias, G

Πλήρης Εγγραφή


URI: http://purl.tuc.gr/dl/dias/228C5CF8-99CB-4750-8FCA-6D2254C2CF2B
Έτος 2010
Τύπος Δημοσίευση σε Περιοδικό με Κριτές
Άδεια Χρήσης
Λεπτομέρειες
Βιβλιογραφική Αναφορά Y. Marinakis, M. Marinaki , G. Dounias,"A Hybrid particle swarm optimization algorithm for the vehicle routing problem," Engin. Applications of Artifi.Intellig.,vol. 23,no.4, pp. 463-472.Jun. 2010,doi:10.1016/j.engappai.2010.02.002 https://doi.org/10.1016/j.engappai.2010.02.002
Εμφανίζεται στις Συλλογές

Περίληψη

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 vehicle routing problem. The vehicle routing problem is considered one of the most well studied problems in operations research. The proposed algorithm for the solution of the vehicle routing problem, the hybrid particle swarm optimization (HybPSO), combines a particle swarm optimization (PSO) algorithm, the multiple phase neighborhood search–greedy randomized adaptive search procedure (MPNS–GRASP) algorithm, the expanding neighborhood search (ENS) strategy and a path relinking (PR) strategy. The algorithm is suitable for solving very large-scale vehicle routing problems as well as other, more difficult combinatorial optimization problems, within short computational time. It is tested on a set of benchmark instances and produced very satisfactory results. The algorithm is ranked in the fifth place among the 39 most known and effective algorithms in the literature and in the first place among all nature inspired methods that have ever been used for this set of instances.

Υπηρεσίες

Στατιστικά