• Title/Summary/Keyword: Heuristic technique

Search Result 242, Processing Time 0.028 seconds

A practical coherency model for spatially varying ground motions

  • Yang, Qing-Shan;Chen, Ying-Jun
    • Structural Engineering and Mechanics
    • /
    • v.9 no.2
    • /
    • pp.141-152
    • /
    • 2000
  • Based on the discussion about some empirical coherency models resulted from earthquake-induced ground motion recordings at the SMART-1 array in Taiwan, and a heuristic model of the coherency function from elementary notions of stationary random process theory and a few simplifying assumptions regarding the propagation of seismic waves, a practical coherency model for spatially varying ground motions, which can be applied in aseismic analysis and design, is proposed, and the regressive coefficients are obtained using least-square fitting technique from the above recordings.

A Dynamic Programming Approach to PCB Assembly Optimization for Surface Mounters

  • Park, Tae-Hyoung;Kim, Nam
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.192-199
    • /
    • 2007
  • This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.

An integrated manufacturing and distribution model for a multi-echelon structure

  • Hwang, Heung-Suk
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1990.04a
    • /
    • pp.222-244
    • /
    • 1990
  • A multi-echelon structure of manufacturing and distribution system in considered, where the raw materials are transformed into a finished good through a number to manufacturing echelons and it is distributed to the lower echelons(retailers, or customers). The raw material, work-in-process, finished good inventory and the distribution costs are unified into one model. The objective is to determine the ordering policy of raw materials, manufacturing lot size, the number of sub-batch and the distribution policy of the finished good which minimize the annual total system cost. A computer program for a heuristic search technique is developed, by which a numerical example is examined.

  • PDF

Heuristic Approach to Service Restoration (경험 지식 기반 정전 복구)

  • Kim, Jong-Boo;Choi, Sang-Yule;An, Bi-O
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.1019-1020
    • /
    • 2006
  • The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to identify the most effective the set of switches using proposed search technique and a feeder load balance index. Test results on the KEPCO's 108 bus distribution system show that the performance is efficient and robust

  • PDF

Usability Evaluation Method of Information Technology Product (정보기술 제품의 사용성 평가방법)

  • 임치환;이민구
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.16 no.28
    • /
    • pp.69-75
    • /
    • 1993
  • The evaluation of product may be classified by technical tests or by ergonomics assessments. If an ergonomics assessment is required, then the three types of interface dimension are available to the researcher. In this paper, we proposed the heuristic evaluation method for usability of product in the three types of interface dimension The evaluation method is used the fuzzy weighted checklist technique computerized for evaluating or comparing prototype of system and IT product.

  • PDF

Development of Reliability-Based Optimum Design of High-Speed Railway Bridges Considering Structure-Rail Longitudinal Interaction and Structure-Vehicle Interaction Using Heuristic Decision Method (Heuristic Decision Method를 이용하여 구조물-궤도 종방향 상호작용 및 구조물-차량 상호작용을 고려한 고속철도 교량의 신뢰성 최적설계 기법 개발)

  • Ihm, Yeong-Rok
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.10 no.3
    • /
    • pp.31-38
    • /
    • 2010
  • In this study, it is suggested that it has to reliability-based design methodology with respect to bridge structure-rail longitudinal interaction and bridge structure-vehicle interaction. For the structural analysis, commercial package, ABAQUS, are used for a three-dimensional finite element analysis. The optimization process utilizes a well-known optimizer, ADS(Automated Design Synthesis). Optimization technique is utilized the ALM-BFGS method for global area search and Golden Section Method for 1-D search. In general, ALM-BFGS method don't need the 1-D search, and that algorithm converge a 0.1~0.2 of Push-Off factor. But in this study, value of Push-Off factor is used 90, therefore 1-D search should be needed for effective convergency. That algorithm contains the "heuristic decision method". As a result of optimum design of 2-main steel girder birdge with 5${\times}$(1@50m), design methodology suggested in this study was demonstrated more economic and efficient than existing design and LCC optimization not considering bridge-rail longitudinal interaction and bridge-vehicle interaction.

Design of Max Speed Dynamic Heuristic with Real Time Transportation Data (실시간 도로 정보를 이용한 최고속력 동적 휴리스틱의 설계)

  • Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.827-830
    • /
    • 2008
  • The Center Based Navigation System(CBNS) used real time road data searches an optimal path. The other hand, the Terminal Based Navigation System(TBNS) used embedded road data searches a path that has less qualitative than the CBNS. But the TBNS has been favored, because it has no additional fees. Generally, TBNS has not used real time road data but it is recently able to use it with technique such as TPEG. However, it causes to increase a cost of exploring by using real time road data for improvement qualify of a path, because of limited performance. We propose a path-finding algorithm using a Maximum peed Dynamic Heuristic to improve quality and reduce a cost of exploring. Proposed method is to use a maximum road speed of appropriate region as dynamic heuristic for path-finding.

  • PDF

An Improved Particle Swarm Optimization Algorithm for Care Worker Scheduling

  • Akjiratikarl, Chananes;Yenradee, Pisal;Drake, Paul R.
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.171-181
    • /
    • 2008
  • Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

Analysis of cable structures through energy minimization

  • Toklu, Yusuf Cengiz;Bekdas, Gebrail;Temur, Rasim
    • Structural Engineering and Mechanics
    • /
    • v.62 no.6
    • /
    • pp.749-758
    • /
    • 2017
  • In structural mechanics, traditional analyses methods usually employ matrix operations for obtaining displacement and internal forces of the structure under the external effects, such as distributed loads, earthquake or wind excitations, and temperature changing inter alia. These matrices are derived from the well-known principle of mechanics called minimum potential energy. According to this principle, a system can be in the equilibrium state only in case when the total potential energy of system is minimum. A close examination of the expression of the well-known equilibrium condition for linear problems, $P=K{\Delta}$, where P is the load vector, K is the stiffness matrix and ${\Delta}$ is the displacement vector, it is seen that, basically this principle searches the displacement set (or deformed shape) for a system that minimizes the total potential energy of it. Instead of using mathematical operations used in the conventional methods, with a different formulation, meta-heuristic algorithms can also be used for solving this minimization problem by defining total potential energy as objective function and displacements as design variables. Based on this idea the technique called Total Potential Optimization using Meta-heuristic Algorithms (TPO/MA) is proposed. The method has been successfully applied for linear and non-linear analyses of trusses and truss-like structures, and the results have shown that the approach is much more successful than conventional methods, especially for analyses of non-linear systems. In this study, the application of TPO/MA, with Harmony Search as the selected meta-heuristic algorithm, to cables net system is presented. The results have shown that the method is robust, powerful and accurate.

Affect Heuristic in Risk and Benefit Perception of Scientific Technologies (과학기술의 위험 및 이득 지각에서 감정추단)

  • Lee, Hyun-Ju;Lee, Young-Ai
    • Korean Journal of Cognitive Science
    • /
    • v.18 no.3
    • /
    • pp.305-324
    • /
    • 2007
  • We surveyed the emotional images of three kinds of scientific technologies in people's mind and the perception of technologies in terms of their risks and benefits. The contents of the image and their image values were used to estimate the affects on each technology. As an affect heuristic hypothesis predicted, people perceived the technology more beneficial or riskier depending on their overall affect. In other words, those who have positive affect on the technology Perceived less risky and more beneficial than those who have negative affect. On the other hand, those who have negative affect on the technology perceived riskier and less beneficial than those who have positive affect. We also found negative relationship between the perceived risk and perceived benefit of each technology. The implications of our findings that suggest affective heuristic were discussed in terms of the measurements of affect and the necessity of communication of scientific technologies with the public.

  • PDF