Multi-state PSO GSA for solving discrete combinatorial optimization problems

Multi-state PSO GSA for solving discrete combinatorial optimization problems

There are various meta-heuristics exist in literature nowadays. However, not all metaheuristics were originally d~veloped to operate in discrete search space. Two examples of meta-heuristics are Particle swarm optimization (PSO) and gravitational search algorithm (GSA), which are based on the social...

Full description

Bibliographic Details
Main Author: Ismail, Ibrahim
Format: Thesis
Language:English
English
English
Published: 2016
Subjects:
TK Electrical engineering. Electronics Nuclear engineering
Online Access:http://umpir.ump.edu.my/id/eprint/17603/
http://umpir.ump.edu.my/id/eprint/17603/
http://umpir.ump.edu.my/id/eprint/17603/1/Multi-state%20PSO%20GSA%20for%20solving%20discrete%20combinatorial%20optimization%20problems-%20Table%20of%20contents.PDF
http://umpir.ump.edu.my/id/eprint/17603/6/Multi-state%20PSO%20GSA%20for%20solving%20discrete%20combinatorial%20optimization%20problems-%20Abstract.PDF
http://umpir.ump.edu.my/id/eprint/17603/7/Multi-state%20PSO%20GSA%20for%20solving%20discrete%20combinatorial%20optimization%20problems-%20References.PDF

Similar Items

Similar Items