Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization / (Record no. 2682)

MARC details
000 -LEADER
fixed length control field 02863nam a22003733a 4500
001 - CONTROL NUMBER
control field UPMIN-00005905236
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20230117163131.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221014b |||||||| |||| 00| 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency UPMin
Modifying agency upmin
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
090 #0 - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) LG 993.5 2011
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) C6 G37
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Garillos, Cinmayii Abarsolo.
9 (RLIN) 1363
245 ## - TITLE STATEMENT
Title Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization /
Statement of responsibility, etc. Cinmayii Abarsolo Garillos.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2011
300 ## - PHYSICAL DESCRIPTION
Extent 112 leaves.
502 ## - DISSERTATION NOTE
Dissertation note Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2011
520 3# - SUMMARY, ETC.
Summary, etc. It is certain that NP-hard problems frequently arise and are becoming the major concern of experts in different fields of research and industries. These problems could be in the form of continuous constrained optimization. Due to this impact, several optimization algorithms. in their pure and hybrid forms have been developed and improved to handle this kind of problems. It is in this rationale that the metaheuristic Firefly-Simulated Annealing algorithm was introduced and developed through hybridizing Firefly algorithm (FA) and Simulated Annealing algorithm (SA). The ability of Simulated Annealing algorithm to avoid a firefly from being trapped at a local minimum made it a good candidate as FA's local search. In this study, the researcher employed some parameter settings to F-SA for experimentation and four commonly used cooling schedules for reducing the randomness of FA in F-SA to improve solution quality and convergence. The researcher used some benchmarks functions which have varied characteristics to reflect wide variety of difficulties encountered when solving practical problems, to rigorously test the algorithm performance and to obtain comprehensive results. Based on the overall result of this study, F-SA algorithm, especially F-SA with a cooling schedule, is superior to FA in terms of obtaining high solution quality even in solving constrained optimization problem. However, it is recommended to improve the initialization and solution generation process of F-SA to solve multiobjective optimization problems and more constrained optimization problems with equality constraints.
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Firefly-simulated Annealing (F-SA)
9 (RLIN) 1364
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithm.
9 (RLIN) 1365
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Optimization.
9 (RLIN) 733
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Continuous constrained optimization.
9 (RLIN) 1366
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Firefly algorithm.
9 (RLIN) 728
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Hybrid algorithms.
9 (RLIN) 1367
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Metaheuristics.
9 (RLIN) 1368
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Non-dterministic polynomial-time hard (NP-hard)
9 (RLIN) 1369
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Simulated annealing.
9 (RLIN) 1370
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Firefly algorithm (FA)
9 (RLIN) 1371
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element NP-hard problems.
9 (RLIN) 1372
658 ## - INDEX TERM--CURRICULUM OBJECTIVE
Main curriculum objective Undergraduate Thesis
Curriculum code CMSC200,
Source of term or code BSCS
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a Fi
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a UP
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Thesis
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Status Collection Home library Current library Shelving location Date acquired Source of acquisition Accession Number Total Checkouts Full call number Barcode Date last seen Price effective from Koha item type
    Library of Congress Classification   Not For Loan Preservation Copy University Library University Library Archives and Records 2014-03-06 donation UAR-T-gd1950   LG 993.5 2011 C6 G37 3UPML00033578 2022-10-05 2022-10-05 Thesis
    Library of Congress Classification   Not For Loan   College of Science and Mathematics University Library General Reference 2011-12-07   CSM-T-gd2762   LG 993.5 2011 C6 G37 3UPML00012767 2022-10-05 2022-10-05 Thesis
 
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