Minimum cost Network Flow Problem with Fuzzy Arc Capacities

Abstract

본 논문에서는 화지 아크용량을 갖는 네트워크의 최소비용흐름 문제에 관해 다룬다. 아크용량이 L-R형태의 멤버쉽 함수를 갖는 화지집합으로 정의되는 네트워크의 최소비용흐름 문제를 파라메트릭 프로그래밍 절차를 이용하여 Out-of-Kilter와 같은 앨고리즘으로 풀 수 있는 전형적인 네트워크의 최소비용흐름 문제로 변환하였다.

In this paper we deal with the minimal cost network flow problem with fuzzy arc capacitity 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 such as the out-of-kilter algorithm. Also a modified algorithm is presented.

In this paper we deal with the minimal cost network flow problem with fuzzy arc capacitity 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 such as the out-of-kilter algorithm. Also a modified algorithm is presented.