Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

A hybrid particle swarm optimization algorithm for the open vehicle routing problem

Marinakis Ioannis, Marinaki Magdalini

Full record


URI: http://purl.tuc.gr/dl/dias/03A9F388-85C4-4D37-86D6-12B931FFAEFE
Year 2012
Type of Item Conference Paper Abstract
License
Details
Bibliographic Citation 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 https://doi.org/10.1007/978-3-642-32650-9_16
Appears in Collections

Summary

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.

Services

Statistics