A particle swarm optimization and tabu search (PSO-TS : (Record no. 601)

MARC details
000 -LEADER
fixed length control field 01985nam a2200241 4500
001 - CONTROL NUMBER
control field UPMIN-00000014051
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20230118142448.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221017b |||||||| |||| 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 2000
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) C6 L46
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Leopoldo, Jeremie J.
9 (RLIN) 1428
245 00 - TITLE STATEMENT
Title A particle swarm optimization and tabu search (PSO-TS :
Remainder of title hybrid algorithm applied to integer programming /
Statement of responsibility, etc. Jeremie Janog Leopoldo.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2000
300 ## - PHYSICAL DESCRIPTION
Extent 78 leaves.
502 ## - DISSERTATION NOTE
Dissertation note Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2000
520 3# - SUMMARY, ETC.
Summary, etc. Many real world optimization problems are represented by Integer Programming (IP) models to derive optimal solutions. Specific problem constraints must also be satisfied by these solutions. Furthermore, the range of optimal solutions concerning only discrete, integer values is the constraint satisfied by IP models. IP problems are commonly solved using the Branch-and-Bound technique, which ultimately returns the best solutions. However, a need for better and faster search for solutions was imperative. Pure Particle Swarm Optimization (PSO) showed to be a reliable alternative to the search for optimal solutions in IP problems as presented by previous studies. With the advent of 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 heuristic. Tabu Search (TS), was introduced to the pure PSO to solve IP problems. With embedding hybridization, the PSO-TS hybrids returned good solutions to the benchmark problems presented in the study. The hybrids also performed relatively fast. Furthermore, in some of the IP problems presented, the hybrids had shown better average solutions than pure PSO
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-gd960   LG993.5 2000 C6 L46 3UPML00031344 2022-09-21 Thesis
    Library of Congress Classification   Not For Loan Room-Use Only College of Science and Mathematics University Library General Reference 2007-08-08 donation CSM-T-gd-1550   LG993.5 2007 C6 L46 3UPML00011858 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