Abstract
The dial-a-ride problem involves the dispatching of a fleet of vehicles in order to transport a set of customers from specific pick-up nodes to specific drop-off nodes. Using a modified version of hyperlink-induced topic search (HITS), we characterize hubs as nodes with many out-links to other hubs and calculate a hub score for each pick-up and drop-off node. Ranking the nodes by hub score gives guidance to a backtracking algorithm for efficiently finding feasible solutions to the dial-a-ride problem.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
