期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2008
卷号：8
期号：5
页码：181-186
出版社：International Journal of Computer Science and Network Security
摘要：The Frank-Wolfe method (FW) is one of the most widely used algorithm for solving routing problems in the telecom and traffic areas, its popularity is attributed to its simplicity and modest memory requirements. However, FW converges very slowly, that makes it less favourable to use without modifications. To improve its performance, different modifications of the Frank-Wolfe method have been suggested. In This paper we describe a new modified version (FWF?), the algorithm consists to combine Fukushima direction (FWF), with a widened line search technique (FW?). We also present preliminary computational studies in a C++Builder5, in these we apply (FW), (FW?), (FWF), and (FWF?) methods to some Traffic assignment problems. The computational results indicate that the proposed algorithm yield satisfactory results within reasonable computational time comparing to the other methods.
