• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.2
• /
• pp.79-87
• /
• 1986

This paper illustrates a new method to solve the fuzzy goal programming (FGP) problem. It is proved that the FGP proposed by Narasimhan can be solved on the basis of linear programming(LP) model. Narasimhan formulated the FGP problem as a set of $S^{K}$LP problems, each containing 3K constraints, where K is the number of fuzzy goals/constraints. Whereas Hanna formulated the FGP problem as a single LP problem with only 2K constraints and 2K + 1 additional variables. This paper presents that the FGP problem can be transformed with easy into a single LP model with 2K constraints and only one additional variables. And we propose extended FGP :(1) FGP with weights associated with individual goals, (2) FGP with preemptive prioities. The extended FGP has a framework that is identical to that of conventional goal programming (GP), such that the extended FGP can be applied with fuzzy concept to the all areas where GP can be applied.d.

• Journal of Mechanical Science and Technology
• /
• v.18 no.10
• /
• pp.1722-1729
• /
• 2004

This paper presents a design methodology for determining configurations of slider air bearings considering the randomness of the air-bearing surface (ABS) geometry by using the iSIGHT. A reliability-based design optimization (RBDO) problem is formulated to minimize the variations in the mean values of the flying heights from a target value while satisfying the desired probabilistic constraints keeping the pitch and roll angles within a suitable range. The reliability analysis is employed to estimate how the fabrication tolerances of individual slider parameters affect the final flying attitude tolerances. The proposed approach first solves the deterministic optimization problem. Then, beginning with this solution, the RBDO is continued with the reliability constraints affected by the random variables. Reliability constraints overriding the constraints of the deterministic optimization attempt to drive the design to a reliability solution with minimum increase in the objective. The simulation results of the RBDO are listed in comparison with the values of the initial design and the results of the deterministic optimization, respectively. To show the effectiveness of the proposed approach, the reliability analyses are simply carried out by using the mean value first-order second-moment (MVFO) method. The Monte Carlo simulation of the RBDO's results is also performed to estimate the efficiency of the proposed approach. Those results are demonstrated to satisfy all the desired probabilistic constraints, where the target reliability level for constraints is defined as 0.8.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1267-1270
• /
• 1997

An assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying assembly constraints. to generate such sequences for robotic assembly, this paper proposes a method using a genetic algorithm (GA). This method denotes an assembly sequence as an individual, which is assigned a fitness related to the assembly cost. Then, a population consisting of a number of individuals evolves to the next generation through genetic operations of crossover and mutation based upon the fitness of the individuals. The population continues to repetitively evolve, and finally the fittest individual and its corresponding assembly sequence is found. Through case study for an electrical relay, the effectiveness of the proposed method is demonstrated. Also, the performance is evaluated by-comparing with those of previously presented approaches such as a neural-netowork-based method and a simulated annealing method.

• Language and Information
• /
• v.8 no.1
• /
• pp.77-100
• /
• 2004

This paper aims to account for direct combination of an entity type noun with the verb HA- 'do' (ex. piano-rul ha- 'piano-ACC do') in Korean, based on Generative Lexicon Theory (Pustejovsky, 1995). The verb HA-'do' coerces some entity type nouns (e.g., pap 'boiled rice') into event type ones, by virtue of the qualia of the nouns. Typically, a telic-based type coercion supplies individual predication to the HA- construction and an agentive-based type coercion evokes a stage-level interpretation. Type coercion has certain constraints on the choice of qualia. We further point out that qualia cannot be a warehouse of pragmatic information. Qualia are composed of necessary information to explain the lattice structure of lexical meaning and co-occurrence constraints, distinct from accidental information. Finally, we seriously consider co-composition as an alternative to type coercion for the crucial operation of type shift.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.793-796
• /
• 1996

This study proposes a new algorithm which performs a production simulation under various constraints and maintains computational efficiency. In order to consider the environmental and operational constraints, the proposed algorithm is based on optimization techniques formulated in LP form In the algorithm, "system characteristic constraints" reflect the system characteristics such as LDC shape, unit loading order and forced outage rate. By using the concept of Energy Invariance Property and two operational rules i.e. Compliance Rule for Emission Constraint, Compliance Rule for Limited Energy of Individual Unit, the number of system characteristic constraints is appreciably reduced. As a solution method of the optimization problem, the author uses Karmarkar's method which performs effectively in solving large scale LP problem. The efficiency of production simulation is meaningful when it is effectively used in power system planning. With the proposed production simulation algorithm, an optimal expansion planning model which can cope with operational constraints, environmental restriction, and various uncertainties is developed. This expansion planning model is applied to the long range planning schemes by WASP, and determines an optimal expansion scheme which considers the effect of supply interruption, load forecasting errors, multistates of unit operation, plural limited energy plants etc.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.425-428
• /
• 2004

Flexible assembly line (FAL) is a production system that assembles various parts in unidirectional flow line with many constraints and manufacturing flexibilities. In this research we deal with a FAL balancing problem with the objective of minimizing the maximum workload allocated to the stations. However, almost all the existing researches do not appropriately consider various constraints due to the problem complexity. Therefore, this thesis addresses a balancing problem of FAL with many constraints and manufacturing flexibilities, unlike the previous researches. To solve this problem we use a genetic algorithm (GA). To apply GA to FAL, we suggest a genetic representation suitable for FAL balancing and devise evaluation method for individual's fitness and genetic operators specific to the problem, including efficient repair method for preserving solution feasibility. The experimental results are reported.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.294-303
• /
• 2023

During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.8
• /
• pp.398-402
• /
• 2002

The ELD computation has been based upon the so-called B-coefficient which uses a quadratic approximation of system loss as a function of generation output. Direct derivation of system loss sensitivity based on the Jacobian-based method was developed in early 1970s', which could eliminate the dependence upon the approximate loss formula. However, both the B-coefficient and the Jacobian-based method require a complicated Procedure for calculating the system loss sensitivity included in the constraints of the optimization problem. In this paper, an ELD formulation in which only the bus power equations are defined as the constraints has been introduced. Derivation of the partial derivatives of the system loss with respect to the generator output and calculation of the penalty factors for individual generators are not required anymore in proposed method. A comprehensive solution procedure including calculation of the Jacobians and Hessians of the formulation has been presented in detail. Proposed ELD formulation has been tested on a sample system and the simulation indicated a satisfactory result.

• Asia pacific journal of information systems
• /
• v.32 no.1
• /
• pp.92-124
• /
• 2022

Providing services using kiosks is actively carried out between suppliers and consumers. These service processes have recently begun to play a dominant role in transactions. However, previous self-service technology (SST) studies or kiosks have not fully reflected the changing environment surrounding these different technologies. To cover the updated business environments, we combined qualitative and quantitative research methods. Through qualitative research and a review of previous studies, the variables emphasized as motivations and constraints for kiosks use and those that can be newly illuminated were selected for this study. We then applied the variables to the research model to assess their influence. In terms of the motivations for using kiosks, the results suggest that perceived usefulness and compatibility as service quality, forced use, and perceived service providers' efficiency as provider polices, absorptive capacity, and habit as an individual characteristic and social influence as a subjective norm have a significant effect on the attitude toward kiosks. In terms of constraints, difficult to use and need for interaction predicts the attitude toward kiosks. Attitude toward kiosks, perceived behavioral control, and social influence are directly related to the intention to use kiosks. Lastly, intention to use kiosks plays a significant role as an antecedent of revisit intention. Using these empirical results, we propose both academic and practical implications for future kiosks use.

• Communications for Statistical Applications and Methods
• /
• v.25 no.2
• /
• pp.131-157
• /
• 2018

We propose a robust event date model to estimate the date of a target event by a combination of individual dates obtained from archaeological artifacts assumed to be contemporaneous. These dates are affected by errors of different types: laboratory and calibration curve errors, irreducible errors related to contaminations, and taphonomic disturbances, hence the possible presence of outliers. Modeling based on a hierarchical Bayesian statistical approach provides a simple way to automatically penalize outlying data without having to remove them from the dataset. Prior information on individual irreducible errors is introduced using a uniform shrinkage density with minimal assumptions about Bayesian parameters. We show that the event date model is more robust than models implemented in BCal or OxCal, although it generally yields less precise credibility intervals. The model is extended in the case of stratigraphic sequences that involve several events with temporal order constraints (relative dating), or with duration, hiatus constraints. Calculations are based on Markov chain Monte Carlo (MCMC) numerical techniques and can be performed using ChronoModel software which is freeware, open source and cross-platform. Features of the software are presented in Vibet et al. (ChronoModel v1.5 user's manual, 2016). We finally compare our prior on event dates implemented in the ChronoModel with the prior in BCal and OxCal which involves supplementary parameters defined as boundaries to phases or sequences.