Stochastic Traveling Salesman Problem (S-TSP) with Partial Visibility and Randomized Edge Weights is a critical challenge in disaster management where uncertainty and dynamic conditions hinder effective rescue operations. To address this, five optimization algorithms, Genetic Algorithm (GA), Ant Colony Optimization (ACO), Tabu Search (TS), Simulated Annealing (SA), and Nearest Neighbor Heuristic (NNH), implemented using Code::Blocks IDE and evaluated through simulation. Chrono measured execution time, providing insights into algorithmic efficiency under dynamic conditions. Memory utilization and computational overhead were analyzed using gperftools, which monitored evictions, interrupts, and byte usage. Valgrind’s Callgrind assessed instruction counts, offering a detailed evaluation of algorithm scalability and resource management. The comparative analysis highlighted NNH as the most effective algorithm, balancing computational efficiency with solution quality, making it highly suitable for real-time disaster response applications. The profiling tools reinforced these findings, identifying NNH’s capability to optimize memory and computation resources effectively. This research underscores the importance of using adaptable and efficient algorithms in disaster management, where rapid and accurate decision-making is crucial.