1 / 32

Hub and Spoke Network Design

Hub and Spoke Network Design. Outline. Motivation Problem Description Mathematical Model Solution Method Computational Analysis Extension Conclusion. Motivation. 1. 7. 5. 2. 4. 8. 3. 9. Spokes. Hubs. Motivation. σ = 0.25. Spoke and Hub Network. Motivation.

marja
Download Presentation

Hub and Spoke Network Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Hub and Spoke Network Design

  2. Outline • Motivation • Problem Description • Mathematical Model • Solution Method • Computational Analysis • Extension • Conclusion

  3. Motivation 1 7 5 2 4 8 3 9

  4. Spokes Hubs Motivation σ = 0.25 Spoke and Hub Network

  5. Motivation • Hub and Spoke Network design: • Cited as “seventh in the American Marketing Association series of ‘Great Ideas in the Decade of Marketing’ (Marketing News, June 20, 1986) • Predominant architecture for airline route system since deregulation in 1978 • Finds applications in telecommunication network, express cargo

  6. Problem Description • Given a network of nodes with given flows between each pair, determine: • Which nodes are set as hubs • Which hub is a node assigned to • So that: • Every flow is first routed through one or two hubs before being sent to its destination

  7. Methodologies • Enumeration heuristics - O’Kelly (1986) • Meta-heuristics: • Tabu Search – Klincewicz (1991); Kapov & Kapov (1994) • Simulated Annealing – Ernst & Krishnamoorthy (1996) • Lagrangian relaxation – Pirkul & Schilling (1998); Aykin (1994); Elhedhli & Hu (2005)

  8. m i j k Mathematical Model

  9. (7) Mathematical Model Min (1) Subject to: for all i (2) for all i, k (3) (4) for all i, j > i, k (5) for all i, j > i, m (6)

  10. Mathematical Model • Problem size: • For number of nodes = n: That’s too large! • For n = 15:

  11. Solution Method • Lagrangian Relaxation • 31 different lagrangian relaxations possible • Review on Lagrangian Relaxation: Fisher (1981, 2005); Geoffrion (1974) • In current study, constriant sets (2), (5), (6) relaxed

  12. Solution Method Min (1) Subject to: for all i (2) αi for all i, k (3) (4) for all i, j > i, k (5) βijk for all i, j > i, m (6) Gijm (7)

  13. Solution Method Min (7) Subject to: for all i, k (3) (4) Sub problem 2 Where, Sub problem 1

  14. Constrained added to improve bound Min for all i, j > i Subject to: [SUB1]: Min Subject to: for all i, k Solution Method [SUB2]:

  15. Solution Method [MASTER]: Max for h = 1,2,…. Subject to: for h = 1,2,….

  16. Solution Algorithm • [SUB1]: • For each i, j: • Find • Set

  17. Solution Algorithm • [SUB2]:

  18. Solution Algorithm • [Feasible Solution]:

  19. Solution Algorithm • Issues: • Slow convergence as master problem grows too large • Could not converge in 30 minutes for 10 nodes • How to resolve???

  20. Initialize α, β, γ; Initialize step size Solve SUB1; SUB2 and obtain LB Construct a feasible solution and obtain UB Is (UB-LB)/LB>ε? α, β, γ Adjust α, β, γ by the amount of infeasibility If no improvement in LB since long, decrease step size stop Solution Algorithm • Subgradient Optimization to find lagrang multipliers No Yes

  21. Computational Analysis

  22. Analysis Congested

  23. Extended Model Min (1) Subject to: for all i (2) for all i, k (3) (4) for all i, j > i, k (5) for all i, j > i, m (6) Congestion Cost function

  24. Extended Model cont.. Min Linear Approximation using tanget planes for congestion cost function Subject to: (2) – (7)

  25. (8) Extended Model cont.. Min Subject to: MIP with an infinite number of constraints (2) – (7)

  26. (8) (7) Solution Method (Langrangean Relaxation) Min Subject to: for all i, k (3) (4) Sub problem 2 Sub problem 1 Where,

  27. In absence of this constraint, problem separates into k smaller problems; each can be solved using cutting plane method (8) (7) Solution Method contd.. [SUB1]: Min Subject to: for all i, k (3) (4)

  28. Solution Method contd.. • Solution implemented in MATLAB 7.0 • [SUB1-k] solved using CPLEX 10 • CPLEX called from MATLAB

  29. Computational Analysis

  30. Discussion • Solution speed can be improved by using a compiled code (in C or Fortran). MATLAB is inefficient in executing loops as it is interpreted line by line.

  31. Conclusion • A model for Hub and Spoke Network Design solved using lagrangean relaxation • Model extended to address the issue of congestion • Good solutions obtained in reasonable time • Solution speed can be further improved if implemented in a language that uses acompiler

More Related