• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.27
• /
• pp.91-104
• /
• 1993

This paper is concerned with flow shop scheduling problems having the common due date. V-shape property is used for algorithms with early and tardy penalty cost. The objective of this paper is developing efficient heuristic scheduling algorithms for minimizing total penalty cost function and determining the optimal common due date. The between job delay and the work in process are considered for developing algorithms as penalty cost. Algorithms is simulated to analyze interrelated factors. A numerical example is given for illustrating the proposed algorithms.

• Journal of Korean Society of Transportation
• /
• v.23 no.6 s.84
• /
• pp.71-80
• /
• 2005

With rapid development Telematics industry, the concern of dynamic road pricing system is increasing. In this study, the change of traffic flows according to traffic information and variation of congestion road prices related to the dynamic road pricing was analyzed. In this study, three facts were unfolded. First, high delay penalty and low delay penalty drivers are shown different reaction for the different congestion road prices. Second, the higher congestion road prices the more drivers convert their route from toll road to non toll road. Third, high penalty drivers are converting to toll road than low delay penalty drivers under same congestion road prices. This study has reached the conclusion that dynamic congestion pricing has a high possibility for traffic management.

• 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 Industrial and Systems Engineering
• /
• v.14 no.23
• /
• pp.65-70
• /
• 1991

This paper is concerned with a flow-shop scheduling problem for all jobs having the common due date using V-Shape penalty cost function for earliness and lateness. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty cost function and for determining the optimal common due date. In addition, the between-job-delay for two machines are considered for developing the algorithm. A numerical example is given for illustrating the proposed algorithm.

• Journal of Korean Society of Transportation
• /
• v.6 no.1
• /
• pp.55-64
• /
• 1988

Prior to using any computer model, the program-embedded palameters showing significant differences from real world should be calibrated. This is especially true when the model is expected to be used fro various roadway and traffic condition. The calibration of TRANSYT model was conducted for the parameters of start-up delay, and lag, stop penalty(K), platoon dispersion factor, and saturation flow rate. The values of the parameters were obtained by theoretical methods from actual field measurements for discharging and arrival pattern. The sites elected for the study was an intersection of Dongil-Ro and Hwarang-Ro, and a 334 meter downstrean section from the intersection stop line on westbound Hwarang-Ro. The study results showed that the start-up delay was 2.6 sec, end lag was 1.0 sec, saturation flow rate was 2287 pcphgpl, platoon dispersion factor was 0.2-03, and stop penalty(K) was 32. However, since these parameters re apt to depend on traffic and roadway condition, it is doubtful whether the obtained values will be applicable to the area-wide situation other than this particular site.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.1
• /
• pp.85-90
• /
• 2013

PID control for unstable processes with time delay is not easy to apply because of unstability due to the poles existing on left-hand side in s-plane and the effect of time delay. In this paper, the authors consider the PID controller design technique in case of predefining overshoot or rising time by designer according to control environment. To deal with constraint problem like this, in this paper, the RCGA incorporating the penalty strategy is used. This is the method that if the RCGA violates given constraints, the defined penalty function is summed to the evaluation function depending on the severity and then the given constraint problem is converted to non-constraints optimization problem. The proposed method is applied to the unstable FOPTD(First Order Plus Time Delay) system and simulations are accomplished to illustrate the set-point tracking performance.

• 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.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2002.11a
• /
• pp.111-116
• /
• 2002

The delay of the completion of the construction project occurs frequently because the origin schedule is affected by numerous factors that contribute to the overall delay in completing the project. But in our country. the dealing with a claim is not sufficient yet by reasons of fairl relation between owner and constructor, cognitive shortage in claim, and such. especially they have make a wrong application of baseless the rule. In this study. we make a rational model ; that includes calculating of dispute costs, and suggest the solution and the prevention for claim by considerating the law followed liquidated damages.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.27-31
• /
• 2011

This paper describes the optimization of spectrum sensing in terms of the throughput of a cognitive radio (CR) system. Dealing with the optimization problem of spectrum sensing, this paper evaluates the throughput of a CR system by considering such situations as the penalty time of a channel search and incumbent user (IU) detection delay caused by a missed detection of an incumbent signal. Also, this paper suggests a serial channel search scheme as the search method for a vacant channel, and derives its mean channel search time by considering the penalty time due to the false alarm of a vacant channel search. The numerical results suggest the optimum sensing time of the channel search process using the derived mean channel search time of a serial channel search in the case of a sensing hardware structure with single radio frequency (RF) path. It also demonstrates that the average throughput is improved by two separate RF paths in spite of the hardware complexity of an RF receiver.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.3
• /
• pp.206-212
• /
• 2003

In this paper, we propose a mathematical optimization model with a suitable algorithm to determine delivery and backlogging quantities by minimizing the total cost including the penalty costs for delay. The system has fixed transshipment costs and demands are fulfilled by some delivery units that represent the volume of delivery amount to be shipped in a single time period. Since, backlogging is allowed, demands could be delivered later at the expense of some penalty costs. The model provides the optimal decisions on when and how much to he delivered while minimizing the total costs. To solve the problem, we propose an algorithm that uses the Lagrangian dual in conjunction with some primal heuristic techniques that exploit the special structure of the problem. Finally, we present some computational test results along with comments on the further study.