Sentence examples for multiple allocation p-hub from inspiring English sources

This paper provides time definite models for multiple allocation p-hub median problems and hub arc location problems.

In this paper, we address the multiple allocation p-hub median, p-hub maximal covering, and p-hub center problems under intentional disruptions.

This research develops a mathematical model using the multiple-allocation p-hub median approach.

We introduce the single allocation p-hub median location and routing problem with simultaneous pick-up and delivery based on observations from real life hub networks.

We present a new general variable neighborhood search approach for the uncapacitated single allocation p-hub median problem in networks.

This paper develops a bi-objective reliable single allocation p-hub maximal covering problem (BRSApHMCP) considering two objectives: maximizing expected covered flows and minimizing congestion.

Specifically, we tackle the uncapacitated r-allocation p-hub median problem, which consists of minimizing the cost of transporting the traffics between nodes of a network through special facilities that act as transshipment points.

Within this context, the single allocation incomplete p-hub median, the incomplete hub location with fixed costs, the incomplete hub covering, and the incomplete p-hub center network design problems are defined, and efficient mathematical formulations for these problems with O(n3) variables are introduced.

Then a linearization idea is considered for it and applied for multiple allocation hub set, single and multiple allocation hub maximal covering problems.

The multiple allocation hub-and-spoke network design under hub congestion problem is addressed in this paper.

This paper focuses on a multiple allocation incomplete hub location problem in which a hub network can be partially interconnected by hub arcs, direct connections between non-hub nodes are allowed, and uncertainty is assumed for the data of origin-destination demands and hub fixed costs.