Abstract
In this work, we adopt the route reservation architecture proposed in [1] and adapt the reservation algorithm so that route reservations are made based on continuous-time intervals (instead of fixed discrete-time intervals). Using the continuous-time reservation architecture, we formulate a mixed integer linear programming (MILP) problem to obtain the optimal path of any vehicle, avoiding roads that are at-capacity. Since the MILP problem is hard to solve efficiently, we also propose a heuristic iterative algorithm that is based on Dijkstra's algorithm, is of low-complexity and provides close-to-optimal results, as compared to the MILP obtained solution (at least for small problems where MILP provided a solution in reasonable time). The simulation results further indicate that the Dijkstra-based heuristic can be solved more efficiently in continuous-time rather than discrete-time for high-demand scenarios.
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.
