Closed parasitic flow loops and dominated loops in networks
by Michael T. Todinov
International Journal of Operational Research (IJOR), Vol. 36, No. 4, 2019

Abstract: The paper raises awareness of the presence of highly undesirable closed parasitic flow loops in the solutions of published algorithms for maximising the throughput flow in networks. Parasitic flow loops increase the cost of transportation of the flow unnecessarily, consume residual capacity from the edges of the network, increase the likelihood of deterioration of perishable products, increase congestion and energy wastage. By using the presented theoretical framework, it is demonstrated that the probability of existence of closed and dominated flow loops in networks is surprisingly high. The paper also demonstrates that the successive shortest path strategy fails to minimise the total length of transportation routes from multiple interchangeable origins to destinations. By using the developed theoretical framework, it is shown that a minimum total length of the transportation routes in a network with multiple interchangeable origins is attained if and only if no closed parasitic flow loops and dominated flow loops exist in the network.

Online publication date: Tue, 10-Dec-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com