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

U toku planiranja i praktične realizacije zadataka jedinica Vojske SCG često se javlja problem izbora optimalnog puta između dva mesta (čvora) na putnoj mreži. Kriterijumi optimizacije mogu biti različiti. Ovaj projekat treba da omogući brzo i lako određivanje optimalnog puta, primenom dinamičkog programiranja (DP), uz korišćenje Belmanovog (Bellman), algoritma u zavisnosti od izabranog kriterijuma -parametra. Kriterijum optimizacije je minimalno vreme kretanja (putovanja), koje je dobijeno imitacionim modeliranjem kolonskog saobraćajnog toka. Razrađeni algoritam omogućuje izbor optimalnog puta, za bilo koja dva čvora na mreži. / During the planning and practical realization of Serbian & Montenegro units' tasks a problem -which often occurs is choosing an optimal transport route between two places (nodes). Optimization criteria can be various. This project should enable quick and easy defining of an optimal route, applying dynamic programing (DP) using Bellman's algorithm depending on chosen criteria - parameter. Optimization criteria represent minimum movement time (traveling), which are taken from imitational modeling of a traffics queue flow. Operating algorithm enable choosing an optimal transport route, for any two nodes on a road map

Choosing an optimal route for organized vehicle movement based on modeling results