• 제목/요약/키워드: Objective distance

검색결과 1,055건 처리시간 0.025초

미세 가공 시스템에서 분무특성이 에칭특성에 미치는 영향에 관한 연구 (A Study on Effect of Spray Characteristics on Etching Characteristics in Micro Fabrication System)

  • 정지원;김덕줄
    • 대한기계학회논문집B
    • /
    • 제28권1호
    • /
    • pp.109-117
    • /
    • 2004
  • The objective of this study is to investigate the effect of the spray characteristics on the etching characteristics for the optimization of etching process in the micro fabrication industry. The etching characteristics such as etching rate and etching factor were investigated under different etching conditions. To compare with the etching characteristic, the spray characteristics such as droplet size and velocity were measured by PDA system. The etching rate was increased in case of high spray pressure and in the region of spray center. The etching factor was increased with decrease in the distance from nozzle tip and increase in the etchant temperature. It was found that the spray characteristics were correlated with the etching characteristics.

개미 알고리듬을 이용한 설비배치계획 (Facility Layout Planning Using Ant Algorithm)

  • 이성열;이월선
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
    • /
    • pp.1065-1070
    • /
    • 2003
  • Facility Layout Planning is concerned with how to arrange facilities necessary for production in a given space. Its objective is often to minimize the total sum of all material flows multiplied by the distance among facilities. FLP belongs to NP complete problem; i.e., the number of possible layout solutions increases with the increase of the number of facilities. Thus, meta heuristics such as Genetic Algorithm (GA) and Simulated Annealing have been investigated to solve the FLP problems. However, one of the biggest problems which lie in the existing meta heuristics including GA is hard to find an appropriate combinations of parameters which result in optimal solutions for the specific problem. The Ant System algorithm with elitist and ranking strategies is used to solve the FLP problem as an another good alternative. Experimental results show that the AS algorithm is able to produce the same level of solution quality with less sensitive parameters selection comparing to the ones obtained by applying other existing meta heuristic algorithms.

  • PDF

최대 로트 그룹핑 문제의 복잡성 (On the hardness of maximum lot grouping problem)

  • 황학진
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
    • /
    • pp.409-416
    • /
    • 2003
  • We consider the problem of grouping orders into lots. The problem is modelled by a graph G = (V, E). where each node $\nu\;\in\;V$ denotes order specification and its weight $\omega(\nu)$ the orders on hand for the specification. We ran construct a lot simply from orders or single specification For a set of nodes (specifications) $\theta\;\subseteq\;V$, if the distance or any two nodes in $\theta$ is at most d, it is also possible to make a lot using orders on the nodes. The objective is to maximize the number of lots with size exactly $\lambda$. In this paper, we prove that our problem is NP-Complete when d = 2, $\lambda\;=\;3$ and each weight is 0 or 1. Moreover, it is also shown to be NP-Complete when d = 1, $\lambda\;=\;3$ and each weight is 1, 2 or 3

  • PDF

시간제약을 가진 다회방문 차량경로문제에 대한 휴리스틱 알고리즘 (A heuristic algorithm for the multi-trip vehicle routing problem with time windows)

  • 김미이;이영훈
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.1740-1745
    • /
    • 2006
  • This paper is concerned with a novel heuristic algorithm for the multi-trip vehicle routing problem with time windows. The objective function is the minimization of total vehicle operating time, fixed cost of vehicle and the minimization of total lateness of customer. A mixed integer programming formulation and a heuristic algorithm for a practical use are suggested. A heuristic algorithm is constructed two phases such as clustering and routing. Clustering is progressed in order to assign appropriate vehicle to customer, and then vehicle trip and route are decided considering traveling distance and time window. It is shown that the suggested heuristic algorithm gives good solutions within a short computation time by experimental result.

  • PDF

직선운동베어링 성능평가방법의 표준화 및 내구성 시험에 관한 연구 (A Study on the Fatigue Test and Performance Evaluation for Linear Motion Rolling Bearing)

  • 김태범;김동길;이상조;김익수;이위로;이동규
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2003년도 춘계학술대회 논문집
    • /
    • pp.1270-1274
    • /
    • 2003
  • The objective of this paper is to introduce the standard of evaluation methods and fatigue test for linear motion rolling bearing. In particular, attention well be given to the list of evaluation and fatigue results in this paper. The life of a linear motion rolling bearing is given by the length of distance covered between the connection parts before the first evidence of fatigue develops in the material of one of the raceways of rolling elements. The main factors that contribute to fatigue failures include: Number of load cycles experienced; Range of stress experienced in each load cycle; Mean stress experienced in each toad cycle; Presence of local stress concentrations.

  • PDF

차세대 DVD 시스템용 Actuator 연구 (Study on Dual-Lenses Actuator for HD-DVD System)

  • Kim, Seok-Jung;Lee, Yong-Hoon;Ahn, Young-Man;Chung, Chong-Sam
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2002년도 추계학술대회논문초록집
    • /
    • pp.377.1-377
    • /
    • 2002
  • Recently, an optical disc system has been proposed using blue laser diode, high NA objective lens and groove only disc structure. A new method is needed to readout CD and DVD in the blue system. In order to readout CD and DVD in HD-DVD system, we adopted dual-lenses actuator in consideration of optical utilization efficiency, optical performance and insurance of sufficient W.D (working distance). (omitted)

  • PDF

RAPD Marker에 의한 호박의 품종간 유연 관계 분석 (Assessment of Genetic Relationship among Curcurbitaceae Cultivars Revealed by RAPD Marker)

  • 김창훈;이승인;유병천;송인호;권용삼
    • 생명과학회지
    • /
    • 제13권5호
    • /
    • pp.590-595
    • /
    • 2003
  • The objective of this study was to assess of genetic variation within and between pumpkin species including Cucurbita maxima, C. moschata, C. pepo and C. maxima${\times}$C. moschata using RAPD markers. The 16 primers showed the amplification of 136 scorable fragments ranging from about 100 bp to 2300 bp. A total of 94 DNA fragments were polymorphic with an average 5.9 polymorphic bands per primer. A species $(C. maxima\timesC. moschata)$ has the highest number of polymorphic loci. Based on obtained data, UPGMA cluster analysis was conducted. Twenty pumpkin cultivars were classified into three large categories and identified genetic distance of cluster ranging from 0.38 and 1.00. Clustering was in accordance with the division of Curcurbitaceae into four species, C. maxima, C. moschata, C. pepo and C. $C. maxima\timesC. moschata$. Therefore, RAPD method may be essential tool for enabling discrimination of pumpkin cultivars.

지하철 터널 균열밀도 분석을 통한 합리적인 보수보강 방안 연구 (Study on a rational repair and reinforcement by analysis of crack density in OO subway)

  • 윤태국;신용석;안상로;이송
    • 한국터널공학회:학술대회논문집
    • /
    • 한국터널공학회 2005년도 학술발표회 논문집
    • /
    • pp.262-269
    • /
    • 2005
  • The priority order about a rational repair and reinforcement is generally decided by subjective decision of engineer. An appearance investigation by tunnel scanner that is widely used in foreign nation was carried out to decide about a rational repair and reinforcement through systematic and objective analysis in box and NATM tunnel. We have decided on the order of priority of an rational repair and reinforcement through the crack density analysis by span, distance and location with the result of tunnel scanner.

  • PDF

An Accelerated Simulated Annealing Method for B-spline Curve Fitting to Strip-shaped Scattered Points

  • Javidrad, Farhad
    • International Journal of CAD/CAM
    • /
    • 제12권1호
    • /
    • pp.9-19
    • /
    • 2012
  • Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.

철도건널목의 사고예측모형 개발에 관한 연구 (Development and Application of Accident Prediction Model for Railroad At-Grade Crossings)

  • 조성훈;서선덕
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2001년도 추계학술대회 논문집
    • /
    • pp.429-434
    • /
    • 2001
  • Rail crossings pose special safety concerns for modern railroad operation with faster trains. More than ninety percent of train operation-related accidents occurs on at-grade crossings. Surest countermeasure for this safety hazard is to eliminate at-grade crossings by constructing over/under pass or by closing them. These eliminations usually require substantial amount of investment and/or heavy public protest from those affected by them. Thorough and objective analysis are usually required, and valid accident prediction models are essential to the process. This paper developed an accident prediction model for Korean at-grade crossings. The model utilized many important factors such as guide personnel, highway traffic, train frequency, train sight distance, and number of tracks. Developed model was validated with actual accident data.

  • PDF