Abstract
ABSTRACT Nowadays, large cities face numerous problems caused by the rapidly increasing number of vehicles on road. Carpooling has been shown as an efficient solution to ease the traffic pressure. The objective of our carpool scheduling problem is to minimise the number of carpools needed to transport users. Previous research on the similar topic introduces static capacity constraint which limits the carpool size to the vehicle's capacity. However, it is unnecessary since a seat in the vehicle can be occupied by several passengers if their routes are not overlapped. In this paper, we remove this constraint, which allows a vehicle to serve more users than its capacity. We propose a greedy approach based on the iterative matching and merging. Specifically, starting from a set of single-user carpools, the algorithm iteratively checks the merge-ability between carpools, and then applies the maximum matching algorithm to maximise the number of carpools merged. In addition, two methods are proposed to reduce the time complexity of merge-ability checking process. Furthermore, we improve the time efficiency of our algorithms by exploiting geometry properties. Experimental results on synthetic and real-world datasets show that our algorithms have better performances than baseline.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Parallel, Emergent and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
