Intelligent Road DesignTraditional textbooks on roadway designs focus on fundamental alignment elements and design criteria. When applying these in practice, engineers must try various design combinations, check whether the resulting alignments satisfy requirements, and evaluate their relative effectiveness. Introducing a systematic and efficient approach to optimize alignments, this essentially practical text emphasizes the use of artificial intelligence (AI) and Geographic Information Systems (GIS) in extensively automated highway design. Based on a series of research projects, it provides a thorough introduction to the mathematical models and solution algorithms for optimizing highway alignments, including horizontal, vertical, and three-dimensional alignments. The text is ideally suited to senior undergraduate or graduate students majoring in civil engineering or transportation management. Practicing highway design and transportation engineers will also find it of interest. |
Contents
Chapter | 3 |
Chapter | 9 |
Chapter 3 | 35 |
Chapter 4 | 51 |
Chapter 5 | 95 |
Chapter 6 | 111 |
Chapter 7 | 125 |
Chapter 8 | 157 |
12 | 269 |
13 | 315 |
Local optimization of intersections for highway | 325 |
Case studies with intersections and road structures | 337 |
4 | 358 |
optimization | 387 |
5 | 397 |
Appendix B Overview of geographic information system applications | 401 |
Other editions - View all
Common terms and phrases
3-dimensional alignments AASHTO accident costs Algorithm 4.1 alleles analysis attribute table average running speed backtracking best solution bridges and tunnels Brookeville cell chromosome circular curve computation continuous uniform distribution coordinates cost functions cost items crossover curvature decision variables denote developed digitized dynamic programming earthwork cost earthwork volume end points environmental estimating existing road genetic algorithms genetic operators given in eqn global optimum grade separation ground elevation intersection optimization intersection points length-dependent cost located location-dependent cost method mutation net present value non-backtracking objective function objective value obtained offspring optimal alignment optimal solution parabolic curves parameters penalty cost planar interpolation problem random seed right-of-way cost scenario search space segment selected shown in Figure sight distance solution algorithm station points study area study region tangent section test example total cost traffic unit cost user costs vector vertical cutting