@article {10.3844/ajassp.2012.238.239,
article_type = {journal},
title = {Flow Based Algorithm},
author = {Karpagam, T. and Sudhakar, V. J. and Arunsankar, N. and Dhanasekaran, M.},
volume = {9},
year = {2011},
month = {Dec},
pages = {238-239},
doi = {10.3844/ajassp.2012.238.239},
url = {https://thescipub.com/abstract/ajassp.2012.238.239},
abstract = {Problem statement: Network topology design problems find application in several real life scenario. Approach: Most designs in the past either optimize for a single criterion like shortest or cost minimization or maximum flow. Results: This study discussed about solving a multi objective network topology design problem for a realistic traffic model specifically in the pipeline transportation. Here flow based algorithm focusing to transport liquid goods with maximum capacity with shortest distance, this algorithm developed with the sense of basic pert and critical path method. Conclusion/Recommendations: This flow based algorithm helps to give optimal result for transporting maximum capacity with minimum cost. It could be used in the juice factory, milk industry and its best alternate for the vehicle routing problem.},
journal = {American Journal of Applied Sciences},
publisher = {Science Publications}
}