On solving multi objective Set Covering Problem with imprecise linear fractional objectives

2015 ◽  
Vol 49 (3) ◽  
pp. 495-510 ◽  
Author(s):  
Mudita Upmanyu ◽  
Ratnesh R Saxena
Keyword(s):  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Multi Objective

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 Goal Programming Approach to Solve Linear Fractional Multi-Objective Set Covering Problem

OPSEARCH ◽  
2005 ◽  
Vol 42 (2) ◽  
pp. 112-125 ◽  
Author(s):  
S. R. Arora ◽  
Ravi Shanker ◽  
Neelam Malhotra
Keyword(s):  
Goal Programming ◽  
Set Covering ◽  
Covering Problem ◽  
Programming Approach ◽  
Set Covering Problem ◽  
Multi Objective

scholarly journals Multi-Objective Database Queries in Combined Knapsack and Set Covering Problem Domains

2020 ◽  
Author(s):  
Sean Mochocki ◽  
Gary Lamont ◽  
Robert Leishman ◽  
Kyle 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

Abstract Database 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 polynomialtime 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.

scholarly journals A multi-objective set covering problem: A case study of warehouse allocation in truck industry

2011 ◽  
Vol 1 (1) ◽  
pp. 73-80 ◽  
Author(s):  
Atefeh Malekinezhad ◽  
Ehsan Shirazi ◽  
M. B. Aryanezhad
Keyword(s):  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Multi Objective
Sign in / Sign up

Export Citation Format

Share Document