Enhancement of tabu search algorithm for optimized rescue routing operation (Record no. 37407)

000 -LEADER
fixed length control field 02617nam a22001817a 4500
003 - CONTROL NUMBER IDENTIFIER
control field ft8917
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 260108b ||||| |||| 00| 0 eng d
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9 A43 C36 2025
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Cando, Jhaime Jose O.; Manaois, Shelly Pe L.; Verano, Angelo P.
245 ## - TITLE STATEMENT
Title Enhancement of tabu search algorithm for optimized rescue routing operation
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Date of production, publication, distribution, manufacture, or copyright notice c2025
300 ## - PHYSICAL DESCRIPTION
Other physical details Undergraduate Thesis: (Bachelor of Science in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2025
336 ## - CONTENT TYPE
Source text
Content type term text
Content type code text
337 ## - MEDIA TYPE
Source unmediated
Media type term unmediated
Media type code unmediated
338 ## - CARRIER TYPE
Source volume
Carrier type term volume
Carrier type code volume
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note ABSTRACT: The Tabu Search algorithm while effective for optimization problems, faces challenges with getting stuck in suboptimal solutions, slow processing for large-scale issues, and inconsistent performance across different problem sizes. The TS algorithm specifically struggles in three critical care areas: it often gets trapped in suboptimal solutions and cannot find the best possible solutions, it suffers from high computational complexity leading to excessive runtime, and it encounters scalability issues that produce unexpected results when applied to problems of varying sizes. To address these limitations, researchers established three primary objectives: to enhance the balance of exploration and exploitation by incorporating a modified perturbation technique to diversity the search space, to optimize the high-complexity operations by swapping selected Points of Interest (POIs) to speed up the generation of neighborhood solutions, and to improve scalability by utilizing a modified dynamic tabu tenure mechanism that adjusts parameters based on problem size. The methodology implemented three innovative approaches: first, a wave-resonance based perturbation technique which mimics wave interference patterns observed in transmission frequency analysis to better explore the solution space; second, a local point sampling method for neighborhood generation that strategically examines only the most promising route segments rather than exhaustively checking every possibility; and third, a Wave-Inspired Dynamic Tenure mechanism (WIDT) that dynamically adjusts memory length using principles derived from wave properties. Testing demonstrated significant improvements over previous approaches: solution diversity increased substantially (scoring 0.21 versus 0.03), processing time for 160-location problems became eight times faster (3.33 seconds versus 28.88 seconds), and performance remained consistent across all tested scenarios regardless of size.
942 ## - ADDED ENTRY ELEMENTS
Source of classification or shelving scheme
Item type Thesis/Dissertation
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Permanent Location Current Location Shelving location Date acquired Fund Source Total Checkouts Full call number Barcode Date last seen Price effective from Item type
          Filipiniana-Thesis PLM PLM Filipiniana Section 2025-10-24     QA76.9 A43 C36 2025 FT8917 2026-01-08 2026-01-08 Thesis/Dissertation

© Copyright 2024 Phoenix Library Management System - Pinnacle Technologies, Inc. All Rights Reserved.