Experimental and Numerical Shortest Route Optimization in Generating a Design Template for a Recreation Area in Kadifekale

As cities grow, their complexity and the complexity of their infrastructure for various applications increase. Especially, transportation design is usually a very cumbersome process in current urban development models, and it is becoming more complex. Traditional approaches are not always sufficient to solve such complex problems, therefore, design disciplines like architecture and urban design need new tools to optimize many parameters related to their design. An alternate way to solve this problem can be via finding shortest routes. In this context, this study aims to evaluate different shortest path algorithms within a methodological approach to urban transportation planning via either experimentation or mathematical modeling. Three methods; namely live slime mold plasmodium, Floyd-Warshall algorithm, and ant colony algorithm are used to design a template for routes within the historical Kadifekale district of Izmir, Turkey. The results from these approaches are compared, contrasted, and discussed in terms of their suitability for use as a guide for route creation. In conclusion, the parameters of an algorithm are significant on suggesting routes, thus the strengths and weaknesses of an algorithm should be carefully considered before application in a design problem

On the efficiency of artificial neural networks for plastic analysis of planar frames in comparison with genetic algorithms and ant colony systems

WOS: 000412313900008The investigation of plastic behavior and determining the collapse load factors are the important ingredients of every kinematical method that is employed for plastic analysis and design of frames. The determination of collapse load factors depends on many effective parameters such as the length of bays, height of stories, types of loads and plastic moments of individual members. As the number of bays and stories increases, the parameters that have to be considered make the analysis a complex and tedious task. In such a situation, the role of algorithms that can help to compute an approximate collapse load factor in a reasonable time span becomes more and more crucial. Due to their interesting properties, heuristic algorithms are good candidates for this purpose. They have found many applications in computing the collapse load factors of low-rise frames. In this work, artificial neural networks, genetic algorithms and ant colony systems are used to obtain the collapse load factors of two-dimensional frames. The latter two algorithms have already been employed in the analysis of frames, and hence, they provide a good basis for comparing the results of a newly developed algorithm. The structure of genetic algorithm, in the form presented here, is the same as previous works; however, some minor amendments have been applied to ant colony systems. The performance of each algorithm is studied through numerical examples. The focus is mainly on the behavior of artificial neural networks in the determination of collapse load factors of two-dimensional frames compared with other two algorithms. The investigation of results shows that a careful selection of the structure of artificial neural networks can lead to an efficient algorithm that predicts the load factors with higher accuracy. The structure should be selected with the aim to reduce the error of the network for a given frame. Such an algorithm is especially useful in designing and analyzing frames whose geometry is known a priori