Metropolitan area network design using GA based on hierarchical linkage identification

DOI10.1007/3-540-45110-2_52MaRDI QIDQ4449771zbMATH OpenFDO

Authors Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241616.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A meta-heuristic approach for solving the urban network design problem
• Path based algorithms for metro network design
• An improved genetic algorithm for the large-scale rural highway network layout
• Compared analysis of metro networks supported by graph theory
• Bi-objective bimodal urban road network design using hybrid metaheuristics
• An efficient metaheuristic to improve accessibility by rural road network planning
• Hybrid meta-heuristic algorithms for solving network design problem
• Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks

Cited in

(2)

• A Network Design Problem by a GA with Linkage Identification and Recombination for Overlapping Building Blocks
• Topological expansion of multiple-ring metropolitan area networks

This page was built for publication: Metropolitan area network design using GA based on hierarchical linkage identification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449771)