Results 81 to 90 of about 1,485,911 (189)

Weighted geometric set multi-cover via quasi-uniform sampling

Journal of Computational Geometry, 2016
We give a randomized polynomial time algorithm with approximation ratio $O(\log \phi(n))$ for weighted set multi-cover instances with a shallow cell complexity of at most $f(z,k) =z\phi(z) k^{O(1)}$.
Nikhil Bansal, Kirk Pruhs
doaj   +1 more source

Exploiting fitness distance correlation of set covering problems [PDF]

The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport.
Helena Ramalhinho-Lourenço, Markus Finger, Thomas Stützle   +2 more
core  

DETERMINING THE OPTIMAL TEMPORARY WASTE DISPOSAL SITES IN THE ALANG-ALANG LEBAR SUB-DISTRICT PALEMBANG USING THE P-CENTRE LOCATION PROBLEM AND P-MEDIAN PROBLEM MODELS

Barekeng
The rapid development of Palembang City comes with an increase in population and a proportionate increase in waste. Providing Temporary Waste Disposal Sites (TWDS) with ideal locations is one way to address the waste problem in Palembang City.
Sisca Octarina, Divasanda Armalia, Bambang Suprihatin, Putra BJ Bangun, Endro Setyo Cahyono, Fitri Maya Puspita, Evi Yuliza, Indrawati Indrawati   +7 more
doaj   +1 more source

Computing Tournament Solutions using Relation Algebra and REL VIEW [PDF]

We describe a simple computing technique for the tournament choice problem. It rests upon a relational modeling and uses the BDD-based computer system RelView for the evaluation of the relation-algebraic expressions that specify the solutions and for the
Agnieszka Rusinowska, Harrie De Swart, Rudolf Berghammer   +2 more
core  

On Geometric Priority Set Cover Problems

, 2021
We study the priority set cover problem for simple geometric set systems in the plane. For pseudo-halfspaces in the plane we obtain a PTAS via local search by showing that the corresponding set system admits a planar support. We show that the problem is APX-hard even for unit disks in the plane and argue that in this case the standard local search ...
Banik, Aritra, Raman, Rajiv, Ray, Saurabh   +2 more
openaire   +2 more sources

2-Stage Design of E-Moped-Sharing Service for Accessibility, Greenhouse Gas Emissions, and Cost Through Station and Supplier Selections

Energies
In recent years, there has been a call for a shift to transportation with lower greenhouse gas (GHG) emissions in order to combat global warming. One of the ecofriendly transportation methods is an electric moped scooter (e-moped)-sharing service that ...
Seigo Takahashi, Yuki Kinoshita, Nora Schelte, Semih Severengiz, Tetsuo Yamada   +4 more
doaj   +1 more source

A Binary Chaotic White Shark Optimizer

Mathematics
This research presents a novel hybrid approach, which combines the White Shark Optimizer (WSO) metaheuristic algorithm with chaotic maps integrated into the binarization process.
Fernando Lepe-Silva, Broderick Crawford, Felipe Cisternas-Caneo, José Barrera-Garcia, Ricardo Soto   +4 more
doaj   +1 more source

Dual hybrid frameworks combining graph convolutional network with decoding for covering location problem

iScience
Summary: The Covering Location Problem (CLP) is widely used for the efficient facility distribution. However, existing algorithms for this problem suffer from long computation times or suboptimal solutions.
Yao Zhang, Shaohua Wang, Haojian Liang, Xiao Li, Zhenbo Wang, Hao Lu   +5 more
doaj   +1 more source

PROVIDING EQUITABLE SPATIAL DISTRIBUTION OF PROTECTED NATURAL AREAS IN A METROPOLITAN SETTING: AN APPLICATION OF THE LOCATION SET-COVERING PROBLEM [PDF]

We use the location set covering problem to define a natural area site selection model for use in the Chicago region. This framework allows us to explicitly consider the equity of site distribution by stipulating that each population center has access to
Gobster, Paul H., Haight, Robert G., Homans, Frances R., Ruliffson, Jane A.   +3 more
core   +1 more source

Optimizing Bus Driver Scheduling: A Set Covering Approach for Reducing Transportation Costs

Applied System Innovation
Cutting operational costs is a critical component for transportation agencies. To reduce these costs, agencies must optimize their scheduling. Typically, the total operating costs of transport include vehicle expenses and driver wages. Solving such tasks
Viktor Sándor Árgilán, József Békési   +1 more
doaj   +1 more source