交通网络最短路径与加权细分

Graph Data Management Pub Date : 1900-01-01 DOI:10.4018/978-1-61350-053-8.ch020

Radwa El Shawi, Joachim Gudmundsson

{"title":"交通网络最短路径与加权细分","authors":"Radwa El Shawi, Joachim Gudmundsson","doi":"10.4018/978-1-61350-053-8.ch020","DOIUrl":null,"url":null,"abstract":"The shortest path problem asks for a path between two given points such that the sum of its edges is minimized. The problem has a rich history and has been studied extensively since the 1950’s in many areas of computer science, among them network optimization, graph theory and computational geometry. In this chapter we consider two versions of the problem; the shortest path in a transportation network and the shortest path in a weighted subdivision, sometimes called a terrain.","PeriodicalId":227251,"journal":{"name":"Graph Data Management","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Shortest Path in Transportation Network and Weighted Subdivisions\",\"authors\":\"Radwa El Shawi, Joachim Gudmundsson\",\"doi\":\"10.4018/978-1-61350-053-8.ch020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The shortest path problem asks for a path between two given points such that the sum of its edges is minimized. The problem has a rich history and has been studied extensively since the 1950’s in many areas of computer science, among them network optimization, graph theory and computational geometry. In this chapter we consider two versions of the problem; the shortest path in a transportation network and the shortest path in a weighted subdivision, sometimes called a terrain.\",\"PeriodicalId\":227251,\"journal\":{\"name\":\"Graph Data Management\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graph Data Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/978-1-61350-053-8.ch020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graph Data Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/978-1-61350-053-8.ch020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

最短路径问题要求在两个给定点之间找到一条路径，使得它的边之和最小。自20世纪50年代以来，这个问题在计算机科学的许多领域得到了广泛的研究，其中包括网络优化、图论和计算几何。在本章中，我们考虑这个问题的两个版本;交通网络中的最短路径和加权分区中的最短路径，有时称为地形。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Shortest Path in Transportation Network and Weighted Subdivisions

The shortest path problem asks for a path between two given points such that the sum of its edges is minimized. The problem has a rich history and has been studied extensively since the 1950’s in many areas of computer science, among them network optimization, graph theory and computational geometry. In this chapter we consider two versions of the problem; the shortest path in a transportation network and the shortest path in a weighted subdivision, sometimes called a terrain.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Graph Data Management

自引率

0.00%

发文量