Shuffled frog leaping algorithm with modified local search using one-point crossover operation applied to the bounded knapsack problem / (Record no. 2238)

MARC details
000 -LEADER
fixed length control field 02776nam a22003253a 4500
001 - CONTROL NUMBER
control field UPMIN-00003211644
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20230117163624.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 2008
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) C6 G83
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Guden, Glenn Merquita.
9 (RLIN) 1373
245 ## - TITLE STATEMENT
Title Shuffled frog leaping algorithm with modified local search using one-point crossover operation applied to the bounded knapsack problem /
Statement of responsibility, etc. Glenn Merquita Guden.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2008
300 ## - PHYSICAL DESCRIPTION
Extent 93 leaves.
502 ## - DISSERTATION NOTE
Dissertation note Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2008
520 3# - SUMMARY, ETC.
Summary, etc. The knapsack problem is one of the most studied problems in combinatorial optimization because analyzing this problem can help in solving other complex optimization problems. The knapsack problem entails forming a combination of items from a set that gives the maximum total profit without exceeding the weight capacity of the knapsack. This study settled on solving the bounded knapsack problem (BKP) since only a few dedicated algorithms for BKP have been published. In this study, an evolutionary algorithm (EA) called the shuffled frog leaping algorithm (SFLA) was applied to the BKP. The experimental results in terms of the probability of convergence to a global optimal solution and the speed of solution imply that the SFLA can be an efficient tool for solving combinatorial optimization problems comparable to a genetic algorithm. 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). This study also utilized a genetic algorithm operator called the single-point crossover operator. The original SFLA (OSFLA) and the modified SFLA (MSLFA) with crossover were the only main algorithm used. The evaluation of the efficiency of the SFLA variants was limited to the generated test data only. Generally, MSLFA provided more optimal results than OSFLA except for data sets with a data range of 10000 paired with problem types ss and sc. MSLFA also consistently performed significantly faster than OSFLA. Accordingly, MSFLA is a promising approach in solving the bounded knapsack problem if further improvements can be done
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Knapsack problems.
9 (RLIN) 1374
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Knapsack problems
General subdivision Bounded.
9 (RLIN) 1375
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Crossover operations.
9 (RLIN) 1376
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 algorithms.
9 (RLIN) 1379
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Shuffled frog leaping algorithms.
9 (RLIN) 1380
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 2009-01-12 donation UAR-T-gd1163   LG993.5 2008 C6 G83 3UPML00032398 2022-10-05 2022-10-05 Thesis
    Library of Congress Classification   Not For Loan Room-Use Only College of Science and Mathematics University Library Theses 2008-06-25 donation CSM-T-gd1963   LG993.5 2008 C6 G83 3UPML00012211 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