• Title/Summary/Keyword: Weighted penalty

Search Result 21, Processing Time 0.023 seconds

A study on Flow Shop Scheduling Problems with Different Weighted Penalties and a Common Due Date (차별 벌과금과 공통납기를 고려한 흐름작업 일정 계획에 관한 연구)

  • Lee, Jeong-Hwan;No, In-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.19 no.2
    • /
    • pp.125-132
    • /
    • 1991
  • This paper is concerned with the flow shop scheduling problems considering different weighted penalty costs for earliness and lateness, and a common due date. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty costs and for determining the optimal common due date. The positional weight index and, the product sum method are used. A numerical example is given for illustrating the proposed algorithm.

  • PDF

Adaptive ridge procedure for L0-penalized weighted support vector machines

  • Kim, Kyoung Hee;Shin, Seung Jun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.6
    • /
    • pp.1271-1278
    • /
    • 2017
  • Although the $L_0$-penalty is the most natural choice to identify the sparsity structure of the model, it has not been widely used due to the computational bottleneck. Recently, the adaptive ridge procedure is developed to efficiently approximate a $L_q$-penalized problem to an iterative $L_2$-penalized one. In this article, we proposed to apply the adaptive ridge procedure to solve the $L_0$-penalized weighted support vector machine (WSVM) to facilitate the corresponding optimization. Our numerical investigation shows the advantageous performance of the $L_0$-penalized WSVM compared to the conventional WSVM with $L_2$ penalty for both simulated and real data sets.

Weighted Support Vector Machines with the SCAD Penalty

  • Jung, Kang-Mo
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.6
    • /
    • pp.481-490
    • /
    • 2013
  • Classification is an important research area as data can be easily obtained even if the number of predictors becomes huge. The support vector machine(SVM) is widely used to classify a subject into a predetermined group because it gives sound theoretical background and better performance than other methods in many applications. The SVM can be viewed as a penalized method with the hinge loss function and penalty functions. Instead of $L_2$ penalty function Fan and Li (2001) proposed the smoothly clipped absolute deviation(SCAD) satisfying good statistical properties. Despite the ability of SVMs, they have drawbacks of non-robustness when there are outliers in the data. We develop a robust SVM method using a weight function with the SCAD penalty function based on the local quadratic approximation. We compare the performance of the proposed SVM with the SVM using the $L_1$ and $L_2$ penalty functions.

A Study on a Measure for Non-Normal Process Capability (비정규 공정능력 측도에 관한 연구)

  • 김홍준;김진수;조남호
    • Proceedings of the Korean Reliability Society Conference
    • /
    • 2001.06a
    • /
    • pp.311-319
    • /
    • 2001
  • All indices that are now in use assume normally distributed data, and any use of the indices on non-normal data results in inaccurate capability measurements. Therefore, $C_{s}$ is proposed which extends the most useful index to date, the Pearn-Kotz-Johnson $C_{pmk}$, by not only taking into account that the process mean may not lie midway between the specification limits and incorporating a penalty when the mean deviates from its target, but also incorporating a penalty for skewness. Therefore we propose, a new process capability index $C_{psk}$( WV) applying the weighted variance control charting method for non-normally distributed. The main idea of the weighted variance method(WVM) is to divide a skewed or asymmetric distribution into two normal distribution from its mean to create two new distributions which have the same mean but different standard distributions. In this paper we propose an example, a distribution generated from the Johnson family of distributions, to demonstrate how the weighted variance-based process capability indices perform in comparison with another two non-normal methods, namely the Clements and the Wright methods. This example shows that the weighted valiance-based indices are more consistent than the other two methods In terms of sensitivity to departure to the process mean/median from the target value for non-normal process.s.s.s.

  • PDF

Weld Quality Assessment Method for Short-Circuit Mode in GMAW

  • Kim, J.M.;Yoo, C.D.
    • International Journal of Korean Welding Society
    • /
    • v.1 no.2
    • /
    • pp.1-6
    • /
    • 2001
  • A weld quality assessment method is proposed in this work, which can be applied to the short-circuit mode in GMAW. Information about the welding signal trajectory, distribution of the signal duration at each sub-regions and short-circuit frequency is used to evaluate the weld quality. The weighted penalty, which is determined experimentally, is imposed for each abnormal signal. Performance of the proposed method is compared with the Simpson's method under the conditions of shielding gas reduction, workpiece surface contamination and joint gap in the butt and fillet welds. Although the proposed method predicts the weld quality with reasonable accuracy, further modification and extension to other metal transfer modes are needed as a further study.

  • PDF

An Algorithm for Resource-Unconstrained Earliness-Tardiness Problem with Partial Precedences (자원 제약이 없는 환경에서 부분 우선순위를 고려한 Earliness-Tardiness 최적 일정계획 알고리즘)

  • Ha, Byung-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.38 no.2
    • /
    • pp.141-157
    • /
    • 2013
  • In this paper, we consider the minimization of the total weighted earliness-tardiness penalty of jobs, regarding the partial precedences between jobs. We present an optimal scheduling algorithm in O(n(n+m log m)) where n is the number of jobs and m is the number of partial precedences. In the algorithm, the optimal schedule is constructed iteratively by considering each group of contiguous jobs as a block that is represented by a tree.

Element Free Galerkin Method applying Penalty Function Method

  • Choi, Yoo Jin;Kim, Seung Jo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.1 no.1
    • /
    • pp.1-34
    • /
    • 1997
  • In this study, various available meshless methods are briefly reviewed and the connection among them is investigated. The objective of meshless methods is to eliminate some difficulties which are originated from reliance on a mesh by constructing the approximation entirely in terms of nodes. Especially, focusing on Element Free Galerkin Method(EFGM) based on moving least square interpolants(MLSI), a new implementation is developed based on a variational principle with penalty function method were used to enforce the essential boundary condition. In addition, the weighted orthogonal basis functions are constructed to overcome disadvantage of MLSI.

  • PDF

An integrated particle swarm optimizer for optimization of truss structures with discrete variables

  • Mortazavi, Ali;Togan, Vedat;Nuhoglu, Ayhan
    • Structural Engineering and Mechanics
    • /
    • v.61 no.3
    • /
    • pp.359-370
    • /
    • 2017
  • This study presents a particle swarm optimization algorithm integrated with weighted particle concept and improved fly-back technique. The rationale behind this integration is to utilize the affirmative properties of these new terms to improve the search capability of the standard particle swarm optimizer. Improved fly-back technique introduced in this study can be a proper alternative for widely used penalty functions to handle existing constraints. This technique emphasizes the role of the weighted particle on escaping from trapping into local optimum(s) by utilizing a recursive procedure. On the other hand, it guaranties the feasibility of the final solution by rejecting infeasible solutions throughout the optimization process. Additionally, in contrast with penalty method, the improved fly-back technique does not contain any adjustable terms, thus it does not inflict any extra ad hoc parameters to the main optimizer algorithm. The improved fly-back approach, as independent unit, can easily be integrated with other optimizers to handle the constraints. Consequently, to evaluate the performance of the proposed method on solving the truss weight minimization problems with discrete variables, several benchmark examples taken from the technical literature are examined using the presented method. The results obtained are comparatively reported through proper graphs and tables. Based on the results acquired in this study, it can be stated that the proposed method (integrated particle swarm optimizer, iPSO) is competitive with other metaheuristic algorithms in solving this class of truss optimization problems.

Weighted L1-Norm Support Vector Machine for the Classification of Highly Imbalanced Data (불균형 자료의 분류분석을 위한 가중 L1-norm SVM)

  • Kim, Eunkyung;Jhun, Myoungshic;Bang, Sungwan
    • The Korean Journal of Applied Statistics
    • /
    • v.28 no.1
    • /
    • pp.9-21
    • /
    • 2015
  • The support vector machine has been successfully applied to various classification areas due to its flexibility and a high level of classification accuracy. However, when analyzing imbalanced data with uneven class sizes, the classification accuracy of SVM may drop significantly in predicting minority class because the SVM classifiers are undesirably biased toward the majority class. The weighted $L_2$-norm SVM was developed for the analysis of imbalanced data; however, it cannot identify irrelevant input variables due to the characteristics of the ridge penalty. Therefore, we propose the weighted $L_1$-norm SVM, which uses lasso penalty to select important input variables and weights to differentiate the misclassification of data points between classes. We demonstrate the satisfactory performance of the proposed method through simulation studies and a real data analysis.

A Finite Capacity Material Requirement Planning System for a Multi-Stage Assembly Factory: Goal Programming Approach

  • Wuttipornpun, Teeradej;Yenradee, Pisal;Beullens, Patrick;van Oudheusden, Dirk L.
    • Industrial Engineering and Management Systems
    • /
    • v.4 no.1
    • /
    • pp.23-35
    • /
    • 2005
  • This paper aims to develop a practical finite capacity MRP (FCMRP) system based on the needs of an automotive parts manufacturing company in Thailand. The approach includes a linear goal programming model to determine the optimal start time of each operation to minimize the sum of penalty points incurred by exceeding the goals of total earliness, total tardiness, and average flow-time considering the finite capacity of all work centers and precedence of operations. Important factors of the proposed FCMRP system are penalty weights and dispatching rules. Effects of these factors on the performance measures are statistically analyzed based on a real situation of an auto-part factory. Statistical results show that the dispatching rules and penalty weights have significant effects on the performance measures. The proposed FCMRP system offers a good tradeoff between conflicting performance measures and results in the best weighted average performance measures when compared to conventional forward and forward-backward finite capacity scheduling systems.