The week's pick
Reseach Article
Optimization of Gas Transmission Pipeline using Ant Colony Optimization
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 177 - Number 46 |
| Year of Publication: 2020 |
| Authors: Akshat Sharma, Aabhay Bhardwaj, Prakhar Tiwari, Nitya Chauhan, Nitin Arora |
10.5120/ijca2020919910
|
Akshat Sharma, Aabhay Bhardwaj, Prakhar Tiwari, Nitya Chauhan, Nitin Arora . Optimization of Gas Transmission Pipeline using Ant Colony Optimization. International Journal of Computer Applications. 177, 46 ( Mar 2020), 1-5. DOI=10.5120/ijca2020919910
Abstract
Presently, gas is one of the most important natural resources available on Earth. Gas is required in many fields. Gas flow from one source to the destination using pipes. Flowing is gas through pipes sometime can be very risky. For, the flow of gas through piles one should follow the smallest path as per the distance. But, not only the distance one should take care of the pressure as well. Pressure at different points also plays an important role in the flow of gas. Optimizing the pipeline route plays an important role in making the transportation eco-friendly, efficient and safe. As per the literature, the flow of gas is done using brute force algorithms (Complexity-O(|V|)), Dijkstra Algorithm (Complexity-O|V|2), Dynamic Programming Algorithms (Complexity-O(|V|22|V|)), where, |V| is representing the number of nodes. In this paper, Traveling Salesman Problem is being solved using Ant Colony Optimization Algorithm taking pressure and distances for the flow of gas from one point to another point.
References
- Baeza, Daniel & Ihle, Christian & Ortiz, Julian. (2017). A comparison between ACO and Dijkstra algorithms for optimal ore concentrate pipeline routing. Journal of Cleaner Production. 144. 149-160. 10.1016/j.jclepro.2016.12.084.
- Soeiro Ferreira, José & Vidal, René. (1984). Optimization of a pump-pipe system by dynamic programming. Engineering Optimization - ENG OPTIMIZ. 7. 241-251. 10.1080/03052158408960641
- Joy deep Kundu. Ant colony optimization problem to solve travelling salesman problem.
- “SDLC – RAD Model”, Tutorials Point (2016), website:https://www.tutorialspoint.com/sdlc/sdlc_rad_model.htm#
- Won Hyung, Flowchart-of-ACO-Ant-Colony-Optimization, AS:328302964297731@1455284934219, website: https://www.researchgate.net/profile/Won_Hyung/publication/274620390/figure/fig9/AS:328302964297731@1455284934219/Flowchart-of-ACO-Ant-Colony-Optimization.png
- Bora, Neha, Jigyasha Arora, and Nitin Arora. "Ant colony based optimization algorithm for the Mobile ad hoc Network Routing Problems based on SMR Protocol (ACO-SMR)." International Journal of Application or Innovation in Engineering & Management, Vol. 2, 6, June 2013.
- Lakshmi, M., Kaushik, P. K., & Arora, N. (2013). Novel Approximation Algorithm for Calculating Maximum Flow in a Graph. International Journal of Computer Applications, 74(3).
- Kumar, Ashwani, Surinder Pal Singh, and Nitin Arora. "A New Technique for Finding Min-Cut Tree." International Journal of Computer Applications 69, no. 20 (2013).
- Kumar, Ashwani, Surinder Pal Singh, and Nitin Arora. "A New Technique for Finding Min-Cut Tree." International Journal of Computer Applications 69, no. 20 (2013).
- Arora, Nitin, Pradeep Kumar Kaushik, and Surinder Pal Singh. "A Survey on Methods for finding Min-Cut Tree." International Journal of Computer Applications 66, no. 23 (2013).
- Bora, Neha, Swati Arora, and Nitin Arora. "An Efficient Algorithm for Calculating Maximum Bipartite matching in a Graph." International Journal of Advanced Computer Research 3, no. 2 (2013): 193.
Index Terms
Keywords