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

Search

Browse

My Space

A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem

Marinakis Ioannis, Marinaki Magdalini

Simple record


URIhttp://purl.tuc.gr/dl/dias/8F391DA7-0A7A-4DF4-9FC5-D96C8A046C38-
Identifierhttps://doi.org/10.1016/j.cor.2009.03.004-
Languageen-
Extent11 pagesen
TitleA hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problemen
CreatorMarinakis Ioannisen
CreatorΜαρινακης Ιωαννηςel
CreatorMarinaki Magdalinien
CreatorΜαρινακη Μαγδαληνηel
PublisherElsevieren
Content SummaryThe Probabilistic Traveling Salesman Problem (PTSP) is a variation of the classic Traveling Salesman Problem (TSP) and one of the most significant stochastic routing problems. In the PTSP, only a subset of potential customers need to be visited on any given instance of the problem. The number of customers to be visited each time is a random variable. In this paper, a new hybrid algorithmic nature inspired approach based on Particle Swarm Optimization (PSO), Greedy Randomized Adaptive Search Procedure (GRASP) and Expanding Neighborhood Search (ENS) Strategy is proposed for the solution of the PTSP. The proposed algorithm is tested on numerous benchmark problems from TSPLIB with very satisfactory results. Comparisons with the classic GRASP algorithm, the classic PSO and with a Tabu Search algorithm are also presented. Also, a comparison is performed with the results of a number of implementations of the Ant Colony Optimization algorithm from the literature and in 13 out of 20 cases the proposed algorithm gives a new best solution.en
Type of ItemPeer-Reviewed Journal Publicationen
Type of ItemΔημοσίευση σε Περιοδικό με Κριτέςel
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2015-11-05-
Date of Publication2010-
SubjectParticle swarm optimizationen
Bibliographic CitationY. Marinakis , M. Marinaki ," A Hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem," Comp. and Operations Research, vol. 37,no.3 ,pp. 432-442 ,Mar. 2010.doi:10.1016/j.cor.2009.03.004en

Services

Statistics