788 research outputs found
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 allocation hub location problems are presented: in a first model, total time is considered as the second criteria and, in a second model, the maximum service time for the hubs is minimized. To generate non-dominated solutions an interactive decision-aid approach developed for bi-criteria integer linear programming problems is used. Both bi-criteria models are tested on a set of instances, analyzing the corresponding non-dominated solutions set and studying the reasonableness of the hubs flow charge for these non-dominated solutions. The increased information provided by the non-dominated solutions of the bi-criteria model when compared to the unique solution given by the capacitated hub location model is highlighted.http://www.sciencedirect.com/science/article/B6VC5-4NJ20KB-1/1/1e97eb5bcd05f13ffa09fff6a50958b
A New Model for The Multi-Objective Multiple Allocation Hub Network Design and Routing Problem
In this paper, we propose a new model for the multi-objective multiple allocation hub network
design and routing problem which contains determining the location of hubs, the design of hub network, and
the routing of commodities between source-destination pairs in the given network. The selected hubs are not
assumed to be fully connected, and each node and arc in the network has capacity constraints. The multiple
objectives of the problem are the minimization of total xed and transportation costs and the minimization
of the maximum travel time required for routing. We propose a mathematical formulation for the multiobjective
problem and present a meta-heuristic solution based on a well-known multi-objective evolutionary
algorithm. Using the proposed formulation, we are able to nd the optimal solution for small networks of ve
nodes and seven nodes. To evaluate the performance of our heuristic approach on real data, the computational
experiments are conducted on Turkish postal system data set. The results demonstrate that our heuristic
approach can nd feasible solutions to the problem in reasonable execution time, which is less than 10 min
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
Experimental Evaluation of Meta-Heuristics for Multi-Objective Capacitated Multiple Allocation Hub Location Problem
Multi-objective capacitated multiple allocation hub location problem (MOCMAHLP) is a variation of classic
hub location problem, which deals with network design, considering both the number and the location
of the hubs and the connections between hubs and spokes, as well as routing of flow on the network.
In this study, we offer two meta-heuristic approaches based on the non-dominated sorting genetic algorithm
(NSGA-II) and archived multi-objective simulated annealing method (AMOSA) to solve
MOCMAHLP. We attuned AMOSA based approach to obtain feasible solutions for the problem and developed
five different neighborhood operators in this approach. Moreover, for NSGA-II based approach, we
developed two novel problem-specific mutation operators. To statistically analyze the behavior of both
algorithms, we conducted experiments on two well-known data sets, namely Turkish and Australian
Post (AP). Hypervolume indicator is used as the performance metric to measure the effectiveness of both
approaches on the given data sets. In the experimental study, thorough tests are conducted to fine-tune
the proposed mutation types for NSGA-II and proposed neighborhood operators for AMOSA. Fine-tuning
tests reveal that for NSGA-II, mutation probability does not have a real effect on Turkish data set, whereas
lower mutation probabilities are slightly better for AP data set. Moreover, among the AMOSA based
neighborhood operators, the one which adds/removes a specific number of links according to temperature
(NS-5) performs better than the others for both data sets. After analyzing different operators for both
algorithms, a comparison between our NSGA-II based and AMOSA based approaches is performed with
the best settings. As a result, we conclude that both of our algorithms are able to find feasible solutions
of the problem. Moreover, NSGA-II performs better for larger, whereas AMOSA performs better for smaller
size networks
Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem
Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origin-destination links are impractical. This work investigates the single allocation hub location problem, and proposes a genetic algorithm (GA) approach for it. The effectiveness of using a single-objective criterion measure for the problem is first explored. Next, a multi-objective GA employing various fitness evaluation strategies such as Pareto ranking, sum of ranks, and weighted sum strategies is presented. The effectiveness of the multi-objective GA is shown by comparison with an Integer Programming strategy, the only other multi-objective approach found in the literature for this problem. Lastly, two new crossover operators are proposed and an empirical study is done using small to large problem instances of the Civil Aeronautics Board (CAB) and Australian Post (AP) data sets
A hybrid model for multi-objective capacitated facility location network design problem
One of the primary concerns on many traditional capacitated facility location/network problems is to consider transportation and setup facilities in one single objective function. This simple assumption may lead to misleading solutions since the cost of transportation is normally considered for a short period time and, obviously, the higher cost of setting up the facilities may reduce the importance of the transportation cost/network. In this paper, we introduce capacitated facility location/network design problem (CFLNDP) with two separate objective functions in forms of multi-objective with limited capacity. The proposed model is solved using a new hybrid algorithm where there are two stages. In the first stage, locations of facilities and design of fundamental network are determined and in the second stage demands are allocated to the facilities. The resulted multi-objective problem is solved using Lexicography method for a well-known example from the literature with 21 node instances. We study the behaviour of the resulted problem under different scenarios in order to gain insight into the behaviour of the model in response to changes in key problem parameters
Hierarchical Passenger Hub Location Problem in a Megaregion Area Considering Service Availability
The rapid growth of the intercity travel demand has resulted in enormous pressure on the passenger transportation network in a megaregion area. Optimally locating hubs and allocating demands to hubs influence the effectiveness of a passenger transportation network. This study develops a hierarchical passenger hub location model considering the service availability of hierarchical hubs. A mixed integer linear programming formulation was developed to minimize the total cost of hub operation and transportation for multiple travel demands and determine the proportion of passengers that access hubs at each level. This model was implemented for the Wuhan metropolitan area in four different scenarios to illustrate the applicability of the model. Then, a sensitivity analysis was performed to assess the impact of changing key parameters on the model results. The results are compared to those of traditional models, and the findings demonstrate the importance of considering hub choice behavior in demand allocation
- …