遺伝的アルゴリズムを用いた地方部における小規模な相乗りのマッチングアルゴリズム

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.