고정비용과 용량제약이 있는 다품종 흐름 네트워크 설계를 위한 모의풀림 알고리즘

In this paper, we propose a simulated annealing algorithm for the fixed-charge multicommodity capacitated network design problem using commodity sequence neighborhoods. For a commodity sequence, a corresponding flow path network is obtained by a network construction method and it is improved by an arc-blocking method. The flow path network is further improved by solving a linear programming model after fixing binary variables according to the result of the arc-blocking method. To evaluate the performance of the suggested algorithm, computational experiments are performed on well-known benchmark problems. Results of computational experiments show that the suggested algorithm gives better solutions than a commercial optimization software package and an existing algorithm.