Oil pipeline route optimization using multi-criteria analysis in GIS

Document Type : Original Article


Department of Remote Sensing and GIS, Remote Sensing and GIS Research Institute, University of Shahid Beheshti, Tehran, Iran


According to distribution requirements and the broad distance between production and consumption centres in Iran, linear infrastructure development plays an important role and should be considered as a vital necessity. Routing problems include many factors which are often incompatible with each other and incompatibility amongst parameters causes significant delays in the process of routing. Hence, it is of interest that use of the new utilities in Geographic Information Systems (GIS) to optimize the routing process can resolve the difficulties faced in decision-making steps.
Material and methods:
This study aims at optimizing oil pipeline routes from wells drilled to the refinery by using different scenarios and to consider is ORness and ANDness. In the beginning preparation stage all necessary spatial data Like, Geology, land cover, slope, Dem, Fault, Main, River, stream which are required to find the optimal route for establishment of oil transmission line have been collected than Standardization and Preparation by  using reducing and Increasing linear weighting function. AHP process has been hired in order to find spatial weight of each parameter’s effectiveness in terms of cost of establishment and oil line interaction with its surrounding environment. Ordered weighted average (OWA) method has been applied to integrate spatial data and achieve the result, cost layer.  Dijkstra's algorithm has then been used to find the optimal route between the location of wells and refineries.
Results and discussion:
The results show that with increase in the value of α, the amount of cost, average slope and height of the oil transit route increase. In scenarios with, higher values are given to high-value pixels. While higher order weights are assigned to values with a lower numerical value in the same position. Therefore, the length of the route from the All (AND) scenario to the At least one (OR) scenario decreases. Because the Dijkstra's algorithm is a single-objective algorithm and aims at extracting the path with the least cost. Because at every move, Choose a pixel with the lowest Accumulative cost as the direction of motion and do not pay attention to the length of the route.
:  By comparing the existing route and the paths obtained from the Dijkstra's algorithm in different scenarios based on the factors of length, cost, mean slope and height of the route extracted In Almost All, Most, and Half (WLC) scenarios, are better than the other options in terms of techno-economic and environmental conditions in study area. Other scenarios have produced better results than some of the existing ones in some of the factors. Providing Various Results, With ORness and tradeoff this method has great flexibility in estimating the needs and priority of decision makers in the field of petroleum industry to design optimal transmission lines.


  1. Ahmadi, S., Ebadi, H., Zeoj, M. V., 2008. A new method for path finding of power transmission lines in geospatial information system using raster networks and minimum of mean algorithm. World Applied Sciences Journal, 3(2), 269-277.
  2. Albert, P., 2004. Finding minimal cost paths in raster geographic information system map representations, genetic algorithms, simulated annealing and tabu search. Phd Thesis, Kent State University College of Business.
  3. Antikainen, H., 2013. Using the Hierarchical Pathfinding A* Algorithm in GIS to Find Paths through Rasters with Nonuniform Traversal Cost. ISPRS International Journal of Geo-Information, , 2(4), 996.
  4. Bagli, S., Geneletti, D. and Orsi, F., 2011. Routeing of power lines through least-cost path analysis and multicriteria evaluation to minimise environmental impacts. Environmental Impact Assessment Review, 31(3), 234-239.
  5. Boroushaki, S., Malczewski, J.2010. Using the fuzzy majority approach for GIS-based multicriteria group decision-making. International Journal Computers & Geosciences 36, 302–312.
  6. Dean, D. J., 2011.Optimal routefinding with unlimited possible directions of movement. Transactions in GIS, 15(1), 87-107.
  7. Dijkstra, E. W., 1959. A note on two problems in connexion with graphs. Numerischemathematik, 1(1), 269-271.
  8. Eldrandaly, K. A., Hassan, M. M., AbdelAziz, N.M., 2015. A Modified Artificial Bee Colony Algorithm for Solving Least-Cost Path Problem in Raster GIS. Appl. Math, 9(1), 147-154.
  9. Gonçalves, A. B., 2010. An extension of GIS-based least-cost path modelling to the location of wide Paths. International Journal of Geographical Information Science, 24(7), 983-996.
  10. Iqbal, M., Sattar, F., and Nawaz, M., 2006. Planning a Least Cost Gas Pipeline Route A GIS & SDSS Integration Approach. Paper presented at the Advances in Space Technologies,International Conference Turkey.
  11. Kruusmaa, M and Willemson, J. 2003. Covering the path space: a casebase analysis for mobile robot path planning. Knowledge-Based Systems, 16(5), 235-242.
  12. Li, X., He, J. and Liu, X. 2009. Ant intelligence for solving optimal path‐covering problems with multi‐objectives. International Journal of Geographical Information Science, 23(7), 839-857.
  13. Malczewski, J., 1999. GIS and multicriteria decision analysis: John Wiley & Sons.
  14. Malczewski, J., 2006a. GIS-based multicriteria decision analysis: a survey of the literature. International Journal of Geographical Information Science 20 (7), 703–726.
  15. Malczewski, J., and Rinner, C., 2010. Multicriteria Decision Analysis in Geographic Information Science: Springer.
  16. Malczewski, J., Chapman, T., Flegel, C., Walters, D., Shrubsole, D. and Healy, M.A., 2003. GIS-multicriteria evaluation with ordered weighted averaging (OWA): case study of developing watershed management strategies. Environ. Plann. A 35 (10), 1769–1784.
  17. Matkan, A. A., Pourali, S. H., Mirbagheri, B. and Mohammadi, Sh., 2015. Optimal Routing Using Intelligent Algorithms in GIS, The First National Conference of Fire and urban safety, Theran, Iran.
  18. Meng Y., Malczewski J., and Boroushaki S., 2011. A GIS-based multicriteria decision analysis approach for mapping accessibility patterns of housing development sites: a case study in canmore, Alberta, Geo. Inf. Sys. 3: 50-61.
  19. Saaty, T.L., 1980. The Analytic Hierarchy Process: Planning, Priority Setting, Resource Allocation. McGraw-Hill, New York, NY, 437 pp.
  20. Saaty,T.L. and L.G.,Vargas. 1991. Prediction, Projection and Forecasting. Kluwer Academic Publishers, Dordrecht, 251 pp.
  21. Saha, A. K., 2005. GIS‐based route planning in landslide‐prone areas”, International Journal of Geographical Information Science, 19(10), 1149-1175.
  22. Stahl, C. W., 2005. Accumulated surfaces & least-cost paths: GIS modeling for autonomous ground vehicle (AGV) navigation. Msc Thesis, aculty of the Virginia Polytechnic Institute and State University, American.
  23. Umashankar, S., 2014.Optimization on Shortest Path Finding For Undergroungd Cable Transmission Lines Routing Using GIS. Journal of Theoretical & Applied Information Technology, 65(3), 2014.
  24. Wagner, E.D. 2002. Public key infrastructure (PKI) and virtual private network (VPN) compared using a utility function and the analytic hierarchy process (AHP). M.Sc. Thesis,Virginia Polytechnic Institute and State University, 50pp.
  25. Yager, R. R. 1988. On ordered weighted averaging aggregation operators in multicriteria decision making. Systems, Man and Cybernetics, IEEE Transactions on 18(1): 183-190.
  26. Yager, R. R. 1988. On ordered weighted averaging aggregation operators in multicriteria decision making. Systems, Man and Cybernetics, IEEE Transactions on 18(1): 183-190.
  27. Yager, R.R. and Filev, D.P., 1999. Induced ordered weighted averaging operators. IEEE Transactions on Systems, Man, and Cybernetics- Part B 29, 141–150.
  28. Yu, C., Lee, J., Munro-Stasiuk, M. J., 2003. Extensions to least-cost path algorithms for roadway planning. International Journal of Geographical Information Science, 17(4), 361-375.