Hybridization of particle swarm optimization and simulated annealing (PSO-SA) algorithms applied to integer programming / (Record no. 600)

MARC details
000 -LEADER
fixed length control field 01900nam a2200241 4500
001 - CONTROL NUMBER
control field UPMIN-00000014050
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20221108170254.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221108b |||||||| |||| 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 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) LG993.5 2007
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) C6 S26
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Salvador, Dessie Mae S.
245 00 - TITLE STATEMENT
Title Hybridization of particle swarm optimization and simulated annealing (PSO-SA) algorithms applied to integer programming /
Statement of responsibility, etc. Dessie Mae Sercedillo Salvador
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2007
300 ## - PHYSICAL DESCRIPTION
Extent 72 leaves.
502 ## - DISSERTATION NOTE
Dissertation note Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2007
520 3# - SUMMARY, ETC.
Summary, etc. Integer Programming (IP) is a technique that finds numeric solutions to problems wherein variables take integer values. IP problems are NP-complete and so far, no efficient solutions algorithms have been found to solve these types of problems. Heuristic methods have been applied to solve these types of problems. This study tested the efficiency of a hybrid algorithm, Particle Swarm Optimization and Simulated Annealing in solving Integer Programming benchmark test problems. The pure PSO algorithms was combined with a non-population based local escape hill-climbing heuristic Simulated Annealing (SA). To test the hybrid algorithm, different iteration values and SA parameters were used. Results of the test showed that for large numbers of iterations such as 25000, large values of Simulated Annealing temperature are needed to have a good solution quality and a better running time. But for smaller iterations, smaller temperatures are more suitable to use but a large geometric ratio would be better for both large and small iteration values. The results of this study showed that PSO-SA is a promising method in solving IP problems
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 Koha item type
    Library of Congress Classification   Not For Loan Preservation Copy University Library University Library Archives and Records 2007-09-26 donation UAR-T-gd959   LG993.5 2007 C6 S26 3UPML00031011 2022-09-21 Thesis
    Library of Congress Classification   Not For Loan   College of Science and Mathematics University Library General Reference 2007-08-08 donation CSM-T-gd-1549   LG993.5 2007 C6 S26 3UPML00011859 2022-09-21 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