Matching Algorithm for Compact Ride-sharing in Rural Area using Genetic Algorithm

被引:0
|
作者
Takano S. [1 ]
Chida S. [1 ]
Horita Y. [2 ]
机构
[1] Graduate School of Science and Engineering, University of Toyama, 3190, Gofuku, Toyama, Toyama-shi
[2] School of Sustainable Design, University of Toyama, 3190, Gofuku, Toyama, Toyama-shi
关键词
combinatorial optimization; driving test; genetic algorithm; ride-sharing;
D O I
10.1541/ieejeiss.142.136
中图分类号
学科分类号
摘要
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 The Institute of Electrical Engineers of Japan.
引用
收藏
页码:136 / 144
页数:8
相关论文
共 50 条
  • [1] Matching algorithm for compact ride-sharing in rural area using genetic algorithm
    Takano, Shina
    Chida, Shinya
    Horita, Yuukou
    ELECTRONICS AND COMMUNICATIONS IN JAPAN, 2022, 105 (01)
  • [2] Bimodal Cooperative Matching Algorithm for the Dynamic Ride-Sharing Problem
    Guo Y.
    Liu Y.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2022, 59 (07): : 1533 - 1552
  • [3] Matching algorithm for improving ride-sharing by incorporating route splits and social factors
    Aydin, Omer Faruk
    Gokasar, Ilgin
    Kalan, Onur
    PLOS ONE, 2020, 15 (03):
  • [4] Joint pricing and matching in ride-sharing systems
    Ozkan, Erhun
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 287 (03) : 1149 - 1160
  • [5] Stable Matching for Dynamic Ride-Sharing Systems
    Wang, Xing
    Agatz, Niels
    Erera, Alan
    TRANSPORTATION SCIENCE, 2018, 52 (04) : 850 - 867
  • [7] Ride-Sharing Matching of Commuting Private Car Using Reinforcement Learning
    Lv, Junchao
    Zheng, Linjiang
    Liao, Longquan
    Chen, Xin
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT I, 2021, 12815 : 679 - 691
  • [8] Stable ride-sharing matching for the commuters with payment design
    Peng, Zixuan
    Shan, Wenxuan
    Jia, Peng
    Yu, Bin
    Jiang, Yonglei
    Yao, Baozhen
    TRANSPORTATION, 2020, 47 (01) : 1 - 21
  • [9] DeepPool: Distributed Model-Free Algorithm for Ride-Sharing Using Deep Reinforcement Learning
    Al-Abbasi, Abubakr O.
    Ghosh, Arnob
    Aggarwal, Vaneet
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (12) : 4714 - 4727
  • [10] Stable ride-sharing matching for the commuters with payment design
    Zixuan Peng
    Wenxuan Shan
    Peng Jia
    Bin Yu
    Yonglei Jiang
    Baozhen Yao
    Transportation, 2020, 47 : 1 - 21