MARC details
000 -LEADER |
fixed length control field |
02377nam a22003133a 4500 |
001 - CONTROL NUMBER |
control field |
UPMIN-00004750826 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
UPMIN |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20230117165721.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) |
LG993.5 2010 |
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
C6 I33 |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Ibañez, Princess Nelia Magdalena C. |
9 (RLIN) |
1393 |
245 ## - TITLE STATEMENT |
Title |
Modified shuffled frog leaping algorithm with integer mutation applied to the bounded knapsack problem / |
Statement of responsibility, etc. |
Princess Nelia Magdalena C. Ibañez |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Date of publication, distribution, etc. |
2010 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
86 leaves |
502 ## - DISSERTATION NOTE |
Dissertation note |
Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2010 |
520 3# - SUMMARY, ETC. |
Summary, etc. |
The knapsack problem or rucksack problem is a problem in combinatorial optimization. It has been studied for centuries as it is the simplest prototype of a maximization problem. The term knapsack problem invokes of the backpacker who is constrained by a fixed-sized knapsack and so must fill it only with the most useful items. This study settled on solving the bounded knapsack problem (BKP) since only a few dedicated algorithms for BKP have been published. As reported in literatuire, hybrid methods have produced better results. Thus, evolutionary algorithms (EAs) called the shuffled frog leaping algorithm (SFLA) and integer mutation genetic algorithm (GA) were applied to the BKP. The test data used in this study were generated using the algorithm specified in the study of Pisinger (1994). Furthermore, the parameters used in this study were based on the study of AMiri et al. (2005). The experimental results indicated that the MSFlA with integer mutation operation is a promising alternative to the OSFLA and MSFLA with one-point crossover operation in finding the global optimal solution. However, MSFLA with integer mutation failed to achieve optimal solution time. Moreover, other variations and modifications to the SFLA may be explored, and see if it produces better results than those achieved by this modified algorithm. |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Bounded knapsack problem |
9 (RLIN) |
1394 |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Discrete optimization |
9 (RLIN) |
1377 |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Evolutionary algorithms |
9 (RLIN) |
1378 |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Genetic algorithm |
9 (RLIN) |
344 |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Integer mutation |
9 (RLIN) |
1395 |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Shuffled frog leaping algorithm |
9 (RLIN) |
1396 |
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 |