紀要論文

一定時間で全ての需要を被覆する設備配置問題

LOCATION SET-COVERING PROBLEM TO COVER ALL DEMAND SITHIN A CERTAIN TIME

jpn

24368083

https://doi.org/10.15002/00026444

法政大学大学院理工学研究科

法政大学大学院紀要. 理工学研究科編

64

1

4

2023-03-24

Version of Record

Decision making in facility allocation problems involves a variety of factors, such as facility cost, time, and distance. In the location set-covering problem (LSCP), facility siting is employed as decision variables with the number of facilities as a cost factor. The problem is to find the minimum number and location of facilities that satisfy the time or distance to demand criteria. It is possible to find the siting of emergency services such as fire stations, schools, and libraries. In this study, we formulate the timed location set-covering problem (T-LSCP), which takes into account the passage of time in the LSCP. The model is based on the assumption that facilities are movable over time. Once a demand point is covered, the effect of the coverage remains for a certain time. Therefore, the number of facilities can be reduced compared to LSCP, as they do not need to be covered all the time. This problem can be applied to police patrols.

Article