A Heuristic Approach to the Capacity Assignment Problem in a Centralized Network

Abstract

본 논문은 중앙 집중식 네트워크의 설계에 있어서 회선의 용량이 여러 개인 경우에 대하여 연구하였다. 발견적 기법의 일종인 회선교환방식이 선택되어 이전의 연구결과와 비교되었다. 그 결과 계산기간은 증가되었으나 목적함수의 값이 개선되고 증가된 계산시간도 충분히 허용할 수 있는 정도였다.

This paper deals with the problem of designing the minimum-cost centralized network with multi-point linkage were options are available as to discrete link capacities. A heuristic approach (link exchange technique) is adopted and the result is compared to earlier works. With the approach in this paper, the value of the objective function is improved with more allowable computation time.

This paper deals with the problem of designing the minimum-cost centralized network with multi-point linkage were options are available as to discrete link capacities. A heuristic approach (link exchange technique) is adopted and the result is compared to earlier works. With the approach in this paper, the value of the objective function is improved with more allowable computation time.