• 제목/요약/키워드: Goal Programming

검색결과 294건 처리시간 0.019초

기계중복과 셀간 이동수의 최소화가 가능한 예외적 요소의 제거 방법 : 비용 및 설치대수 제약 고려 (A Method of Eliminating Exceptional Elements Attaining Minimum Machine Duplications and Intercell Moves In Cellular Manufacturing Systems)

  • 장익;윤창원;정병희
    • 한국경영과학회지
    • /
    • 제23권4호
    • /
    • pp.87-96
    • /
    • 1998
  • Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

  • PDF

Weighting objectives strategy in multicriterion fuzzy mechanical and structural optimization

  • Shih, C.J.;Yu, K.C.
    • Structural Engineering and Mechanics
    • /
    • 제3권4호
    • /
    • pp.373-382
    • /
    • 1995
  • The weighting strategy has received a great attention and has been widely applied to multicriterion optimization. This gaper examines a global criterion method (GCM) with the weighting objectives strategy in fuzzy structural engineering problems. Fuzziness of those problems are in their design goals, constraints and variables. Most of the constraints are originated from analysis of engineering mechanics. The GCM is verified to be equivalent to fuzzy goal programming via a truss design. Continued and mixed discrete variable spaces are presented and examined using a fuzzy global criterion method (FGCM). In the design process a weighting parameter with fuzzy information is introduced into the design and decision making. We use a uniform machine-tool spindle as an illustrative example in continuous design space. Fuzzy multicriterion optimization in mixed design space is illustrated by the design of mechanical spring stacks. Results show that weighting strategy in FGCM can generate both the best compromise solution and a set of Pareto solutions in fuzzy environment. Weighting technique with fuzziness provides a more relaxed design domain, which increases the satisfying degree of a compromise solution or improves the final design.

기계중복과 셀간 이동수의 최소화가 가능한 예외적 요소의 제거 방법 : 비용 및 설치대수 제약 고려 (A Method of Eliminating Exceptional Elements Attainting Minimum Machine Duplications and Intercell Moves In Cell Manufacturing Systems)

  • 장익;윤창원;정병희
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1998년도 추계학술대회 논문집
    • /
    • pp.263-266
    • /
    • 1998
  • Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

  • PDF

포병진지 구축을 위한 공병장비 최적배정 모형 (Optimum Allocation Model of Military Engineer Equipments for Artillery Position Development)

  • 장영초;이문걸
    • 경영과학
    • /
    • 제34권2호
    • /
    • pp.103-113
    • /
    • 2017
  • The artillery is a key element of the ground forces operation during wartime, and the military engineers support the artillery position development operation to support the smooth operation of the artillery. In establishing the artillery position development operation plan, the commander requires more than his intuition to find the best option reflecting a number of elements of the battlefield situation which changes every minute. Moreover, the number of available equipment is smaller than the number of required position developments, and the effective equipment operation becomes essential element of this issue. This study quantified the capability of the available engineering equipment, organized a number of teams enabling equipment to put out the maximum capacity based on the quantified figures, and formed the model which allocates the team to the developing points to minimize the developing time. The goal programming method was applied to resolve the problem. The developed model was applied to compare the total mission duration following the number of teams, the variable for commander's decision, and the result of this study can be used as the quantitative data for commander's decision making process in establishing the artillery position development support operation through effective equipment management.

부하불평형 및 부하모형을 고려한 복합배전계통의 분산형전원의 연계 방안 (Interconnection of Dispersed Generation Systems considering Load Unbalance and Load Model in Composite Distribution Systems)

  • 이유정;김규호;이상근;유석구
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제53권5호
    • /
    • pp.266-274
    • /
    • 2004
  • This paper presents a scheme for the interconnection of dispersed generator systems(DGs) based on load .unbalance and load model in composite distribution systems. Groups of each individual load model consist of residential, industrial, commercial, official and agricultural load. The unbalance is involved with many single-phase line segment. . Voltage profile improvement and system loss minimization by installation of DGs depend greatly on how they are placed and operated in the distribution systems. So, DGs can reduce distribution real power losses and replace large-scale generators if they are placed appropriately in the distribution systems. The main idea of solving fuzzy goal programming is to transform the original objective function and constraints into the equivalent multi-objectives functions with fuzzy sets to evaluate their imprecise nature for the criterion of power loss minimization, the number or total capacity of DGs and the bus voltage deviation, and then solve the problem using genetic algorithm. The method proposed is applied to IEEE 13 bus and 34 bus test systems to demonstrate its effectiveness.

초등학교 저학년을 위한 교육용 프로그래밍 언어 스크래치주니어와 비스킷 사용성 분석 (Analysis of the usability of ScratchJr and Viscuit for the lower grades in elementary school)

  • 정나은;김자미;이원규
    • 정보교육학회논문지
    • /
    • 제23권4호
    • /
    • pp.303-314
    • /
    • 2019
  • 2015개정 교육과정에 의해 2019년부터 초등학교 5, 6학년을 대상으로 실과과목에서 정보교육이 진행되고 있지만, 국외에서는 초등학교 저학년부터 정보교육을 시행하는 경우가 많다. 이에 본 연구는 초등학교 저학년의 특성을 고려한 프로그래밍 언어의 선택 방향성을 제시하기 위한 목적이 있다. 목적 달성을 위해 저학년의 발달특징과 교육용 프로그래밍 언어의 필요요소를 고려하여 평가 준거를 개발하였다. 준거에 근거하여 두 언어의 사용성을 분석한 결과는 다음과 같다. 첫째, 비스킷은 학령이 낮은 학생의 표현력 고려, 프로그래밍의 개념에 대한 학습 없이 알고리즘 익히기 등에 활용할 수 있으며, 둘째, 스크래치 주니어는 알고리즘이나 프로그래밍에 대한 개념 학습에 용이한 것으로 나타났다. 본 연구는 향후, 초등학교 저학년 대상의 프로그래밍 교육을 대비하여 학생들의 발달 상태를 고려한 시사점을 제시했다는데 의의가 있다.

수자원 운영계획 시스템의 구현을 위한 수리계획 모형 자료구조의 활용 (Utilization of a Mathematical Programming Data Structure for the Implementation of a Water Resources Planning System)

  • 김재희;김승권;박영준
    • 산업공학
    • /
    • 제16권4호
    • /
    • pp.485-495
    • /
    • 2003
  • This paper reports on the application of the integration of mathematical programming model and database in a decision support system (DSS) for the planning of the multi-reservoir operating system. The DSS is based on a multi-objective, mixed-integer goal programming (MIGP) model, which can generate efficient solutions via the weighted-sums method (WSM). The major concern of this study is seamless, efficient integration between the mathematical model and the database, because there are significant differences in structure and content between the data for a mathematical model and the data for a conventional database application. In order to load the external optimization results on the database, we developed a systematic way of naming variable/constraint so that a rapid identification of variables/constraints is possible. An efficient database structure for planning of the multi-reservoir operating system is presented by taking advantage of the naming convention of the variable/constraint.

HORB에 기반한 신뢰성 있는 분산 프로그래밍 환경의 설계 및 구현 (Design and Implementation of Reliable Distributed Programming Environment based on HORB)

  • 현무용;김식;김명준
    • 전자공학회논문지CI
    • /
    • 제39권2호
    • /
    • pp.1-9
    • /
    • 2002
  • DSOM, DCOM, CORBA, Java RMI 같은 객체 지향 분산 프로그래밍 환경을 이용한 분산 응용 프로그램 개발이 일반화되고 있다. 그러나, 이러한 분산 미들웨어들은 응용프로그램의 품질과 재사용성을 향상시켜 주지만, 결함 허용 기능을 지원하지 않음으로서 신뢰성이 보장된 객체 기반 분산 응용프로그램의 설계 및 구현을 복잡하게 한다. 본 논문에서는 RMI 메커니즘을 기반으로 한 결함 허용 분산 시스템 개발 환경인 에버그린(Evergreen)을 제안하고자 한다. 에버그린은 신뢰성 있는 분산 컴퓨팅을 지원하기 위해서 체크포인트와 롤백 복구(rollback recovery) 메커니즘을 이용하여 설계되었다 일련의 실험을 통해 에버그린의 성능을 평가하였고 최적의 디자인 목표를 지원하기 위한 확장 가능성을 확인하였다.

실시간 적응 A* 알고리즘과 기하학 프로그래밍을 이용한 선박 최적항로의 2단계 생성기법 연구 (Two-Phase Approach to Optimal Weather Routing Using Real-Time Adaptive A* Algorithm and Geometric Programming)

  • 박진모;김낙완
    • 한국해양공학회지
    • /
    • 제29권3호
    • /
    • pp.263-269
    • /
    • 2015
  • This paper proposes a new approach for solving the weather routing problem by dividing it into two phases with the goal of fuel saving. The problem is to decide two optimal variables: the heading angle and speed of the ship under several constraints. In the first phase, the optimal route is obtained using the Real-Time Adaptive A* algorithm with a fixed ship speed. In other words, only the heading angle is decided. The second phase is the speed scheduling phase. In this phase, the original problem, which is a nonlinear optimization problem, is converted into a geometric programming problem. By solving this geometric programming problem, which is a convex optimization problem, we can obtain an optimal speed scheduling solution very efficiently. A simple case of numerical simulation is conducted in order to validate the proposed method, and the results show that the proposed method can save fuel compared to a constant engine output voyage and constant speed voyage.

관점지향 프로그램 기반의 동적 소프트웨어 컴포넌트 조합 패턴 (Dynamic Software Component Composition Based On Aspect-Oriented Programming)

  • 배성문;박철순;박춘호
    • 산업경영시스템학회지
    • /
    • 제31권4호
    • /
    • pp.100-105
    • /
    • 2008
  • Cost reduction, time to market, and quality improvement of software product are critical issues to the software companies which try to survive in recent competitive market environments. Software Product Line Engineering (SPLE) is one of the approaches to address these issues. The goal of software product line is to maximize the software reuse and achieve the best productivity with the minimum cost. In software product line, software components are classified into the common and variable modules for composition work. In this paper, we proposed a dynamic composition process based on aspect-oriented programming methodology in which software requirements are classified into the core-concerns and cross-cutting concerns, and then assembled into the final software product. It enables developers to concentrate on the core logics of given problem, not the side-issues of software product such as transactions and logging. We also proposed useful composition patterns based on aspect oriented programming paradigm. Finally, we implemented a prototype of the proposed process using Java and Aspect to show the proposed approach's feasibility. The scenario of the prototype is based on the embedded analysis software of telecommunication devices.