電気学会論文誌C(電子・情報・システム部門誌)
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
<情報システム,エレクトロニック・コマース>
遺伝的アルゴリズムを用いた地方部における小規模な相乗りのマッチングアルゴリズム
高野 詩菜千田 真也堀田 裕弘
著者情報
ジャーナル 認証あり

2022 年 142 巻 2 号 p. 136-144

詳細
抄録

To solve the last mile problem in rural areas, we deal with compact ride-sharing model. For reducing the computational cost, we use a simple GA method and compared the performance of the parameters. To simplify the problem, our algorithm use a simple linear distance and minimize the total traveling distance. A data set used for GA was based on the Inami area in Nanto City, Toyama Prefecture, that is a real case study region. The performance comparison experiment of the algorithm by changing parameters was carried out. Experimental results show that the algorithm is likely to give correct answers for up to four vehicles. It was also shown that the combination of population size and elite proportion for GA could reduce computational costs while ensuring accuracy. In addition, by ride-sharing was actually carried out using the obtained experimental result, it was shown that it could be applied to the actual route even if the calculation was carried out in the linear distance.

著者関連情報
© 2022 電気学会
前の記事 次の記事
feedback
Top