scholarly journals MODEL JARINGAN RANTAI PASOK UNTUK POS PEMADAM KEBAKARAN DI KAWASAN SIER

2021 ◽  
Vol 16 (1) ◽  
pp. 25-35
Author(s):  
Indra Dwi Febryanto ◽  
Prihono Prihono
Keyword(s):  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem

Perancangan jaringan rantai pasok bisa diaplikasikan dalam industri manufaktur maupun jasa, misalnya dalam menentukan lokasi pos pemadam kebakaran. Perancangan jaringan rantai pasok penting dilakukan khususnya mengenai pos pemadam kebakaran karena  belum terdapat pelayanan yang optimal di hampir seluruh kawasan perindustrian di Indonesia. Metode yang digunakan dalam penelitian adalah set covering problem. Set covering problem memuat variabel keputusan tentang pos pemadam kebakaran mana yang nantinya akan digunakan untuk menjangkau seluruh area SIER. Pos pemadam kebakaran yang digunakan ada 4 yaitu Pos UPTD III, Pos Kali Rungkut, Pos Kepuh, dan Pos Sukolilo. Hasil dari penelitian ini adalah bahwa untuk jarak jangkauan 100-1000 meter ke empat pos pemadam kebakaran semuanya bertugas untuk mengamankan. Sedangkan untuk jarak jangkauan 2000 meter hanya 3 pos pemadam kebakaran yang bertugas. Jarak jangkauan 3000 meter, 2 pos pemadam kebakaran yang bertugas. Jarak jangkauan 4000-5000 meter hanya 1 pos pemadam kebakaran yang bertugas.

scholarly journals Multi-objective database queries in combined knapsack and set covering problem domains

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Sean A. Mochocki ◽  
Gary B. Lamont ◽  
Robert C. Leishman ◽  
Kyle J. Kauffman
Keyword(s):  
Relational Database ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Database Queries ◽  
Multi Objective ◽  
Data Representations ◽  
Np Hard Problem ◽  
Institute Of Technology ◽  
The One

AbstractDatabase queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data. The Air Force Institute of Technology has approximately 100 data logs which will be converted to the standardized Scorpion Data Model format. A relational database is designed to house this data and its associated sensor and non-sensor metadata. Deterministic polynomial-time queries were used to test the performance of this schema against two other schemas, with databases of 100 and 1000 logs of repeated data and randomized metadata. Of these approaches, the one that had the best performance was chosen as AFIT’s database solution, and now more complex and useful queries need to be developed to enable filter research. To this end, consider the combined Multi-Objective Knapsack/Set Covering Database Query. Algorithms which address The Set Covering Problem or Knapsack Problem could be used individually to achieve useful results, but together they could offer additional power to a potential user. This paper explores the NP-Hard problem domain of the Multi-Objective KP/SCP, proposes Genetic and Hill Climber algorithms, implements these algorithms using Java, populates their data structures using SQL queries from two test databases, and finally compares how these algorithms perform.

A Percentil Bat Algorithm an Application to the Set Covering Problem

2020 ◽  
pp. 223-233
Author(s):  
Lorena Jorquera ◽  
Pamela Valenzuela ◽  
Francisco Altimiras ◽  
Paola Moraga ◽  
Gabriel Villavicencio
Keyword(s):  
Bat Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem
Sign in / Sign up

Export Citation Format

Share Document