• español
    • English
  • Login
  • español 
    • español
    • English

UniversidaddeCádiz

Área de Biblioteca, Archivo y Publicaciones
Comunidades y colecciones
Ver ítem 
  •   RODIN Principal
  • Producción Científica
  • Artículos Científicos
  • Ver ítem
  •   RODIN Principal
  • Producción Científica
  • Artículos Científicos
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

Uncapacitated single-allocation hub median location with edge upgrading: Models and exact solution algorithms

Thumbnail
Identificadores

URI: http://hdl.handle.net/10498/35886

DOI: 10.1016/j.trb.2024.103034

ISSN: 0191-2615

Ficheros
OA_2024_1355.pdf (1.367Mb)
Estadísticas
Ver estadísticas
Métricas y Citas
 
Compartir
Exportar a
Exportar a MendeleyRefworksEndNoteBibTexRIS
Metadatos
Mostrar el registro completo del ítem
Autor/es
Landete, Mercedes; Muñoz Ocaña, Juan ManuelAutoridad UCA; Rodríguez Chía, Antonio ManuelAutoridad UCA; Saldanha-da-Gama, Francisco
Fecha
2024-07-30
Departamento/s
Estadística e Investigación Operativa
Fuente
Transportation Research Part B: Methodological, Vol. 187, 2024
Resumen
In this paper, a class of single-allocation hub location problems is investigated from the perspective of upgrading. The latter is understood as an improvement of a set of edges to increase their individual performance, e.g., a decreased unit transportation cost. The goal is to obtain an improved optimal solution to the problem compared to that obtained if upgrading was not done. A budget constraint is assumed to limit the upgrading operations. A flow-based formulation is initially proposed that extends a classical model for uncapacitated single-allocation hub location with complete hub networks. Nevertheless, the fact that the unit costs after upgrading may violate the triangle inequality needs to be accounted for. Since the proposed formulation has a high computing burden, different possibilities are discussed for enhancing it. This leads to devising an efficient branch-and-cut algorithm with different variants. Additionally, a formulation based on the discrete ordered median function is also introduced that is also enhanced and embedded into a branch-and-cut algorithm again with several variants. All models and algorithms are also adapted to problems embedding hub network design decisions. Extensive computational tests were conducted to assess the methodological contributions proposed.
Materias
Hub location; Hub-network design; Single allocation; Edge upgrading; MILP models; Branch-and-cut
Colecciones
  • Artículos Científicos [12009]
  • Articulos Científicos Est. I.O. [361]
  • Artículos Científicos INDESS [1043]
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Listar

Todo RODINComunidades y ColeccionesPor fecha de publicaciónAutoresTítulosMateriasEsta colecciónPor fecha de publicaciónAutoresTítulosMaterias

Mi cuenta

AccederRegistro

Estadísticas

Ver Estadísticas de uso

Información adicional

Acerca de...Deposita en RODINPolíticasNormativasDerechos de autorEnlaces de interésEstadísticasNovedadesPreguntas frecuentes

RODIN está accesible a través de

OpenAIREOAIsterRecolectaHispanaEuropeanaBaseDARTOATDGoogle Académico

Enlaces de interés

Sherpa/RomeoDulcineaROAROpenDOARCreative CommonsORCID

RODIN está gestionado por el Área de Biblioteca, Archivo y Publicaciones de la Universidad de Cádiz

ContactoSugerenciasAtención al Usuario