Abstract: The Vehicle Routing Problem with Multiple Soft Time Windows (VRPMSTW) is a challenging combinatorial optimization problem where a fleet of vehicles must deliver goods to a set of customers, ...
Faculty of Educational Sciences and Technology, Universiti Teknologi Malaysia, Skudai, Johor 81310, Malaysia ...
Abstract: This study explores optimizing the Traveling Salesman Problem (TSP) using Q-Learning reinforcement learning. The proposed method builds a Q-table to learn the optimal path and employs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback