Transmission line route selection by goal programming

A two-stage solution for transmission line route selection is presented. The generalized double-sweep method has been used to select the K least costly routes. The selected routes are subjected to social and environmental constraints (SEC). The SEC problem is formulated as a zero-one goal-programming model and solved by the implicit enumeration method. The two-stage solution algorithm has been applied to two problems. The results indicate the suitability of the method for route selection provided that acceptable SEC criteria can be found. The results also indicate the viability of the goal-programming technique for choosing power network interconnection concepts.