Abstract
The problem of vehicle redeployment in multi-period systems is studied in this paper. It is a sequential decision making problem that involves optimizing an objective over some planning horizon composed of multiple periods. In this work, the problem is handled with a hybrid local search and Q-learning algorithm. It integrates local search into the Dyna-Q algorithm and combines the system’s tactical and operational decision levels to find a multi-period policy for sharing vehicles between stations while optimizing the objective. Tests were carried out on synthetic and real instances, and the obtained results show how local search integration can improve the basic Dyna-Q algorithm.
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 on Artificial Intelligence Tools
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.
