• Proceedings of the Korea Association of Information Systems Conference
• /
• 2005.12a
• /
• pp.155-161
• /
• 2005

3자물류 시장의 급부상, 운송업계의 경쟁가열화, 운송경로의 다양화 및 글로벌화가 추구되면서 복합운송을 고려한 수송계획의 효율화가 필요한 실정이다. 본 연구에서는 국제물류에서 이루어지고 있는 복합운송을 고려한 최적수송계획 알고리즘을 제안하고자 한다. 화물과 경유지의 고려는 운송수단에 따라 동적으로 변화하는 NP-hard문제로써 가지치기 알고리즘(pruning algorithm)을 이용하여 문제를 단순화시키고, 운송수단을 제약조건으로 한 휴리스틱 최단경로 알고리즘을 제안하였다. 이를 부산항에서 로테르담항까지 실제로 사용되는 경로문제에 적용해 봄으로써 본 알고리즘의 효율성을 검증하였다.

• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.1-7
• /
• 2000

A quickest path in a network is a path that takes the shortest time to send the amount of data from the source node to the sink node. Martin and Santos presented a theorem on the quickest path by which a quickest path for the amount of data is determined. However, we find a counterexample to Martins and Santos' theorem. In this paper, we present the corrected theorem and give a revised algorithm for finding quickest paths.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.197-208
• /
• 2007

Enormously sized buildings are appearing world-wide with the advancement of construction techniques. Large-scaled and complicated structures will have increased difficulties for dealing with safety, and will demand well-matched safety measures. This research introduced up-to-date techniques and systems which are applied in buildings in foreign nations. Furthermore, it proposed s direct guidance plan for buildings in case of fire. Since it is possible to install wireless sensor networks which detect fires or effects of fire, the plan makes use of this information. Accordingly, the authors completed a direct guidance plan that was based on omnidirectional guidance lights. It is possible to select a route with concern about both time and capacity with a concept of a non-dominated path. Finally, case studies showed that quickest path algorithms were effective for guiding efficient dispersion routes and in case of restriction of certain links in preferred paths due to temperature and smoke, it was possible to avoid relevant links and to restrict demand in the network application. Consequently, the algorithms were able to maximize safety and minimize evacuation time, which were the purposes of this study.