Abstract
This article presents a metaheuristic approach applying simulated annealing for the problem of planning corridors for oil pipelines facilities. The corridor location problem requires finding an optimal or a set of sub-optimal alternative routes between two locations, accounting for cost optimization and topographical constraints. The proposed simulated annealing applies a path-based search for exploring the space of possible routes. The experimental evaluation solves realistic problem instances considering real information of Veracruz, Mexico. The proposed approach is able to compute a set of near-optimal alternative routes that improve up to 34.1% of the terrain impact cost over a greedy pathfinding reference method, such as the ones included in traditional geographical information systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Akgün, V., Erkut, E., Batta, R.: On finding dissimilar paths. Euro. J. Oper. Res. 121(2), 232–246 (2000)
Berry, J.: Beyond Mapping: Concepts, Algorithms, and Issues in GIS. Wiley, Hoboken (1996)
Byers, T., Waterman, M.: Technical note-determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming. Oper. Res. 32(6), 1381–1384 (1984)
Church, R., Loban, S., Lombard, K.: An interface for exploring spatial alternatives for a corridor location problem. Comput. Geosci. 18(8), 1095–1105 (1992)
Church, R., Murray, A.: Line-based location. In: Church, R., Murray, A. (eds.) Business Site Selection, Location Analysis and GIS, chap. 7. Wiley, Hoboken (2008)
Cruz-Chavez, M., Martinez-Oropeza, A., Barquera, S.: Neighborhood hybrid structure for discrete optimization problems. In: IEEE Electronics, Robotics and Automotive Mechanics Conference, pp. 108–113. IEEE (2010)
Douglas, D.: Least-cost path in GIS using an accumulated cost surface and slopelines. Cartographica: Int. J. Geogr. Inf. Geovisualization 31(3), 37–51 (1994)
Fournier, E.: Mogador revisited: improving a genetic approach to multi-objective corridor search. Environ. Plann. B Plann. Des. 43(4), 663–680 (2016)
Hallam, C., Harrison, K., Ward, J.: A multiobjective optimal path algorithm. Digit. Sig. Process. 11(2), 133–143 (2001)
Huber, D., Church, R.: Transmission corridor location modeling. J. Transp. Eng. 111(2), 114–130 (1985)
Johnson, P., Joy, D., Clarke, D., Jacobi, J.: Highway 3.1: An enhanced highway routing model: Program description, methodology, and revised user’s manual (1993)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Kuby, M., Zhongyi, X., Xiaodong, X.: A minimax method for finding the k best “differentiated” paths. Geogr. Anal. 29(4), 298–313 (1997)
Lombard, K., Church, R.: The gateway shortest path problem: generating alternative routes for a corridor location problem. Geogr. Syst. 1, 25–45 (1993)
Medrano, A., Church, R.: Corridor location for infrastructure development: a fast bi-objective shortest path method for approximating the pareto frontier. Int. Reg. Sci. Rev. 37(2), 129–148 (2013)
Medrano, A., Church, R.: A parallel algorithm to solve near-shortest path problems on raster graphs. In: Xi, X., Kindratenko, V., Yang, C. (eds.) Modern Accelerator Technologies for Geographic Information Science, pp. 83–94. Springer, Boston (2013). https://doi.org/10.1007/978-1-4614-8745-6_7
Medrano, A., Church, R.: Corridor location for infrastructure development: a fast bi-objective shortest path method for approximating the pareto frontier. Int. Reg. Sci. Rev. 37(2), 129–148 (2014)
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)
Miller, H., Shaw, S.: Geographic information systems for transportation in the 21st century. Geogr. Compass 9, 180–189 (2015)
Nesmachnow, S.: An overview of metaheuristics: accurate and efficient methods for optimisation. Int. J. Metaheuristics 3(4), 320–347 (2014)
Nesmachnow, S., Iturriaga, S.: Cluster-UY: collaborative scientific high performance computing in Uruguay. In: Torres, M., Klapp, J. (eds.) ISUM 2019. CCIS, vol. 1151, pp. 188–202. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-38043-4_16
Scaparra, M., Church, R., Medrano, A.: Corridor location: the multi-gateway shortest path model. Geogr. Syst. 16, 287–309 (2014)
Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)
Turner, K.: Computer-assisted procedures to generate and evaluate regional highway alternatives. Purdue University, Technical report (1968)
Yen, J.: Finding the k shortest loopless paths in a network. Manage. Sci. 17(11), 712–716 (1971)
Zhang, X., Armstrong, M.: Genetic algorithms and the corridor location problem: multiple objectives and alternative solutions. Environ. Plann. B Plann. Des. 35(1), 148–168 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Moreno-Bernal, P., Nesmachnow, S. (2021). Simulated Annealing Metaheuristic Approach for Generating Alternative Corridor Locations. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds) Production Research. ICPR-Americas 2020. Communications in Computer and Information Science, vol 1408. Springer, Cham. https://doi.org/10.1007/978-3-030-76310-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-76310-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-76309-1
Online ISBN: 978-3-030-76310-7
eBook Packages: Computer ScienceComputer Science (R0)