• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.3
• /
• pp.47-61
• /
• 2007

This paper presents two elimination methods of subtours, which is obtained by applying the Out-of-Kilter algorithm to the sequential ordering problem (SOP) to produce a feasible solution for the SOP. Since the SOP is a kind of asymmetric traveling salesman problem (ATSP) with precedence constraints, we can apply the Out-of-Kilter algorithm to the SOP by relaxing the precedence constraints. Instead of patching subtours, both of two elimination methods construct a feasible solution of the SOP by using arcs constructing the subtours, and they improve solution by running 3-opt and 4-opt at each iteration. We also use a perturbation method. cost relaxation to explore a global solution. Six cases from two elimination methods are presented and their experimental results are compared to each other. The proposed algorithm found 32 best known solutions out of the 34 instances from the TSPLIB in a reasonable time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.157-167
• /
• 2005

This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

• Journal of the military operations research society of Korea
• /
• v.17 no.2
• /
• pp.54-71
• /
• 1991

It is very important to increase defence capability rapidly against any surprise attack. This can be done by fast deployment of mobilization reserved resources. This paper is forcused on optimal allocation of special reserved resources. First of all, the location of special reserved resources is identified and then the location of combat and mobilization units and amount of requirement resources of each unit are identified. Finally, optimal allocation of the special reserved resources is obtained by Out of Kilter method.

• Journal of the military operations research society of Korea
• /
• v.22 no.1
• /
• pp.129-141
• /
• 1996

At present surveillance equipment on the ground of the army is distributed and located by experience element and intellience preparation of the battle field. Therefore, it is hard to utilize the optimal detection capability. This paper is forcused on improving watch ratio of the named area interested(NAI) and maximizing detection area. A linear programming model is developed and network model is established on the basis of the linear programming model. And then Out-of-Kilter algorithm is utilized for the optimal solution. Finally, one of the example is provided it shows that this model minimizes the non-detection area.

• Water for future
• /
• v.27 no.1
• /
• pp.111-121
• /
• 1994

The purpose of this paper is to construct a network model for the optimal allocation of limited water resources to the nodal system with given priorities. The solution technique for the model is based on the out-of-kilter algorithm(OKA). For the verification and application of the theoretical methodology and computer programs, the Geum river system is selected. Using release of Daecheong dam and water demand in Geum river basin, optimal allocation of water resources is accomplished for 4 cases(case 1 - case 4) which consider priority numbers in the demand nodes. The results of the application show that the model can reasonably represent the physical system, and water shortage at the demand nodes with high priority numbers is reduced. Its system solution was verified with that by the revised simplex algorithm.

• Journal of the military operations research society of Korea
• /
• v.13 no.1
• /
• pp.28-44
• /
• 1987

This thesis presents a model to assign targets and to determine gun ammunitions required for naval surface warfare. Delivery errors of weapon systems and vulnerability of moving targets are analyzed, then probability to kill moving battle sihps is computed. A weapon-target allocation model is proposed by using the Out of Kilter technique. A model to determine ammunitions required for killing moving targets is also designed. The models are evaluated by simulation and sensitivity analysis.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.67-79
• /
• 1997

In this paper we develop the integrated software that can compare algorithms of the minimum cost flow problem using PC. The chosen algorithms are the network simplex method, dual network simplex method, and out-of-kilter method, which methods correspond to primal, dual, and primal-dual approach respectively. We also present the improved methods obtaining the initial solution to increase the efficiency of algorithms, and experiment results shown the difference between the entering(dropping) selection rules.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.51-60
• /
• 1990

In this paper we deal with the miniaml cost network flow problem with uncertain arc capacity constraints. When the arc capacities are fuzzy with linear L-R type membership function, using parametric programming procedure, we reduced it to the deterministic minimal cost network flow problem which can be solved by various typical network flow algorithms. A modified Algorithm using the Out-of-kilter algorithm is developed.

• Proceedings of the Korea Water Resources Association Conference
• /
• 1990.07a
• /
• pp.137-137
• /
• 1990

하천의 각종 용수 수요급증지역에서의 저수및 갈수시에는 한정된 수자원의 공급능력에 비해 각종용수의 수요가 크게 증가하므로 수자원을 적정 배분하는 데에는 물의 부족으로 인하여 많은 문제가 발생하고 있다. 이러한 저수및 갈수시 각 수요점 별로 필요한 용수를 확보하기 위하여 용수사용의 우선권을 고려한 수자원 최적배분 모형을 개발할 필요성이 있다. 본연구의 목적은 Out of Kilter Algorithm(OKA)를 이용하여 저수및 갈수시 용수사용의 우선순위에 따른 수자원 배분을 실시하기 위한 알고리즘을 구성하고, 이를 실제 유역에 적용하므로서 그 유용성과 신뢰성을 입증하고자 한다.

• Journal of the military operations research society of Korea
• /
• v.2 no.1
• /
• pp.145-162
• /
• 1976

For a large organization such as a military service which can foresee future growths in its manpower requirements, a systematic tool that can provide analysis of its present manpower structure and policies in terms of meeting the future requirements, is in order today. This paper proposes a network model for such a purpose. The ROK Navy officer corps manpower system is studied and formulated as a network model, which may be expressed as a linear programming problem of minimizing total cost. An appropriate cost concept is developed and the out-of-kilter algorithm of Ford and Fulkerson is computer programmed to be used as a solution procedure for this network problem. A case study is conducted with a set of hypothetical data on a possible Navy combat-line specialty manpower problem.