Reliable location routing problem considers a location problem and a vehicle routing problem in order to select the optimal location of facilities and at the same time the optimal routes for vehicles considering the unexpected failure for facilities in which, all facilities may fail with a probability. In this paper, a bi-objective mathematical model has been developed to minimize the total cos...

Hub location problems, with the hub-and-spoke network structure, involve locating hub facilities, allocating the non-hubs (spokes) to the hubs, and determining the path for each origin-destination pair. In a pure hub-and-spoke network, all hubs, which act as intermediate switching or transshipment points for internodal flows, are fully interconnected and none of the non-hubs are directly connec...

Design of network, through which data, packages or even people can be transported, is an important issue for achieving a desired level of service quality at an acceptable cost. For this purpose, it is possible to design a network comprised of nodes that are connected to each other with dedicated lines. However, this kind of solution will not be cost effective. In order to decrease the total tra...

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

This paper considers the design of two-layered networks with fully interconnected backbone and access networks. The problem, a specific application of hub location to network design, is known as fully interconnected network design problem (FINDP). A novel mathematical programming formulation advantageous over an earlier formulation is presented to model the problem. Two hybrid heuristics are pr...

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

This paper proposes a new lower bounding procedure for the Uncapacitated Single Allocation p-Hub Median Problem based on Lagrangean relaxation. For solving the resulting Lagrangean subproblem, the given problem structure is exploited: it can be decomposed into smaller subproblems that can be solved efficiently by combinatorial algorithms. Our computational experiments for some benchmark instanc...

We study the hub location and routing problem where we jointly decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and s...

This paper developed a mathematical model framework using the single allocation strategy for hub covering location problem. The model encompassed the transportation time covering under gradual decay function. Within a certain transportation time for the origin and destination nodes among two hubs, the route is fully covered, and beyond another specified transportation time the route is not cove...