Abstract
Planning corridors for new facilities such as pipeline or transmission lines through geographical spaces is a topographical constraint optimization problem. The corridor planning problem requires finding an optimal route or a set of alternative paths between two locations. This article presents a simulated-annealing-based (SA) approach applying a variable neighborhood strategy in a continuous space to generate competitive and different alternative paths to solve the corridor planning problem. The variable neighborhood method randomly selects two points from a variable interval of the current solution generated by SA creating pseudo-random paths inside a corridor and finding spatially different alternatives. The proposed approach is evaluated with three practical problems using real topographic data from the Veracruz Basin in Mexico. The experimental results show that this approach obtains efficient and competitive solutions with improvements above 18% over those gotten by the compared method.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献