Designing Networks in Cooperation with ACO

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.

Original document

The different versions of the original document can be found in:

• http://www.springer.com/cda/content/document/cda_downloaddocument/Book+Proposal+Form_MC.pdf?SGWID=0-0-45-1655017-p173623786

• http://link.springer.com/content/pdf/10.1007/978-3-319-89988-6_15,

http://dx.doi.org/10.1007/978-3-319-89988-6_15 under the license http://www.springer.com/tdm

• https://link.springer.com/chapter/10.1007%2F978-3-319-89988-6_15,

https://academic.microsoft.com/#/detail/2810458683