207 research outputs found
Network hub locations problems: the state of the art
Cataloged from PDF version of article.Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin-destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hub location and provide a synthesis of the literature. (C) 2007 Elsevier B.V. All rights reserved
A new model for the hazardous waste location-routing problem
Cataloged from PDF version of article.Hazardous waste management involves the collection, transportation, treatment and disposal of hazardous wastes. In this paper a new multiobjective location-routing model is proposed. Our model also includes some constraints, which were observed in the literature but were not incorporated into previous models. The aim of the proposed model is to answer the following questions: where to open treatment centers and with which technologies, where to open disposal centers, how to route different types of hazardous waste to which of the compatible treatment technologies, and how to route waste residues to disposal centers. The model has the objective of minimizing the total cost and the transportation risk. A large-scale implementation of the model in the Central Anatolian region of Turkey is presented. © 2005
The design of single allocation incomplete hub networks
Cataloged from PDF version of article.The hub location problem deals with finding the location of hub facilities and allocating the
demand nodes to these hub facilities so as to effectively route the demand between any
origin–destination pair. In the extensive literature on this challenging network design
problem, it has widely been assumed that the subgraph induced by the hub nodes is complete.
Relaxation of this basic assumption constitutes the starting point of the present
work. In this study, we provide a uniform modeling treatment to all the single allocation
variants of the existing hub location problems, under the incomplete hub network design.
No network structure other than connectivity is imposed on the induced hub network.
Within this context, the single allocation incomplete p-hub median, the incomplete hub
location with fixed costs, the incomplete hub covering, and the incomplete p-hub center
network design problems are defined, and efficient mathematical formulations for these
problems with Oðn3Þ variables are introduced. Computational analyses with these formulations
are presented on the various instances of the CAB data set and on the Turkish
network.
2009 Elsevier Ltd. All rights reserved
The hazardous waste location-routing problem
Cataloged from PDF version of article.As a result of high industrialization and technology hazardous waste
management problem has now become an unavoidable problem of the world.
Hazardous waste management involves collection, transportation, treatment
and disposal of hazardous wastes. In this thesis, the existing models in the
literature are analyzed in terms of applicability. A new multiobjective
location-routing model is proposed by combining the applicable aspects from
different models. Our model also includes the constraints that reflect certain
requirements that have been observed in the literature but could not been
incorporated into the models correctly together with the additional constraints
that we propose. The aim of the model is to decide on the following
questions: where to open treatment centers with which technologies, where to
open disposal centers, how to route different types of hazardous wastes to
which of the compatible treatment technologies, and how to route waste
residues to disposal centers. The model has two objectives of minimizing total
cost and minimizing transportation risk. A large scale implementation of the
model in the Central Anatolian Region of Turkey is presented.Alumur, SibelM.S
Multimodal hub location and hub network design
Cataloged from PDF version of article.Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In addition to the location and allocation decisions, we also study the decision on how the hub networks with different possible transportation modes must be designed. In this multimodal hub location and hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different transportation modes between hubs and different types of service time promises between origin–destination pairs while designing the hub network in the multimodal problem. We first propose a linear mixed integer programming model for this problem and then derive variants of the problem that might arise in certain applications. The models are enhanced via a set of effective valid inequalities and an efficient heuristic is developed. Computational analyses are presented on the various instances from the Turkish network and CAB data set
Hub location and Hub network design
Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2009.Thesis (Ph.D.) -- Bilkent University, 2009.Includes bibliographical references leaves 138-150.he hub location problem deals with finding the location of hub facilities and
allocating the demand nodes to these hub facilities so as to effectively route
the demand between origin–destination pairs. Hub location problems arise in
various application settings in telecommunication and transportation. In the
extensive literature on the hub location problem, it has widely been assumed
that the subgraph induced by the hub nodes is complete. Throughout this thesis
we relax the complete hub network assumption in hub location problems and
focus on designing hub networks that are not necessarily complete. We
approach to hub location problems from a network design perspective. In
addition to the location and allocation decisions, we also study the decision on
how the hub network must be designed. We focus on the single allocation
version of the problems where each demand center is allocated to a single hub
node. We start with introducing the 3-stop hub covering network design
problem. In this problem, we aim to design hub networks so that all origin–
destination pairs receive service by visiting at most three hubs on a route.
Then, we include hub network design decisions in the classical hub location
problems introduced in the literature. We introduce the single allocation
incomplete p-hub median, hub location with fixed costs, hub covering, and p-hub center network design problems to the literature. Lastly, we introduce the
multimodal hub location and hub network design problem. We include the
possibility of using different hub links, and allow for different transportation
modes between hubs, and for different types of service time promises between
origin–destination pairs, while designing the hub network in the multimodal
problem. In this problem, we jointly consider transportation costs and travel
times, which are studied separately in hub location problems presented in the
literature. Computational analyses with all of the proposed models are
presented on the various instances of the CAB data set and on the Turkish
network.Alumur, Sibel AlevPh.D
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
Cataloged from PDF version of article.Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin–destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network
A hub covering network design problem for cargo applications in Turkey
Hub location problems involve locating hub facilities and allocating demand nodes to hubs in order to provide service between origin-destination pairs. In this study, we focus on cargo applications of the hub location problem. Through observations from the Turkish cargo sector, we propose a new mathematical model for the hub location problem that relaxes the complete hub network assumption. Our model minimizes the cost of establishing hubs and hub links, while designing a network that services each origin-destination pair within a time bound. We formulate a single-allocation hub covering model that permits visiting at most three hubs on a route. The model is then applied to the realistic instances of the Turkish network and to the Civil Aeronautics Board data set. © 2009 Operational Research Society Ltd
Profit Maximizing Hub Location Problems
The final publication is available at Elsevier via https://doi.org/10.1016/j.omega.2018.05.016 © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/In this paper, we study profit maximizing hub location problems. We formulate mathematical models determining the location of hubs, designing the hub networks, and routing the demand in order to maximize profit. The profit is calculated by summing the total revenue minus total cost. Total cost includes the total transportation cost, the installation cost of hubs, and the cost of operating hub links. We consider all possible allocation strategies: multiple allocation, single allocation, and r-allocation. As an extension, for each allocation strategy, we also model the cases in which direct connections between non-hub nodes are allowed. To test and evaluate the performances of the proposed models, we use two well-known data sets from the literature. We analyze the resulting hub networks under various different parameter settings.Natural Sciences and Engineering Research Council of Canada [RGPIN-2015-05548
- …