Understanding the Out-of-Kilter Algorithm for Network Flows in IENG 516

Slide Note
Embed
Share

Delve into the Out-of-Kilter Algorithm, a primal-dual approach for optimizing network flows by balancing kilter states of edges and node variables. Learn about the formulation, tracking variables, algorithm explanation, kilter number rules, and initiating the process.


Uploaded on Sep 30, 2024 | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

E N D

Presentation Transcript


  1. Network Flows IENG 516 Out-of-Kilter Algorithm PRESENTED TO: ASSIS.PROF.DR. SAHAND DANESHVAR PRESENTED BY: YAHYA EL OSMAN EL DANDACHI 15500727 MOHAMMAD A. KH. HAMDAN 16500161

  2. Introduction 2 The out of kilter algorithm is an example of a primal-dual algorithm. It works on both the primal problem (edges of the network) and the dual problem (nodes) in successive phases to find a feasible solution, and then to optimize the problem. 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  3. What do we keep track of ? 3 We will have a variable for each node wi, and the flows through each edge of the original network. As well as these variables, each edge will be given a kilter state and a kilter number kij. Edges are either in kilter or out of kilter . We want all edges to be in kilter, so the algorithm keeps in kilter edges in kilter, and brings out of kilter edges into kilter. 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  4. THE OUT-OF-KILTER FORMULATION OF A MINIMAL-COST NETWORK FLOW PROBLEM 4 We shall assume that Cij, lij, and Uij are integers 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  5. Algorithm explained 5 We will have a variable for each node wi, and the flows through each edge of the original network. As well as these variables, each edge will be given a kilter state and a kilter number kij. Edges are either in kilter or out of kilter . We want all edges to be in kilter, so the algorithm keeps in kilter edges in kilter, and brings out of kilter edges into kilter. 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  6. Kilter Numbers Rules 6 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  7. 7 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  8. Starting the algorithm 8 When we start we have a set of upper and lower bounds for all edges in the network and the cost of sending units of flow along each edge. We may need to add an artificial edge from the sink to the source, or even add an artificial node to handle some formulations. All flows xij and the wi values for the nodes can be set to zero in this initial phase. This makes some working simple. 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  9. The primal phase The primal phase of the algorithm finds the most out of kilter edge of the network and tries to being it into kilter. We find the reduced costs of the edges of our network, and determine the kilter states and numbers for all edges. The edge with the highest kilter number is chosen and we then look to augment the flows of the network by finding a cycle through the potential changes of our network flows.

  10. The Primal Phase 10 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  11. The Dual Phase 11 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  12. The complementary Slackness Condition 12 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  13. 13 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  14. The Kilter States and Kilter Numbers 14 A kilter number can be thought of as the change required to bring a flow into feasibility and eventually optimality. So we can add up all the kilter numbers to find how far from optimality we are at any given time. An in kilter edge has a kilter number of zero. 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  15. The Dual Phase and Variable Changes 15 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  16. The Amount of Change 16 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  17. 17 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  18. 18 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  19. 19 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  20. 20 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  21. 21 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  22. 22 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  23. The Primal Phase 23 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  24. The First Dual Solution 24 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  25. The Second Dual Phase 25 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

  26. The Optimal Solution 26 9/30/2024 Out of Kilter : Yahya Dandachi & Mohammad Hamdan

More Related Content