| Presentation | 2020-06-05 Dynamically changing penalties method for Large-Scale multiple-Vehicle Bike Sharing System Routing Problem Honami Tsushima, Takafumi Matsuura, Tohru Ikeguchi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In a bike sharing system (BSS) , we proposed a multiple-Vehicle Bike Sharing System Routing Problem (mBSSRP) to determine short tours to adjust bicycles using vehicles in short time. However, it is difficult to construct feasible solutions for some instances due to strict constraints of mBSSRP. Therefore, we proposed a multiple-Vehicle Bike Sharing System Routing Problem with Soft Constraints (mBSSRP-S) that removes some constraints from mBSSRP and adds those violations to objective function of mBSSRP as penalties. Furthermore, we proposed a dynamic weight adjustment method to efficiently explore both feasible and infeasible solution space of mBSSRP by solving mBSSRP-S. Numerical experiments have shown that we obtained good solutions for instances with about 50 ports. However, the number of ports in real BSSs in more than hundreds. Thus, in this study, we investigate the performance for large-scale instances. As results of numerical experiments, we confirm that good solutions of mBSSRP are obtained for the large-scale instances. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | large-scale bike sharing system / combinatorial optimization problem / multiple-vehicle bike sharing system routing problem / tabu search |
| Paper # | NLP2020-14,CCS2020-4 |
| Date of Issue | 2020-05-29 (NLP, CCS) |
| Conference Information | |
| Committee | CCS / NLP |
|---|---|
| Conference Date | 2020/6/5(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Shonan Institute of Technology |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Shigeki Shiokawa(Kanagawa Inst. of Tech.) / Kiyohisa Natsume(Kyushu Inst. of Tech.) |
| Vice Chair | Tetsuya Asai(Hokkaido Univ.) / Megumi Akai(Hokkaido Univ.) / Takuji Kosaka(Chukyo Univ.) |
| Secretary | Tetsuya Asai(Kanagawa Inst. of Tech.) / Megumi Akai(TDK) / Takuji Kosaka(Kyushu Inst. of Tech.) |
| Assistant | Hidehiro Nakano(Tokyo City Univ.) / Hiroyasu Ando(Tsukuba Univ.) / Takashi Matsubara(Kobe Univ.) / Kosuke Sanada(Mie Univ.) / Toshikaza Samura(Yamaguchi Univ.) / Hideyuki Kato(Oita Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Complex Communication Sciences / Technical Committee on Nonlinear Problems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Dynamically changing penalties method for Large-Scale multiple-Vehicle Bike Sharing System Routing Problem |
| Sub Title (in English) | |
| Keyword(1) | large-scale bike sharing system |
| Keyword(2) | combinatorial optimization problem |
| Keyword(3) | multiple-vehicle bike sharing system routing problem |
| Keyword(4) | tabu search |
| 1st Author's Name | Honami Tsushima |
| 1st Author's Affiliation | Tokyo University of Science(TUS) |
| 2nd Author's Name | Takafumi Matsuura |
| 2nd Author's Affiliation | Nippon Institute of Technology(NIT) |
| 3rd Author's Name | Tohru Ikeguchi |
| 3rd Author's Affiliation | Tokyo University of Science(TUS) |
| Date | 2020-06-05 |
| Paper # | NLP2020-14,CCS2020-4 |
| Volume (vol) | vol.120 |
| Number (no) | NLP-55,CCS-56 |
| Page | pp.pp.19-22(NLP), pp.19-22(CCS), |
| #Pages | 4 |
| Date of Issue | 2020-05-29 (NLP, CCS) |