• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.421-424
• /
• 2013

차량 애드 혹 네트워크는 도심 교차로에서 도로의 특성과 차량의 높은 이동성으로 인해 네트워크의 단절이 자주 일어난다. 향상된 지리기반 라우팅 프로토콜인 GBSR(Greedy Border Superiority Routing)은 V2V(Vehicle-to-Vehicle)에 적합하다. 그러나 탐욕모드에서 stale노드가 로컬최대에 직면하는 문제를 가지고 있다. EGBSR(Enhanced GBSR)은 반대 방향의 차량과 같은 방향의 차량에게 보내는 비콘 메시지와 도로 정보를 관리하는 테이블을 이용하여 경로를 탐색하고 설정된 경로를 통해 패킷을 보낸다. 이를 통해 소스노드가 목적지노드에 빠르고 안전하게 패킷을 전달할 수 있는 양방향 라우팅 기법 제안한다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.25 no.2
• /
• pp.21-29
• /
• 2017

For the efficient and stable operation of autonomous vehicles or advanced driver assistance systems being actively studied nowadays, it is important to determine the positions of the vehicle accurately and economically. A satellite based navigation system is mainly used for positioning, but it has a limitation in signal blockage areas. To overcome this limitation, sensor fusion methods including additional sensors such as an inertial navigation system have been mainly proposed but the high sensor cost has been a problem. In this work, we develop a vehicle position estimation algorithm using in-vehicle sensors and a low-cost imaging sensor without any expensive additional sensor. We determine the vehicle positions using the velocity and yaw-rate of a car from the in-vehicle sensors and the position and attitude of the camera based on the single photo resection process. For the evaluation, we built a prototype system, acquired test data using the system, and estimated the trajectory. The proposed algorithm shows the accuracy of about 40% higher than an in-vehicle sensor only method.

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2009

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.81-91
• /
• 2005

The Traveling Salesman Problem(TSP) is one of the NP-complete (None-deterministic Polynomial time complete) route optimization problems. Its calculation time increases very rapidly as the number of nodes does. Therefore, the near optimum solution has been searched by heuristic algorithms rather than the real optimum has. This paper reviews the Ant System Algorithm(ANS), an heuristic algorithm of TSP and its applicability in the parcel delivery service in Korea. ASA, which is an heuristic algorithm of NP-complete has been studied by M. Dorigo in the early 1990. ASA finds the optimum route by the probabilistic method based on the cumulated pheromone on the links by ants. ASA has been known as one of the efficient heuristic algorithms in terms of its calculation time and result. Its applications have been expanded to vehicle routing problems, network management and highway alignment planning. The precise criteria for vehicle routing has not been set up in the parcel delivery service of Korea. Vehicle routing has been determined by the vehicle deriver himself or herself. In this paper the applicability of ASA to the parcel delivery service has been reviewed. When the driver s vehicle routing is assumed to follow the Nearest Neighbor Algorithm (NNA) with 20 nodes (pick-up and drop-off places) in $10Km{\times}10Km$ service area, his or her decision was compared with ASA's one. Also, ASA showed better results than NNA as the number of nodes increases from 10 to 200. If ASA is applied, the transport cost savings could be expected in the parcel delivery service in Korea.

• The Journal of Bigdata
• /
• v.5 no.1
• /
• pp.155-180
• /
• 2020

It takes the most important role the problem of assigining vehicles and desigining optimal routes for each vehicle in order to enhance the logistics service level. While solving the problem, various cost factors such as number of vehicles, the capacity of vehicles, total travelling distance, should be considered at the same time. Although most of logistics service providers introduced the Transportation Management System (TMS), the system has the limitation which can not consider the practical constraints. In order to make the solution of TMS applicable, it is required experts revised the solution of TMS based on their own experience and intuition. In this research, different from previous research which have focused on minimizing the total cost, it has been proposed the methodology which can enhance the efficiency and fairness of asset utilization, simultaneously. First of all, it has been adopted the Cluster-First Route-Second (CFRS) approach. Based on the location of customers, we have grouped customers as clusters by using four different clustering algorithm such as K-Means, K-Medoids, DBSCAN, Model-based clustering and a procedural approach, Fisher & Jaikumar algorithm. After getting the result of clustering, it has been developed the optiamal vehicle routes within clusters. Based on the result of numerical experiments, it can be said that the propsed approach based on CFRS may guarantee the better performance in terms of total travelling time and distance. At the same time, the variance of travelling distance and number of visiting customers among vehicles, it can be concluded that the proposed approach can guarantee the better performance of assigning tasks in terms of fairness.

• Management & Information Systems Review
• /
• v.29 no.4
• /
• pp.109-121
• /
• 2010

In this study, we propose a solution procedure to solve travelling salesman problem(TSP) with special cost function, route dependent travelling salesman problem(RDTSP). First, we develop an integer programming model to describe the problem. In the model, a variable means a possible route. And, the number of variables in this model are extremely large. So, we develop a LP relaxation problem of the IP model and solve the relaxation problem by a column generation technique. The relaxation problem does not guarantee the optimal solution. If we get an integer solution in the ralaxation problem, then the solution is an optimal one. But, if not, we cannot get an optimal solution. So, we approach a branch and price technique. The overall solution procedure can be applied a printed circuit board(PCB) assembly process.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.8
• /
• pp.155-161
• /
• 1999

아이들 상태에서 차실 내에 불쾌감을 주는 매우 높은 크기의 소음이 발생하였다. 본 논문에서는 아이들 시 문제소음의 원인을 분석하고 저감하는데 필요한 관련이론의 적용과 이에 수반되는 데이터측정, 데이터처리 및 데이터 해석과정을 자세하게 기술하였다. 소음진동 측정 및 분석 결과 문제의 소음은 엔진의 회전 2.5차 성분을 가지고 구조기인소음이었다. 아이들 시 문제의 실내소음에 영향을 미치는 구조전달경로들의 기여도를 분석하기 위해 소음경로해석시험 및 모드시험을 실시하였다. 시험분석 결과에 따라 기여도가 놓은 배 기계 및 트랜스미션계의 진동 전달특성을 개선하므로써 만족할 수준의 소음 저감효과를 얻었다.

• Proceedings of the KOR-KST Conference
• /
• 1995.12a
• /
• pp.111-124
• /
• 1995

첨단 교통 체계(Intelligent Transport Systems)의 중요한 요소인 첨단 교통 관리 체계(Advanced Traffic Management Systems)의 성공 여부는 교통정보를 어떻게 제공하고 통제하는데 의존하다. 즉, 정보 제공 방식과 이데 대한 운전자의 반응을 정확하게 파악하고 예측하여야 ITS를 성공적으로 구축할 수 있다. 이 논문에서는 동적 차량 길잡이 장치의 효용성을 평가하기 위한 확률적 통행배정모형을 개발하는 것이다. 개발된 통행배정모형은 운전자의 동적행태조정(Dynamic Behavioural Adjustment)을 명백하게 확솔 과정(Stochastic Process)으로 표현하여 기존의 모형에 비해 통해자들의 행태를 더욱 실제적으로 반영한다. 특히, 각 통행자들에게 K개의 최소경로시간을 제공해줌으로 인하여 통행자의 노선선택에 대한 선택폭을 증가시켜준다. 통행경로의 선택폭의 증가는 쟁점으로 대두되는 문제(교통항제소에서는 차량 길잡이 보유 운전자에게 체계최적(System Optimum)와 이용자최적(User Equilibrium)중 어떠한 원칙하에 교통정보를 제공하여야 하는가에 대한 해결 방안이다. 왜냐하면 만약 교통급제소에서 운전자에게 통행정보를 체계 최상을 하기 위해 정보를 제공하고자 하면, 길잡이 장착 운전자는 더 이상 제공된 정보를 따르지 않고 자기 스스로의 경에 의해 이용자 최상을 달성하고자 할 것이다. 이 논문의 목적은 이러한 복잡한 통행자의 경로선택행위를 반영하는 확률적 평형 통행 배정 모형을 여러가지 통계기법을 도입하여 개발하는 것이다.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.49-58
• /
• 2007

MDPDPTW (Multi-Depot Pickup and Delivery Problem with Time Windows) is a typical model among the optimization models based on the pickup and delivery flow in supply chains. It is based on multi-vehicles in multi-depots and does not consider moving vehicles near pickup and delivery locations. In ubiquitous environments, it is possible to obtain information on moving vehicles and their baggage. Providing the proper context from the perspective of moving vehicles and their baggage allows for more effective vehicle routings. This study proposes Integer Programming-based MDPDPTW including the information on moving vehicles and their baggage in a ubiquitous environment: u-MDPDPTW, and shows the viability and effectiveness of u-MDPDPTW through comparative experiments of MDPDPTW and u-MDPDPTW.

• Proceedings of the Military Operations Research Society of Korea Conference
• /
• 2007.03a
• /
• pp.51-74
• /
• 2007