• Research in Mathematical Education
• /
• v.15 no.4
• /
• pp.311-325
• /
• 2011

In this paper I propose that teaching students the most efficient method of problem solving may curtail students' creativity. Instead it is important to arm students with a variety of problem solving heuristics. It is the students' responsibility to decide which heuristic will solve the problem. The chosen heuristic is the one which is meaningful to the students.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.554-558
• /
• 2001

In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.279-282
• /
• 2001

This paper is concerned with Vehicle Routing Problem to minimize the total delivery waiting time of customers. The delivery waiting time is the time taken to travel from the depot to the customer, which is important for the delivery of the perishing products or foods requiring freshness. We construct a mixed integer linear programming formulation of this problem, and CR(Clustering first Routing second) heuristic and SPH(set partitioning heuristic) are suggested. the results of computational experiments showed that these heuristics find successfully favorable solutions, in much shorter time than optimal.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.115-127
• /
• 1996

Based on a job insertion method, we developed a heuristic algorithm for the mean flowtime objective in a permutation flowshop environment. The simulation experiments are implemented to evaluate the effectiveness of the proposed algorithm against the existing heuristics. The experiments reveal the superiority of the proposed algorithm to other heuristics especially when the ratio of the number of jobs and number of machines is greater than or equal to two.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.97-104
• /
• 1990

The problem is a variation of the weighted set-covering problem (SCP) which requires the minimum-cost cover to be self-covering. It is shown that direct extension of the well-known greedy heuristic for SCP can have an arbitrarily large error in the worst case. It remains an open question whther these exists a greedy heuristic with a finite error bound.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.3
• /
• pp.94-102
• /
• 2007

In this paper, we consider a line balancing problem in hybrid flowshops where each workstation has identical parallel machines. The number of machines in each workstation is determined in ways of satisfying pre-specified throughput rate of the system. To minimize the total number of machines in the systems, we propose five heuristic methods and one simulated annealing method. Extensive computational experiments found the superiorities of two heuristic methods and the meta-heuristic.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.917-920
• /
• 1993

Various forms of hardware alternatives exist for the implementation of fuzzy logic controllers. In this paper, we describe a systematic framework for realizing fuzzy heuristics on programmable-logic-devices. Our approach is suitable for the automated development of fuzzy logic controllers.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.989-992
• /
• 1993

In this paper, we describe hardware architecture of fuzzy processors for reasoning involving fuzzy control“Heuristics”. This we believe will lead to fuzzy systems that are closer to the way humans process domain knowledge for decision making. One noticeable beneficial effect based on our notion of fuzzy heuristics is the significantly reduced number of rules required.

• Journal of the military operations research society of Korea
• /
• v.36 no.3
• /
• pp.29-42
• /
• 2010

In this study, the weapon-target assignment problem arising in military application of operations research is considered. We reformulated the problem in order to simplify the solution methods based on genetic algorithms and heuristics. Since the problem is well known as NP-complete and cannot be solved in polynomial time, such solution methods have been widely used to obtain good solutions. Two chromosome representations--target number representation and permutation representation--in genetic algorithm are compared. In addition, a construction heuristic and three improving heuristics are developed. Several experiments under the condition of transitivity rules in weapon's kill probability have been accomplished. It shows that the construction heuristic and exchange-based improving heuristic guarantees good solutions within a second and the performance of construction heuristic is sensitive to transitivity rules.

• Journal of Korea Multimedia Society
• /
• v.11 no.1
• /
• pp.44-52
• /
• 2008

This paper is on the enhancement of our heuristics for Grade Of Services Steiner Minimum Tree (GOSST) problem that can apply to the design of communication networks offering manifold grade of services in multimedia communication area. GOSST problem known as one of NP-Hard problems asks for a network topology meeting the G-Condition with minimum construction cost. In our prior researches, we proposed some heuristics for the problem. In this paper, we suggest a strategy of G-Condition scrutiny sequence to fortify our previous heuristics. In the experiment results, the ameliorated achieves 71.9% economy of execution times, 28.9% of required Steiner points and 1.1% of network construction costs.