Method for a simultaneous determination of the path and the speed for ship route planning problems

Lee, Sung-Min,Roh, Myung-Il,Kim, Ki-Su,Jung, Hoeryong,Park, Jong Jin Elsevier 2018 Ocean engineering Vol.157 No.-

<P><B>Abstract</B></P> <P>Recently, the need for a more efficient method for ship route planning was raised due to the financial crisis in the shipping industry, a strengthening of emission regulations, and the limitations of the existing methods. So far, numerous ship route planning methods have been developed, but most of them do not correctly reflect the effect of a change of the ship speed in the path-determination stage. For this study, a ship route planning problem was formulated as an optimization problem. To solve this, a method for a simultaneous determination of the path and the speed of a ship is proposed. To check the efficiency and the applicability of the proposed method, sensitivity analyses and a comparative test regarding some other methods was performed. The proposed method was applied to various examples of ship route planning and the results show that the proposed method can reduce the total fuel consumption compared with the other methods.</P> <P><B>Highlights</B></P> <P> <UL> <LI> We propose a method for ship route planning. </LI> <LI> We formulate an optimization problem for the determination of the path and the speed. </LI> <LI> We perform the sensitivity analyses and a comparative test with other methods. </LI> <LI> We apply the proposed method to various examples of ship route planning. </LI> </UL> </P>

항로 혼잡 구역의 해상교통 밀도와 관리방안에 관한 연구

김종관(Jong-Kwan KIM) 한국수산해양교육학회 2019 水産海洋敎育硏究 Vol.31 No.2

Rapid economic growth of Korea has expanded the ports and increased traffic on route. The expansion of the port facilities has delayed compared to the expansion of the port. Therefore the marine accidents on the route has increased. The research on `the traffic congestion degree` on the route was mainly performed. However, previous studies have been conducted to evaluate the congestion of the bottleneck section of the route. This study has defined the area where the vessel s passage is the most in the route as the congestion area and propose a maritime traffic management plan in this area. The congestion area of the destination route has analyzed the instantaneous traffic density and the average maritime traffic density on the route. In case of Busan North Port No. 1 route, the instantaneous traffic density exceeded 100% but the average maritime traffic density was less than 100%. In case of Ongdo route, both the instantaneous traffic density and the average maritime traffic density were less than 100%. The management plan of marine traffic congestion area has proposed in three situations. If both the instantaneous traffic density and the average maritime traffic density are exceeded 100%, the maritime traffic environment should be improved. If the average maritime traffic density is exceeded 100% but the average maritime traffic density is less than 100%, maritime traffic control should be strengthened in VTS, etc. And if both the instantaneous traffic density and the average maritime traffic density are less than 100%, the operator of vessel shall navigate the sea traffic congestion area carefully. In case of Busan No. 1 route, maritime traffic control should be strengthened in VTS, etc. In case of Ongdo route, the operator of vessel should navigate carefully. However, this study is limited research on the subject route, so further research has needed.

Intrusion Route as an Analysis Unit for Residential Burglars’ Target Assessment

박소연,이경훈,Miroslav Tadić,강석진 한국셉테드학회 2022 한국셉테드학회지 Vol.13 No.1

The purpose of this study is to determine whether a house's intrusion route is a more useful analysis unit for explaining residential burglars' choice than the house as a whole. Also, we investigated whether a predictive model derived separately from the selected intrusion route better describes burglary decisions than a model derived from the entire response at once. Kruskal-Wallis tests were used to assess whether the participants' evaluations were influenced by the general state of the house or that of the chosen intrusion route. Additionally, two regression studies were undertaken to investigate the effect of the intrusion route chosen on the derivation of regression models. The results indicated that the targeted house is evaluated primarily on the basis of environmental factors associated with the selected intrusion route, rather than on the basis of all environmental elements throughout the house. This result infers that the intrusion route should be treated as an analysis unit to obtain more accurate results for environmental factors affecting burglar's target selection.

Landmarks based route planning and linear path generation for mobile navigation applications

Pasindu Chandrasekara,Thejaka Mahaulpatha,Dananjaya Thathsara,Irendra Koswatta,Nimalika Fernando 대한공간정보학회 2016 Spatial Information Research Vol.24 No.3

In this study a landmarks based navigation model considering local context is designed and a proto- type is implemented. A route planning model where both the distance of a route and the strength of landmarks along the route are considered when deciding the optimum route to follow is developed. The Dijkstra algorithm is used as the basis and if the route is having more strength related to landmarks, it is prioritize while comparing with the dis- tance. The route’s strength is defined based on number of landmarks visible along it and their salience. The hori- zontal spread, the height and the visibility of landmarks at different time of the day and the social/cultural significance are considered as attributes which give strength to a land- mark. To utilize the mobile screen in effective manner, a map generalization is used to show the optimum path. With landmarks the map becomes congested and difficult to read on mobile screen. Therefore the path is reduced to a linear map which shows the path reducing curves while empha- sizing the turns. Douglas–Peucker algorithm is used to derive the linear path. The linear map, which is a schematic representation of the actual map, reduces the path between junctions to straight lines and thereby uses less screen area. The implementation is done using mobile web approach and web services to reduce the platform dependency. OpenStreetMap is used as the main data source with sample local landmarks. All technologies used are free and open source. The application is still being verified and tested in Sri Lanka.

Ship collision avoidance route planning using CRI-based A^* algorithm

Chanhee Seo,Yoojeong Noh,Misganaw Abebe,Young-Jin Kang,Sunyoung Park,Cheolhyeon Kwon The Society of Naval Architects of Korea 2023 International Journal of Naval Architecture and Oc Vol.15 No.-

This study presents a novel ship route planning algorithm that takes into account both operational economy and safety by integrating the A^* algorithm with a collision avoidance algorithm that evaluates the Collision Risk Index (CRI) between the own ship and the target ship. The CRI-based A^* algorithm defines a penalty zone, allowing the own ship to explore safe routes based on the International Regulations for Preventing Collisions at Sea 1972 (COLREGs) and performs an adaptive and effective node search on an extended local map grid according to various encounter situations. The proposed algorithm is validated through simulations of head-on, fine-broad crossing, converging crossing, and overtaking encounters, indicating an economical and safe optimum route compared to conventional ship domain-based route planning.

Ship collision avoidance route planning using CRI-based A∗ algorithm

서찬희,노유정,Abebe Misganaw,Kang Young-Jin,박선영,권철현 대한조선학회 2023 International Journal of Naval Architecture and Oc Vol.15 No.-

This study presents a novel ship route planning algorithm that takes into account both operational economy and safety by integrating the A* algorithm with a collision avoidance algorithm that evaluates the Collision Risk Index (CRI) between the own ship and the target ship. The CRI-based A* algorithm defines a penalty zone, allowing the own ship to explore safe routes based on the International Regulations for Preventing Collisions at Sea 1972 (COLREGs) and performs an adaptive and effective node search on an extended local map grid according to various encounter situations. The proposed algorithm is validated through simulations of head-on, fine-broad crossing, converging crossing, and overtaking encounters, indicating an economical and safe optimum route compared to conventional ship domainbased route planning.

GIS기반의 계층분석기법(AHP)을 활용한 부산시 자전거도로망 선정에 관한 연구

손유진 ( Eu Gene Son ),황인식 ( In Sik Hwang ) 한국지리정보학회 2009 한국지리정보학회지 Vol.12 No.4

To solve the problems of traffic congestion, air pollution and energy derived from increased car consumption, people are in recognition of the importance of green mode, bicycle. Bicycle use rate in Busan is lower due to the terrain and limited public transportation accessibility. Therefore, geographical conditions and use activation should be initially considered in the bicycle route planning. We calculated a weight using AHP(Analytic Hierarchy Process), make a database using GIS tool and deduced the routes applying calculated weight in this study. The result of this study, We could get reliable data as inspecting consistency of the research. Routes are deducted in the place where using demand is higher than arbitrarily chosen routes. Therefore, the route planning through AHP is expected to be utilized in area-specialty-reflected route planning or bicycle road alternatives testing.

지하연계 복합건축물의 가변적 피난경로 및 안전구역 계획기법 연구

이진경(Lee, Jin-Kyoung),김찬주(Kim, Chan-Ju) 대한건축학회 2021 대한건축학회논문집 Vol.37 No.12

The purpose of this study is to survey the characteristics of the pedestrian node of the underground-connected complex for the establishment of the convertible evacuation route and safety area. Through this, it is intended to find out the planning techniques of convertible evacuation routes and safe zones in response to urban disasters. The sites of the survey are 4 cases of building with underground buildings. (Wangsimni Station, Seoul, Dongdaemun History & Culture Park, and Suseo Station) The procedure for the study is as follows. First, the regulations and literature on the evacuation route and safety area of Building with Underground connections are reviewed. Second, the pedestrian node factors are derived through literature review and preliminary investigation. Third, the characteristics of the pedestrian movement, evacuation route, and the pedestrian node of 4 cases are analyzed. Finally, we propose a planning technique for setting convertible evacuation routes and safe zones in underground-connected buildings that can efficiently respond to urban disasters. The conclusion of the study is as follows; First, it is necessary to plan a convertible evacuation safety zone at node such as transit path, concourse, and squares on the first basement floor with the highest connectivity and accessibility. Second, considering the connection type of the transfer station, it is proposed to install a convertible evacuation safety zone in the transfer space. Third, if you plan a convertible evacuation safety zone in the transfer space, you should plan a simple and accessible variable evacuation route. Finally, it is necessary to match the general movement and evacuation route so that it is easy to recognize even in emergencies.

우편물의 최적 순로구분계획 작성을 위한 구분단위 결정방안

임준묵(Joon-Mook Lim) 한국SCM학회 2017 한국SCM학회지 Vol.17 No.2

In this paper, we propose a method for creating an optimal delivery route sorting plan in a delivery post office that performs automatic route sorting by the letter sorting machine. We have presented four design principles for the determination of sorting-unit. These design principles are to minimize deviation of mail volume divided by sorting machine, minimize mail split volume of delivery team divided by sorting machine, minimize mail split volume of delivery team divided by sorting-unit, and minimize mail split volume of delivery area divided by sorting-unit. Based on these design principles, we suggested a two-step mathematical model and solution for the optimal sorting-unit necessary to create an optimal delivery route sorting plan. We also proposed an algorithm for the determination of the sortingunit. For the proposed algorithm, we explained the objective functions of model as the numerical examples and verified their effectiveness through real world case studies. From the case study, we found that the number of sorting-units was reduced and the shift of mail volume was decreased by about 45% compared with the existing method.

택시 데이터를 이용한 심야버스 노선 계획 방안

도승일,박신형,황재연,박현수 도로교통공단 2023 교통안전연구 Vol.42 No.1

This study proposes additional late-night bus routes based on taxi traffic patterns considering the operating cost and demand of late-night buses. For the study, Seoul is divided into hexagons with a radius of 500 m, and the top 1% of the late-night taxi origin– destination (O–D) pairs is extracted using the Seoul taxi information system data established in 2013. We conduct a cost–benefit analysis on 109 taxi O–D pairs extracted from the top 1% of available pairs, excluding five O–D pairs that are economically unfeasible, and divide 104 O–D pairs into five zones based on their respective regions. After excluding zones with two or more existing late-night bus routes, we selected three zones as the target areas for late-night bus route installation. We use OR-Tools to set up optimized late-night bus routes based on the distance of the designated zones. The results of this study could be used as basic data when establishing a new route for late-night buses, and more realistic reviews will be possible using the information on the benefits and costs of late-night buses. 본 연구는 심야시간대에 이용한 서울시 택시 데이터를 기반으로 시민들의 통행 패턴을 파악하여, 경 제성을 고려한 신규 심야버스 노선을 제안하고자 한다. 연구 수행을 위해 서울시를 반경 500m의 Hexagon 단위로 분할하였고, 서울택시정보시스템 데이터를 활용하여, 심야시간 기준 상위 1%에 해당하는 O-D 쌍을 추출하였다. 그 결과, 총 109개의 O-D 쌍이 추출되었고, 각 O-D 쌍을 대상으 로 비용편익분석을 수행하여, 경제적 타당성이 없는 5개의 O-D 쌍을 제외하였다. 다음으로 104개 의 O-D 쌍을 5개의 권역으로 구분하여, 기존 심야버스 노선과 중복되는 2개의 노선을 제외하였으 며, 최종적으로 3개의 권역을 대상으로 심야버스 노선 계획을 수행하였다. 심야버스 노선 계획은 OR-Tools를 사용하여 모든 신규 노선의 거리가 최소가 되도록 도출하였다. 본 연구의 결과는 향후 심야버스의 노선을 새롭게 수립할 때 기초 자료로 활용 가능할 것으로 기대한다. 다만 실제 심야버스 노선 수립 시에는 비용과 편익을 면밀히 검토하여, 운영 여부를 결정할 필요가 있을 것으로 판단된다.