Province X in Indonesia has a significant problem with trash that been challenging to address. The Environment Agency therefore desires construct an inorganic Trash Management System. four potential locations various capacities. purpose of this research is locate treatment system's best possible site and allocate each TPS less than 30 km more over from the chosen system, respectively, ensure ov...

On-Road Sensor Networks (ORSNs) play an important role in capturing traffic flow data for predicting short-term traffic patterns, driving assistance and self-driving vehicles. However, this kind of network is prone to large-scale communication failure if a few sensors physically fail. In this paper, to ensure that the network works normally, an effective fault-tolerance mechanism for ORSNs whic...

due to limitations in computing resources of mobile nodes, mobile ad-hoc networks (manets) are very fault-prone. so far, redundancy at different levels of the network has been considered an efficient strategy to enhance the fault-tolerance of networks. indeed, ad-hoc networks are extremely redundant; therefore, natural redundancy to fault tolerance enhancement has a great impact on the network ...

Location problems have been the focus of considerable attention both in research and practice for many years. Numerous extensions have been described to broaden its appeal and enhance its applicability. This study proposes a spreadsheet approach for three well-known facility location problems, the p-median problem (PMP), capacitated p-median (CPMP), and maximal covering location problem (MCLP)....

We show algorithms for computing representative families matroid intersections and use them in fixed-parameter set packing, covering, facility location problems with multiple constraints. complement our tractability results by hardness results.

The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...

This paper discusses the comparison of two different heuristics for total covering problem. The total covering problem is a facility location problem in which the objective is to identify the minimum number of sites among the potential sites to locate facilities to cover all the customers. This problem is a combinatorial problem. Hence, heuristic development to provide solution for such problem...