The facility location problem with probabilistic constraints

Atsuya Suzuki; Tomoki Fukuba; Takayuki Shiina

doi:10.1109/SCISISIS50064.2020.9322732

The facility location problem with probabilistic constraints

Atsuya Suzuki, Tomoki Fukuba, Takayuki Shiina

School of Creative Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This study shows the effectiveness of the cutting plane method by applying it to the facility location problem with probabilistic constraints. Probabilistic constraints are those that should be satisfied at a certain probabilistic level and can consider the uncertainty of the parameters involved in the problem. Problems with such probabilistic constraints are generally difficult to solve. Therefore, based on previous research, we consider transforming a problem with probabilistic constraints into a 0-1 mixed integer programming problem under special conditions. Thereafter, we introduce the cutting plane method using a valid inequality of the feasible region.

Original language	English
Title of host publication	2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781728197326
DOIs	https://doi.org/10.1109/SCISISIS50064.2020.9322732
Publication status	Published - 2020 Dec 5
Event	Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020 - Virtual, Tokyo, Japan Duration: 2020 Dec 5 → 2020 Dec 8

Publication series

Name	2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020

Conference

Conference	Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020
Country/Territory	Japan
City	Virtual, Tokyo
Period	20/12/5 → 20/12/8

Keywords

Cutting plane method
Facility location problem
Probabilistic constraints

ASJC Scopus subject areas

Artificial Intelligence
Computer Science Applications
Computer Vision and Pattern Recognition
Software
Computational Mathematics

Access to Document

10.1109/SCISISIS50064.2020.9322732

Cite this

Suzuki, A., Fukuba, T., & Shiina, T. (2020). The facility location problem with probabilistic constraints. In 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020 [9322732] (2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SCISISIS50064.2020.9322732

The facility location problem with probabilistic constraints. / Suzuki, Atsuya; Fukuba, Tomoki; Shiina, Takayuki.

2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020. Institute of Electrical and Electronics Engineers Inc., 2020. 9322732 (2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Suzuki, A, Fukuba, T & Shiina, T 2020, The facility location problem with probabilistic constraints. in 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020., 9322732, 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020, Institute of Electrical and Electronics Engineers Inc., Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020, Virtual, Tokyo, Japan, 20/12/5. https://doi.org/10.1109/SCISISIS50064.2020.9322732

Suzuki A, Fukuba T, Shiina T. The facility location problem with probabilistic constraints. In 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020. Institute of Electrical and Electronics Engineers Inc. 2020. 9322732. (2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020). https://doi.org/10.1109/SCISISIS50064.2020.9322732

Suzuki, Atsuya ; Fukuba, Tomoki ; Shiina, Takayuki. / The facility location problem with probabilistic constraints. 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020. Institute of Electrical and Electronics Engineers Inc., 2020. (2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020).

@inproceedings{b758e0edd5a14c2a89460a5bbcc06fa3,

title = "The facility location problem with probabilistic constraints",

abstract = "This study shows the effectiveness of the cutting plane method by applying it to the facility location problem with probabilistic constraints. Probabilistic constraints are those that should be satisfied at a certain probabilistic level and can consider the uncertainty of the parameters involved in the problem. Problems with such probabilistic constraints are generally difficult to solve. Therefore, based on previous research, we consider transforming a problem with probabilistic constraints into a 0-1 mixed integer programming problem under special conditions. Thereafter, we introduce the cutting plane method using a valid inequality of the feasible region.",

keywords = "Cutting plane method, Facility location problem, Probabilistic constraints",

author = "Atsuya Suzuki and Tomoki Fukuba and Takayuki Shiina",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020 ; Conference date: 05-12-2020 Through 08-12-2020",

year = "2020",

month = dec,

day = "5",

doi = "10.1109/SCISISIS50064.2020.9322732",

language = "English",

series = "2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020",

}

TY - GEN

T1 - The facility location problem with probabilistic constraints

AU - Suzuki, Atsuya

AU - Fukuba, Tomoki

AU - Shiina, Takayuki

PY - 2020/12/5

Y1 - 2020/12/5

N2 - This study shows the effectiveness of the cutting plane method by applying it to the facility location problem with probabilistic constraints. Probabilistic constraints are those that should be satisfied at a certain probabilistic level and can consider the uncertainty of the parameters involved in the problem. Problems with such probabilistic constraints are generally difficult to solve. Therefore, based on previous research, we consider transforming a problem with probabilistic constraints into a 0-1 mixed integer programming problem under special conditions. Thereafter, we introduce the cutting plane method using a valid inequality of the feasible region.

AB - This study shows the effectiveness of the cutting plane method by applying it to the facility location problem with probabilistic constraints. Probabilistic constraints are those that should be satisfied at a certain probabilistic level and can consider the uncertainty of the parameters involved in the problem. Problems with such probabilistic constraints are generally difficult to solve. Therefore, based on previous research, we consider transforming a problem with probabilistic constraints into a 0-1 mixed integer programming problem under special conditions. Thereafter, we introduce the cutting plane method using a valid inequality of the feasible region.

KW - Cutting plane method

KW - Facility location problem

KW - Probabilistic constraints

UR - http://www.scopus.com/inward/record.url?scp=85100410996&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85100410996&partnerID=8YFLogxK

U2 - 10.1109/SCISISIS50064.2020.9322732

DO - 10.1109/SCISISIS50064.2020.9322732

M3 - Conference contribution

AN - SCOPUS:85100410996

T3 - 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020

BT - 2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems, SCIS-ISIS 2020

Y2 - 5 December 2020 through 8 December 2020

ER -

The facility location problem with probabilistic constraints

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this