Sentence examples for maximal covering problem from inspiring English sources

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.

Peker and Kara (2015) developed a P-Hub maximal covering problem with a gradual coverage function.

Hub covering problems, as location-allocation problems, consist of two sub problems namely hub set covering problem (HSCP) and hub maximal covering problem (HMCP).

In the last few years, the p-hub maximal covering problem (pHMCP) has been applied in a variety of applications, including the design of air transportation networks, distribution systems for perishable products, postal delivery networks, and tourism routing.

While HSCP is aimed at minimizing the transportation and hub establishment costs without any limitation on the number of established hubs, a hub maximal covering problem is constrained by the number of established hubs as an exogenous parameter.

We consider the multiple allocation hub maximal covering problem (MAHMCP): Considering a serviced O D flow was required to reach the destination optionally passing through one or two hubs in a limited time, cost or distance, what is the optimal way to locate p hubs to maximize the serviced flows?

Also, uncertain shipments are studied in the context of hub maximal covering problems.

In this paper, we proposed new formulations for single and multiple allocation hub maximal covering problems.

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

In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed.

This proposed model combines T maximal covering problems; (Y_{it}) is equal to unity only when facilities are established at sites in the set (N_{it}) (Constraint 18).