• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.12-19
• /
• 2010

In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.157-167
• /
• 2009

This study deals with the turn penalty functions in the urban transportation demand forecasting. The objectives are to develop the penalty functions of left-turn traffic in the case of signalized intersections, and to analyze the applicability of the functions to the traffic assignment models. This is based on the background that the existing models can not effectively account for the delays of left-turn traffic which is bigger than that of through traffic. In pursuing the above, this study gives particular attention to developing the penalty functions based on the degrees of saturation by simulation results of Transyt-7F, and analyzing the applicability of the functions by the case study of Cheongju. The major findings are the followings. First, two penalty functions developed according to the degrees of saturation, are evaluated to be all statistically significant. Second, the results that the above functions apply to the Cheongju network, are analyzed to be converging, though the iteration numbers increase. Third, the link volumes forecasted by turn penalty functions are evaluated to be better fitted to the observed data than those by the existing models. Finally, the differences of traffic volumes assigned by two functions, which are exponential and divided forms, are analyzed to be very small.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.73-83
• /
• 1999

In this paper, we consider the shortest path network problem with fixed charges. A turn penalty algorithm for the shortest path problem with fixed charges or turn penalties is presented, which is using the next node comparison method. The algorithm described here is designed to determine the shortest route in the shortest path network problem including turn penalties. Additionally, the way to simplify the computation for the shortest path problem with turn penalties was pursued.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.4
• /
• pp.268-275
• /
• 2000

The increasing technological demands of today call for complex systems, which in turn involve a series of optimization problems with some equality or inequality constraints. In this paper, we presents a real-coded genetic algorithm(RCGA) as an optimization tool which is implemented by three genetic operators based on real coding representation. Through a lot of simulation works, the optimum settings of its control parameters are obtained on the basis of global off-line robustness for use in off-line applications. Two optimization problems are Presented to illustrate the usefulness of the RCGA. In case of a constrained problem, a penalty strategy is incorporated to transform the constrained problem into an unconstrained problem by penalizing infeasible solutions.

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.89-99
• /
• 2003

Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.11
• /
• pp.4016-4020
• /
• 2011

A number of mimetic peptides of apolipoprotein A-I, a major component for high density lipoproteins (HDL), were screened from the phase-displayed random peptide library by utilizing monoclonal antibodies (A12). A mimetic peptide for A12 epitope against apolipoprotein A-I was selected as FVLVRDTFPSSVCCP(pA2) exhibiting 45% homology with Apo A-I in the BLAST search. Solution structure determination of this mimotope was made by using 2D-NMR data and NMR-based distance geometry (DG)/molecular dynamic calculations. The resulting DG structures had low penalty value of 0.4-0.6 ${\AA}^2$ and the total RMSD of 0.7-1.7 ${\AA}$. The mimotope pA2 exhibited a characteristic ${\beta}$-turn conformation from Val[2] to Phe[8] near Pro[9] residue.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.9
• /
• pp.3425-3428
• /
• 2011

Apolipoprotein A-I (Apo A-I) is a major component for high density lipoproteins (HDL). A number of mimetic peptides of Apo A-I were screened from the phase-displayed random peptide library by utilizing monoclonal antibodies (A12). Mimetic peptide for A12 epitope against Apo A-I was selected as CPFARLPVEHHDVVGL (pA1). From the BLAST search, the mimetic peptide pA1 had 40% homology with Apo A-I. As a result of the structural determination of this mimotope using homo/hetero nuclear 2D-NMR techniques and NMR-based distance geometry (DG)/molecular dynamic (MD) computations, DG structure had low penalty value of 0.3-0.7 ${\AA}^2$ and the total RMSD was 0.6-1.6 ${\AA}$. The mimotope pA1 exhibited characteristic conformation including a ${\beta}$-turn from Pro[7] to His[11].

• Ocean Systems Engineering
• /
• v.8 no.2
• /
• pp.101-118
• /
• 2018

In case of conventional shallow-draft semisubmersibles, unacceptably large riser stroke was the restricting factor for dry-tree-riser-semisubmersible development. Many attempts to address this issue have focused on using larger draft and size with extra heave-damping plates, which results in a huge cost increase. The objective of this paper is to investigate an alternative solution by improving riser systems through the implementation of a magneto-rheological damper (MR Damper) so that it can be used with moderate-size/draft semisubmersibles. In this regard, MR-damper riser systems and connections are numerically modeled so that they can couple with hull-mooring time-domain simulations. The simulation results show that the moderate-size semisubmersible with MR damper system can be used with conventional dry-tree pneumatic tensioners by effectively reducing stroke-distance even in the most severe (1000-yr) storm environments. Furthermore, the damping level of the MR damper can be controlled to best fit target cases by changing input electric currents. The reduction in stroke allows smaller topside deck spacing, which in turn leads to smaller deck and hull. As the penalty of reducing riser stroke by MR damper, the force on the MR-damper can significantly be increased, which requires applying optimal electric currents.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.4
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.