Inny tytuł:

Raport Badawczy = Research Report ; RB/23/2016

Wydawca:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Miejsce wydania:

Warszawa

Opis:

39 pages ; 21 cm ; Bibliography p. 34-38

Abstrakt:

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.

Czasopismo/Seria/cykl:

Raport Badawczy = Research Report

Szczegółowy typ zasobu:

Report

Identyfikator zasobu:

oai:rcin.org.pl:144852

Źródło:

RB-2016-23

Język:

eng

Język streszczenia:

eng

Prawa:

Creative Commons Attribution BY 4.0 license

Zasady wykorzystania:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitalizacja:

Systems Research Institute of the Polish Academy of Sciences

Lokalizacja oryginału:

Library of Systems Research Institute PAS

Dofinansowane ze środków:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Dostęp:

Open