Available online 9 December 2008

the hub location decision is a long term investment and any changes in it take considerable time and money. in real situations, some parameters are uncertain hence, deterministic models cannot be more efficient. the ability of two-stage stochastic programming is to make a long-term decision by considering effects of it in short term decisions simultaneously. in the two-stage stochastic programm...

In this paper we consider a capacitated single allocation p-hub median problem (CSApHMP) which is to determine the location of p hubs, the allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total transportation cost and fixed cost of the selected p hubs. Since the CSApHMP is NP-hard...

In this paper we consider a capacitated single allocation p-hub median problem with multiple capacity levels (CSApHMPMC) in which the decisions are to determine the location of p hubs and their capacity levels, the single allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total tran...

Two competitors, a Leader and a Follower, are sequentially creating their hub and spoke networks to attract customers in a market where prices have fixed markups. Each competitor wants to maximize his profit, rather than a market share. Demand is split according to the logit model. The goal is to find the optimal hub and spoke topology for the Leader. We represent this Stackelberg game as a non...

Hub location problems are widely studied in the area of location theory, where they involve locating the hub facilities and designing the hub networks. In this paper, we present a new and robust solution based on a genetic search framework for the uncapacitated single allocation hub location problem (USAHLP). To present its e8ectiveness, we compare the solutions of our GA-based method with the ...

We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol c...