Enhancement of short path algorithm for finding optimal path in cycling navigation (Record no. 37368)

000 -LEADER
fixed length control field 02434nam a22002417a 4500
003 - CONTROL NUMBER IDENTIFIER
control field FT8903
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20251217171227.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 251217b ||||| |||| 00| 0 eng d
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title engtag
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9 A43 M37 2025
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number .
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Poliquit, James John Lou O.; Martinez, James Andrew M.
245 ## - TITLE STATEMENT
Title Enhancement of short path algorithm for finding optimal path in cycling navigation
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture .
Name of producer, publisher, distributor, manufacturer .
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: Cycling navigation systems often face difficulties in balancing route accessibility, safety, and efficiency due to oversimplified path selection algorithms. This study presents an enhancement to the shortest path algorithm originally developed by Koritsoglou and colleagues, addressing key limitations such as binary edge accessibility evaluation, redundant processing loops, and inefficient memory usage. The original algorithm applies a strict binary access penalty, which frequently leads to suboptimal routing by deprioritizing shorter or higher-quality paths. The enhanced algorithm introduces a weighted scoring system that assigns proportional values to road characteristics, including surface type, slope, and smoothness, enabling a more refined assessment of route suitability. In addition, the optimization process merges threshold filtering and penalty computation into a single iteration loop, reducing execution time by 28.68%. Memory efficiency is further improved through the replacement of dual list structures with a heap queue, resulting in a 55.57% reduction in memory consumption. Experimental evaluations demonstrate that the proposed enhancements lead to more accurate and context-aware route rankings while also improving computational performance. These improvements render the algorithm more suitable for integration into real-world cycling navigation systems, offering a user-centered approach that supports responsive and efficient route planning. By incorporating both route quality and system efficiency, the enhanced algorithm better addresses the practical needs of cyclists navigating complex and dynamic urban environments.
526 ## - STUDY PROGRAM INFORMATION NOTE
Classification Filipiniana
655 ## - INDEX TERM--GENRE/FORM
Genre/form data or focus term academic writing
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 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 M37 2025 FT8903 2025-12-17 2025-12-17 Thesis/Dissertation

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