A Comparative Study of Several Metaheuristic Algorithms to Optimize Monetary Incentive in Ridesharing Systems

被引:20
作者
Hsieh, Fu-Shiung [1 ]
机构
[1] Chaoyang Univ Technol, Dept Comp Sci & Informat Engn, Taichung 41349, Taiwan
关键词
ridesharing; metaheuristics; particle swarm optimization; differential evolution; firefly algorithm; A-RIDE PROBLEM; SWARM; INTELLIGENCE; CAR; MONEY; TAXI;
D O I
10.3390/ijgi9100590
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The strong demand on human mobility leads to excessive numbers of cars and raises the problems of serious traffic congestion, large amounts of greenhouse gas emissions, air pollution and insufficient parking space in cities. Although ridesharing is a potential transport mode to solve the above problems through car-sharing, it is still not widely adopted. Most studies consider non-monetary incentive performance indices such as travel distance and successful matches in ridesharing systems. These performance indices fail to provide a strong incentive for ridesharing. The goal of this paper is to address this issue by proposing a monetary incentive performance indicator to improve the incentives for ridesharing. The objectives are to improve the incentive for ridesharing through a monetary incentive optimization problem formulation, development of a solution methodology and comparison of different solution algorithms. A non-linear integer programming optimization problem is formulated to optimize monetary incentive in ridesharing systems. Several discrete metaheuristic algorithms are developed to cope with computational complexity for solving the above problem. These include several discrete variants of particle swarm optimization algorithms, differential evolution algorithms and the firefly algorithm. The effectiveness of applying the above algorithms to solve the monetary incentive optimization problem is compared based on experimental results.
引用
收藏
页数:34
相关论文
共 40 条
[1]   Optimization for dynamic ride-sharing: A review [J].
Agatz, Niels ;
Erera, Alan ;
Savelsbergh, Martin ;
Wang, Xing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :295-303
[2]   Dynamic ride-sharing: A simulation study in metro Atlanta [J].
Agatz, Niels A. H. ;
Erera, Alan L. ;
Savelsbergh, Martin W. P. ;
Wang, Xing .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (09) :1450-1464
[3]   A bio-inspired swarm intelligence technique for social aware cognitive radio handovers [J].
Anandakumar, H. ;
Umamaheswari, K. .
COMPUTERS & ELECTRICAL ENGINEERING, 2018, 71 :925-937
[4]  
[Anonymous], 2015, RECENT ADV SWARM INT
[5]   Monarch Butterfly Optimization Based Convolutional Neural Network Design [J].
Bacanin, Nebojsa ;
Bezdan, Timea ;
Tuba, Eva ;
Strumberger, Ivana ;
Tuba, Milan .
MATHEMATICS, 2020, 8 (06)
[6]   An exact method for the car pooling problem based on Lagrangean column generation [J].
Baldacci, R ;
Maniezzo, V ;
Mingozzi, A .
OPERATIONS RESEARCH, 2004, 52 (03) :422-439
[7]   Mechanism design for on-demand first-mile ridesharing [J].
Bian, Zheyong ;
Liu, Xiang ;
Bai, Yun .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2020, 138 :77-117
[8]   Investigating ride sharing opportunities through mobility data analysis [J].
Bicocchi, Nicola ;
Mamei, Marco .
PERVASIVE AND MOBILE COMPUTING, 2014, 14 :83-94
[9]   PoliUniPool: a carpooling system for universities [J].
Bruglieri, Maurizio ;
Ciccarelli, Diego ;
Colornia, Alberto ;
Lue, Alessandro .
STATE OF THE ART IN THE EUROPEAN QUANTITATIVE ORIENTED TRANSPORTATION AND LOGISTICS RESEARCH, 2011: 14TH EURO WORKING GROUP ON TRANSPORTATION & 26TH MINI EURO CONFERENCE & 1ST EUROPEAN SCIENTIFIC CONFERENCE ON AIR TRANSPORT, 2011, 20 :558-567
[10]   Handling dropout probability estimation in convolution neural networks using meta-heuristics [J].
de Rosa, Gustavo H. ;
Papa, Joao P. ;
Yang, Xin-S .
SOFT COMPUTING, 2018, 22 (18) :6147-6156