Authors: Kratica, Jozef 
Tošić, Dušan
Filipović, Vladimir
Ljubić, Ivana
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A genetic algorithm for the uncapacitated network design problem
First page: 329
Last page: 338
Related Publication(s): Soft Computing and Industry - Recent Applications
Issue Date: 2002
Rank: M14
ISBN: 978-1-4471-1101-6
DOI: 10.1007/978-1-4471-0123-9_28
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.
Keywords: Genetic Algorithm | Transportation Cost | Steiner Tree | Lagrangean Relaxation | Steiner Tree Problem
Publisher: Springer Link

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM




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