• 제목/요약/키워드: heuristic design

검색결과 494건 처리시간 0.025초

An Operating System Design and Development for Efficient Painting Process

  • Chung, Kuy-Hoon;Baek, Tae-Hyun;Park, Ju-Chull;Cho, Kyu-Kab
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
    • /
    • pp.183-187
    • /
    • 2000
  • In this study, we design a scheduling system for painting shop, called HYPOS(Hyundai heavy industry Painting shop Operating System) and develop a system implementing the design. The painting shop operations are currently scheduled manually by experts. Manual scheduling is a serious time consuming job and generally can not guarantee a full optimality. Building a traditional heuristic scheduling system lot this problem, however, is not promising because there are various kinds of constraints to be satisfied including space allocation of shipbuilding blocks in a painting cell. We, therefore, adopt a spatial scheduling approach and develop scheduling algorithms based on field-oriented scheduling heuristics and computational geometry. And we show that the algorithms can successfully be applied to the painting shop scheduling problem.

  • PDF

FTTH-PON 가입자망 설계에서 Splitter Location-Allocation 문제 (A Splitter Location-Allocation Problem in Designing FTTH-PON Access Networks)

  • 박찬우;이영호;한정희
    • 한국경영과학회지
    • /
    • 제36권2호
    • /
    • pp.1-14
    • /
    • 2011
  • In this paper, we deal with an access network design problem of fiber-to-the-home passive optical network (FTTH-PON). The FTTH-PON network design problem seeks to minimize the total cost of optical splitters and cables that provide optical connectivity between central office and subscribers. We develop a flow-based mixed integer programming (MIP) model with nonlinear link cost. By developing valid inequalities and preprocessing rules, we enhance the strength of the proposed MIP model in generating tight lower bounds for the problem. We develop an effective Tabu Search (TS) heuristic algorithm that provides good quality feasible solutions to the problem. Computational results demonstrate that the valid inequalities and preprocessing rules are effective for improving the LP-relaxation lower bound and TS algorithm finds good quality solutions within reasonable time bounds.

Analytical Procedures for Designing an Optimal Noise Hazard Prevention Program

  • Asawarungsaengkul, Krisada;Nanthavanij, Suebsak
    • Industrial Engineering and Management Systems
    • /
    • 제4권2호
    • /
    • pp.165-175
    • /
    • 2005
  • Two extreme and one mixed procedures for designing a noise hazard prevention program are discussed in this paper. The two extreme design procedures (engineering-based and HPD-based) yield upper and lower bounds of the total noise control cost, respectively; while the mixed design procedure provides an optimal noise hazard prevention program within a given total budget. The upper bound of the workforce size for job rotation is approximated using a heuristic procedure. Six optimization models are developed and utilized by the mixed procedure to eliminate or reduce excessive noise levels (or noise exposures) in an industrial workplace. The mixed procedure also follows the OSHA’s hierarchy of noise control. A numerical example is given to demonstrate the application of the proposed design procedures.

On Solving the Tree-Topology Design Problem for Wireless Cellular Networks

  • Pomerleau Yanick;Chamberland Steven;Pesant Gilles
    • Journal of Communications and Networks
    • /
    • 제8권1호
    • /
    • pp.85-92
    • /
    • 2006
  • In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

상차림중심의 지능형 수산물 인터넷 쇼핑몰 개발 (Intelligent Electronic Shoppingmall with Bundle Product Suggestions for Fisheries)

  • 정대율
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제10권2호
    • /
    • pp.5-32
    • /
    • 2001
  • The main goal of this research is at the development of a bundle product suggestion sub-system of an internet shopping mall for fishery products, which can reduce the search cost of user. To achieve the goal, we first study tie key factors of successful direct commerce for fishery products, and second, we design a bundle product suggestion module and its sub-module. For this, we identify the objectives of system, and write out the necessary functions of the system and models(process model, data model, dynamic model) through the analysis of user requirements. Based on the functions and models, we design user interfaces, database, processes, and knowledge base. In designing knowledge base and inferencing strategy, we consider two intelligent agent approach(optimal algorithms, heuristic rules) and suggest one more approach(case-based reasoning). The intelligent agent can be used in enhancing the suggestion of multiple fishery product simultaneously. The system analysis and design documents presented as the research results can be used to provide good guidelines to the companies who consider developing an production suggestion agents.

  • PDF

장애극복형 네트워크 설계에 관한 연구 (On the Survivable Network Design Problem)

  • 명영수;김현준
    • 산업공학
    • /
    • 제9권3호
    • /
    • pp.72-80
    • /
    • 1996
  • As the fiber optic technology is rapidly being deployed in telecommunication networks, particular emphasis is placed on the survivability in designing networks. Most of the survivable network design models proposed to date have connectivity constraints, which cannot precisely define a network topology owing to the multiplicity of feasible ones. In this paper, we propose a k-link survivable network design model incorporating traffic-based survivability constraints which restrict the lost traffic due to a network failure under a prescribed level. Our model is shown to include the existing connectivity models as special cases. Then we present its integer programming formulation, analyze the structural properties, and develop a heuristic for obtaining low cost survivable networks.

  • PDF

Reduced record method for efficient time history dynamic analysis and optimal design

  • Kaveh, A.;Aghakouchak, A.A.;Zakian, P.
    • Earthquakes and Structures
    • /
    • 제8권3호
    • /
    • pp.639-663
    • /
    • 2015
  • Time history dynamic structural analysis is a time consuming procedure when used for large-scale structures or iterative analysis in structural optimization. This article proposes a new methodology for approximate prediction of extremum point of the response history via wavelets. The method changes original record into a reduced record, decreasing the computational time of the analysis. This reduced record can be utilized in iterative structural dynamic analysis of optimization and hence significantly reduces the overall computational effort. Design examples are included to demonstrate the capability and efficiency of the Reduced Record Method (RRM) when utilized in optimal design of frame structures using meta-heuristic algorithms.

Conceptualizing the Realistic Mathematics Education Approach in the Teaching and Learning of Ordinary Differential Equations

  • Kwon, Oh-Nam
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제6권2호
    • /
    • pp.159-170
    • /
    • 2002
  • The undergraduate curriculum in differential equations has undergone important changes in favor of the visual and numerical aspects of the course primarily because of recent technological advances. Yet, research findings that have analyzed students' thinking and understanding in a reformed setting are still lacking. This paper discusses an ongoing developmental research effort to adapt the instructional design perspective of Realistic Mathematics Education (RME) to the teaching and learning of differential equations at Ewha Womans University. The RME theory based on the design heuristic using context problems and modeling was developed for primary school mathematics. However, the analysis of this study indicates that a RME design for a differential equations course can be successfully adapted to the university level.

  • PDF

Museum Web 공간의 사용성 평가와 구조분석에 관한 연구 (A Study on the Usability test and Space Syntax analysis in Web Museum)

  • 최성욱;황미영;임채진
    • 한국실내디자인학회:학술대회논문집
    • /
    • 한국실내디자인학회 2002년도 춘계학술발표대회 논문집
    • /
    • pp.99-104
    • /
    • 2002
  • The main concept of this thesis is to research about how to express the interface element of the virtual museum on tile cyber space and how to evaluate its organization. In addition, the basis of this thesis is to help people build their efficient spaces on the current virtual museum. My understanding about the interface element and its structural evaluation is grounded on Usability evaluation and Syntax thesis. For the survey, I utilize two different methods. One is regular questionnaire; the other is heuristic evaluation which is derived from empirical study and practical experience. The survey is mainly composed of contents, design, usability and overall impression. The main concept of this research is to establish the initial foundation of the virtual museum on cyber space by suggesting an objective evolutional norm including esthetic orientation.

  • PDF

안정성 설계방법을 이용한 자동흐름라인의 완충재고용량 할당 (Allocation of Buffer Capacity in Automatic Transfer Line Using Robust Design Method)

  • 서순근;정원기
    • 산업공학
    • /
    • 제12권2호
    • /
    • pp.210-221
    • /
    • 1999
  • Several researchers have previously studied the problem of allocating buffer storage to maximize the throughput rate and/or minimize the mean buffer average of a transfer line for a given total amount of buffer space. But there seems to be very little difference in performance between intuitively reasonable and optimal allocations. This paper proposes and illustrates a methodology, based on the robust design concept of Taguchi, to allocate buffer storage of long transfer lines with a given total amount of buffer capacity when up and down times follow exponential distributions, respectively. We show how this procedure using simple heuristic rule can be used for design of long transfer lines.

  • PDF