Cutting plane method for the facility location problem with probabilistic constraints

A. Suzuki, T. Fukuba, T. Shiina

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationProceedings - 2020 9th International Congress on Advanced Applied Informatics, IIAI-AAI 2020
EditorsTokuro Matsuo, Kunihiko Takamatsu, Yuichi Ono, Sachio Hirokawa
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages707-712
Number of pages6
ISBN (Electronic)9781728173979
DOIs
Publication statusPublished - 2020 Sep
Event9th International Congress on Advanced Applied Informatics, IIAI-AAI 2020 - Kitakyushu, Japan
Duration: 2020 Sep 12020 Sep 15

Publication series

NameProceedings - 2020 9th International Congress on Advanced Applied Informatics, IIAI-AAI 2020

Conference

Conference9th International Congress on Advanced Applied Informatics, IIAI-AAI 2020
Country/TerritoryJapan
CityKitakyushu
Period20/9/120/9/15

Keywords

  • cutting plane method
  • facility location problem
  • probabilistic constraints

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Computer Vision and Pattern Recognition
  • Information Systems
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Cutting plane method for the facility location problem with probabilistic constraints'. Together they form a unique fingerprint.

Cite this