Journal of Korean Society of Rural Planning (농촌계획)
- Volume 5 Issue 1 Serial No. 9
- /
- Pages.20-25
- /
- 1999
- /
- 1225-8857(pISSN)
- /
- 2288-9493(eISSN)
The Efficient Computation Method of Two-commodity Network Flow Problem Using TSP
판매원 문제를 이용한 2-상품 네트워크 흐름 문제의 효율적인 계산방법
- Hwang, In-Keuk (Dept. of Industrial Engineering, Kongju National University) ;
- Park, Dong-Jin (Dept. of Industrial Engineering, Kongju National University) ;
- Yoon, Kwang-Sik (Dept. of Agricultural Engineering, Chonnam National University)
- Published : 1999.02.25
Abstract
Our interest in this paper is in the efficient computation of a good low bound for the traveling salesman problem and is in the application of a network problem in agriculture. We base our approach on a relatively new formulation of the TSP as a two-commodity network flow problem. By assigning Lagrangian multipliers to certain constraints and relaxing them, the problem separates into two single-commodity network flow problems and an assignment problem, for which efficient algorithms are available.
Keywords