| ■論文No. |
|
| ■ページ数 |
8ページ |
■発行日
|
2021/12/01 |
| ■タイトル |
数理計画モデルと地理データによるゴミ回収サービスの定量評価 |
| ■タイトル(英語) |
Numerical Evaluation of Garbage Collection Services by Mathematical Programming and Geographic Data |
| ■著者名 |
松﨑 仁平（富山県立大学），榊原 一紀（富山県立大学），立花 潤三（富山県立大学） |
| ■著者名(英語) |
Jin Matsuzaki (Toyama Prefectural University), Kazutoshi Sakakibara (Toyama Prefectural University), Junzo Tachibana (Toyama Prefectural University) |
| ■価格 |
会員 ¥550 一般 ¥770 |
| ■書籍種類 |
論文誌(論文単位) |
| ■グループ名 |
【C】電子・情報・システム部門 |
| ■本誌 |
電気学会論文誌C（電子・情報・システム部門誌） Vol.141 No.12 （2021） 特集Ⅰ：電気・電子・情報関係学会東海支部連合大会 特集Ⅱ：研究会優秀論文
|
| ■本誌掲載ページ |
1380-1387ページ |
| ■原稿種別 |
論文／日本語 |
| ■電子版へのリンク |
https://www.jstage.jst.go.jp/article/ieejeiss/141/12/141_1380/_article/-char/ja/
|
| ■キーワード |
ゴミ回収，配送計画，集合被覆，最短経路 garbage collection service，vehicle routing problem，set covering problem，minimum cost route |
| ■要約(日本語) |
|
| ■要約(英語) |
The vehicle routing problems for services of collecting home garbages are hard to optimize due to not only their combinatorial scale but also their intrinsic constraints. This problem is becoming a serious issue from viewpoints of cost savings of the public service of local governments. We try to develop the optimization method incorporating realistic functions in order to evaluate and compare various systems of garbage collection services. In this optimization method, the problem is formulated as a set covering problem which enables to decompose the problem into routes generation and routes selection. The routes can be generated by adopting dynamic programming techniques on the road network of the city. On the other hand, the optimal set of routes is selected by solving the set covering problem of the candidate route collection. Through some numerical evaluation for the realistic services of garbage collection, the potential for application of our method is examined. |
| ■版 型 |
A4 |
