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

20Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Marinakis, Y., & Marinaki, M. (2012). A hybrid particle swarm optimization algorithm for the open vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7461 LNCS, pp. 180–187). https://doi.org/10.1007/978-3-642-32650-9_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free