The emergence of artificial intelligence (AI)-based optimization heuristics like genetic and ant algorithms is useful in solving many complex transportation location optimization problems. The suitability of such algorithms depends on the nature of the problem to be solved. This study examines the suitability of genetic and ant algorithms in two distinct and complex transportation problems: (1) highway alignment optimization and (2) rail transit station location optimization. A comparative study of the two algorithms is presented in terms of the quality of results. In addition, Ant algorithms (AAs) have been modified to search in a global space for both problems, a significant departure from traditional AA application in local search problems. It is observed that for the two optimization problems both algorithms give almost similar solutions. However, the ant algorithm has the inherent limitation of being effective only in discrete search problems. When applied to continuous search spaces ant algorithm requires the space to be sufficiently discretized. On the other hand, genetic algorithms can be applied to both discrete and continues spaces with reasonable confidence. The application of AA in global search seems promising and opens up the possibility of its application in other complex optimization problems.
OPTIMIZATION OF HORIZONTAL HIGHWAY ALIGNMENT USING A PATH PLANNER METHOD
