• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.89-115
• /
• 2000

Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.296-304
• /
• 2015

Vessel Traffic Service (VTS) is the service that provides ships navigating on a sea transportation route with guidance and advice about geographical environment and other attentive information for their safety. In this study we point out that currently, constructing additional VTSs is required to prevent ships from unexpected accident on their navigation. We first select several candidate locations for constructing VTSs, based on the amount of marine transportation and its potential development possibility. Then, we present an optimization model in which the maximum area coverage is achieved by determining new locations of VTS subject to budget limitation. The problem can be modeled as a binary integer program and it provides an optimal solution for new VTS locations to be constructed under the consideration of the currently located VTSs in Korea.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.667-676
• /
• 2001

We have solved a problem occurring in case that RSVP is applied to existing wired network in order to guarantee a QoS of multimedia traffic in mobile computing environment in this paper. If MN moves to another area when Mobile IP is applied to RSVP, HA makes new tunnel to FA because SESSION ID of MN is changed. However, we suggest MIP-DUDN method, which applied RSVP. Although MN moves to another area in this method, it does not make new tunnel because it eliminates the problem of existing Triangle Routing Problem. We design the new protocol of RMIP-DUDN and compare with the method of existing Mobile IP applied to RSVP.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.59-64
• /
• 2016

This paper suggests heuristic algorithm with O(mn) polynomial time complexity using Excel for partially survivable networks optimization problem of cellular telecommunication systems with m cells and n hubs. This problem only can be get the solution using linear programming or LINGO software package. The proposed algorithm connects the cell to hubs in ring network with minimum cost as the connection diversity of each cell. If the traffic of ring network (T) is T>2K for ring capacity (K), we adjust the maximum cost hub to MTSO that has a ascending order of (D/DC)/${\Delta}^+$ cell with each cell traffic demand (D) and ${\Delta}^+$=(MTSO cost-maximum cost hub) than we get the $T{\leq}2K$. Finally, we adjust MTSO to the removed maximum cost hub for the cell with 2K-$T{\geq}$(D/DC) and $_{max}{\Delta}^-$. While we using like this simple method, the proposed algorithm can be get the same optimal solution for experimental data as linear programing and LINGO software package.

• Journal of Korean Society of Transportation
• /
• v.27 no.6
• /
• pp.157-166
• /
• 2009

A network design problem (NDP) is to find a design parameter to optimize the performance of transportation system. This paper presents a modified NDP, called target-oriented NDP, which contains a target that we try to arrive in real world, and also proposes a solution algorithm. Unlike general NDP which seeks an optimal value to minimize or to maximize objective function of the system, in target-oriented NDP traffic manager or operator can set a target level prior and then try to find an optimal design variable to attain this goal. A simple example for mode choice problem is given to test the model.

• International Journal of Contents
• /
• v.14 no.2
• /
• pp.24-29
• /
• 2018

In this paper, we propose an efficient traffic light detection (TLD) method as an advanced driver assistance system (ADAS) for elderly drivers. Since an increase in traffic accidents is associated with the aging population and an increase in elderly drivers causes a serious social problem, the provision of ADAS for older drivers via TLD is becoming a necessary(Ed: verify word choice: necessary?) public service. Therefore, we propose an economical TLD method that can be implemented with a simple black box (built in camera) and a smartphone in the near future. The system utilizes a color pre-processing method to differentiate between the stop and go signals. A mathematical morphology algorithm is used to further enhance the traffic light detection and a circular Hough transform is utilized to detect the traffic light correctly. From the simulation results of the computer vision and image processing based on a proposed algorithm on Matlab, we found that the proposed TLD method can detect the stop and go signals from the traffic lights not only in daytime, but also at night. In the future, it will be possible to reduce the traffic accident rate by recognizing the traffic signal and informing the elderly of how to drive by voice.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.365-378
• /
• 2013

In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.647-669
• /
• 2016

Multiple attribute for decision making including user preference will increase the complexity of route selection process. Various approaches have been proposed to solve the optimal route selection problem. In this paper, multi attribute decision making (MADM) algorithms such as Simple Additive Weighting (SAW), Weighted Product Method (WPM), Analytic Hierarchy Process (AHP) method and Total Order Preference by Similarity to the Ideal Solution (TOPSIS) methods have been proposed for acoustic signature based optimal route selection to facilitate user with better quality of service. The traffic density state conditions (very low, low, below medium, medium, above medium, high and very high) on the road segment is the occurrence and mixture weightings of traffic noise signals (Tyre, Engine, Air Turbulence, Exhaust, and Honks etc) is considered as one of the attribute in decision making process. The short-term spectral envelope features of the cumulative acoustic signals are extracted using Mel-Frequency Cepstral Coefficients (MFCC) and Adaptive Neuro-Fuzzy Classifier (ANFC) is used to model seven traffic density states. Simple point method and AHP has been used for calculation of weights of decision parameters. Numerical results show that WPM, AHP and TOPSIS provide similar performance.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.113-118
• /
• 2016

The walking speed of handicapped people generally is slower than that of normal people. So it is difficult for them to cross at crosswalks within the allotted time provided by the traffic light. This problem can be solved by expanding the time of the traffic light. However, if the latency of the traffic light is increased without distinguishing the handicapped among all other pedestrians, the efficiency of traffic signal lights will decrease. In this paper, we propose a smart traffic signal connecting mechanism between the previous pedestrian traffic signal and a pedestrian's device (smartphone). This Smart pedestrian traffic light, through this mechanism, minimizes traffic congestion by providing additional walking time only to the handicapped among pedestrians. This crosswalk traffic light recognizes the handicapped using a technique called Internet of things (IOT). In this paper, we extract the data necessary to build an effective smart crosswalk traffic light mechanism through simulation techniques. We have extracted different kinds of traffic signal times with our virtual simulation environment to verify the efficiency of the smart crosswalk pedestrian traffic light system. This approach can validate the effective delay time of the traffic signal time through a comparison based on number of pedestrians.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.33-43
• /
• 2004

In this paper, a traffic trend analysis based SNMP algorithm is proposed for improving the problem of existing traffic analysis using SNMP. The existing traffic analysis method has a vulnerability that is taken much time In analyzing by using a threshold and not detected a harmful traffic at the point of transition. The method that is proposed in this paper can solve the problems that the existing method had, simultaneously using traffic trend analysis of the day, traffic trend analysis happening in each protocol and MIB object analysis responding to attacks instead of using the threshold. The algorithm proposed in this paper will analyze harmful traffic more quickly and more precisely; hence it can reduce the damage made by traffic flooding attacks. When traffic happens, it can detect the abnormality through the three analysis methods previously mentioned. After that, if abnormal traffic overlaps in at least two of the three methods, we can consider it as harmful traffic. The proposed algorithm will analyze harmful traffic more quickly and more precisely; hence it can reduce the damage made by traffic flooding attacks.