.png){kind=icon}
返回
Optimizing long-term carpooling with fairness: A collaborative Jaya algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2024.110663.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Inspired by Japan's unique regulatory framework, this study addresses the Long-Term Carpooling Problem with Fairness (LTCPF), with a focus on enhancing sustainable urban transport. We investigate this issue by optimizing carpooling arrangements to balance travel time, ensure inclusive rider participation, and reduce detour time discrepancies. At the core of our approach is the Collaborative Jaya Algorithm (CJA), a modification of the existing Jaya algorithm with improved computational efficiency and reduced hyperparameter dependency. Our model assigns explicitly fixed roles to participants as drivers or riders, promoting efficient and equitable carpooling. The practical efficacy of the CJA is validated through rigorous simulation experiments across various scenarios. The simulation results demonstrate that the proposed algorithm is superior to existing counterparts.
Keyword:
Sustainable carpooling
Metaheuristics
Fairness mechanism
Urban mobility
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。