Shape Grammars for Hierarchical Transport Network Design

Urban systems are growing fast in many countries today, and therefore face the task to build efficient transport networks. Significant productivity gains are due to infrastructure investments in urban systems. A shape grammar based approach is proposed to contribute to more efficient networks by reducing the enormous and complex search space in the design of a new transport network. This paper sheds light on impacts of different shape grammars in network design. The proposed approach applies a network generation algorithm based on the integration of ant colony optimization (ACO) and a genetic algorithm (GA). For network design applications, the proposed algorithm is able to overcome restrictions of both ACO and GA, e.g. in network size and computational time, and is concurrently computationally fast. The algorithm generates best transport network layouts given a defined objective function, including demand weighted travel times. A budget constraint provides an upper bound for infrastructure investment. Shape grammars for hierarchical network design are respected during the generation of the network layouts. Different initial network layouts are tested. It can be shown that shape grammars can affect the resulting transport networks. Future research is proposed, including additional shape grammars, variable demand and growth processes, to verify and complete the results gained.

[1]  Daniel E. Goldberg The design of innovation: Lessons from genetic algorithms , 1998 .

[2]  M. Surico,et al.  Concrete Delivery using a combination of GA and ACO , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[3]  H. L. Ong,et al.  Solving the feeder bus network design problem by genetic algorithms and ant colony optimization , 2006, Adv. Eng. Softw..

[4]  Marco Dorigo Ant colony optimization , 2004, Scholarpedia.

[5]  Steven Beningo,et al.  National Transportation Statistics 2008 , 2009 .

[6]  Kay W. Axhausen,et al.  Patterns and Grammars for Transport Network Generation , 2010 .

[7]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[10]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[11]  Chao Yang,et al.  Computational Study of Origin-Based User Equilibrium Traffic Assignment Algorithms , 2010, 2010 International Conference on Intelligent Computation Technology and Automation.

[12]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[13]  Mohammed Alam,et al.  New Capital Cost Table for Highway Investment Economic Analysis , 2005 .

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[16]  Kay W. Axhausen,et al.  Optimization of Large Transport Networks Using the Ant Colony Heuristic , 2009, Comput. Aided Civ. Infrastructure Eng..

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  K. Nagel,et al.  Agent-based traffic assignment: going from trips to behavioral travelers , 2009 .

[19]  H. Poorzahedy,et al.  Application of Ant System to network design problem , 2005 .

[20]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..