• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.2
• /
• pp.83-92
• /
• 2024

Currently, various countries are enhancing accessibility by providing bicycle rental services for convenient usage within daily life. This paper introduces the Nubija public bicycle service in Changwon, South Korea, aiming to address the imbalance between demand and supply of Nubija bicycles. We propose a Highest Priority Reallocation Scheme to prevent this disparity. Comparing this scheme with others that randomly visit terminals for redistribution and those that prioritize terminals closest to current locations, we illustrate its superior efficiency. Our proposed Highest Priority Reallocation Scheme prioritizes terminals with the highest demand and shortest distances nearby. Through experiments, our proposed scheme demonstrates superior performance, with the lowest average of 817.44km distance and an average of 6437.45 times, i.e., 88.14% successful rental occurrences. This highlights its superiority over the other two algorithms.

• Journal of the Korea Computer Graphics Society
• /
• v.30 no.3
• /
• pp.159-169
• /
• 2024

This paper proposes a new real-time fire monitoring and evacuation navigation system by integrating Augmented Reality (AR) technology with Internet of Things (IoT) technology. The proposed system collects temperature data through IoT temperature measurement devices installed in buildings and automatically transmits it to a MySQL cloud database via an IoT platform, enabling real-time and accurate data monitoring. Subsequently, the real-time IoT data is visualized on a 3D building model generated through Building Information Modeling (BIM), and the model is represented in the real world using AR technology, allowing intuitive identification of the fire origin. Furthermore, by utilizing Vuforia engine's Device Tracking and Area Targets features, the system tracks the user's real-time location and employs an enhanced A^* algorithm to find the optimal evacuation route among multiple exits. The paper evaluates the proposed system's practicality and demonstrates its effectiveness in rapid and safe evacuation through user experiments based on various virtual fire scenarios.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.139-149
• /
• 2004

As the expansion of road capacity has become impractical in many urban areas, congestion pricing has been widely considered as an effective method to reduce urban traffic congestion in recent years. The principal reason is that the congestion pricing may lead the user equilibrium (UE) flow pattern to system optimum (SO) pattern in road network. In the context of network equilibrium, the link tolls according to the marginal cost pricing principle can user an UE flow to a SO pattern. Thus, the pricing method offers an efficient tool for moving toward system optimal traffic conditions on the network. This paper proposes a continuous network design program (CNDP) in network equilibrium condition, in order to find optimal congestion toll for maximizing net economic benefit (NEB). The model could be formulated as a bi-level program with continuous variable(congestion toll) such that the upper level problem is for maximizing the NEB in elastic demand, while the lower level is for describing route choice of road users. The bi-level CNDP is intrinsically nonlinear, non-convex, and hence it might be difficult to solve. So, we suggest a heuristic solution algorithm, which adopt derivative information of link flow with respect to design parameter, or congestion toll. Two example networks are used for test of the model proposed in the paper.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.1D
• /
• pp.17-23
• /
• 2009

Due to the rapid increase of vehicles on the street, Korean society is facing worsening traffic congestions and air pollutions. Also, the oil price pickup has led to increasing need for the use of public transportation. In particular, transfering among public transportation may be a main factor for riders who are commuting for a long distance journey. In order to ensure such connectivity, transfer stations have been actively built in Korea. However, it would be necessary to shift those vehicles, from cars to public transportations by enhancing the users' satisfaction with public transportation through strategies for minimizing the users' waiting cost by building an efficient connective system between transportation modes as well as the preparation of aforementioned transfer stations. Therefore, this study aimed to develop an algorithm for minimizing transferring passengers' waiting costs based on service intervals of linked buses within the transfer facilities. In order to adjust the service interval, we calculated the total costs, involving the wait cost of transfer passengers and bus operation costs, and produced an allocation interval, that would minimize the costs. We selected a KTX departing from Seoul station, and a No. 6014 bus route in Gwangmyeong city where it starts from the Gwangmyeong station in order to for verifying the model. Then, the transfer passengers' total waitting cost was reduced equivalent to the maximum of 212 minutes, and it revealed that the model performed very effectively.

• Journal of Korean Society of Transportation
• /
• v.29 no.2
• /
• pp.91-100
• /
• 2011

Hub network design for freight transportation is a decision process that determines hub locations together with freight transportation routes among shippers so as to ultimately minimize total logistics cost. This study presents the optimal location of hubs by strict hub network design policy with single allocation, which overcomes the limitation of Kim et al. (2008) that does not allow direct transportation among shippers. The greedy-interchange algorithm is employed for hub location decision process, and EMME/2 is adopted for the route searching process. Application of the processes to the nationwide highway network shows that the best hub locations in order are Seoul metropolitan, GyeongNam, Chung-nam, Jeon-Nam, Gyeong-Buk, Chung-Buk, and the locations are concentrated on the Seoul-Busan corridor. The strict hubnetwork design policy with single allocation increases the transportation distance but decreases the transportation cost by passing through the hubs instead of direct transportation. The reduction in total transportation cost can be achieved as the number of hubs increases, but the amount of the reduction gradually decreases because the cost reduction from the decrease in detour transportation distance between non-hubs and hubs becomes less than the discount reduction from dispersion of inter-hubs transportation volumes.

• Journal of Intelligence and Information Systems
• /
• v.29 no.2
• /
• pp.101-114
• /
• 2023

In the wartime, aircraft carrying out a mission to strike the enemy deep in the depth are exposed to the risk of being shoot down. As a key combat force in mordern warfare, it takes a lot of time, effot and national budget to train military flight personnel who operate high-tech weapon systems. Therefore, this study studied the path problem of predicting the route of emergency escape from enemy territory to the target point to avoid obstacles, and through this, the possibility of safe recovery of emergency escape military flight personnel was increased. based problem, transforming the problem into a TSP, VRP, and Dijkstra algorithm, and approaching it with an optimization technique. However, if this problem is approached in a network problem, it is difficult to reflect the dynamic factors and uncertainties of the battlefield environment that military flight personnel in distress will face. So, MDP suitable for modeling dynamic environments was applied and studied. In addition, GIS was used to obtain topographic information data, and in the process of designing the reward structure of MDP, topographic information was reflected in more detail so that the model could be more realistic than previous studies. In this study, value iteration algorithms and deterministic methods were used to derive a path that allows the military flight personnel in distress to move to the shortest distance while making the most of the topographical advantages. In addition, it was intended to add the reality of the model by adding actual topographic information and obstacles that the military flight personnel in distress can meet in the process of escape and escape. Through this, it was possible to predict through which route the military flight personnel would escape and escape in the actual situation. The model presented in this study can be applied to various operational situations through redesign of the reward structure. In actual situations, decision support based on scientific techniques that reflect various factors in predicting the escape route of the military flight personnel in distress and conducting combat search and rescue operations will be possible.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.67-81
• /
• 2005

Recently, the interest and research on the development of new application services such as the Location Based Service and Telemetics providing the emergency service, neighbor information search, and route search according to the development of the Geographic Information System have been increasing. User's search in the spatio-temporal database which is used in the field of Location Based Service or Telemetics usually fixes the current time on the time axis and queries the spatial and aspatial attributes. Thus, if the range of query on the time axis is extensive, it is difficult to efficiently deal with the search operation. For solving this problem, the snapshot, a method to summarize the location data of moving objects, was introduced. However, if the range to store data is wide, more space for storing data is required. And, the snapshot is created even for unnecessary space that is not frequently used for search. Thus, non storage space and memory are generally used in the snapshot method. Therefore, in this paper, we suggests the Hash-based Spatio-Temporal Clustering Algorithm(H-STCA) that extends the two-dimensional spatial hash algorithm used for the spatial clustering in the past to the three-dimensional spatial hash algorithm for overcoming the disadvantages of the snapshot method. And, this paper also suggests the knowledge extraction algorithm to extract the knowledge for the path search of moving objects from the past location data based on the suggested H-STCA algorithm. Moreover, as the results of the performance evaluation, the snapshot clustering method using H-STCA, in the search time, storage structure construction time, optimal path search time, related to the huge amount of moving object data demonstrated the higher performance than the spatio-temporal index methods and the original snapshot method. Especially, for the snapshot clustering method using H-STCA, the more the number of moving objects was increased, the more the performance was improved, as compared to the existing spatio-temporal index methods and the original snapshot method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1099-1104
• /
• 2007

The visual implementation of 3-dimensional national environment is focused by the requirement and importance in the fields such as, national development plan, telecommunication facility deployment plan, railway construction, construction engineering, spatial city development, safety and disaster prevention engineering. The currently used DEM system using contour lines, which embodies national geographic information based on the 2-D digital maps and facility information has limitation in implementation in reproducing the 3-D spatial city. Moreover, this method often neglects the altitude of the rail way infrastructure which has narrow width and long length. There it is needed to apply laser measurement technique in the spatial target object to obtain accuracy. Currently, the LiDAR data which combines the laser measurement skill and GPS has been introduced to obtain high resolution accuracy in the altitude measurement. In this paper, we first investigate the LiDAR based researches in advanced foreign countries, then we propose data a generation scheme and an algorithm for the optimal manage and synthesis of railway facility system in our 3-D spatial terrain information. For this object, LiDAR based height data transformed to DEM, and the realtime unification of the vector via digital image mapping and raster via exactness evaluation is transformed to make it possible to trace the model of generated 3-dimensional railway model with long distance for 3D tract model generation.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.101-107
• /
• 2016

Due to the recent advancement in digital imaging technology, development of intervention equipment has become generalize. Video arbitration procedure is a process to insert a tiny catheter and a guide wire in the body, so in order to enhance the effectiveness and safety of this treatment, the high-quality of x-ray of image should be used. However, the increasing of radiation has become the problem. Therefore, the studies to improve the performance of x-ray detectors are being actively processed. Moreover, this intervention is based on the reference of the angiographic imaging and 3D medical image processing. In this paper, we propose a guidance system to support this intervention. Through this intervention, it can solve the problem of the existing 2D medical images based vessel that has a formation of cerebrovascular disease, and guide the real-time tracking and optimal route to the target lesion by intervention catheter and guide wire tool. As a result, the system was completely composed for medical image acquisition unit and image processing unit as well as a display device. The experimental environment, guide services which are provided by the proposed system Brain Phantom (complete intracranial model with aneurysms, ref H+N-S-A-010) was taken with x-ray and testing. To generate a reference image based on the Laplacian algorithm for the image processing which derived from the cerebral blood vessel model was applied to DICOM by Volume ray casting technique. $A^*$ algorithm was used to provide the catheter with a guide wire tracking path. Finally, the result does show the location of the catheter and guide wire providing in the proposed system especially, it is expected to provide a useful guide for future intervention service.