• Journal of the Korean earth science society
• /
• v.43 no.5
• /
• pp.647-658
• /
• 2022

The purpose of this study is to analyze students' learning characteristics regarding spatial ability, orienteering ability and earth science content learning ability and their relationship through development and application of earth science activities using orienteering. The programme aims to improve students' spatial ability using orienteering activity which requires spatial ability. Topics in the programme included map, compass, contour, movement of celestial, and constellation application. Students were to orienteer in the field using the method they learned in class. This programme was applied to five 7th graders. The results are, first, students who have positive attitude toward science and do well at school tended to perceive their orienteering ability high. Second, all parts of spatial ability, spatial visualization, spatial orientation, spatial relation were used during orienteering, especially spatial visualization and spatial orientation. The relationship between spatial ability, orienteering ability, and earth science content learning abilities was not clear. However, orienteering ability and earth science content learning ability were in similar tendency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.101-102
• /
• 2017

An orienteering is a sport that play with a map, a compass and a point map. However, it is difficult to measure the number of steps and the play time accurately. In this paper, we develop the Orienteering application to integrate the essential function for the orienteering sport. since the integrated UI display the map, the compass and the number of step at the same time, it is easy for an user to watch the progress of the orienteering and improve the accuracy by measuring the steps and the play time.

• Management Science and Financial Engineering
• /
• v.17 no.1
• /
• pp.79-94
• /
• 2011

Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.5
• /
• pp.667-673
• /
• 2019

We present an orienteering problem with unknown stochastic reward(OPUSR) model for persistent monitoring tasks with unknown event probabilities at each point of interest. Prior studies on orienteering problem for persistent monitoring task assume that rewards and event probabilities are known as a prior. In this paper, we propose a stochastic reward model with unknown event statistics and a path re-planning algorithm based on Bayesian reward inference. Experiments demonstrate the efficiency of our method.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.198-206
• /
• 2013

The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.303-311
• /
• 2007

This study deals with a type of vehicle routing problem faced by manager of some department stores during peak sales periods. The problem is to find a set of traveling paths of vehicles that leave a department store and arrive at a destination specified for each vehicle after visiting customers without violating time and capacity constraints. The mathematical model is formulated with the objective of maximizing the sum of the rewards collected by each vehicle. Since the problem is known to be NP-hard, a heuristic algorithm is developed to find the solution. The performance of the algorithm is compared with the optimum solutions obtained from CPLEX for small size problems and a priority-based Genetic Algorithm for large size problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.573-576
• /
• 2006

기존의 인폼드 검색 모델에서 자원 보유 피어의 검색 결과는 검색 과정에서 선택된 피어들 각각의 라우팅 결정 정보로 저장되는데, 자원 적중률에 따라 다음 피어를 선택할 때 주요 결정 요인으로 작용한다. 이러한 라우팅 결정 정보를 이용하여 검색 트래픽과 검색 성공률 등의 측면에서 기존의 Random Walks 등에 비해 효과적인 성능 평가 결과를 보인 LTO(Leveled The Orienteering) 검색 알고리즘은 검색 과정에서의 라우팅 경로가 편중되어 있어 해당 노드들에 검색 부하 집중 경향을 보인다. 이에 본 논문에서는 검색 적중 빈도에 다라 LTO 검색 알고리즘이 검색 과정상에서 라우트 대상 노드들의 성능을 고려한 적응적 P2P 검색 알고리즘으로 확장 제안한다. 제안한 알고리즘의 성능 평가 결과 노드들의 검색 부하 집중률과 자원 검색 노드의 검색 성공률 측면에서 적절한 타협점에서 동작함을 확인하였다.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.407-415
• /
• 2009

In this research, to identify the degree of preference and participation in leisure sports, over 19-year-old adults living in the capital region were collected as subjects, and among them, 250 persons were chosen by purposive sampling method. Using SPSSWIN 16.0, I analyzed the collected data by reliability analysis, paired sample t-test, PPA(preference performance analysis) method. The conclusion is the following. First, the first quadrant showed wind surfing, skins-cuba, water-ski, and yacht, and as a result of this, it is necessary to improve the degree of participation in this field, the second quadrant showed golf, racketball snow board, ski, fishing, and climbing, and these field need to specific attention to maintain continuous attention, for they have a great deal of attendance, the third quadrant, showed water sleigh, cart, balloon, sky-diving, orienteering, hang gliding, model plane, and survival game. As the degree of preference and participation in these sports is low, it is recommended that more effort should be made for these sports. Finally, in the forth quadrant, there are tracking, mountain bike, inline skates, rafting, and cycling. As it's the participation is high, while that of preference is low, it is important to maintain the policy of the participation in leisure sports. Sencondly, the degree of preference and participation in leisure sport activicties acording to socio demographic characteristics differentiate.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.420-424
• /
• 2009

In this research, to identify the degree of preference and participation in leisure sports, over 19-year-old adults living in the capital region were collected as subjects, and among them, 250 persons were chosen by sampling. Using SPSSWIN 16.0, I analyzed the collected data by Reliability Analysis, Paired Sample T-Test, and IP A method. The conclusion is the following. First, the first quadrant showed skins-cuba, water-ski, wind surfing, and clay-pigeon shooting, and as a result of this, it is necessary to improve the degree of participation in this field. Secondly, the second quadrant showed golf, snow board, ski, fishing, and climbing, and these field need to specific attention to maintain continuous attention, for they have a great deal of attendance. Thirdly, in the third quadrant, there are water sleigh, cart, balloon, sky-diving, orienteering, hang gliding, model plane, and survival game. As the degree of preference and participation in these sports is low, it is recommended that more effort should be made for these sports. Finally, in the forth quadrant, there are tracking, mountain bike, inline skates, rafting, and cycling. As it's the participation is high, while that of preference is low, it is important to maintain the policy of the participation in leisure sports. In conclusion, for the sports which is preferred that is difficult to join right now, most of all, it is necessary that we should pay attention to and invest the social infrastructure in which main items cannot be joined now.