Hybrid PSO Algorithm with Iterated Local Search Operator for Equality Constraints Problems

Felipe O. Mota; Vinicius Almeida; Elizabeth  Wanner; Gladston Moreira

doi:10.1109/CEC.2018.8477884

Hybrid PSO Algorithm with Iterated Local Search Operator for Equality Constraints Problems

Felipe O. Mota, Vinicius Almeida, Elizabeth Wanner, Gladston Moreira

College of Engineering and Physical Sciences

Research output: Chapter in Book/Published conference output › Conference publication

Abstract

This paper presents a hybrid PSO algorithm (Par-ticle Swarm Optimization) with an ILS (Iterated Local Search) operator for handling equality constraints problems in mono-objective optimization problems. The ILS can be used to locally search around the best solutions in some generations, exploring the attraction basins in small portions of the feasible set. This process can compensate the difficulty of the evolutionary algorithm to generate good solutions in zero-volume regions. The greatest advantage of the operator is the simple implementation. Experiments performed on benchmark problems shows improvement in accuracy, reducing the gap for the tested problems.

Original language	English
Title of host publication	2018 IEEE Congress on Evolutionary Computation (CEC)
Publisher	IEEE
ISBN (Electronic)	978-1-5090-6017-7
ISBN (Print)	978-1-5090-6018-4
DOIs	https://doi.org/10.1109/CEC.2018.8477884
Publication status	Published - 4 Oct 2018
Event	2018 IEEE Congress on Evolutionary Computation (CEC) - Rio de Janeiro, Brazil Duration: 8 Jul 2018 → 13 Jul 2018

Conference

Conference	2018 IEEE Congress on Evolutionary Computation (CEC)
Country/Territory	Brazil
City	Rio de Janeiro
Period	8/07/18 → 13/07/18

Bibliographical note

© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Access to Document

10.1109/CEC.2018.8477884

Hybrid PSO Algorithm with Iterated Local Search
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Accepted author manuscript, 416 KB

Cite this

@inproceedings{8b200651471340e0ae08cc0f57925198,

title = "Hybrid PSO Algorithm with Iterated Local Search Operator for Equality Constraints Problems",

abstract = "This paper presents a hybrid PSO algorithm (Par-ticle Swarm Optimization) with an ILS (Iterated Local Search) operator for handling equality constraints problems in mono-objective optimization problems. The ILS can be used to locally search around the best solutions in some generations, exploring the attraction basins in small portions of the feasible set. This process can compensate the difficulty of the evolutionary algorithm to generate good solutions in zero-volume regions. The greatest advantage of the operator is the simple implementation. Experiments performed on benchmark problems shows improvement in accuracy, reducing the gap for the tested problems.",

author = "Mota, {Felipe O.} and Vinicius Almeida and Elizabeth Wanner and Gladston Moreira",

note = "{\textcopyright} 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.; 2018 IEEE Congress on Evolutionary Computation (CEC) ; Conference date: 08-07-2018 Through 13-07-2018",

year = "2018",

month = oct,

day = "4",

doi = "10.1109/CEC.2018.8477884",

language = "English",

isbn = "978-1-5090-6018-4",

booktitle = "2018 IEEE Congress on Evolutionary Computation (CEC)",

publisher = "IEEE",

address = "United States",

}

TY - GEN

T1 - Hybrid PSO Algorithm with Iterated Local Search Operator for Equality Constraints Problems

AU - Mota, Felipe O.

AU - Almeida, Vinicius

AU - Wanner, Elizabeth

AU - Moreira, Gladston

N1 - © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

PY - 2018/10/4

Y1 - 2018/10/4

N2 - This paper presents a hybrid PSO algorithm (Par-ticle Swarm Optimization) with an ILS (Iterated Local Search) operator for handling equality constraints problems in mono-objective optimization problems. The ILS can be used to locally search around the best solutions in some generations, exploring the attraction basins in small portions of the feasible set. This process can compensate the difficulty of the evolutionary algorithm to generate good solutions in zero-volume regions. The greatest advantage of the operator is the simple implementation. Experiments performed on benchmark problems shows improvement in accuracy, reducing the gap for the tested problems.

AB - This paper presents a hybrid PSO algorithm (Par-ticle Swarm Optimization) with an ILS (Iterated Local Search) operator for handling equality constraints problems in mono-objective optimization problems. The ILS can be used to locally search around the best solutions in some generations, exploring the attraction basins in small portions of the feasible set. This process can compensate the difficulty of the evolutionary algorithm to generate good solutions in zero-volume regions. The greatest advantage of the operator is the simple implementation. Experiments performed on benchmark problems shows improvement in accuracy, reducing the gap for the tested problems.

UR - https://ieeexplore.ieee.org/document/8477884

U2 - 10.1109/CEC.2018.8477884

DO - 10.1109/CEC.2018.8477884

M3 - Conference publication

SN - 978-1-5090-6018-4

BT - 2018 IEEE Congress on Evolutionary Computation (CEC)

PB - IEEE

T2 - 2018 IEEE Congress on Evolutionary Computation (CEC)

Y2 - 8 July 2018 through 13 July 2018

ER -

Hybrid PSO Algorithm with Iterated Local Search Operator for Equality Constraints Problems

Abstract

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this