Raport Badawczy = Research Report ; RB/23/2016
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
39 stron ; 21 cm ; Bibliografia s. 34-38
In this paper a dynamic version of the Capacitated Vehicle Routing Problem (CVRP) is considered. The proposed solution to CVRP with traffic jams (CVRPwTJ) relies on application of the Upper Confidence Bounds applied to Trees (UCT) method, which is an extension of the Monte Carlo Tree Search algorithm. UCT-based approach is compared with four other methods showing promising results and offering prospects for its wider applicability in the domain of stochastic optimization problems.
Raport Badawczy = Research Report
Licencja Creative Commons Uznanie autorstwa 4.0
Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Instytut Badań Systemowych Polskiej Akademii Nauk
Biblioteka Instytutu Badań Systemowych PAN
Oct 19, 2021
Oct 28, 2020
111
https://rcin.org.pl/publication/180439
Edition name | Date |
---|---|
RB-2016-23 : Mańdziuk Jacek, Świechowski Maciej Jakub : UCT in Capacitated Vehicle Routing Problem with Traffic Jams | Oct 19, 2021 |
Jakubowski, Andrzej