Initial studies on the hybridization of particle swarm optimization-tabu search (PSO-TS) approach applied to the classical 0/1knapsack problem / (Record no. 530)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02847nam a2200241 4500 |
| 001 - CONTROL NUMBER | |
| control field | UPMIN-00000010894 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | UPMIN |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20230105135212.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 221013b |||||||| |||| 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 2006 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) | C6 D59 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Diza, Francis George B. |
| 9 (RLIN) | 922 |
| 245 00 - TITLE STATEMENT | |
| Title | Initial studies on the hybridization of particle swarm optimization-tabu search (PSO-TS) approach applied to the classical 0/1knapsack problem / |
| Statement of responsibility, etc. | Francis George B. Diza. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Date of publication, distribution, etc. | 2006 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 89 leaves. |
| 502 ## - DISSERTATION NOTE | |
| Dissertation note | Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2006 |
| 520 3# - SUMMARY, ETC. | |
| Summary, etc. | The classical 0/1 Knapsack Problem is a well-known optimization problem occurring in many real-world problems and is considered to be nonpolynomial-hand (NP-hard) by mathematicians. Different knapsack algorithms have already been studied and used to solve for the optimal solution in the knapsack problem with great considerations to its performance in terms of running time and quality of the optimal solution returned by the algorithm. Because of this, a recent breed of algorithms, called heuristic methods, is popularly used in knapsack optimization problems because of its good performance in yielding good results and the Particle Swarm Optimization (PSO) is one of these. The PSO algorithm is a population-based stochastic search technique that is modelled after the social behavior of a bird flock and fish school. Recent mathematical researches have embarked on the use of PSO in solving for the Classical 0/1 Knapsack Problem. The results of these studies showed that the Knapsack Particle Swarm Optimization (KPSO) algorithm is good in solving for the optimal solution in three benchmark sample knapsack problems. Local hill climbing techniques such as Tabu Search (TS) is also popular in solving various optimization problems. The TS method has already been studied and used in solving the Classical 0/1 Knapsack Problem and has been shown that the TS method is a promising algorithm to find the optimal (or near optimal) solution in a knapsack problem. This research study has made us of the successes of the PSO and TS algorithms and has combined both algorithms to solve for the optimum in the Classical 0/1 Knapsack Problem using three benchmark sample knapsack problems. The results of the research showed that the PSO-TS hybrid algorithm has the capacity to return more optimal hits to the known knapsack optimal solution than the pure PSO algorithm alone. Thus, this study has shown that the PSO-TS hybrid algorithm performs better in finding the optimal solution to the three benchmark knapsack sample problems compared to the pure PSO algorithm |
| 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 |
| 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 | 2006-06-27 | donation | UAR-T-gd738 | LG993.5 2006 C6 D59 | 3UPML00021984 | 2022-09-21 | 2022-09-21 | Thesis | ||||
| Library of Congress Classification | Not For Loan | Room-Use Only | College of Science and Mathematics | University Library | Theses | 2006-06-27 | donation | CSM-T-gd1423 | LG993.5 2006 C6 D59 | 3UPML00011612 | 2022-09-21 | 2022-09-21 | Thesis |