Suzzette Ann H. Latoza, Maricel L. Arcega.  4  0   <br/><br/>
Optimizing the travelling salesman problem : a genetic algorithm enhanced with Tabu search.        6 
       6     

 -   
 -     
 -         
 -   
 -   
 - 
 - 
 -         .
 -     .
 -          0   .
 -         .
 -  0       .
<br/><br/>   Undergraduate Thesis : (Bachelor of Science major in Computer Science) - Pamantasan Lungsod ng Maynila, 2024. 
<br/><br/>
<br/><br/>      
<br/><br/>   5 
<br/><br/>      
<br/><br/> ABSTRACT:  The provoting of the logistics industry caused by the pandemic surely raised the pressure on delivery providers to resolve decreasing the travel time while still having optimal ways to deliver each parcel. Traveling salesman problem (TSP) is a common problem encountered in the logistics industry. It is a common problem encountered in the logistics industry. It is known that the traveling salesman needs to choose the most efficient route to travel all of the locations and return to the original city where the salesman started. The study aims to improve the quality of solutions for TSP instances by leveraging the complimentary strength of the Genetic Algorithm (GA) and Tabu Search (TS). Genetic algorithms are commonly used for optimization that stimulates searching that are observed in natural evolution. The main objective of the study is to enhance the genetic algorithm in order to further optimize the routing problem present in TSP and still be able to present efficient and optimal results. Specifically, the study focuses on the algorithmic enhancement, solution quality improvement, and convergence speed of the offspring producing suboptimal solutions using Tabu search. The results show that the existing algorithm still produces the same optimal solution and its convergence rate and RMSE remains an inconsistency that needs improvement. Moreover, the proposed algorithm produces multiple optimal solutions compared to the current method. The proposed algorithm also shows great reliability in its solutions. This output demonstrates the algorithm's ability to produce consistent despite variations in convergence rate.       
<br/><br/>      
<br/><br/><br/> <br/> <br/> <br/> <br/> <br/> <br/> 
<br/><br/><br/>5     
<br/><br/><br/> <br/>   
<br/><br/><label>ISBN: </label>  
<br/><br/><label>ISSN: </label>2 
 =   
 =   
<br/><br/><label>Standard No.: </label>        
<br/><br/><label>Publisher. No.: </label>  
<br/><br/><label>Source: </label>        
<br/><br/><label>LCCN: </label>
<br/><br/><label>Nat. Bib. No.: </label> 2 
<br/><br/><label>Nat. Bib. Agency Control No.: </label>    
<br/><br/><label>Subjects--Personal Names: </label><br/>     2     --0------
<br/><br/><label>Subjects--Corporate Names: </label><br/>     6 --0-- 2 --------
<br/><br/><label>Subjects--Meeting Names: </label><br/><br/> 0    2 --
<br/><br/><label>Subjects--Uniform Titles: </label><br/>  --20------
<br/><br/><label>Subjects--Chronological Terms: </label><br/> 
<br/><br/><label>Subjects--Topical Terms: </label><br/>    --------20--
<br/><br/><label>Subjects--Geographic Terms: </label><br/>--------20--
<br/><br/><label>Index Terms--Genre/Form: </label><br/>----2
<br/><br/><label>LC Class. No.: </label> / 2 
<br/><br/><label>Dewey Class. No.: </label> / 2 
<br/><br/><label>National Agricultural Library Call No.: </label> /  
<br/><br/><label>National Library of Medicine Call No.: </label> /  
<br/><br/><label>Gov. Doc. Class. No.: </label>