{"id":6749,"date":"2021-04-19T15:29:21","date_gmt":"2021-04-19T13:29:21","guid":{"rendered":"https:\/\/gts-systems.com\/?p=6749"},"modified":"2024-01-09T14:24:47","modified_gmt":"2024-01-09T13:24:47","slug":"was-ist-ein-kuerzeste-wege-problem","status":"publish","type":"post","link":"https:\/\/gts-systems.com\/it\/glossar\/was-ist-ein-kuerzeste-wege-problem\/","title":{"rendered":"Che cos'\u00e8 il problema del percorso pi\u00f9 breve?"},"content":{"rendered":"<div data-elementor-type=\"wp-post\" data-elementor-id=\"6749\" class=\"elementor elementor-6749\" data-elementor-post-type=\"post\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-2299ff7 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"2299ff7\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-54fc8d4\" data-id=\"54fc8d4\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-817f2de elementor-widget elementor-widget-text-editor\" data-id=\"817f2de\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>La determinazione dei percorsi pi\u00f9 brevi o pi\u00f9 veloci tra i punti di una rete \u00e8 un problema noto da tempo nell'informatica e nella ricerca operativa. L'obiettivo \u00e8 determinare la lunghezza e i bordi contenuti di un percorso tra 2 o tutti i punti di una rete. I matematici Edsger W. Dijkstra e George Dantzig svilupparono un algoritmo per questo problema gi\u00e0 negli anni Cinquanta.<\/p><p>Oggi, in molte aree di applicazione, come la pianificazione degli itinerari, \u00e8 necessario determinare i percorsi e i tempi di percorrenza tra centinaia, migliaia o decine di migliaia di localit\u00e0 in enormi reti stradali (ad esempio, tutte le strade d'Europa). Negli ultimi dieci anni l'algoritmo di Dijkstra ha subito un notevole sviluppo per rendere possibile questo risultato con tempi di esecuzione ridotti.<\/p><p>Con gli algoritmi attuali, \u00e8 possibile calcolare matrici di distanza di grandi dimensioni in tempi molto brevi. Inoltre, i sistemi di pianificazione dei percorsi come TransIT offrono la possibilit\u00e0 di tenere conto delle chiusure delle strade e di impedire agli autocarri di svoltare quando possibile, il che richiede modifiche ancora pi\u00f9 ampie agli algoritmi.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"<p>Die Bestimmung von k\u00fcrzesten oder schnellsten Wegen zwischen Punkten in einem Netzwerk ist ein schon lange bekanntes Problem in der Informatik bzw. dem Operations Research. Ziel ist es, die L\u00e4nge und enthaltenen Kanten eines Weges zwischen 2 oder allen Punkten in einem Netzwerk zu bestimmen. Bereits in den f\u00fcnfziger Jahren des vergangenen Jahrhunderts haben die [&hellip;]<\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[23],"tags":[],"class_list":["post-6749","post","type-post","status-publish","format-standard","hentry","category-glossar"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.3 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Was ist ein K\u00fcrzeste-Wege-Problem - gts systems<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/gts-systems.com\/it\/glossario\/was-ist-ein-kuerzeste-wege-problem\/\" \/>\n<meta property=\"og:locale\" content=\"it_IT\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Was ist ein K\u00fcrzeste-Wege-Problem - gts systems\" \/>\n<meta property=\"og:description\" content=\"Die Bestimmung von k\u00fcrzesten oder schnellsten Wegen zwischen Punkten in einem Netzwerk ist ein schon lange bekanntes Problem in der Informatik bzw. dem Operations Research. Ziel ist es, die L\u00e4nge und enthaltenen Kanten eines Weges zwischen 2 oder allen Punkten in einem Netzwerk zu bestimmen. Bereits in den f\u00fcnfziger Jahren des vergangenen Jahrhunderts haben die [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/gts-systems.com\/it\/glossario\/was-ist-ein-kuerzeste-wege-problem\/\" \/>\n<meta property=\"og:site_name\" content=\"gts systems\" \/>\n<meta property=\"article:published_time\" content=\"2021-04-19T13:29:21+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-01-09T13:24:47+00:00\" \/>\n<meta name=\"author\" content=\"Bastian Grein\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Scritto da\" \/>\n\t<meta name=\"twitter:data1\" content=\"Bastian Grein\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tempo di lettura stimato\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minuto\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Che cos'\u00e8 il problema del percorso pi\u00f9 breve? - gts systems","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/gts-systems.com\/it\/glossario\/was-ist-ein-kuerzeste-wege-problem\/","og_locale":"it_IT","og_type":"article","og_title":"Was ist ein K\u00fcrzeste-Wege-Problem - gts systems","og_description":"Die Bestimmung von k\u00fcrzesten oder schnellsten Wegen zwischen Punkten in einem Netzwerk ist ein schon lange bekanntes Problem in der Informatik bzw. dem Operations Research. Ziel ist es, die L\u00e4nge und enthaltenen Kanten eines Weges zwischen 2 oder allen Punkten in einem Netzwerk zu bestimmen. Bereits in den f\u00fcnfziger Jahren des vergangenen Jahrhunderts haben die [&hellip;]","og_url":"https:\/\/gts-systems.com\/it\/glossario\/was-ist-ein-kuerzeste-wege-problem\/","og_site_name":"gts systems","article_published_time":"2021-04-19T13:29:21+00:00","article_modified_time":"2024-01-09T13:24:47+00:00","author":"Bastian Grein","twitter_card":"summary_large_image","twitter_misc":{"Scritto da":"Bastian Grein","Tempo di lettura stimato":"1 minuto"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/#article","isPartOf":{"@id":"https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/"},"author":{"name":"Bastian Grein","@id":"https:\/\/gts-systems.com\/#\/schema\/person\/9ed8a105a05dc3ce47aa43796173bbd1"},"headline":"Was ist ein K\u00fcrzeste-Wege-Problem","datePublished":"2021-04-19T13:29:21+00:00","dateModified":"2024-01-09T13:24:47+00:00","mainEntityOfPage":{"@id":"https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/"},"wordCount":176,"publisher":{"@id":"https:\/\/gts-systems.com\/#organization"},"articleSection":["Glossar"],"inLanguage":"it-IT"},{"@type":"WebPage","@id":"https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/","url":"https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/","name":"Che cos'\u00e8 il problema del percorso pi\u00f9 breve? - gts systems","isPartOf":{"@id":"https:\/\/gts-systems.com\/#website"},"datePublished":"2021-04-19T13:29:21+00:00","dateModified":"2024-01-09T13:24:47+00:00","breadcrumb":{"@id":"https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/#breadcrumb"},"inLanguage":"it-IT","potentialAction":[{"@type":"ReadAction","target":["https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/gts-systems.com\/glossar\/was-ist-ein-kuerzeste-wege-problem\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Startseite","item":"https:\/\/gts-systems.com\/"},{"@type":"ListItem","position":2,"name":"Was ist ein K\u00fcrzeste-Wege-Problem"}]},{"@type":"WebSite","@id":"https:\/\/gts-systems.com\/#website","url":"https:\/\/gts-systems.com\/","name":"gts systems","description":"Ottimizzare ora","publisher":{"@id":"https:\/\/gts-systems.com\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/gts-systems.com\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"it-IT"},{"@type":"Organization","@id":"https:\/\/gts-systems.com\/#organization","name":"gts-systems","url":"https:\/\/gts-systems.com\/","logo":{"@type":"ImageObject","inLanguage":"it-IT","@id":"https:\/\/gts-systems.com\/#\/schema\/logo\/image\/","url":"https:\/\/gts-systems.com\/wp-content\/uploads\/2021\/03\/logogtssystems_1.svg","contentUrl":"https:\/\/gts-systems.com\/wp-content\/uploads\/2021\/03\/logogtssystems_1.svg","width":1,"height":1,"caption":"gts-systems"},"image":{"@id":"https:\/\/gts-systems.com\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.linkedin.com\/company\/gts-systems-and-consulting-gmbh"]},{"@type":"Person","@id":"https:\/\/gts-systems.com\/#\/schema\/person\/9ed8a105a05dc3ce47aa43796173bbd1","name":"Bastian Grein","image":{"@type":"ImageObject","inLanguage":"it-IT","@id":"https:\/\/secure.gravatar.com\/avatar\/63a51f72e38efaeedcea218995ed9a9d7cc599114900902bd6dceba42b9fd583?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/63a51f72e38efaeedcea218995ed9a9d7cc599114900902bd6dceba42b9fd583?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/63a51f72e38efaeedcea218995ed9a9d7cc599114900902bd6dceba42b9fd583?s=96&d=mm&r=g","caption":"Bastian Grein"}}]}},"_links":{"self":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/posts\/6749","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/comments?post=6749"}],"version-history":[{"count":0,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/posts\/6749\/revisions"}],"wp:attachment":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/media?parent=6749"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/categories?post=6749"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/tags?post=6749"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}