Skip to main content

Part of the book series: Computational Methods in Applied Sciences ((COMPUTMETHODS,volume 48))

Abstract

In this paper we present a cooperative game for a network design. The game model adopts for the cooperating players the profit maximizing requirement. Since the players may use different paths, there is the possibility to cooperate and design the optimal network satisfying the requests of all the players and minimizing the cost. The solution of the game is determined by the core concept, well known in cooperative game literature. By means of several examples, both analytical and numerical solutions are proposed. Concerning the computational procedure, in this work an algorithmic approach based on ant colony model is employed. Finally, an application to the airline network design is discussed, providing a numerical example for intercontinental air traffic routes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Adler, N., Smilowitz, K.: Hub-and-spoke network alliances and mergers: Price-location competition in the airline industry. Transp. Res. Part B 41, 394–440 (2007)

    Article  Google Scholar 

  2. Avrachenkov, K., Elias, J., Martignon, F., Neglia, G., Petrosyan, L.: A Nash bargaining solution for cooperative network formation games. In: Proceedings of Networking 2011, Valencia, Spain, 9–13 May 2011

    Google Scholar 

  3. Bittlingmayer, G.: Efficiency and entry in a simple airline network. Int. J. Ind. Organ. 8, 245–257 (1990)

    Article  Google Scholar 

  4. Braun, M., Koch, A., Dahlmann, K., Grewe, V., Gollnick, V.: An airline network design approach considering environmental and economical targets. iN: 27th International Congress of the Aeronautical Sciences, Nice, France (2010)

    Google Scholar 

  5. Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank-based version of the ant system: a computational study. Cent. Eur. J. Oper. Res. Econ. 7(1), 25–38 (1997)

    MathSciNet  MATH  Google Scholar 

  6. Chen, H., Roughgarden, T., Valiant, G.: Designing networks with good equilibria. In: SODA ’08/SICOMP ’10 (2008)

    Google Scholar 

  7. DAmato, E., Iuspa, L., Del Core, G.: A distributed ant colony algorithm for topological optimization of 2D structural domains. iN: Proceedings of EUROGEN2011 Evolutionary and Deterministic Methods for Design, Optimization and Control, pp. 108–123 (2011)

    Google Scholar 

  8. Dorigo, M., Blum, C.: Ant colony optimization theory: a survay. Theor. Comput. Sci. 344, 243–278 (2005)

    Article  Google Scholar 

  9. Eurocontrol: European Route Network Improvement Plan, Part 1: Airspace Design Methdology, https://www.eurocontrol.int/sites/default/files/publication/files/ernip-part-1-airspace-design-methodology$_0$.pdf (2015)

  10. Gilles, R.P., Chakrabarti, S., Sarangi, S.: Nash equilibria of network formation games under consent. Math. Soc. Sci. 64, 159–165 (2012)

    Article  MathSciNet  Google Scholar 

  11. Jaillet, P., Song, G., Yu, G.: Airline network design and hub location problems. Locat. Sci. 4, 195–211 (1996)

    Article  Google Scholar 

  12. Lederer, P.J.: A competitive network design problem with pricing. Transp. Sci. 27, 2538 (1993)

    Article  Google Scholar 

  13. Lederer, P.J., Nambimadom, R.S.: Airline network design. Oper. Res. 46, 785804 (1998)

    Article  Google Scholar 

  14. Mallozzi, L.: An application of Optimization Theory to the study of equilibria for games: a survey. Cent. Eur. J. Oper. Res. 21(3), 523–539 (2013)

    Article  MathSciNet  Google Scholar 

  15. Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14, 124–143 (1996)

    Article  MathSciNet  Google Scholar 

  16. Marinakis, Y., Migdalas, A., Pardalos, P.M.: Expanding neighborhood searchGRASP for the probabilistic traveling salesman problem. Optim. Lett. 2, 351–361 (2008)

    Article  MathSciNet  Google Scholar 

  17. Moulin, H.: Game Theory for the Social Sciences, Second and Revised Edition. New York University Press, New York (1986)

    Google Scholar 

  18. Neumann, F., Witt, C.: Ant Colony Optimization and the minimum spanning tree problem. Theor. Comput. Sci. 411, 2406–2413 (2010)

    Article  MathSciNet  Google Scholar 

  19. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)

    Book  Google Scholar 

  20. OAG Worldwide Limited: Official Airline Guide, OAG Bedford (2007)

    Google Scholar 

  21. Oum, T.-H., Tretheway, M.W.: Airline hub and spoke systems. J. Transp. Res. Forum 30, 380–393 (1990)

    Google Scholar 

  22. Single European Sky ATM Research: http://www.sesarju.eu/newsroom/brochures-publications/release-5 (2015)

  23. Sharkey, W.W.: Network models in economics. In: Bali, M.O., et al. (eds.) Handbooks in OR & MS, vol. 8, Ch. 9 (1995)

    Google Scholar 

  24. Topkis, D.: Supermodularity and Complementarity. Princeton University Press, Princeton NJ (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. D’Amato .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

D’Amato, E., Daniele, E., Mallozzi, L. (2019). Designing Networks in Cooperation with ACO. In: Minisci, E., Vasile, M., Periaux, J., Gauger, N., Giannakoglou, K., Quagliarella, D. (eds) Advances in Evolutionary and Deterministic Methods for Design, Optimization and Control in Engineering and Sciences. Computational Methods in Applied Sciences, vol 48. Springer, Cham. https://doi.org/10.1007/978-3-319-89988-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-89988-6_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-89986-2

  • Online ISBN: 978-3-319-89988-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics