IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/1029499.html
   My bibliography  Save this article

Optimized Distance-Based Algorithm for Cloud Space—Tourist Route Recommendation for Heritage Town, Pondicherry, India

Author

Listed:
  • Lakshmi Lakshmanan
  • Madhumathi A
  • Sudhakara Pandian R
  • Subhashini S
  • Sivakumar Paraman
  • Velmurugan K
  • Gianpaolo Di Bona
  • Juan C. Jauregui-Correa

Abstract

Architecture, often regarded as a three-dimensional art form, relies on a multitude of abstractions during the design process. In this context, architectural elements are effectively represented through vector-based data processing techniques, offering a canvas for creative exploration. To further our understanding of spatial configurations and generate multiple design insights, mathematical structures known as graphs come into play. Graph theory, a fundamental component of this process, it is a mathematical field that studies relationships and connections between objects using vertices and edges, finding applications in computer science, network analysis, and more finds application in architectural design. This study delves into the application of graph theory in the analytical exploration of urban networks, with a focus on tourism parameters in the picturesque town of Pondicherry, Tamil Nadu, India. Traditionally, urban network analysis seeks to determine the shortest distance between origin and destination, a metric rooted in accessibility. However, in leisure destinations, a novel approach involving an optimized distance-based algorithm is introduced. This innovative methodology aims to facilitate efficient access to all tourist destinations within the spatial extent while minimizing discrete physical distances. To illustrate this concept, we take the iconic French Quarters in the White Town of Pondicherry as a case study. By applying the optimized distance-based algorithm, we endeavor to uncover the most efficient route for tourists to navigate and leisurely explore the area. The outcome of this analysis reveals a path graph structure, which, when compared to a circular graph structure, demonstrates superior efficiency in guiding tourists through the space. The implications of this tourist route extend beyond the realm of tourism itself. It has the potential to enhance the organization of tourist activities, allowing stakeholders to manage and regulate the flow of visitors. Additionally, it presents an opportunity to promote and develop the region’s often-underestimated tourist destinations, which can, in turn, have a positive impact on the local economy. In summary, the integration of graph theory into architectural and urban design methodologies enriches the approach to tourism and offers a holistic perspective on spatial optimization.

Suggested Citation

  • Lakshmi Lakshmanan & Madhumathi A & Sudhakara Pandian R & Subhashini S & Sivakumar Paraman & Velmurugan K & Gianpaolo Di Bona & Juan C. Jauregui-Correa, 2024. "Optimized Distance-Based Algorithm for Cloud Space—Tourist Route Recommendation for Heritage Town, Pondicherry, India," Mathematical Problems in Engineering, Hindawi, vol. 2024, pages 1-10, March.
  • Handle: RePEc:hin:jnlmpe:1029499
    DOI: 10.1155/2024/1029499
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2024/1029499.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2024/1029499.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2024/1029499?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:1029499. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.