Tower cranes, on today’s typical building construction sites, are the centerpiece of production, hoisting and transporting of a variety of loads. Due to a simple crane limited capacity; there is an urgent need to use high capacity cranes such as tower cranes. However, we have to select an appropriate type of cranes to be utilized to reduce the associated coste as much as possible. In this research, we propose a method to select the suitable type of crane and locate the best place for crane erection based on a minimum radius for requested crane and minimum cost. To fulfill the target, a computer program is designed to numerate these problems, demonstrating an example explaining how to apply the program and the results are discussed.
Location Allocation is one of the most important decision making problems, which attracted many operational researchers during recent decades and many solution procedures are developed so far to cope with this problem. This paper proposes a new graph theory based method to cope with small size capacitated location allocation problems. Additionally, a genetic algorithm is utilized to solve medium and large scale problems. Finally, through some computational experiments, the quality and capability of these algorithms are shown.