RT Conference Proceedings
T1 Solving multi-objective hub location problems by hybrid algorithms
A1 Domínguez, Miguel A.
A1 Chicano-García, José-Francisco
A1 Ruiz-Mora, Ana Belén
A1 Domínguez-Merino, Enrique
K1 Algoritmos computacionales - Congresos
AB In many logistic, telecommunications and computer networks, direct routing ofcommodities between any origin and destination is not viable due to economic and technolog-ical constraints. In that cases, a network with centralized units, known as hub facilities, and asmall number of links is commonly used to connect any origin-destination pair. The purposeof these hub facilities is to consolidate, sort and transship e ciently any commodity in thenetwork. Hub location problems (HLPs) consider the design of these networks by locating aset of hub facilities, establishing an interhub subnet, and routing the commodities throughthe network while optimizing some objective(s) based on the cost or service.Hub location has evolved into a rich research area, where a huge number of papers havebeen published since the seminal work of O'Kelly [1]. Early works were focused on analoguefacility location problems, considering some assumptions to simplify network design. Recentworks [2] have studied more complex models that relax some of these assumptions and in-corporate additional real-life features. In most HLPs considered in the literature, the inputparameters are assumed to be known and deterministic. However, in practice, this assumptionis unrealistic since there is a high uncertainty on relevant parameters, such as costs, demandsor even distances.In this work, we will study the multi-objective hub location problems with uncertainty.
YR 2018
FD 2018-03-22
LK https://hdl.handle.net/10630/15479
UL https://hdl.handle.net/10630/15479
LA eng
NO Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 19 ene 2026