JavaScript is disabled for your browser. Some features of this site may not work without it.

    Listar

    Todo RIUMAComunidades & ColeccionesPor fecha de publicaciónAutoresTítulosMateriasTipo de publicaciónCentrosEsta colecciónPor fecha de publicaciónAutoresTítulosMateriasTipo de publicaciónCentros

    Mi cuenta

    AccederRegistro

    Estadísticas

    Ver Estadísticas de uso

    DE INTERÉS

    Datos de investigaciónReglamento de ciencia abierta de la UMAPolítica de RIUMAPolitica de datos de investigación en RIUMASHERPA/RoMEODulcinea
    Preguntas frecuentesManual de usoDerechos de autorContacto/Sugerencias
    Ver ítem 
    •   RIUMA Principal
    • Investigación
    • Lenguajes y Ciencias de la Computación - (LCC)
    • LCC - Contribuciones a congresos científicos
    • Ver ítem
    •   RIUMA Principal
    • Investigación
    • Lenguajes y Ciencias de la Computación - (LCC)
    • LCC - Contribuciones a congresos científicos
    • Ver ítem

    Anytime Algorithms for Multi-Objective Hub Location Problems

    • Autor
      Luque-Polo, Gabriel JesúsAutoridad Universidad de Málaga; Domínguez-Merino, EnriqueAutoridad Universidad de Málaga; Chicano-García, José-FranciscoAutoridad Universidad de Málaga; Ruiz-Mora, Ana BelénAutoridad Universidad de Málaga
    • Fecha
      2018-11-20
    • Palabras clave
      Recursos de información electrónicos
    • Resumen
      In many logistic, telecommunications and computer networks, direct routing of commodities between any origin and destination is not viable due to economic and technological constraints. Hub locations problems (HLPs) are considered in that cases, where the design of these networks are optimized based on some objective(s) related on the cost or service. A huge number of papers have been published since the seminal work of O’Kelly. Early works were focused on analogue facility location problems, considering some assumptions to simplify network design. Recent works have studied more complex models that relax some of these assumptions and incorporate additional real-life features. In most HLPs considered in the literature, the input parameters are assumed to be known and deterministic. However, in practice, this assumption is unrealistic since there is a high uncertainty on relevant parameters, such as costs, demands or even distances. As a result, a decision maker usually prefer several solutions with a low uncertainty in their objectives functions. In this work, anytime algorithms are proposed to solve the multi-objective hub location problems with uncertainty. The proposed algorithms can be stopped at any time, yielding a set of efficient solutions (belonging to the Pareto front) that are well spread in the objective space.
    • URI
      https://hdl.handle.net/10630/16902
    • Compartir
      RefworksMendeley
    Mostrar el registro completo del ítem
    Ficheros
    short_abstract.pdf (90.60Kb)
    Colecciones
    • LCC - Contribuciones a congresos científicos

    Estadísticas

    Ver Estadísticas de uso
    Buscar en Dimension
    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA
    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA
     

     

    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA
    REPOSITORIO INSTITUCIONAL UNIVERSIDAD DE MÁLAGA