• Title/Summary/Keyword: Heuristic Procedure

Search Result 204, Processing Time 0.027 seconds

Optimal Design of Centralized Computer Networks - The Terminal Layout Problem and A Dual-based Procedure - (중앙집중식 전산망의 경제적 설계 -단말기 배치문제와 쌍대기반 해법-)

  • 김형욱;노형봉;지원철
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.14 no.1
    • /
    • pp.16-26
    • /
    • 1989
  • The terminal layout problem is fundamental in may centralized computer networks, which is generated formulated as the capaciated minimum spanning tree problem (CMSTP). We present an implementation of the dual-based procedure to solve the CMSTP. Dual ascent procedure generates a good feasible solutions to the dual of the linear programming relaxation of CMSTP. A feasible primal solution to CMSTP can then be constructed based on this dual solution. This procedure can be used either as a stand-alone heuristic or, else, it can be incorporated into a branch and bound algorithm. A numerical result is given with quite favorable results.

  • PDF

An efficient blood testing procedurer by using group testing (그룹 검사를 이용한 효율적인 혈액 검사 절차에 대한 연구)

  • 양원석;채경철
    • The Korean Journal of Applied Statistics
    • /
    • v.9 no.1
    • /
    • pp.17-29
    • /
    • 1996
  • Suppose we have g itesm classified as defective or as nondefective. If we test each item separately, then g tests are required. However, it is possible to test a group of g items so as to detect whether at least one of them is defective, and to proceed to individual testing only if the presense of at least one defective item is indicated. The method is called Dorfman procedure. In this paper, we consider a variant of Dorfman procedure called a hierarchal dorfman procedure. We also consider the curtailment effect resulted from the dependency of the tests. We propose an efficient blood testing procedure. We also present ot heuristic rule of thumb which is simple and easily implementable.

  • PDF

Development of Diagnostic Expert Systems for A Rotor System (로터시스템의 이상진단시스템에 대한 연구)

  • Kim, Sung-Chul;Kim, Sang-Pyo;Kim, Young-Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.61-68
    • /
    • 2001
  • A rotor system is composed of a rotating shaft with supporting bearings. The rotor system is widely used in every rotating machinery such as the turbine generator and the high precision machine tools. A negligible error or malfunction in the rotor, however, can cause a catastrophic failure in the system then result in the environmental and economic disasters. A diagnosis of the rotor system is important in preventing these kinds of failures and disasters. Up to now, many researchers have devoted in the development of diagnosing tools for the system. The basic principles behind the tools are to retrieve the data through the sensors for a specific state of the system and then to identify the specific state through the heuristic methods such as neural network, fuzzy logic, and decision matrix. The proper usage of the heuristic methods will enhance the performance of the diagnostic procedure when together used with the statistical signal processing. In this paper, the methodologies in using the above 3 heuristic methods for the diagnostics of the rotor system are established and also tested and validated for the data retrieved from the rolling element bearing and journal bearing supported system.

  • PDF

The Use of Particle Swarm Optimization for Order Allocation Under Multiple Capacitated Sourcing and Quantity Discounts

  • Ting, Ching-Jung;Tsai, Chi-Yang;Yeh, Li-Wen
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.2
    • /
    • pp.136-145
    • /
    • 2007
  • The selection of suppliers and the determination of order quantities to be placed with those suppliers are important decisions in a supply chain. In this research, a non-linear mixed integer programming model is presented to select suppliers and determine the order quantities. The model considers the purchasing cost which takes into account quantity discount, the cost of transportation, the fixed cost for establishing suppliers, the cost for holding inventory, and the cost of receiving poor quality parts. The capacity constraints for suppliers, quality and lead-time requirements for the parts are also taken into account in the model. Since the purchasing cost, which is a decreasing step function of order quantities, introduces discontinuities to the non-linear objective function, it is not easy to employ traditional optimization methods. Thus, a heuristic algorithm, called particle swarm optimization (PSO), is used to find the (near) optimal solution. However, PSO usually generates initial solutions randomly. To improve the PSO solution quality, a heuristic procedure is proposed to find an initial solution based on the average unit cost including transportation, purchasing, inventory, and poor quality part cost. The results show that PSO with the proposed initial solution heuristic provides better solutions than those with PSO algorithm only.

A Hierarchical Hybrid Meta-Heuristic Approach to Coping with Large Practical Multi-Depot VRP

  • Shimizu, Yoshiaki;Sakaguchi, Tatsuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.2
    • /
    • pp.163-171
    • /
    • 2014
  • Under amazing increase in markets and certain demand on qualified service in the delivery system, global logistic optimization is becoming a keen interest to provide an essential infrastructure coping with modern competitive prospects. As a key technology for such deployment, we have been engaged in the practical studies on vehicle routing problem (VRP) in terms of Weber model, and developed a hybrid approach of meta-heuristic methods and the graph algorithm of minimum cost flow problem. This paper extends such idea to multi-depot VRP so that we can give a more general framework available for various real world applications including those in green or low carbon logistics. We show the developed procedure can handle various types of problem, i.e., delivery, direct pickup, and drop by pickup problems in a common framework. Numerical experiments have been carried out to validate the effectiveness of the proposed method. Moreover, to enhance usability of the method, Google Maps API is applied to retrieve real distance data and visualize the numerical result on the map.

HW/SW Co-design of a Visual Driver Drowsiness Detection System

  • Yu, Tian;Zhai, Yujia
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.1
    • /
    • pp.31-39
    • /
    • 2014
  • PID auto-tuning controller was designed via fuzzy logic. Typical values such as error and error derivative feedback were changed as heuristic expressions, and they determine PID gain through fuzzy logic and defuzzification process. Fuzzy procedure and PID controller design were considered separately, and they are combined and analyzed. Obtained auto-tuning PID controller by Fuzzy Logic showed the ability for less than 3rd order plant control. We also applied to reference tracking problem with the designed auto-tuning scheme.

  • PDF

The Solution of Vehicle Scheduling Problems with Multiple Objectives in a Probabilistic Environment

  • Park, Yang-Byung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.1
    • /
    • pp.119-131
    • /
    • 1988
  • Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

  • PDF

PID auto-tuning controller design via fuzzy logic

  • He, Wei;Yu, Tian;Zhai, Yujia
    • Journal of the Korea Convergence Society
    • /
    • v.4 no.4
    • /
    • pp.31-40
    • /
    • 2013
  • PID auto-tuning controller was designed via fuzzy logic. Typical values such as error and error derivative feedbackwere changed as heuristic expressions, and they determine PID gain through fuzzy logic and defuzzification process. Fuzzy procedure and PID controller design were considered separately, and they are combined and analyzed. Obtained auto-tuning PID controller by Fuzzy Logic showed the ability for less than 3rd order plant control.

Distribution Feeder Reconfiguration Using Heuristic Rules (경험적 규칙을 이용한 배전계통의 재구성기법)

  • Cho, Si-Hyung;Choi, Byoung-Youn;Woo, Kwang-Bang
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.363-365
    • /
    • 1991
  • This paper presents a method for feeder reconfiguration in order to operate distribution systems efficiently using heuristic rules. The reconfiguration method presented here not only eliminates various abnormal states but also achieves minimum power loss and optimum load balance of the distribution feeders under normal operating condition transfering loads from one feeder to anoter applying the experiences of the experts. To implement the method effectively, a best-first tree searching strategy based on heuristics is used to evaluate the various load transfer alternatives. The development of a rule-based system aimed at the reduction of the search space is presented as a means of implementing the best-first searching strategy. The results of the computer simulation of the above procedure are as follows; 1) achieving minimum power loss of the distribution feeder adopting the optimum load transfer alternative. 2) Enhencing system reliability and achieving load balance through rational allocation of the feeder loads.

  • PDF

Analysis and Reconstruction of Vehicle Speeds to Design an Efficient Time Dependent VRP Heuristic (시간종속VRP의 효율적 해법 설계를 위한 차량통행속도의 분석과 재구성)

  • Moon, Gee-Ju;Park, Sung-Mee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.1
    • /
    • pp.140-147
    • /
    • 2012
  • Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds information in a typical metropolitan area are analyzed to use the results in the design procedure of VRP heuristic. Quality initial vehicle routing solutions can be obtained with adaption of the analysed results of the time periods with no vehicle speed changes. This strategy makes complicated time dependent vehicle speed simple to solve. Time dependent vehicle speeds are too important to ignore to obtain optimum vehicle routing search for real life logistics systems.