Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
A hybrid Particle Swarm Optimization: Variable Neighborhood Search Algorithm for Constrained Shortest Path Problems
Technical University of Crete, School of Production Engineering and Management, University Campus, 73100 Chania.
Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
University of Macedonia, School of Information Sciences, Department of Applied Informatics.
Number of Authors: 3
2017 (English)In: European Journal of Operational Research, ISSN 0377-2217, E-ISSN 1872-6860, Vol. 261, no 3, 819-834 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, a well known NP-hard problem, the constrained shortest path problem, is studied. As efficient metaheuristic approaches are required for its solution, a new hybridized version of Particle Swarm Optimization algorithm with Variable Neighborhood Search is proposed for solving this significant combinatorial optimization problem. Particle Swarm Optimization (PSO) is a population-based swarm intelligence algorithm that simulates the social behavior of social organisms by using the physical movements of the particles in the swarm. A Variable Neighborhood Search (VNS) algorithm is applied in order to optimize the particles’ position. In the proposed algorithm, the Particle Swarm Optimization with combined Local and Global Expanding Neighborhood Topology (PSOLGENT), a different equation for the velocities of particles is given and a novel expanding neighborhood topology is used. Another issue in the application of the VNS algorithm in the Constrained Shortest Path problem is which local search algorithms are suitable from this problem. In this paper, a number of continuous local search algorithms are used. The algorithm is tested in a number of modified instances from the TSPLIB and comparisons with classic versions of PSO and with other versions of the proposed method are performed. Also, the results of the algorithm are compared with the results of a number of metaheuristic and evolutionary algorithms. The results obtained are very satisfactory and strengthen the efficiency of the algorithm.

Place, publisher, year, edition, pages
2017. Vol. 261, no 3, 819-834 p.
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Industrial Logistics
Identifiers
URN: urn:nbn:se:ltu:diva-62564DOI: 10.1016/j.ejor.2017.03.031ISI: 000401889300002Scopus ID: 2-s2.0-85016465911OAI: oai:DiVA.org:ltu-62564DiVA: diva2:1083016
Note

Validerad;2017;Nivå 2;2017-06-02 (andbra)

Available from: 2017-03-20 Created: 2017-03-20 Last updated: 2017-07-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Migdalas, Athanasios
By organisation
Business Administration and Industrial Engineering
In the same journal
European Journal of Operational Research
Production Engineering, Human Work Science and Ergonomics

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 121 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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