Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Curt Nowak"'
Publikováno v:
Operations Research Proceedings ISBN: 9783319286952
OR
OR
During courier and express providers’ operational scheduling, vehicles are assigned to customer orders. This task is complex, combinatorially comprehensive, and contains aspects that defy modeling within reasonable effort, e.g. due to a lack of str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f75d15c20821832a16bdc54b69512ffa
https://doi.org/10.1007/978-3-319-28697-6_60
https://doi.org/10.1007/978-3-319-28697-6_60
Publikováno v:
Operations Research Proceedings ISBN: 9783319007946
OR
OR
For single-pair shortest path problems, Contraction Hierarchies (CH) provide very small query times together with a very low space overhead for the graph. During a preprocessing every node is assigned a distinct rank. Queries are performed using an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2eaacf785694158d61b9eff90f2b45b8
https://doi.org/10.1007/978-3-319-00795-3_85
https://doi.org/10.1007/978-3-319-00795-3_85
Publikováno v:
Operations Research Proceedings ISBN: 9783642292095
OR
OR
One of the most successful recent approaches for solving single source - single destination problems in graphs is the Contraction Hierarchies (CH) algorithm, originally published by [3]. The general algorithm consists of two phases: Firstly, a total
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d34f4008455267402966f8042a9fbc11
https://doi.org/10.1007/978-3-642-29210-1_50
https://doi.org/10.1007/978-3-642-29210-1_50
Publikováno v:
Operations Research Proceedings ISBN: 9783540779025
OR
OR
Using the A*-algorithm to solve point-to-point-shortest path problems, the number of iterations depends on the quality of the estimator for the remaining distance to the target. In digital maps of real road networks, iterations can be saved by using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42af4600dced733ccf281b82c076195f
https://doi.org/10.1007/978-3-540-77903-2_70
https://doi.org/10.1007/978-3-540-77903-2_70