• 대한안전경영과학회지
• /
• 제11권4호
• /
• pp.201-211
• /
• 2009

The types and quantities of Hazmat and Hazmat transportation are gradually increasing, keeping pace with industrialization and urbanization. At present the safety management for Hazmat transportation only considers reducing accident probability, but even when an accident involving Hazmat-carrying vehicles occurs, that is not regarded as a Hazmat-related accident if the Hazmats do not leak out from the containers carrying them. Thus the methods to reduce risk (Risk=Probability$\times$Consequence) have to be developed by incorporating accident probability and consequence. By using Geographic Information System (GIS), a technical method is invented and is automatically able to evaluate the consequence by different types of Hazmat. Thus this study analyzed the degree of risk on the links classified by the Hazmat transport pathways. In order to mitigate the degree of risk, a method of 7-step risk management on Hazmat transportation in railway industries can be suggested. (1st step: building up GIS DB, 2nd step: calculating accident probability on each link, 3rd step: calculating consequence by Hazmat types, 4th step: determination of risk, 5th step: analysis of alternative plans for mitigating the risk, 6th: measure of effectiveness against each alternative, and 7th step: action plans to be weak probability and consequence by the range recommended from ALARP). In conclusion, those 7 steps are used as a standardization method of optimum transportation routing. And to increase the efficiency of optimum transportation routing, optional route can be revise by verification.

• 산업경영시스템학회지
• /
• 제38권3호
• /
• pp.1-7
• /
• 2015

This research is to develop a possible process to apply k-means clustering to an efficient vehicle routing process under time varying vehicle moving speeds. Time varying vehicle moving speeds are easy to find in metropolitan area. There is a big difference between the moving time requirements of two specific delivery points. Less delivery times are necessary if a delivery vehicle moves after or before rush hours. Various vehicle moving speeds make the efficient vehicle route search process extremely difficult to find even for near optimum routes due to the changes of required time between delivery points. Delivery area division is designed to simplify this complicated VRPs due to time various vehicle speeds. Certain divided area can be grouped into few adjacent divisions to assume that no vehicle speed change in each division. The vehicle speeds moving between two delivery points within this adjacent division can be assumed to be same. This indicates that it is possible to search optimum routes based upon the distance between two points as regular traveling salesman problems. This makes the complicated search process simple to attack since few local optimum routes can be found and then connects them to make a complete route. A possible method to divide area using k-means clustering is suggested and detailed examples are given with explanations in this paper. It is clear that the results obtained using the suggested process are more reasonable than other methods. The suggested area division process can be used to generate better area division promising improved vehicle route generations.

• 한국멀티미디어학회논문지
• /
• 제16권10호
• /
• pp.1196-1203
• /
• 2013

일반적으로 무선 네트워크는 유선 네트워크에 비하여 고가의 무선 송수신기를 사용하여 설치 및 유지비용이 높다. 하지만, 터널 내 환경관리 시스템의 경우는 기본적으로 터널 내 환경 정보를 감지하여 최소한의 정보만을 중앙통제장치와 유선으로 연결된 지시 노드로 보내는 것이기 때문에 전송되는 데이터양이 매우 적고, 따라서 저속의 무선 송수신기는 낮은 비용으로 구현하여 적용 가능하다. 그리고 무선 네트워크에서는 유선 네트워크와는 달리 데이터 전달 경로를 결정하는 라우팅 문제가 발생한다. 센서에서 감지한 신호를 디지털화하여 얻은 데이터를 무선 송신기를 사용하여 직접 지시노드로 보내는 경우에는 라우팅 문제가 발생하지 않지만, 이 경우에는 상대적으로 고출력의 무선 송신기가 요구되어 무선 송신기 구현 비용이 증가하게 되고, 해당 센서 노드의 전력소모가 커지는 문제점이 발생한다. 이러한 문제점을 해결하기 위해서는, 무선송신기의 출력을 줄이는 대신 인접한 센서 노드의 무선 송수신기를 이용한 중계를 통하여 지시노드까지 전달하도록 하는 방식을 사용할 수 있다. 그러나, 이 경우에는 해당 센서 노드에서 지시노드까지는 복수의 경로가 존재하기 때문에 최적의 경로를 선택하는 라우팅 알고리즘이 필요하게 된다. 따라서 본 논문에서는 터널 내 자동환경 관리 시스템에 적합한 라우팅 알고리즘을 제안하였으며, 추가로 센서 노드들을 각 터널 내에 부착 후 노드 등록 등의 초기화 과정을 거치면 자동으로 노드 간의 협업과정을 통해서 무선 네트워크가 구성될 수 있는 방안을 구현하였다.

• 한국산업정보학회논문지
• /
• 제14권4호
• /
• pp.1-7
• /
• 2009

이 논문은 다목적 공정순서계획 알고리즘을 소개한다. 공정순서계획이란 가용한 기계들을 이용하여 원재료를 가공 완료된 부품으로 변형해주는 최적 공정순서들을 결정하는 일이다. 어느 컴퓨터 지원 공정계획 시스템에서나, 가공작업 순서의 결정은 부품 가공이나 부품 도면상의 기술적인 요구사항들을 충족시켜주기 위한 가장 중요한 활동 중의 하나이다. 여기서, 목표는 생산시간, 생산비용, 기계가동률 또는 이들을 복합적으로 만족시켜주는 최적 가공순서를 생성하는 일일 것이다. 파레토 스트라튬 니치 큐비클 (PS NC) 유전 알고리즘이 두 가지 상호 배타적인 기준인 생산비용과 생산품질을 동시에 최적화 시켜주는 가공순서들을 찾는데 이용되었다. 예제에 의한 검증은 제안된 PS NC 유전자 알고리즘이 공정계획문제에 있어서 효과적이며 효율적인 결과를 가져오는 것을 보여준다.

• Journal of Advanced Marine Engineering and Technology
• /
• 제37권7호
• /
• pp.784-791
• /
• 2013

Recent advanced IT made layout design fast and accurate by using algorithms. Layout design should be determined by considering the position of equipment with satisfying various space constraints and its component works with optimum performance. Especially, engine room layout design is performed with mother ship data, theoretical optimal solution, design requirements and several design constraints in initial design stage. Piping design is affected by position of equipment seriously. Piping design depends on experience of designer. And also piping designer should consider correlation of equipment and efficiency of space. In this study, space evaluation method has been used to evaluate efficiency of space. And also this study suggested object function for optimal piping route, Average Reservation Index(ARI), Estimated Piping Productivity(EPP) and with modified space evaluation method. In this study, optimum pipe routing system has been developed to reflect automated piping route with space efficiency and experience of piping designer. Engine room is applied to the design of the piping in order to confirm validity of the developed system.

• Journal of information and communication convergence engineering
• /
• 제2권2호
• /
• pp.106-109
• /
• 2004

This study designs a load balancer via direct routing that share a virtual service on a single IP address in the Linux system and suggests an efficient load balancing method to improve transmission speed in the web server cluster environment. It will increase performance and scalability with fast packet transfer and removing bottleneck problem by using TCP Splicing and Content-Aware Distributor method. This method is expected to be the noticeable technology that provides an important interface, which make application services for e-commerce effectively be applied to high-speed network infrastructure. At this time, it is required to study further on the optimum balancing method in the web server cluster environment so as to apply the hybrid (optimum load balancing method by software and hardware) method and improve the reuse of security cession based on high-speed TCP connections.

• 산업공학
• /
• 제19권1호
• /
• pp.1-8
• /
• 2006

The mobile communication network has to offer good quality of services (QoS), high capacity, and more coverage at a lower cost. However, with the increase of cellular user, the shortage of capacity due to unbalanced call distribution and lack of QoS are common. This paper deals with dynamic sectorization for efficient resource management to solve load unbalancing among microcells in CDMA (Code Division Multiple Access) microcellular system. Dynamic load balancing can be effected by grouping micro-cells properly and grouping can be developed through a routing mechanism. Therefore, we use ants and their routes to choose the optimum grouping of micro-cells into sectors using Multiple Ant Colony System (MACS)in this paper.

• International Journal of Advanced Culture Technology
• /
• 제5권1호
• /
• pp.58-63
• /
• 2017

Emergencies and disasters can happen any time without any warning, and things can change and escalate very quickly, and often it is swift and decisive actions that make all the difference. It is a responsibility of the building facility management to ensure that a proven evacuation plan in place to cover various worst scenario to handled automatically inside the facility. To mapping out optimal safe escape routes is a straightforward undertaking, but does not necessarily guarantee residents the highest level of protection. The emergency evacuation navigation approach is a state-of-the-art that designed to evacuate human livings during an emergencies based on real-time decisions using live sensory data with pre-defined optimum path finding algorithm. The poor decision on causalities and guidance may apparently end the evacuation process and cannot then be remedied. This paper propose a cloud connected emergency evacuation system model to react dynamically to changes in the environment in emergency for safest emergency evacuation using IoT based emergency exit sign system. In the previous researches shows that the performance of optimal routing algorithms for evacuation purposes are more sensitive to the initial distribution of evacuees, the occupancy levels, and the type and level of emergency situations. The heuristic-based evacuees routing algorithms have a problem with the choice of certain parameters which causes evacuation process in real-time. Therefore, this paper proposes an evacuee routing algorithm that optimizes evacuation by making using high computational power of cloud servers. The proposed algorithm is evaluated via a cloud-based simulator with different "simulated casualties" are then re-routed using a Dijkstra's algorithm to obtain new safe emergency evacuation paths against guiding evacuees with a predetermined routing algorithm for them to emergency exits. The performance of proposed approach can be iterated as long as corrective action is still possible and give safe evacuation paths and dynamically configure the emergency exit signs to react for real-time instantaneous safe evacuation guidance.

• 선박안전
• /
• 통권38호
• /
• pp.32-42
• /
• 2015

세계적 경제변화, $CO_2$ 배출량의 규제, 연료비 상승 등의 원인에 의해 국내외에서 최적항로지원시스템 개발 및 상용화하여 사용중에 있다. 하지만, 대부분 외항상선을 대상으로 하여 기술의 실용화를 위한 실선실험이 행해졌고 내항상선을 대상으로 개발한 사례는 거의 없다. 또한, 국제해사기구(IMO)의 "e-Navigation 전략이행계획" 및 정부의 "한국형 e-Navigation 사업"에 따라 주요 추진전략으로 연구개발 되고 있는 차세대 신(新) 항법시스템의 도입에 예상됨에 따라 국내 연안 최적 안전항로시스템의 새로운 개념 설계가 필요한 시점이다. 본 연구에서는 e-Navigation 체계에서의 최적항로시스템 및 기존의 운용 및 연구개발 중인 최적항로시스템을 분석하고 선박, 육상 및 육해상 통신인프라 등의 시스템 체계를 기본으로 최적안전항로시스템에 적용될 알고리즘을 분석, 시스템의 개념을 설계하고자 한다.

• 대한산업공학회지
• /
• 제33권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.