• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.282-285
• /
• 1998

The purpose of this study is to present a method for determining the k most vital arcs in the maximum flow problem using a heuristic method. Generally, the problem which determine the k most vital arcs in maximum flow problem has known as NP-hard. Therefore, in this study we propose a method for determining all the k most vital arcs in maximum flow problem using a genetic algorithm. The proposed algorithm found all alternatives within shorter time than other heuristic methods. The method presented in this study can determine all the alternatives when there exists other alternative solutions.

• 산업경영시스템학회지
• /
• 제24권66호
• /
• pp.91-98
• /
• 2001

In this study, a heuristic for surface mounters is developed to find an efficient sequence on PCB and rack assignment by component grouping. As setting up 4 reels in a group, the distance of rack moving can be minimized. And then, a generalized model for N reels in a group is developed. It is found that the performance of this heuristic is better than other heuristics found in the literature. Throughout the simulation study, the suggested heuristic is performed about 8.2 ∼ 12% better than other heuristics.

• 한국경영과학회지
• /
• 제13권2호
• /
• pp.215-215
• /
• 1988

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• 경영과학
• /
• 제20권1호
• /
• pp.141-148
• /
• 2003

Vehicle routing problem Is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing problem. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COHSOAL can be a good possible approach to solve the vehicle routing problem.

• 경영과학
• /
• 제13권2호
• /
• pp.215-232
• /
• 1996

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• 산업경영시스템학회지
• /
• 제30권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.

• 대한기계학회논문집A
• /
• 제22권1호
• /
• pp.90-101
• /
• 1998

This paper presents a scheduling method that uses Petri net modeling and heuristic search to handle the tool setup. In manufacturing systems, a tool is attached to a particular machine to process a particular operation. The activity to attach a tool to a particular machine and detach the tool from the machine requires time. The processing time of operations varies according to the attached tool and the machine used. The method proposed in this paper uses Petri net to model these characteristics and applies a search algorithm to the reachability graph of the Petri net model to generate an optimal or near-optimal schedule. New heuristic functions are developed for efficient search. The experimental results that show the effectiveness of the proposed method are presented.

• 한국경영과학회지
• /
• 제38권4호
• /
• pp.1-9
• /
• 2013

We propose a heuristic algorithm for war-game model that is appropriate for warfare in which the maneuver of the attacker is relatively certain. Our model is based on a multi-weapon extention of the Lanchester's square law. However, instead of dealing with the differential equations, we use a multi-period linear approximation which not only facilitates a solution method but also reflects discrete natures of warfare. Then our game model turns out to be a continuous game known to have an ${\varepsilon}$-Nash equilibrium for all ${\varepsilon}{\geq}0$. Therefore, our model approximates an optimal warfare strategies for both players as well as an efficient reinforcement of area defense system that guarantees a peaceful equilibrium. Finally, we report the performance of a practical best-response type heuristic for finding an ${\varepsilon}$-Nash equilibrium for a real-scale problem.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2001년도 춘계학술대회 논문집
• /
• pp.65-69
• /
• 2001

In this paper, consider the three cases of decide for appling point a general Simple Genetic Algorithm about heuristic method(Bottom and Left Sliding) at the piece auto-nesting on the row plate. The 1st case, about only using the Simple Genetic Algorithm. The 2nd case, applied the heuristic method to the genetic operating of the Simple Genetic Algorithm. The 3rd case, applied the heuristic method to the final result of the Simple Genetic Algorirhm. The estimation of final result were proceed to developed simulation program in this research.

• 산업경영시스템학회지
• /
• 제22권52호
• /
• pp.297-309
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling(RCDMPS) is intended to minimize the total processing time(makespan) of two or more projects sequentially arriving at the shop under restricted resources. The aim of this paper is to develop the new Tabu Search heuristic for RCDMPS to minimize makespan. We propose the insertion method to generate the neighborhood solutions in applying the Tabu Search for the RCDMPS and the diversification strategy to search the solution space diversely. The proposed diversification strategy apply the dynamic tabu list that the tabu list size is generated and renewed at each iteration by the complexity of the project, and change the proposed tabu attribute. In this paper, We use the dynamic tabu list for the diversification strategy and intensification strategy in the tabu search, and compare with other dispatching heuristic method to verify that the new heuristic method minimize the makespan of the problem.