• Title/Summary/Keyword: DESTINATION MANAGEMENT

Search Result 371, Processing Time 0.026 seconds

Dimensions of Smart Tourism and Its Levels: An Integrative Literature Review

  • Otowicz, Marcelo Henrique;Macedo, Marcelo;Biz, Alexandre Augusto
    • Journal of Smart Tourism
    • /
    • v.2 no.1
    • /
    • pp.5-19
    • /
    • 2022
  • Smart tourism is seen as a revolution in the tourism industry, involving innovative and transformative theoretical-practical approaches for the sector. As a result of its application in the tourist context, benefits can be seen such as more sustainable practices, greater mobility and better accessibility in destinations, evolution of processes and experiences of tourists. Much of this is achieved through the support of technological solutions. However, despite the immense expectations, and the many researches carried out on it, a literature summary regarding the dimensions that can be observed in each application of this smart tourism has not yet been proposed. Therefore, supported by the PRISMA recommendation, this research proposed to carry out an integrative review of the literature on smart tourism (in its different levels of application, such as the city, the destination and the smart tourism region), with the objective of mapping the dimensions that underlie it. Thus, from an initial scope of 833 intellectual productions obtained, inputs were found for the dimensions in 363 of them after a thorough analysis. The compilation of data obtained from these productions supported the proposition of 14 operational dimensions of smart tourism, namely: collaboration, technology, sustainability, experience, accessibility, knowledge management, innovation management, human capital, marketing, customized services, transparency, safety, governance and mobility. With this set of dimensions, it is envisaged that the implementation of smart tourism projects can present more comprehensive and assertive results. In addition, shortcomings and opportunities for new research that support the evolution of the theory and practice of smart tourism are highlighted.

Fast Handover Mechanism for Multi-Interface MIPv6 Environments and Performance Evaluation (다중 인터페이스 MIPv6 환경에서의 Fast Handover 방안 및 성능 분석)

  • Park, Man-Kyu;Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.12
    • /
    • pp.34-43
    • /
    • 2007
  • Recently, in addition to the sharp increase of mobile nodes, various kinds of wireless technologies are available for mobile nodes. If IPv6 technology is applied to the network, multi-homing terminals which have several public IP addresses on one interface will be common. Accordingly, there are many research activities on mobility management for multi-interface, multi-homming nodes. In this paper we propose an extended fast handover mechanism for multi-interface MIPv6 environments that uses multi-interface FBU (MFBU) message instead of the existing FBU message. The MFBU message has the "tunnel destination" mobility option that points a specific tunnel destination other than NAR, and "T" flag that indicates the existence of tunnel destination option. The proposed mechanism can improve the TCP performance by mitigating packet reordering during FMIPv6 handover that can cause unnecessary congestion control due to 3 duplicate ACKs. In this paper, we implemented a multi-Interface MIPv6 simulator by extending a single-interface MIPv6 simulator in NS-2, and showed that the performance of TCP traffic is improved by using the proposed multi-interface fast MIPv6.

Estimation of Sodium Hydroxide Waste Origin-Destination Matrices for Preventing Hazardous Material Transportation Disasters

  • Kim, Geun-Young;Jung, Tae-Hwa;Kim, Sang-Won
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.9 no.1
    • /
    • pp.73-79
    • /
    • 2009
  • Hazardous materials (HazMats) are substances that are flammable, explosive, toxic, or harmful, if released into the environment. Since the transportation of HazMats increases in many developed countries, HazMat transportation has the key function in the process of HazMat usage to trace information of production, storage, shipment, usage, and waste disposal. The Korean Ministry of Environment (KMOE) and the National Emergency Management Agency (NEMA) have developed many laws, regulations, and standards for hazardous materials. However, the Korean HazMat laws, regulations, and standards do not guarantee accurate information of HazMat origin-destination (O-D) shipments, though the HazMat O-D movement is the critical information in safety and security of HazMat transportation. The objectives of this research are: (1) to investigate emerging and recurrent issues in Korean HazMat transportation, and (2) to develop the estimation method of O-D matrices for hazardous materials under limited data sets. The sodium hydroxide waste shipment among forty candidate HazMats is selected as the sample research case. The growth-factor method is applied to estimate the 2005 O-D matrix of sodium-hydroxide waste shipment. The column-and-row factoring process is used to calibrate the estimated sodium-hydroxide O-D matrix. The result shows the applicability of the O-D estimation process for hazardous materials. The Sodium Hydroxide Waste Origin-Destination Matrix is obtained to trace routes and paths of the Sodium Hydroxide transportation.

Methods for a target-oriented travel demand management (목표지향 기종점 교통수요 관리모형연구)

  • Im, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.6
    • /
    • pp.167-176
    • /
    • 2009
  • Several travel demand management schemes have been used for controlling overloaded traffics on urban area. To maximize efficiency of the travel management, traffic manager has to set target level that we try to arrive in advance, and then to find optimal variable to attain this goal. In this regard, this paper presents two travel demand management models, expressed by mathematical program, and also presents their solution algorithms. The first is to find optimal travel demand for origin-destination (OD) pair, based on average travel time between the OD pair, and the second is based on the ratio of volume over capacity on congested area. An example is given to test the models.

Frequent Origin-Destination Sequence Pattern Analysis from Taxi Trajectories (택시 기종점 빈번 순차 패턴 분석)

  • Lee, Tae Young;Jeon, Seung Bae;Jeong, Myeong Hun;Choi, Yun Woong
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.39 no.3
    • /
    • pp.461-467
    • /
    • 2019
  • Advances in location-aware and IoT (Internet of Things) technology increase the rapid generation of massive movement data. Knowledge discovery from massive movement data helps us to understand the urban flow and traffic management. This paper proposes a method to analyze frequent origin-destination sequence patterns from irregular spatiotemporal taxi pick-up locations. The proposed method starts by conducting cluster analysis and then run a frequent sequence pattern analysis based on identified clusters as a base unit. The experimental data is Seoul taxi trajectory data between 7 a.m. and 9 a.m. during one week. The experimental results present that significant frequent sequence patterns occur within Gangnam. The significant frequent sequence patterns of different regions are identified between Gangnam and Seoul City Hall area. Further, this study uses administrative boundaries as a base unit. The results based on administrative boundaries fails to detect the frequent sequence patterns between different regions. The proposed method can be applied to decrease not only taxis' empty-loaded rate, but also improve urban flow management.

Analysis on Visiting Characteristics and Satisfaction according to Travel Routes of the Hallyeohaesang National Park's Visitors (한려해상국립공원 탐방객의 여행경로에 따른 탐방특성 및 만족도 분석)

  • Sim, Kyu-Won;Jang, Jin
    • The Journal of the Korean Institute of Forest Recreation
    • /
    • v.22 no.4
    • /
    • pp.23-33
    • /
    • 2018
  • The purpose of this research is to develop basic materials useful for the visiting management policies' establishment of national parks by analyzing the characteristics of and satisfaction with the visit to Hallyeohaesang National Park according to travel routes. For this, a total of 671 visitors to Hallyeohaesang National Park were recruited and field surveys were conducted three times in spring, summer, and fall from March to November 2017. The Hallyeohaesang national park's visitors were surveyed using a self-administered questionnaire about visitor characteristics (ex: motivation of visiting, travel routes, travel time, and participating activities, etc.) and satisfaction (ex: satisfaction with the visit, intention to revisit, and intention to recommend). SPSS 21.0 program was used for the statistical analysis: frequency analysis and independent-samples t-test analysis. As a result of analysis the motivation of visiting, those who visited only Hallyeohaesang National Park (a single destination) showed a mean value statistically significantly higher level in health improvement and vacation, relaxation, and healing compared to those who had visited or would visit other places along with Hallyeohaesang National Park (multi-destinations). Single destination visitors spent less time traveling from home to national park than multi-destinations visitors. Those who visited only Hallyeohaesang National Park (as a single destination) showed a mean value statistically higher satisfaction and intention to revisit and recommend. The results of this research have significance in providing basic materials to develop efficient park management policies by studying the characteristics of Hallyeohaesang National Park visitors.

POI Recommender System based on Folksonomy Using Mashup (매쉬업을 이용한 폭소노미 기반 POI 추천 시스템)

  • Lee, Dong Kyun;Kwon, Joon Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.13-20
    • /
    • 2009
  • The most of navigation services these days, are designed in order to just provide a shortest path from current position to destination for a user. Several navigation services provides not only the path but some fragmentary information about its point, but, the data tends to be highly restricted because it's quality and quantity totally depends on service provider's providing policy. In this paper, we describe the folksonomy POI(Point of interest) recommender system using mashup in order to provide the information that is more useful to the user. The POI recommender system mashes-up the user's folksonomy data that stacked by user with using external folksonomy service(like Flickr) with others' in order to provide more useful information for the user. POI recommender system recommends others' tag data that is evaluated with the user folksonomy similarity. Using folksonomy mahup makes the services can provide more information that is applied the users' karma. By this, we show how to deal with the data's restrictions of quality and quantity.

Point-to-Multipoint Minimum Cost Flow Problem with Convex Cost Function (콘벡스 비용함수를 갖는 점-대-다중점 최소비용 흐름문제)

  • 박구현;신용식
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.15-25
    • /
    • 2000
  • In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

  • PDF

A Genetic Algorithm for Real-Time Multicast Routing (실시간 멀티캐스트 라우팅을 위한 유전자 알고리즘)

  • 서용만;한치근
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.3
    • /
    • pp.81-89
    • /
    • 2000
  • The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

  • PDF

A VRP Model for Pickup and Delivery Problem (배달 및 수거를 고려한 차량운송계획모델)

  • 황흥석;조규성;홍창우
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.285-288
    • /
    • 2000
  • 본 연구는 Heuristic 알고리즘 및 유전자알고리즘(GA)을 이용하여 수거(Pickup) 및 배달(Delivery)을 동시에 고려한 통합차량운송계획 모델의 개발이다. 본 연구는 기존의 TSP의 문제를 확장 응용하였으며, 이는 한 Route에서 수거지(Origin)와 운반지(Destination)를 포함하는 수요들을 만족하도록 운반되어야 하는 문제이다. 이러한 통합차량경로계획문제(VRP Vehicle Routing Problem)를 해결하기 위한 접근방법으로 Heuristic 방법을 사용하였으며, 기존의 Saving 알고리즘과 유전자알고리즘(Genetic Algorithm)의 각종 연산자(Operators)들을 계산하여 사용한 TSP문제의 해를 본 연구의 해의 초기해로 사용하였으며 수거 및 배달문제의 특성을 고려하여 해를 구하였다. 본 연구의 결과를 다양한 운송환경에서, 거리산정방법, 가용운송장비 대수, 운송시간의 제한, 물류센터 및 운송지점의 위치 및 수요량 등 다양한 인자들을 고려한 통합시스템으로 프로그램을 개발하고 Sample 문제를 통하여 응용결과를 보였다.

  • PDF