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

Title
고정비용과 용량제약이 있는 다품종 흐름 네트워크 설계를 위한 모의풀림 알고리즘
Other Titles
A simulated annealing algorithm for the fixed-charge capacitated multicommodity network design problem
Author(s)
신용호김재곤[김재곤]
Keywords
Fixed-charge muticommodity capacitated network design; Simulated annealing; Commodity sequence; Heuristic
Issue Date
201303
Publisher
한국경영공학회
Citation
한국경영공학회지, v.18, no.1, pp.15 - 26
Abstract
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.
URI
http://hdl.handle.net/YU.REPOSITORY/26138
ISSN
2005-7776
Appears in Collections:
경영대학 > 경영학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE