Diagnostic Expert Systems Based on a Set Covering Model

Cutting Stock Problem (CSP) is the determination of how to cut stocks into items with certain cutting rules. A diverse set of stocks is called multiple stock CSP. This study used Pattern Generation (PG) algorithm to determine cutting pattern, then formulated it into a Gilmore and Gomory model and solved by using Column Generation Technique (CGT). Set Covering model was generated from Gilmore and Gomory model. Based on the results, selected cutting patterns in the first stage can be used in the second stage. The combination of patterns generated from Gilmore and Gomory model showed that the use of stocks was more effective than Set Covering model.

Download Full-text

Sustainable Location Selection of Data Centers: Developing a Multi-Criteria Set-Covering Decision-Making Methodology

International Journal of Information Technology & Decision Making ◽

10.1142/s0219622020500157 ◽

2020 ◽

Vol 19 (03) ◽

pp. 741-773

Author(s):

Siamak Kheybari ◽

Mansoor Davoodi Monfared ◽

Hadis Farazmand ◽

Jafar Rezaei

Keyword(s):

Data Center ◽

Data Centers ◽

Social Economic ◽

Set Covering ◽

Online Questionnaire ◽

Location Selection ◽

Sustainability Criteria ◽

Proposed Model ◽

Covering Model ◽

Selection Of

In this paper, a multi-criteria set-covering methodology is proposed to select suitable locations for a set of data centers. First, a framework of criteria, with social, economic and environmental dimensions, is presented. The framework is used to calculate the suitability of potential data center locations in Iran. To that end, a sample of specialists in Iran was asked to take part in an online questionnaire, based on best–worst method (BWM), to determine the weight of the criteria included in the proposed framework, after which a number of potential locations are evaluated on the basis of the criteria. The proposed model is evaluated under a number of settings. Using the proposed multi-criteria set-covering model, not only the utility of candidate places is evaluated by sustainability criteria but also all service applicants are covered by at least one data center with a specific coverage radius.

Download Full-text

Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem

Applied Sciences ◽

10.3390/app10207110 ◽

2020 ◽

Vol 10 (20) ◽

pp. 7110 ◽

Cited By ~ 1

Author(s):

Roghayyeh Alizadeh ◽

Tatsushi Nishi

Keyword(s):

Location Problem ◽

Set Covering ◽

Strategic Decisions ◽

Maximal Covering ◽

Planning Decisions ◽

Tactical Decisions ◽

Covering Model ◽

Validation Tests ◽

Capacitated Facilities

This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning decisions. Hybrid covering location problem (HCLP) determines the location of the capacitated facilities by using dynamic set covering location problem as strategic decisions and assigns the constructive units of facilities and allocates the demand points by using dynamic modular capacitated maximal covering location problem as tactical decisions. One of the applications of the proposed model is locating first aid centers in humanitarian logistic services that have been addressed by studying a threat case study in Japan. In addition to validating the developed model, it has been compared to other possible combined problems, and several randomly generated examples have been solved. The results of the case study and model validation tests approve that the main hybrid developed model (HCLP) is capable of providing better coverage percentage compared to conventional covering models and other hybrid variants.

Download Full-text

Capacitated set-covering model considering the distance objective and dependency of alternative facilities

IOP Conference Series Materials Science and Engineering ◽

10.1088/1757-899x/319/1/012072 ◽

2018 ◽

Vol 319 ◽

pp. 012072 ◽

Cited By ~ 1

Author(s):

I Wayan Suletra ◽

Yusuf Priyandari ◽

Wakhid A Jauhari

Keyword(s):

Set Covering ◽

Covering Model

Download Full-text

Research on Multi-Period Hydrogen Refueling Station Location Model in Jiading District

World Electric Vehicle Journal ◽

10.3390/wevj12030146 ◽

2021 ◽

Vol 12 (3) ◽

pp. 146

Author(s):

Qianhui Zheng ◽

Hong Lv ◽

Wei Zhou ◽

Cunman Zhang

Keyword(s):

Fuel Cell ◽

Location Model ◽

Set Covering ◽

Passenger Cars ◽

Promoting Effect ◽

Growth Trend ◽

Weighting Method ◽

Covering Model ◽

Planning And Construction ◽

Station Location

The construction of hydrogen refueling stations is an important part of the promotion of fuel cell vehicles. In this paper, a multi-period hydrogen refueling station location model is presented that can be applied to the planning and construction of hydrogen infrastructures. Based on the hydrogen demand of fuel cell passenger cars and commercial vehicles, the model calculates the hydrogen demand of each zone by a weighting method according to population, economic level and education level. Then, the hydrogen demand of each period is calculated using the generalized Bass diffusion model. Finally, the set covering model is improved to determine the locations of the stations. The new model is applied to the scientific planning of hydrogen refueling stations in Jiading District, Shanghai; the construction location and sequence of hydrogen refueling stations in each period are given, and the growth trend of hydrogen demand and the promoting effect of hydrogen refueling stations are analyzed. The model adopted in this model is then compared with the other two kinds of node-based hydrogen refueling station location models that have previously been proposed.

Download Full-text

OPTIMIZATION ASSIGNMENT OF WESTERN PATROL UNIT (KRI) ELEMENT IN SEA SECURITY OPERATIONS IN RIAU ISLANDS WATER AREAS USING SET COVERING MODEL

JOURNAL ASRO ◽

10.37875/asro.v11i1.202 ◽

2020 ◽

Vol 11 (1) ◽

pp. 42

Author(s):

Agus Setiadji ◽

Didit Herdiawan ◽

Benny Sukandari ◽

Muksin Muksin

Keyword(s):

Critical Points ◽

Set Covering ◽

Limited Information ◽

Location Selection ◽

Operational Costs ◽

Discrete Approach ◽

Covering Method ◽

Security Operations ◽

Covering Model ◽

High Level

The territorial waters of Riau Islands are one of the locations with a high level of vulnerability to violations in thesea in Indonesia, because this region is directly adjacent to neighboring countries and is an international tradeand shipping route. One of the roles of the Indonesian Navy is to maintain the security of national jurisdictions,including in the territorial waters of Riau Islands, which are then realized in Operation Sea Security, where theimplementation still has several constraints, namely budget constraints, technical capabilities, number of ships,limited information, and limitations supporting facilities, so that the implementation of Marine SecurityOperations is not optimal. The main reason is the placement of patrol boats during operations is not wellorganized. With these problems, a study was conducted using the set covering method to get the most optimallocation for patrol boat placement with as few ships as possible but still be able to reach the entire waters of theRiau Islands and minimize operational costs. In this study a discrete approach was taken, namely thedetermination of the critical points, which numbered 37 vulnerable points. All these points must be affordable bythe ship on duty.Keywords: Set Covering, Location Selection, Marine Security Operations, Riau Islands Waters Region

Download Full-text

Modified Maintenance Network Model for Urban Rail Transit Systems Based on the Variable Coverage Radius: Evidence from Changchun City in China

Journal of Advanced Transportation ◽

10.1155/2020/3971478 ◽

2020 ◽

Vol 2020 ◽

pp. 1-11 ◽

Cited By ~ 1

Author(s):

Yuan Jiang ◽

Baofeng Sun ◽

Lili Zheng ◽

Wankun Cui ◽

Xinhua Mao

Keyword(s):

Urban Rail Transit ◽

Set Covering ◽

Rail Transit ◽

Transit Systems ◽

Theoretical Support ◽

Urban Rail ◽

Exploratory Stage ◽

Changchun City ◽

Different Populations ◽

Covering Model

Network-wide maintenance lacks strong theoretical support and practical cases. However, research on this topic has entered an extensive exploratory stage; for example, new network design methods are being sought, and successful practices from traditional maintenance by line and by profession are being incorporated. This paper proposes a novel set-covering model with the variable coverage radius for the maintenance network of urban rail transit systems in the context of network-wide maintenance. The concepts of network-wide maintenance follow principles that are similar to those of bio-geography-based optimization (BBO), i.e., patterns of migration, variation, and extinction of different populations in different habitats. Therefore, a BBO algorithm is implemented with combinatorial optimization programming. Experiments from Changchun city in China show that the proposed model and algorithm are effective in fulfilling network-wide requirements through a direct tradeoff between the coverage radius and maintenance response time. In addition, the maintenance capacity and variable coverage radius of each maintenance point influence both the maintenance timeliness and resource utilization of maintenance units.

Download Full-text

Improved Path Flow Estimator for Origin–Destination Trip Tables

Transportation Research Record Journal of the Transportation Research Board ◽

10.1177/0361198105192300102 ◽

2005 ◽

Vol 1923 (1) ◽

pp. 9-17 ◽

Cited By ~ 8

Author(s):

Piya Chootinan ◽

Anthony Chen ◽

Will Recker

Keyword(s):

Error Bounds ◽

Lagrange Multipliers ◽

Transportation Network ◽

Location Theory ◽

Set Covering ◽

Traffic Counts ◽

Minimum Number ◽

Covering Model ◽

Path Flow Estimator

Path flow estimator (PFE) is a one-stage network observer that can estimate path flows and path travel times from traffic counts in a transportation network. Because a unique set of path flows is readily available from the PFE, a trip table can be estimated by simply adding up flows on all the paths connecting individual origin–destination (O-D) pairs. In this paper, the effects of the number and locations of traffic counts on the quality of the O-D trip table estimated by PFE are examined. The set-covering model, studied in the location theory, is applied to determine the minimum number of traffic counts and their corresponding locations required to observe the total demand of the study network. Next, the effects of the error bounds used in PFE to handle the inconsistency problem of traffic counts are examined, and a heuristic using the Lagrange multipliers to facilitate the adjustment of such error bounds is provided. Numerical results show that PFE can correctly estimate the total demand of the study area if a sufficient number of traffic counts collected at appropriate locations is provided. The results further indicate that improper specification of the error bounds could lead to biased estimation of total demand utilizing the network.

Download Full-text