.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Sustainable carpooling
Metaheuristics
Fairness mechanism
Urban mobility
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveD-SPAC: Double-Sided Preference-Aware Carpooling of Private Cars for Maximizing Passenger Utility
PREAI
ShareSaveShareSave
View more