Simulating realistic set covering problems with known optimal solutions

Authors:
Nabin Sapkota;Charles H. Reilly
Affiliations:
Department of Industrial Engineering and Management Systems, University of Central Florida, 4000 Central Florida Blvd., P.O. Box 162450, Orlando, FL 32816-2450, United States;Department of Industrial Engineering and Management Systems, College of Engineering and Computer Science, University of Central Florida, P.O. Box 162993, Orlando, FL 32826-2993, United States
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 11
Cited 0

Scheduling ocean transportation of crude oil

Management Science
Optimal selection of ingot sizes via set covering

Operations Research
A new algorithm for the 0-1 knapsack problem

Management Science
A comparison of alternative input models for synthetic optimization problems

WSC '93 Proceedings of the 25th conference on Winter simulation
Optimization test problems with uniformly distributed coefficients

WSC '91 Proceedings of the 23rd conference on Winter simulation
Input models for synthetic optimization problems

Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Characterizing distributions of discrete bivariate random variables for simulation and evaluation of solution methods

WSC' 90 Proceedings of the 22nd conference on Winter simulation
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
Synthetic Optimization Problem Generation: Show Us the Correlations!

INFORMS Journal on Computing
Experiments with parallel branch-and-bound algorithms for the set covering problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper outlines a methodology to generate random Set Covering Problem (SCP) instances with known optimal solutions and correlated coefficients. Positive correlation between the objective function coefficients and the column sums of the SCP constraint matrix is known to affect the performance of SCP solution methods. Generating large SCP instances with known optimal solutions and realistic coefficient correlation provides a plethora of test problems with controllable problem characteristics, including correlation, and an ample opportunity to test the performance of SCP heuristics and algorithms without having to solve the problems to optimality. We describe the procedure for generating SCP instances and present the results of a computational demonstration conducted on SCP instances generated by our procedure. This computational demonstration shows that the heuristics' relative errors increase as the correlation increases, that the likelihood of finding a non-optimal solution also increases with the level of correlation, and that the quality of the solutions found is affected by the number of constraints.