English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The problem of determining route of visiting several points is considered. The task differs from known ones that time for arrival at each point is specified. The tasks of these class are solved in courier delivery services of various goods types. Basis of proposed algorithm for determining delivery route is algorithm for forming the route tree used matrix, which specify distances between delivery points, which is supplemented by checking conditions for possibility of visiting points, according to defined delivery time vector. Various criteria for selecting vertices for inclusion in route are considered. During developing software that implements proposed algorithm, used parallel computation methods that allow to obtain a solution for problem of sufficiently large dimension at acceptable time.

vestnik nacionalʹnogo tehničeskogo universiteta "hpi". sistemnyj analiz, upravlenie i informacionnye tehnologii/vestnik nacionalʹnogo tehničeskogo universiteta "hpi". seriâ sistemnyj analiz, upravlenie i informacionnye tehnologii

Development of software solution for building route of a orders group delivery in presence of time constraints