Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Adaptive Tunning of All Parameters in a Multi- Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem
School of Production Engineering and Management, Technical University of Crete, Decision Support Systems Laboratory, Department of Production Engineering and Management, Technical University of Crete.
School of Production Engineering and Management, Technical University of Crete.
Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
2014 (English)Conference paper, Oral presentation only (Refereed)
Abstract [en]

One of the main issues in the application of a Particle SwarmOptimization (PSO) algorithm and of every evolutionary opti-mization algorithm is the finding of the suitable parameters ofthe algorithm. In this paper, we use a parameter free version of aMulti-Swarm PSO algorithm where random values are assignedin the initialization of all parameters (including the number ofswarms) of the algorithm and, then, during the iterations theparameters are optimized together and simultaneously with theoptimization of the objective function of the problem. This ideais used for the solution of the Probabilistic Traveling SalesmanProblem (PTSP). The PTSP is a variation of the classic Trav-eling Salesman Problem (TSP) and one of the most significantstochastic routing problems. In the PTSP, only a subset of poten-tial customers needs to be visited on any given instance of theproblem. The number of customers to be visited each time is arandom variable. The proposed algorithm is tested on numer-ous benchmark problems from TSPLIB with very satisfactoryresults. It is compared with other algorithms from the literature,and, mainly with a Multi-Swarm Particle Swarm Optimizationwith parameters calculated with a classic trial - and - error pro-cedure and they are the same for all instances.

Place, publisher, year, edition, pages
2014.
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Industrial Logistics
Identifiers
URN: urn:nbn:se:ltu:diva-27458Local ID: 0eaa4f7c-66c2-4674-bf72-24117f04d977OAI: oai:DiVA.org:ltu-27458DiVA: diva2:1000642
Conference
Conference on Optimization Control and Applications in the Information Age : Organized in honor of the 60th birthday of Professor Panos M. Pardalos 15/06/2014 - 20/06/2014
Note
Godkänd; 2014; 20141124 (athmig)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2017-11-25Bibliographically approved

Open Access in DiVA

fulltext(48 kB)13 downloads
File information
File name FULLTEXT01.pdfFile size 48 kBChecksum SHA-512
45626c3a2cc0ad39a54fb658bdd9aad172a72e436a79b2a74bcea209632a05579af973cff5811a6c8a12df595f35c43bd401f0006a423ade6106d64bb59d74bf
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Migdalas, Athanasios
By organisation
Business Administration and Industrial Engineering
Production Engineering, Human Work Science and Ergonomics

Search outside of DiVA

GoogleGoogle Scholar
Total: 13 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 29 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf