基于距离的优化算法,为印度本迪榭里遗产小镇推荐云空间-旅游路线

4区 工程技术 Q1 Mathematics Mathematical Problems in Engineering Pub Date : 2024-03-07 DOI:10.1155/2024/1029499
Lakshmi Lakshmanan, Madhumathi A, Sudhakara Pandian R, Subhashini S, Sivakumar Paraman, Velmurugan K, Gianpaolo Di Bona
{"title":"基于距离的优化算法,为印度本迪榭里遗产小镇推荐云空间-旅游路线","authors":"Lakshmi Lakshmanan, Madhumathi A, Sudhakara Pandian R, Subhashini S, Sivakumar Paraman, Velmurugan K, Gianpaolo Di Bona","doi":"10.1155/2024/1029499","DOIUrl":null,"url":null,"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.","PeriodicalId":18319,"journal":{"name":"Mathematical Problems in Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimized Distance-Based Algorithm for Cloud Space—Tourist Route Recommendation for Heritage Town, Pondicherry, India\",\"authors\":\"Lakshmi Lakshmanan, Madhumathi A, Sudhakara Pandian R, Subhashini S, Sivakumar Paraman, Velmurugan K, Gianpaolo Di Bona\",\"doi\":\"10.1155/2024/1029499\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":18319,\"journal\":{\"name\":\"Mathematical Problems in Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Problems in Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1155/2024/1029499\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Problems in Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1155/2024/1029499","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

建筑通常被视为一种三维艺术形式,在设计过程中依赖于多种抽象概念。在这种情况下,建筑元素通过基于矢量的数据处理技术得到有效表达,为创造性探索提供了画布。为了进一步了解空间配置并产生多种设计见解,被称为图形的数学结构开始发挥作用。图论是这一过程的基本组成部分,它是一个利用顶点和边研究对象之间关系和联系的数学领域,在计算机科学、网络分析以及建筑设计中都有应用。本研究深入探讨了图论在城市网络分析探索中的应用,重点是印度泰米尔纳德邦风景如画的本迪榭里镇的旅游参数。传统上,城市网络分析旨在确定出发地和目的地之间的最短距离,这是一种根植于可达性的指标。然而,在休闲旅游目的地,引入了一种新方法,即基于距离的优化算法。这种创新方法的目的是在最大限度地减少离散物理距离的同时,方便游客高效地到达空间范围内的所有旅游目的地。为说明这一概念,我们以本地治里白城的标志性法式街区为例进行研究。通过应用基于距离的优化算法,我们努力为游客找出一条最有效的路线,以便他们在该地区悠闲地游览。分析结果揭示了一种路径图结构,与圆形图结构相比,这种路径图结构在引导游客穿越空间方面表现出更高的效率。这条旅游路线的意义超出了旅游业本身。它有可能加强旅游活动的组织,使利益相关者能够管理和调节游客流量。此外,它还为推广和开发该地区往往被低估的旅游目的地提供了机会,这反过来又会对当地经济产生积极影响。总之,将图论融入建筑和城市设计方法中,可以丰富旅游方法,并为空间优化提供一个整体视角。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimized Distance-Based Algorithm for Cloud Space—Tourist Route Recommendation for Heritage Town, Pondicherry, India
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematical Problems in Engineering
Mathematical Problems in Engineering 工程技术-工程:综合
CiteScore
4.00
自引率
0.00%
发文量
2853
审稿时长
4.2 months
期刊介绍: Mathematical Problems in Engineering is a broad-based journal which publishes articles of interest in all engineering disciplines. Mathematical Problems in Engineering publishes results of rigorous engineering research carried out using mathematical tools. Contributions containing formulations or results related to applications are also encouraged. The primary aim of Mathematical Problems in Engineering is rapid publication and dissemination of important mathematical work which has relevance to engineering. All areas of engineering are within the scope of the journal. In particular, aerospace engineering, bioengineering, chemical engineering, computer engineering, electrical engineering, industrial engineering and manufacturing systems, and mechanical engineering are of interest. Mathematical work of interest includes, but is not limited to, ordinary and partial differential equations, stochastic processes, calculus of variations, and nonlinear analysis.
期刊最新文献
Flower Recognition Algorithm Based on Nonlinear Regression of Pixel Value On Spectral Radius and Energy of a Graph with Self-Loops Influence of Structural Parameters of Gearbox Seal System of Electrical Multiple Units on Seal Performance Implementation of Bioelectrical Impedance Measuring Instrument Based on Embedded System Analyzing Lower Limb Dynamics in Human Gait Using Average Value-Based Technique
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1