Full-text resources of PSJD and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

PL EN


Preferences help
enabled [disable] Abstract
Number of results
- |

Article title

A hybrid algorithm for probabilistic traveling salesman problem

Content

Title variants

Languages of publication

PL

Abstracts

PL
In this paper Probabilistic Traveling Salesman Problem (PTSP) is considered and a hybrid algorithm is proposed, in which an evolutionary algorithm is combined with local optimization and parallelization techniques. Local optimization methods include 1-shift and 2-p-opt operators. Several basic variants of evolutionary and hybrid algorithms are experimentally tested and compared.

Publisher

Year

-

Physical description

Dates

online
2015-04-29

Contributors

References

Document Type

Publication order reference

Identifiers

YADDA identifier

bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2015-article-2025
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.