论文信息 - A Genetic Algorithm for the Uncapacitated Network Design Problem

A Genetic Algorithm for the Uncapacitated Network Design Problem

In this paper a genetic algorithm (GA) for solving the uncapacitated network design problem (UNDP) is presented. The problem with single source and destinations for each commodity is considered. UNDP is a base in class of the network design problems, but it is still NP-hard. The implementation of GA is additionally improved by caching technique of GA. The computational results on instances up to 50 commodities, 100 nodes and 700 edges are reported.

Jozef Kratica | Vladimir Filipović | Ivana Ljubić | Dušan Tošić

[1] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[2] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .

[3] Thomas L. Magnanti,et al. Tailoring Benders decomposition for uncapacitated network design , 1986 .

[4] Johan Hellstrand,et al. Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

[5] Thomas L. Magnanti,et al. A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[6] Jozef Kratica,et al. Improving Performances of the Genetic Algorithm by Caching , 1999, Comput. Artif. Intell..

[7] J. Kratica,et al. Fine Grained Tournament Selection for the Simple Plant Location Problem , 2002 .

[8] Thomas L. Magnanti. NETWORK DESIGN AND TRANSPORTATION PLANNING , 1990 .