• Structural Engineering and Mechanics
• /
• v.71 no.2
• /
• pp.139-151
• /
• 2019

In a project schedule, it is possible to reduce the time required to complete a project by allocating extra resources for critical activities. However, accelerating a project causes additional expense. This issue is addressed by finding optimal set of time-cost alternatives and is known as the time-cost trade-off problem in the literature. The aim of this study is to identify the optimal set of time-cost alternatives using a multiobjective teaching-learning-based optimization (TLBO) algorithm integrated with the non-dominated sorting concept and is applied to successfully optimize the projects ranging from a small to medium large projects. Numerical simulations indicate that the utilized model searches and identifies optimal / near optimal trade-offs between project time and cost in construction engineering and management. Therefore, it is concluded that the developed TLBO-based multiobjective approach offers satisfactorily solutions for time-cost trade-off optimization problems.

• KIEAE Journal
• /
• v.12 no.5
• /
• pp.29-34
• /
• 2012

A rental housing has a key role to supply the living space to non-ownership. A public rental housing is particularly aimed at providing the living space for the low-income households with a low rent fee. Therefore, the local government would try to maintain the facilities of the rental housing and to get the decent living condition. For getting the required living condition, it should make a maintenance plan, which contains the repair time, repair scope and targeted component and finishings. This study is aimed at providing the optimal repair time in 12 components and components of the rental housing which is controlled by the local government. The optimal repair time has two steps to get the final result. First, it would draw the 1'st repair time with the probabilistic and empirical approach. Second, comparing the drawn data and the service life, the optima repair time would be provided with considering the components' attributes. Result are as follows : First, the optimal repair time would be considered with the component attributes. There are user's convenience, its safety and physical aspect. Second, the kitchen utensils, elevator and water tap has a optimal time of 16, 19, 17 years respectively which is considered with physical aspect. In addition, the optima repair time of the wiring appliance and lighting equipment are 12 years and 10 years respectively.

• Journal of Mechanical Science and Technology
• /
• v.19 no.9
• /
• pp.1695-1705
• /
• 2005

Reaction wheels and thrusters are commonly used for the satellite attitude control. Since satellites frequently need fast maneuvers, the minimum time maneuvers have been extensively studied. When the speed of attitude maneuver is restricted due to the wheel torque capacity of low level, the combinational use of wheel and thruster is considered. In this paper, minimum time optimal control performances with reaction wheels and thrusters are studied. We first identify the features of the maneuvers of the satellite with reaction wheels only. It is shown that the time-optimal maneuver for the satellite with four reaction wheels in a pyramid configuration occurs on the fashion of single axis rotation. Pseudo control logic for reaction wheels is successfully adopted for smooth and chattering-free time-optimal maneuvers. Secondly, two different thrusting logics for satellite time-optimal attitude maneuver are compared with each other: constant time-sharing thrusting logic and varying time-sharing thrusting logic. The newly suggested varying time-sharing thrusting logic is found to reduce the maneuvering time dramatically. Finally, the hybrid control with reaction wheels and thrusters are considered. The simulation results show that the simultaneous actuation of reaction wheels and thrusters with varying time-sharing logic reduces the maneuvering time enormously. Spacecraft model is Korea Multi-Purpose Satellite (KOMPSAT)-2 which is being developed in Korea as an agile maneuvering satellite.

• Management Science and Financial Engineering
• /
• v.22 no.1
• /
• pp.13-20
• /
• 2016

We investigate the optimal consumption and investment problem when a working debtor has an option to file for bankruptcy. By applying the duality approach, the closed-form solutions are obtained for the case of CRRA utility function. The optimal bankruptcy time is determined by the first hitting time when the financial wealth hits the wealth threshold derived from the optimal stopping time problem. Moreover, the numerical results show that the investment increases as the wealth approaches the threshold and the value gain from the bankruptcy option is vanished as wealth increases.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.105-111
• /
• 2003

This paper is researching the storing of 40 different kinds of conditions. Such as, car speed, delay in starting time and the volume of cars in traffic. Through the use of a central nervous networking system or AI, using 10 different intersecting roads. We will improve the green traffic light. And allow more cars to easily flow through the intersections. Now days, with increasing many vehicles on restricted roads, the conventional traffic light creates prove startup-delay time and end-lag-time. The conventional traffic light loses the function of optimal cycle. And so, 30-45% of conventional traffic cycle is not matched to the present traffic cycle. In this paper proposes electro sensitive traffic light using fuzzy look up table method which will reduce the average vehicle waiting time and improve average vehicle speed. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering passing vehicle length for optimal traffic cycle is better than fixed signal method which dosen't consider vehicle length.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.121-129
• /
• 2012

In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.1
• /
• pp.101-108
• /
• 1997

The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

• Journal of Biosystems Engineering
• /
• v.29 no.6 s.107
• /
• pp.515-520
• /
• 2004

A device far estimating the optimal artificial insemination time consisted of a computer, RS module, and six direct-reflex photo-sensors. Program was written in LabWindows CVI. In order to establish references for estimating optimal artificial insemination time, lying rate of the thirty three $Berkshire{\times}Hampshire crossbred sows (parity 5 to 6) was recorded from 2 days after moving into stalls to artificial insemination using a time lapse VCR and was measured every hour with one minute interval using the scan point sampling method. Twenty low hours in a day were divided into three comparing periods : 21:00 to 06:59, 07:00 to 13:59, and 14:00 to 20:59. If sum of the percentages of tying during a comparing period was less than the reference value, the starting hour of the comparing period was considered as onset of estrus and the optimal artificial insemination time was estimated at 20 to 24 hours after onset of estrus. The experimental device was evaluated with twenty five $Berkshire{\times}Hampshire$ crossbred sows (parity 2 to 7) and 23 of 25 sows $(92\%)$ were pregnant. This result suggests that the experimental device is excellent in performance for estimating optimal artificial insemination time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.147-151
• /
• 1991

In this paper a time-optimal path planning scheme for the multiple robot manipulators will be proposed by using hopfield neural network. The time-optimal path planning, which can allow multiple robot system to perform the demanded tasks with a minimum execution time and collision avoidance, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to rearrange the problem as MTSP(Multiple Travelling Salesmen Problem) and then apply the Hopfield network technique, which can allow the parallel computation, to the minimum time problem. This paper proposes an approach for solving the time-optimal path planning of the multiple robots by using Hopfield neural network. The effectiveness of the proposed method is demonstrated by computer simulation.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.7
• /
• pp.650-658
• /
• 2012

This paper proposes a high performance position controller for a driving system using a time optimal controller which has been widely used to control driving systems to achieve desired reference position or velocity in a minimum response time. The main purpose of this research lies in an improvement of transient response performance rather than that of steady-state response in comparison with other control strategies. In order to refine the scheme of time optimal control, Lyapunov stability proofs are incorporated in a controller of standard second order system model. This scheme is applied to the control of a driving system. In view of the simulation and experiment results, the standard second order system model exhibits better minimum-time control performance and robustness than double integral system model does.