par Fortz, Bernard 
Editeur scientifique Crainic, Teodor Gabriel;Gendreau, Michel;Gendron, Bernard
Référence Network Design with Applications to Transportation and Logistics, Springer, Ed. 1, page (187-208)
Publication Publié, 2020-12-09
Editeur scientifique Crainic, Teodor Gabriel;Gendreau, Michel;Gendron, Bernard
Référence Network Design with Applications to Transportation and Logistics, Springer, Ed. 1, page (187-208)
Publication Publié, 2020-12-09
Partie d'ouvrage collectif
| Résumé : | This chapter studies models and techniques for long-term planning of networks for which clients demands are not known in advance. It this case, the objective is to build a network at minimum cost, considering only the fixed cost associated with opening a link. Capacity and routing costs are therefore ignored. Nevertheless, the network is subject to topological constraints to ensure its connectivity and survivability. We cover the design of connected networks (and in particular the minimum spanning tree problem), followed by the design of networks requiring a higher level of survivability in terms of number of available node-disjoints paths, to allow re-routing in case of failures. To avoid delays in the networks, we also consider models where the length of paths is bounded, by introducing hop constraints or covering of the links by cycles of bounded lengths. |
