• 대한공간정보학회지
• /
• 제18권4호
• /
• pp.101-107
• /
• 2010

본 연구의 목적은 벡터 도메인 안에 대규모 도로 선형 사상을 대상으로 실시간 데이터 변경, 관리가 가능한 네트워크의 다중 표현 데이터베이스 모델을 구축하는 것이다. 즉, 최상위 레벨의 네트워크 데이터로부터 이에 대응하는 하위 베이스 네트워크 데이터로 순차적으로 데이터 통합과 자동 매칭을 수행하는 상의하달 방식(top-down)을 기초로 하는 프레임워크를 제시하며, 이를 통해 변화 가능한 축척(variable-scale)의 지도를 생성하는 모델을 제안하였다. 구현된 MRDB(Multi-Resolution Database) 모델을 차량 항법 서비스에 적용하여 실제 동적 경로 안내 시스템에 활용 가능함을 확인할 수 있었다.

• 한국실내디자인학회논문집
• /
• 제14권5호
• /
• pp.236-244
• /
• 2005

This study investigates the effects of the spatial elements of the mulit-purpose commercial complex on visitors' circulation pattern and wayfinding by employing method of space syntax, observation, and interview survey. Two commercial complexes were investigated; Techno-mart represented a vertical type and COEX mall rendered a horizontal one. Analysis of the spatial elements using space-syntax method provided a base line for comparing analyses by the two other methods. Analysis of the interview additionally survey identified the factors affecting wayfinding behavior and contributing satisfaction. The findings suggest that level of the effects of the spatial configuration on visitors' circulation pattern is greater in Techno-mart(vertically oriented) than COEX(horizontally). In COEX, for instance, specific route that connects sub-way station and cinema complex carries far more traffic than main route, even though the main route indicates higher degree of integration of spatial configuration. Similar with observation, the degree of integration is corresponding with the satisfaction and easiness of wayfinding behavior In COEX, specific place and feature seem to have more effects on visitors' wayfinding behavior and circulation pattern than the level of integration of spatial configuration.

• 한국측량학회지
• /
• 제32권6호
• /
• pp.637-650
• /
• 2014

Geospatial research on emergency response in multi-level micro-spatial environments (e.g., multi-story buildings) that aims at understanding and analyzing human movements at the micro level has increased considerably since 9/11. Past research has shown that reducing the time rescuers needed to reach a disaster site within a building (e.g., a particular room) can have a significant impact on evacuation and rescue outcomes in this kind of disaster situations. With the purpose developing emergency response systems that are capable of using complex real-time geospatial information to generate fast-changing scenarios, this study develops a Spatiotemporal Optimal Route Algorithm (SORA) for guiding rescuers to move quickly from various entrances of a building to the disaster site (room) within the building. It identifies the optimal route and building evacuation bottlenecks within the network in real-time emergency situations. It is integrated with a Ubiquitous Sensor Network (USN) based tracking system in order to monitor dynamic geospatial entities, including the dynamic capacities and flow rates of hallways per time period. Because of the limited scope of this study, the simulated data were used to implement the SORA and evaluate its effectiveness for performing 3D topological analysis. The study shows that capabilities to take into account detailed dynamic geospatial data about emergency situations, including changes in evacuation status over time, are essential for emergency response systems.

• 한국기계연구소 소보
• /
• 통권14호
• /
• pp.145-155
• /
• 1985

The recent trend in shipbuilding technology is toward development of highly economical vessels of which construction and operation costs are minimized, whereas cargo transport capacity is maximized. But, most of the vessel which are now operated by some of the nation's shipping companies are uneconomical ones built before oil crisis and consequently the companies are suffering from long-lasted deficit problem. In this paper, derivation study of optimum vessel for multi purpose cargo vessel on south-East Asian trade route is carried out to solve this problem. The Required Freight Rate is used as a measure of merits.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.99-104
• /
• 2002

This paper addresses a problem of machining route selection and determination of input quantity with yield in multi-stage flexible flow system. The problem is formulated as nonlinear programing and the proposed model is solved by genetic algorithm(GA) approach. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound for the same problem.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (C)
• /
• pp.596-598
• /
• 2003

다중홉 (multi-hop) 이동 애드혹 앙 (ad-hoc network)에서 무결정성 (seamless) 통신이 이루어지기 위해 효율적인 라우팅 프로토콜을 필요로 한다. AODV (Ad-hoc On-demand Distance Vector) 라우팅 프로토콜은 단지 먼저 수신된 경로 요구 (route request) 메시지가 전달되어 온 경로만을 고려 할 뿐, 경로 탐색 과정에 있어 각 노드에서의 에너지 사용량을 반영하지 못하고 있다. 이 논문에서는 AODV 라우팅 프로토콜에 기존에 제안된 MTPR (Minimum Total Transmission Power Routing) 방법을 효율적으로 적용할 수 있는 경로 탐색 방법을 제안한다.

• 대한교통학회:학술대회논문집
• /
• 대한교통학회 2000년도 제37회 학술발표회논문집
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

• 드라이브 ㆍ 컨트롤
• /
• 제21권1호
• /
• pp.46-52
• /
• 2024

The advancement of autonomous driving technology has heightened the importance of Autonomous Mobile Robotics (AMR) within smart factories. Notably, in tasks involving the transportation of heavy objects, the consideration of weight in route optimization and path planning has become crucial. There is ongoing research on local path planning, such as Dijkstra, A^*, and RRT^*, focusing on minimizing travel time and distance within smart factory warehouses. Additionally, there are ongoing simultaneous studies on route optimization, including TSP algorithms for various path explorations and on minimizing energy consumption in mobile robotics operations. However, previous studies have often overlooked the weight of the objects being transported, emphasizing only minimal travel time or distance. Therefore, this research proposes route planning that accounts for the maximum payload capacity of mobile robotics and offers load-optimized path planning for multi-destination transportation. Considering the load, a genetic algorithm with the objectives of minimizing both travel time and distance, as well as energy consumption is employed. This approach is expected to enhance the efficiency of mobility within smart factories.

• 산업경영시스템학회지
• /
• 제36권4호
• /
• pp.138-145
• /
• 2013

A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forward and backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solving strategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completion times. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of common area needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number of vehicles.

• 산업경영시스템학회지
• /
• 제27권1호
• /
• pp.64-73
• /
• 2004

This paper addresses a problem of machining determination of input quantity in a multi-stage flexible flow system with non-identical parallel machines considers a subcontracting, machining restraint, and machine yield. We develop a nonlinear programing with the objective of minimizing the sum of in-house processing cost and subcontracting cost. To solve this model, we introduce a single-processor parallel genetic algorithm(SPGA) to improve a weak point for the declined robustness of simple algorithm(SGA). The efficiency of the SPGA is examined in comparison with the SGA for the same problem. In of examination the SPGA is to provide the excellent solution than the solution of the SGA.