Local cover image
Local cover image
Local cover image
Local cover image

Hybrid particle swarm optimization tabu-search (PSO-TS) approach applied to constrained engineering optimization problems / Armacheska R. Mesa

By: Material type: TextTextLanguage: English Publication details: 2007Description: 69 leavesSubject(s): Dissertation note: Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2007 Abstract: Many engineering design problems can be formulated as constrained optimization problems. There are several methods reported in literature that can solve many of these optimization design problems with constraints. Genetic algorithm, self-adaptive penalty approach and other evolutionary algorithms had been used to find the optimal solutions to these engineering problems. So far, particle swarm optimization has been the most effective method reported in literature to solve such problems. With the advent of the hybridization techniques to create efficient algorithms pure PSO was paired to several other heuristics and these hybrids were used to solve many optimization problems. Hence, a fast, intelligent meta-heuristic, Tabu Search (TS), was introduced to the pure PSO to solve engineering optimization problems. With the embedded hybridization, the study showed positive results returned by the PSO-TS hybrids and were better compared to the results of other algorithms reported in Hu et.al?s. (2003) and He and Wang?s paper (2006). It is well known that practical engineering optimization involves multiple, nonlinear and non-trivial constraints due to real world limitations. From an engineering standpoint, a better, faster, cheaper solution is always desired. In this study, the embedded hybrid performed well on all our engineering optimization problems tested
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Collection Call number Status Date due Barcode
Thesis Thesis University Library General Reference Reference/Room-Use Only LG993.5 2007 C6 M48 (Browse shelf(Opens below)) Not For Loan 3UPML00012087
Thesis Thesis University Library Archives and Records Preservation Copy LG993.5 2007 C6 M48 (Browse shelf(Opens below)) Not For Loan 3UPML00035011

Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2007

Many engineering design problems can be formulated as constrained optimization problems. There are several methods reported in literature that can solve many of these optimization design problems with constraints. Genetic algorithm, self-adaptive penalty approach and other evolutionary algorithms had been used to find the optimal solutions to these engineering problems. So far, particle swarm optimization has been the most effective method reported in literature to solve such problems. With the advent of the hybridization techniques to create efficient algorithms pure PSO was paired to several other heuristics and these hybrids were used to solve many optimization problems. Hence, a fast, intelligent meta-heuristic, Tabu Search (TS), was introduced to the pure PSO to solve engineering optimization problems. With the embedded hybridization, the study showed positive results returned by the PSO-TS hybrids and were better compared to the results of other algorithms reported in Hu et.al?s. (2003) and He and Wang?s paper (2006). It is well known that practical engineering optimization involves multiple, nonlinear and non-trivial constraints due to real world limitations. From an engineering standpoint, a better, faster, cheaper solution is always desired. In this study, the embedded hybrid performed well on all our engineering optimization problems tested

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image Local cover image
 
University of the Philippines Mindanao
The University Library, UP Mindanao, Mintal, Tugbok District, Davao City, Philippines
Email: library.upmindanao@up.edu.ph
Contact: (082)295-7025
Copyright @ 2022 | All Rights Reserved