• Title/Summary/Keyword: Heuristic Method

Search Result 1,093, Processing Time 0.025 seconds

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.

Development of the Dripping Speed Measurement System of Medical Liquid using Heuristic (휴리스틱을 이용한 의료 수액 낙하 속도 측정 시스템 개발)

  • Kim, Jung-Sook;Jeong, Junho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.5
    • /
    • pp.542-547
    • /
    • 2014
  • This paper describes the medical and IT convergence system using a smart phone and a heuristic method for the measurement of the dripping speed of the liquid in a drip chamber, which can estimate the remaining time using pattern recognition and difference image from video frame information based on Android technology. The video frames were first made using a smartphone camera and we calculated the difference image between the n image and the (n-1) image and then changed into binary images using the threshold value. At this point, it is very important to find an optimal threshold value using heuristic method to recognize the dripping of the liquids. In addition, the user can adjust the dripping speed according to the doctor's prescription, exactly like watching the progress bar of a mobile application. The experiment results show that our method using video processing technique accurately measures the dripping speed for a wide range of speeds that are sufficient for ordinary practice.

Regional Science and Technology Resource Allocation Optimization Based on Improved Genetic Algorithm

  • Xu, Hao;Xing, Lining;Huang, Lan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1972-1986
    • /
    • 2017
  • With the advent of the knowledge economy, science and technology resources have played an important role in economic competition, and their optimal allocation has been regarded as very important across the world. Thus, allocation optimization research for regional science and technology resources is significant for accelerating the reform of regional science and technology systems. Regional science and technology resource allocation optimization is modeled as a double-layer optimization model: the entire system is characterized by top-layer optimization, whereas the subsystems are characterized by bottom-layer optimization. To efficaciously solve this optimization problem, we propose a mixed search method based on the orthogonal genetic algorithm and sensitivity analysis. This novel method adopts the integrated modeling concept with a combination of the knowledge model and heuristic search model, on the basis of the heuristic search model, and simultaneously highlights the effect of the knowledge model. To compare the performance of different methods, five methods and two channels were used to address an application example. Both the optimized results and simulation time of the proposed method outperformed those of the other methods. The application of the proposed method to solve the problem of entire system optimization is feasible, correct, and effective.

A Scalable Heuristic for Pickup-and-Delivery of Splittable Loads and Its Application to Military Cargo-Plane Routing

  • Park, Myoung-Ju;Lee, Moon-Gul
    • Management Science and Financial Engineering
    • /
    • v.18 no.1
    • /
    • pp.27-37
    • /
    • 2012
  • This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

Global Redundancey Check by VLSI Test Theory (VLSI 테스트 이론을 이용한 Global Redundancy 조사)

  • Lee, Seong-Bong;Chong, Jong-Wha
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.4
    • /
    • pp.138-144
    • /
    • 1989
  • In this paper, a new method is proposed to remove the logical redundancy for the gate-level circuit optimization. In this method, only the fanout-branch signals in the circuits, not all the signals, are examined for redundancy. When a signal is determined to be nonredundant, other nonredundant signals are found out by the efficient procedure, using only the informations which are generated in the course of the redundancy-check. In order to avoid the re-examination of a signal for redudancy, a heuristic method is proposed to determine the redundancy-checking order of signals. The proposed method is heuristic, based on the VLSI test theory. It is much faster than other methods, since it does not reexamine a signal for redundancy.

  • PDF

A Study on Node Selection Strategy for the Virtual Network Embedding (가상 네트워크 대응 시 노드 선택 기준에 대한 고찰)

  • Woo, Miae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.8
    • /
    • pp.491-498
    • /
    • 2014
  • Due to the ossification of current Internet, it is hard to accommodate new service requirements. One of the solutions to this problem is network virtualization. In this paper, we propose a heuristic virtual network embedding method for network virtualization. The proposed method checks whether the candidate substrate nodes in the substrate network have the possibility of satisfying virtual link requirements. It gives priority to the virtual nodes and the substrate nodes, and embeds the node with higher priority first. Also, the proposed method tries to cluster the mapped substrate nodes if possible. We evaluate the performance of the proposed method in terms of time complexity and virtual network acceptance rate.

A Variable Neighbourhood Descent Algorithm for the Redundancy Allocation Problem

  • Liang, Yun-Chia;Wu, Chia-Chuan
    • Industrial Engineering and Management Systems
    • /
    • v.4 no.1
    • /
    • pp.94-101
    • /
    • 2005
  • This paper presents the first known application of a meta-heuristic algorithm, variable neighbourhood descent (VND), to the redundancy allocation problem (RAP). The RAP, a well-known NP-hard problem, has been the subject of much prior work, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. The variable neighbourhood descent method has not yet been used in reliability design, yet it is a method that fits perfectly in those combinatorial problems with potential neighbourhood structures, as in the case of the RAP. A variable neighbourhood descent algorithm for the RAP is developed and tested on a set of well-known benchmark problems from the literature. Results on 33 test problems ranging from less to severely constrained conditions show that the variable neighbourhood descent method provides comparable solution quality at a very moderate computational cost in comparison with the best-known heuristics. Results also indicate that the VND method performs with little variability over random number seeds.

A study on a schedule-cost analysis model for defense R&D project planning (국방 R&D프로젝트의 일정-비용분석모델의 연구)

  • 황홍석;류정철;정덕길
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.213-216
    • /
    • 1996
  • R'||'&'||'D project management is a process of decisions concerned with the achievement of goals of objectives. Especially, defense R'||'&'||'D project planning is the key in the successfull management of defense development. The defense project managers are constantly having to perform "what if\ulcorner" exercise, such as what if the project is extended out for an additional cost\ulcorner In this reserch, we developed a schedule-cost analysis model based upon Critical Path Method(CPM) and Venture Evaluation and Review Technique(VERT) for schedule-cost trade off analysis defense R'||'&'||'D projects. In the first step, a deterministic model is developed as a heuristic which deterministic model is developed as a heuristic which determines the schedule extension and reduction cost as a function desired schedule. In the second step, a stochastic network simulation model is developed to analyse the project risk (sucess and failure). The expected time and cost can be determined for desired schedule under the assumptions of stochastic arc data (time and cost) with a various precedence relationships. This model provides the defense R'||'&'||'D managers with an estimated and expected cost for curtailing or extending a project a given amount of time. The effectiveness and efficiency of the proposed methods, a heuristic and stochastic networks simulations, have been demonstrated through examples.

  • PDF

Application of a PERT-Type System on Work Management in Home-Delivered Meals Service Program for Elderly (가정배달 노인급식서비스 작업공정관리 모형개발을 위한 PERT-Type System의 적용)

  • 양일선;채인숙;유일근
    • Journal of Nutrition and Health
    • /
    • v.34 no.6
    • /
    • pp.701-714
    • /
    • 2001
  • The purpose of this study was to apply a PERT-type system, a combination of the project evaluation and review technique(PERT) and critical path method(CPM) on the employees' work time management of flood preparation, assembly, transportation and cleaning in home-delivered meals program for elderly The resources allotment heuristic program was developed by considering the number of employees and cooking utilities, being limited resources of home- delivered meals program. This program could assign the employees to perform the works included in flood preparation, assembly, transportation ind cleaning. Critical path and activities ware identified by PERT-type system on the basic of work time investigation in five senior centers. Work sheets were invented to perform the work by the shortest path with flexible employees'maximum flow As a result of the work time investigation, the most prevalent activities were ones of preparation in center C and E. Besides, the preparation(over fifty percent) was the most proportion among flood preparation, assembly, transportation and cleaning in center C and E. Critical path and activities of 'C'center were cucumber in sauce preparation path and assembly, wrapping in assembly path and case delivery in transportation path. Critical path and activities of 'E'center were Pan-fried Potato Preparation Path and assembly, case covering, wrapping in assembly Path. The work sheet invented by the heuristic program and PERT-type system reduced the work completion time and man hours in both centers.

  • PDF

The Design and Development of On-line Game Characteristic Evaluation System by a Heuristic Evaluation Item (사용성(Heuristics) 평가 항목을 통한 온라인 게임성 평가 시스템 설계 및 구현)

  • Kang, Ki-Ho;Choi, Hwan-Eon;Jung, Chool-Gon;Hong, Soo-Bong
    • Journal of Korea Game Society
    • /
    • v.9 no.1
    • /
    • pp.63-74
    • /
    • 2009
  • This paper mainly focused on research developing online game characteristic evaluation system based on game characteristic evaluation model design. Online game characteristic evaluation system is a system that evaluates game online in real-time using evaluation elements defined by model design. Game characteristic evaluation system uses heuristic evaluation method, which is used to execute evaluation in four parts, technical element, manage element, social element, and competitive element. To verify objectivity and validity of game characteristic evaluation, assessment was performed by three groups of beginners, intermediates, and professionals to increase the trust. And game characteristic evaluation forum was hosted to collect opinion from diverse classes.

  • PDF