NAGIOS: RODERIC FUNCIONANDO
Model and solution methods for some hub location problems
Repositori DSpace/Manakin
- Inici
- Investigació
- e-prints
- 12 - Matemàtiques
- Visualitza element
IMPORTANT: Aquest repositori està en una versió antiga des del 3/12/2023. La nova instal.lació está en https://roderic.uv.es/
Model and solution methods for some hub location problems
Mostra el registre parcial de l'element
| dc.contributor.advisor | Corberán Salvador, Ángel | |
| dc.contributor.advisor | Martí Cunquero, Rafael | |
| dc.contributor.author | Peiró Ramada, Juan José | |
| dc.contributor.other | Departament d'Estadística i Investigació Operativa | es_ES |
| dc.date.accessioned | 2016-11-28T14:10:05Z | |
| dc.date.available | 2017-11-29T05:45:05Z | |
| dc.date.issued | 2016 | es_ES |
| dc.date.submitted | 16-12-2016 | es_ES |
| dc.identifier.uri | http://hdl.handle.net/10550/56197 | |
| dc.description.abstract | In this thesis we study some hub location problems in the context of transportation networks. These are combinatorial optimization problems appearing in situations where there is a need of transporting some traffic, like items, people, and information, from many origins to many destinations. Instead of sending these flows using a direct shipment between all pairs of nodes in the network, a subset of these nodes is selected to use as hubs, with the aim of consolidating and distribute the flows. Thus, hubs induce a subnetwork that sends the traffic more efficiently and at a cheaper cost, allowing economies of scale when large amounts of traffic between nodes on this subnet are transported. We study different variants of hub location problems that try to model several real world situations and characteristics. In all of them, we aim to minimize the cost of sending traffic through the transportation network. | es_ES |
| dc.description.abstract | In this thesis we study some hub location problems in the context of transportation networks. These are combinatorial optimization problems appearing in situations where there is a need of transporting some traffic, like items, people, and information, from many origins to many destinations. Instead of sending these flows using a direct shipment between all pairs of nodes in the network, a subset of these nodes is selected to use as hubs, with the aim of consolidating and distribute the flows. Thus, hubs induce a subnetwork that sends the traffic more efficiently and at a cheaper cost, allowing economies of scale when large amounts of traffic between nodes on this subnet are transported. We study different variants of hub location problems that try to model several real world situations and characteristics. In all of them, we aim to minimize the cost of sending traffic through the transportation network. | en_US |
| dc.format.extent | 202 p. | es_ES |
| dc.language.iso | en | es_ES |
| dc.title | Model and solution methods for some hub location problems | es_ES |
| dc.type | doctoral thesis | es_ES |
| dc.subject.unesco | UNESCO::MATEMÁTICAS::Investigación operativa::Distribución y transporte | es_ES |
| dc.embargo.terms | 1 year | es_ES |
Visualització
(1.685Mb)
Aquest element apareix en la col·lecció o col·leccions següent(s)
-
Tesis [7594]
-
12 - Matemàtiques [287]