Urban Repair Routes Toward Cultural Tourism:A Case Study of the Old Town of Jiazhou in Leshan,Sichuan

Cultural tourism is one of the directions of urban transformation and development,but there are still problems such as fragmentation of resource development models.Urban repair,as a comprehensive,systematic,and holistic updating project under the guidance of the problem,is an important way to promote the sustainable development of urban cultural tourism by paying attention to the connotative development of the "stock" of urban scale.Based on the analysis of the western urban cultural renaissance concept,this study closely followed the actual situation of cultural tourism development in the old city of China,re-examined the scale,goals and values of the current urban repair research to find breakthroughs for urban repair,put forward basic routes for the renewal of the built-up area,and analyzed the project practice of the Old Town of Jiazhou,with a view to providing a new "repair" model for promoting cultural tourism in small and medium-sized cities in China.

Tourism Route Recommendation Based on A Multi-Objective Evolutionary Algorithm Using Two-Stage Decomposition and Pareto Layering

Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions problems,which leads to uneven distribution and weak diversity of optimization solutions of tourism routes.Inspired by these limitations,we propose a multi-objective evolutionary algorithm for tourism route recommendation(MOTRR)with two-stage and Pareto layering based on decomposition.The method decomposes the multiobjective problem into several subproblems,and improves the distribution of solutions through a two-stage method.The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method.The neighborhood is determined according to the weight of the subproblem for crossover mutation.Finally,Pareto layering is used to improve the updating efficiency and population diversity of the solution.The two-stage method is combined with the Pareto layering structure,which not only maintains the distribution and diversity of the algorithm,but also avoids the same solutions.Compared with several classical benchmark algorithms,the experimental results demonstrate competitive advantages on five test functions,hypervolume(HV)and inverted generational distance(IGD)metrics.Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing,our proposed algorithm shows better distribution.It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity,so that the recommended routes can better meet the personalized needs of tourists.

Route maintenance of on-demand routing protocol in mobile ad hoc networks

In mobile ad hoc networks （MANETs）, if a mnltihop route breaks, route maintenance is typically performed to establish a new route which causes high control overhead and long packet delay. To decrease the time of recovery and the overhead of maintenance, a new route maintenance mechanism in which the maintenance is confined to the vicinity of the broken link is proposed. This mechanism patches broken route through some other nodes in which only nodes near the broken link（s） may need to be substituted and the rest of nodes can be retained on the route. The broken link can be repaired without considering its relative position in the whole path, so the abihty of dealing with hnk failure is improved obviously. Simulation results show that the proposed strategy improves network performance significantly, such as in merits of control overhead and packet delay.

Designing Tourism Routes From Tourism Behaviors and Needs of the Tourists in Chaiyaphum Province, Thailand

The aim of this research was to study tourism behaviors and needs for tourism of Thai tourists in Chaiyaphum province in order to bring their tourism behaviors and needs to design tourism routes which are suitable and able to meet the needs of tourists. Questionnaire survey was used to collect data from 400 tourists who traveled to visit Chaiyaphum province. Accidental sampling technique was applied to select the sample. Percentage, mean, and standard deviation were used to analyze the data. The research results revealed that tourists were mostly male with 26-40 years of age and aimed to use spare time with their own families or friends. Most tourists traveled with their families （husband/wife/son/daughter）, because they attach great importance to creating a good relationship with the members of their families in order to show their love and warmth among members within the families. Most tourists took ordy one day to visit Chaiyaphum province （travel there and back in a day）. Tourists＇ needs for visiting tourism places in Chaiyaphum province were as follows： （1） to visit popular and famous tourism places; （2） to visit natural tourism places; and （3） to visit historical and cultural tourism places.

A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

Unique Tourist Routes in Chengde

本文根据承德市旅游发展现状 。

Ants-Based On-Demand Routing Algorithm for Mobile Ad Hoc Networks

An ants-based on-demand routing algorithm （AORA） specialized for mobile ad hoc networks is proposed. AORA measures the network＇s traffic information including delivery time, route energy etc. by the continuous delivery of data packets, then calculates the compositive parameter for each route which can be seen as the stigmity and uses it to choose the comparatively optimal route in real time. To adjust the weight of each traffic information, the algorithm can meet the different demand of the network＇s user. Multipath source self repair routing （MSSRR） algorithm and dynamic source routing （DSR） can be seen as the special samples of AORA. The routing overhead is not increased in this algorithm. By using simulation, it can be seen that the performance of AORA is better than that of DSR in all scenarios obviously, especially the delivery fraction is increased by more than 100 96.

On the Performance of Traffic Locality Oriented Route Discovery Algorithm with Delay

In MANETs, traffic may follow certain pattern that is not necessarily spatial or temporal but rather to follow special needs as a part of group for collaboration purposes. The source node tends to communicate with a certain set of nodes more than others regardless of their location exhibiting traffic locality where this set changes over time. We introduce a traffic locality oriented route discovery algorithm with delay, TLRDA-D. It utilises traffic locality by establishing a neighbourhood that includes the most likely destinations for a particular source node. The source node broadcasts the route request according to the original routing used. However, each intermediate node broadcasts the route request with a delay beyond this boundary to give priority for route requests that are travelling within their own source node’s neighbourhood region. This ap-proach improves the end-to-end delay and packet loss, as it generates less contention throughout the network. TLRDA-D is analysed using simulation to study the effect of adding a delay to route request propagation and to decide on the amount of the added delay.

Topology Control for Ad-Hoc Networks: A Comprehensive Review for Table Driven and On-Demand Routing Protocols

Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is that every terminal of an ad-hoc network is also functioning as a network router. In this paper we provide a comprehensive review about the principles and mechanisms of routing protocols used in ad-hoc networks. For comparison purposes, we discuss some relevant technical issues of two well-known routing strategies, namely On-Demand (Proactive routing) and Table-Driven (Reactive routing). In particular, focus our attention on two major and well-known routing protocols: AODV (Ad-hoc On-Demand Distance Vector Protocol) and OLSR (Optimized Link State Routing Protocol). Our study has no intention to suggest any definite solution for any ad-hoc network, because it is the case depending on dictated by the nature and varying factors of networks. Instead, we demonstrate our major perception and describe general models that may assist us while modeling a given network.

Innovative Perspectives to Apply Blockchain Model for the Saints Cyril and Methodius and Saint Sophronius of Vratsa Historical Sights in the Context of European Cultural Routes

The focus of the study is the implementation of blockchain as an emerging technology that can radically improveoperations when it comes to cultural heritage and in particular in the context of the European cultural routes, andcan create new opportunities for innovation. The development of blockchain technologies in the last few yearsinvolves examples of networks of various organizations that collaborate to create value and improvecompetitiveness. This type of network could provide together with local stakeholders and small- and medium- sizeenterprises (SMEs) on local markets additional assets as to the goods and services between the participants.

High efficiency AODV routing protocol based on link availability prediction in MANETs

To cope with the problem of low protocol efficiency of the standard ad hoc on-demand distance vector （AODV） routing protocol with the periodic Hello message broadcast mechanism, a new link availability prediction based strategy is introduced to reduce the amount of Hello messages. In this strategy, a novel wireless link availability prediction model under line-of-sight （LOS） propagation environments is proposed based on which the parameter of Hello Interval in AODV can be dynamically adjusted to achieve the goal of changing the frequency of Hello message broadcasts under different link stability degrees. Simulation results demonstrate that, compared with the standard AODV with the periodic Hello message broadcast mechanism, the proposed protocol effectively reduces unnecessary control message overhead and greatly improves the performance in terms of end-to-end delay and efficiency.

A reliable and high throughput hybrid routing protocol for vehicular ad-hoc network

Due to highly dynamic topology caused by fast moving nodes the Vehicular ad-hoc network (VANET) results in the existence of transient communication links, which degrade the performance of developed protocols. Established routes frequently become stale, and existing communication flows are interrupted, incurring delay and additional overhead. In this paper we propose a novel hybrid routing protocol, which is the combined between of the table-driven routing and on-demand routing in VANET. It makes fast convergence in routing process, minimal drop links, making more reliable links, and adaptive with changing of VANET topology. With neighbor table is updated instantaneously, and using strong neighbor for routing process makes route discovery process start whenever it received requirement, and through using route mechanism appropriately it reduces significantly route overhead at each node. The simulation results illustrate the outstanding properties of our proposed routing protocol.

Improved Multicast Protocol Based on Routing Grid

Problems may occur in ad hoc network when packets are being multieast. Global routing structure may also produce extra processing cost because the dynamic topology will introduce frequent exchange of routing vector or routing state between nodes. To deal with these problems an improved multicast protocol based on routing grid is designed to ensure that the muhicast packets could be sent to destination through dynamic topology network using muhicast routing grid.

Subarea Tree Routing (STR) in Multi-hop Wireless Ad hoc Networks

Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing subarea trees, and finally each node either joins in a subarea tree or become an interconnect node. STR belongs to hierarchical routing protocol and does not attempt to consistently maintain routing information in every node. Furthermore, through the use of tree’s intrinsic routing function, the STR protocol exhibits hybrid behavior of proactive and on-demand routing protocols. We prove the correctness of STR, and our simulation results show that the pro-posed scheme achieves lower route discovery delays, lower route discovery load and better performance of normalized routing load in large, mobile, ad hoc networks as compared with AODV.

Food Tourism Planning Support System within Urban Sightseeing Areas in Japan

The present study aimed to design, develop, operate and evaluate a tourism planning support system that can be used to decide on places to eat lunch and dinner, sightseeing spots to visit along the way, and routes for visiting these destinations. This system was developed by integrating a web geographic information system (Web-GIS) and a sightseeing plan creation system (an eatery search system and a sightseeing route creation system). Additionally, the system was operated for one month in Central Yokohama City of Kanagawa Prefecture in Japan, and the total number of users was 79. Based on the results of the web questionnaire survey, user evaluations were particularly high for the function of sightseeing spot selection and the function of display of sightseeing plan information, and also for the entire system. From the results of the access analysis of users’ log data, the total number of sessions in the system was 263, 67% used mobile devices, and smartphones were used most frequently. Therefore, it is evident that the system was used by different types of devices just as it was designed for, and that the system was used according to the purpose of the present study, which is to support the food tourism planning of users.

乡村振兴背景下智慧乡村旅游人才培养路径研究

乡村振兴背景下,培养智慧乡村旅游人才具有现实而长远的意义。智慧乡村旅游人才是典型的复合型人才,应具备情感素养、管理素养、技术素养、创新素养等多维度素养。为此,要抢抓乡村振兴战略机遇,加大智慧乡村旅游人才的培养,为乡村旅游高质量发展转换动能。

基于用户兴趣模型的个性化旅游线路生成建模研究

针对个性化旅游线路生成过程中用户个人喜好分析环节较为薄弱,依照用户兴趣分析结果生成路线景点过于分散,旅游线路景区覆盖率较低的问题,提出一种基于用户兴趣模型的个性化旅游线路生成建模方法。获取用户数据,并按照显性兴趣、隐性兴趣的分类方式设定数据标签,完成数据预处理。根据关联规则结合数据预处理结果,构建用户兴趣模型,分析用户对部分旅游目的地的兴趣值以及用户的旅游行为特征。基于用户兴趣模型的个性化旅游线路生成建模方法设计完成。实验结果证实,所提模型可有效克服用户个人喜好分析问题,提升旅游线路景区覆盖率。

景区分时预约策略下的旅游线路优化方法

为提升游客的旅游体验和景区的服务水平,探讨分时预约策略下游客游览决策行为,分析游客拥挤-调适行为对游线设计的影响及其机理.考虑游客分时预约时段选择下入园时间和游览总时间的变化、可游览景点数等约束,以游客总体拥挤感知最小、游线总体满意度最大和景点间总体走行时间最小为优化目标,构建分时预约策略下的多目标景区路线优化模型,并以颐和园为例进行实证和线路优度评价.结果表明颐和园上午预约时段(06:00—12:00)与下午预约时段(12:00—19:00)的推荐游线优度值分别为75.09、69.00,均高于颐和园推荐游线,表明优化模型精度较高.研究可为合理制定景区分时预约等客流调控措施、旅游线路优化设计、均衡景区客流的时空分布提供支撑.

市场对新疆红色旅游选择偏好研究——基于旅游流的角度

市场选择偏好是红色旅游线路开发的基础。本文以来疆参与色旅游活动的游客为研究对象,通过对其旅游游记的分析,建立红色旅游流非对称矩阵。对新疆红色旅游流网络结构特征进行全面分析,从而从旅游流的角度对新疆红色旅游景点和线路的市场欢迎程度进行探索,发现了以下结论:(1)新疆红色旅游流具有显著的分布不均现象,即市场对新疆红色旅游景点和红色旅游路径的选择具有显著的不均衡性。(2)新疆红色旅游流各关键节点扩散-聚集类型差异显著,即不同的红色旅游景点在旅游市场的选择上有显著的先后顺序。(3)新疆红色旅游流具有明显的子群聚集效应,即市场对新疆红色旅游景点的选择具有显著的类型差异。并在此基础上提出了一些建议。

基于虚拟行为实验的景区旅游线路设计方法研究

景区旅游线路设计对提高游客体验和提升景区规划管理水平具有重要价值,并一直是旅游业界和学术界关注的热点问题。文章基于虚拟地理实验和最大旅游效益原则,以景区演艺节目时间调整为切入点,设计实验场景,采用虚拟行为实验方法,探讨景区旅游线路设计的新思路和新方法。文章以清明上河园景区的空间场景及演艺节目为例,开展实验研究。结果表明:1)虚拟旅游场景中,游客仍然追求最小的旅游时间比和最大的信息收集量的目标;2)演艺节目优化场景下,旅游时间比、节目观看完整度和观看率等指标,均优于实际节目场景;3)虚拟行为实验方法在景区线路设计中具有可行性和合理性。该研究不仅丰富了旅游线路设计的理论方法,同时,也拓展了旅游地理学的虚拟空间人地关系研究领域,为旅游地景区规划管理水平提升提供了实践参考。