Subtitle:

Raport Badawczy = Research Report ; RB/23/2016

Publisher:

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

Place of publishing:

Warszawa

Description:

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

Abstract:

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.

Relation:

Raport Badawczy = Research Report

Detailed Resource Type:

Report

Resource Identifier:

oai:rcin.org.pl:144852

Source:

RB-2016-23

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

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: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

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.

Access:

Open