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...

Hinterland transportation has become increasingly critical for global container supply chain performance. However, the literature on the management of the container supply chain tends to overlook the issues related to hinterland transportation. The problem we consider here is faced by a deep-sea terminal operator who wants to open an inland terminal to facilitate its operations. When developed ...

In this paper, a new mixed integer mathematical programme is proposed for the application of Hub Location Problems (HLP) in public transport planning. This model is among the few existing ones for this application. Some classes of valid inequalities are proposed yielding a very tight model. To solve instances of this problem where existing standard solvers fail, two approaches are proposed. The...

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

Full terms and conditions of use:

In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported ...

We consider two formulations for the uncapacitated hub location problem with single assignment (UHL) which use multicommodity flow variables. We project out the flow variables and determine some extreme rays of the projection cones. Then we investigate whether the corresponding inequalities define facets of the UHL polyhedron. We also present two families of facet defining inequalities that dom...