Optimizing TSP-MMC Performance in Non-Homogeneous Environments

The Travelling Salesman Problem (TSP) for determining the optimal trajectory in a non-homogeneous space is related to the variational problem of Fermat's principle, which seeks the path of an optical ray in a medium. Generally, finding such an optimal trajectory is a considerable challenge, es...

Full description

Saved in:
Bibliographic Details
Main Authors: Yessica Yazmín Calderon-Segura, Gennadiy Burlak, Jośe Antonio García Pacheco
Format: Article
Language:English
Published: Universidad Autónoma del Estado de Morelos 2025-06-01
Series:Programación Matemática y Software
Subjects:
Online Access:https://progmat.uaem.mx/progmat/index.php/progmat/article/view/316
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Travelling Salesman Problem (TSP) for determining the optimal trajectory in a non-homogeneous space is related to the variational problem of Fermat's principle, which seeks the path of an optical ray in a medium. Generally, finding such an optimal trajectory is a considerable challenge, especially in structures with a large number of emitters randomly distributed. To address this problem, we propose using the hybrid TSP-MMC algorithm to identify the minimum optical path S that connects the emitters embedded in a percolating cluster. This approach will compensate for the deviations introduced by the transmission of a light beam through the percolation cluster, achieving an intensity distribution tailored to user needs. We have demonstrated that our technique can achieve solutions that improve efficiency by 60% compared to optimal values for light beam optimization data. This technique could be applied to visualize blood vessels in both static and dynamic contexts, making it useful in the biological field for cellular and bacterial samples.
ISSN:2007-3283