The hub location problem with stopovers in a tree topology - Archive ouverte HAL
Communication Dans Un Congrès Année : 2023

The hub location problem with stopovers in a tree topology

Résumé

This research focuses on the study of a hub location problem (HLP), specifically immersed in a tree-shaped network.The objective is to find the minimum cost tree network with three sets of nodes: (i) a set of selected hubs, (ii) a set of spokes that are allocated to a single hub, and (iii) a set of so-called \textit{stopovers} that are intermediate nodes located on a path between two hubs. To locate stopovers, it is necessary to relax some assumptions of classical HLPs. The first one to violate is the assumption to have a complete graph of the hubs. In this work, the graph of hubs is a tree. Another assumption to relax is that the link between hubs may form a path traversing a set of stopovers.We present a mixed-integer linear programming (MILP) formulation for the HLP with stopovers on a tree topology. Numerous computational experiments are performed to test the limits of the MILP formulation. We finally present a case study relying on a real river network.
Fichier non déposé

Dates et versions

hal-04010521 , version 1 (01-03-2023)

Licence

Identifiants

  • HAL Id : hal-04010521 , version 1

Citer

Oscar H. Ariztegui Beltran, David Leonardo Cortés-Murcia, William Javier Guerrero Rueda, Olivier Péton, Mehrdad Mohammadi. The hub location problem with stopovers in a tree topology. ROADEF 2023 : 24ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Nadjib Brahimi, Feb 2023, Rennes, France. ⟨hal-04010521⟩
84 Consultations
0 Téléchargements

Partager

More