Abstract Many of air cargo companies adapt the hub-and-spokes system where economies of scale exist in the transportation cost. In this paper, we formulate economies of scale using nonlinear cost function of distances and demands, and analyze how the change of the transportation cost affects single hub location of air cargo using the generalized Weber problem on the regular demand points of one...

Abstract. In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented in [15], and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for the first time in [19]. In addition to locate the hubs, to determine the tree that connects the hubs and to allocate non-hub nodes to hubs, a decision has to be made ...

This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds at the nodes of the tree. The Lagrangean function exploits the structure of the problem and can be decomposed into smaller subproblems which can be solved efficiently. In addition, some reduction procedures based on the...

abstract minimizing service cost and adverse effects on environment and society are important in waste management. due to this, landfill and transfer station location become important. this article as a practical research uses analytical hierarchy process in multi criteria decision making considering environmental and social criteria in levels of benefit, opportunity, cost and risk (bocr) for p...

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and...

Abstract. We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are located in a cycle, which is called a cycle-star hub network design problem. The problem is essentially equivalent to a cycle-metric labeling problem....

We propose a novel hub location model that jointly eliminates some of the traditional assumptions on structure network and discount as result economies scale in an effort to better reflect real-world logistics transportation systems. Our extends literature various facets: instead connecting nonhub nodes directly nodes, we consider routes with stopovers; pairs hubs directly, design can visit sev...