Design of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand
Authors
Abstract:
This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location of hubs. However, in real life problems, especially for locating a metro hub, the demand is dependent on the utility that is proposed by each hub. By considering the elasticity of demand, the complexity of solving the problem increases. The presented model also has the ability to compute the number of trains between each pair of two hubs. The objectives of this model are to maximize the benefits of transportation and establishing the hub facilities while minimizing the total transportation time. Furthermore, the bi-objective model is converted into a single objective one by the TH method. The significance of applicability of the developed model is demonstrated by a number of numerical experiments and some sensitivity analyses on the data inspired by the Qom monorail project. Finally, the conclusion is provided.
similar resources
Capacitated single allocation hub location problem - A bi-criteria approach
A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allo...
full textA Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...
full textCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
full textThe design of single allocation incomplete hub networks
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 ...
full textComplete / Incomplete Hierarchical Hub Center Single Assignment Network Problem
In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs. The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...
full textModeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)
The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...
full textMy Resources
Journal title
volume 27 issue 4
pages 373- 385
publication date 2016-12
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023