Zobrazeno 1 - 10
of 154
pro vyhledávání: '"Borndörfer, Ralf"'
Publikováno v:
Networks; Oct2023, Vol. 82 Issue 3, p277-298, 22p
Globally optimal free flight trajectory optimization can be achieved with a combination of discrete and continuous optimization. A key requirement is that Newton's method for continuous optimization converges in a sufficiently large neighborhood arou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ebc1745cd192feb0e1abd9ad54d91c4
The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant of the Minimum Spanning Tree problem, in which the costs associated with every edge of the input graph are vectors. In this paper, we design a new dynamic programming MO-MST algor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::559ae9befed403d7a7ea986045eaf92f
The algorithmic efficiency of Newton-based methods for Free Flight Trajectory Optimization is heavily influenced by the size of the domain of convergence. We provide numerical evidence that the convergence radius is much larger in practice than what
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1fb2e9e9afecd0d130ff361b36a139d4
Publikováno v:
Journal of Optimization Theory & Applications; Aug2023, Vol. 198 Issue 2, p830-856, 27p
Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to global minimizers hinges on the discretization error induced by restric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::179e8b949526f8108e0a728e5636affe
http://arxiv.org/abs/2204.05853
http://arxiv.org/abs/2204.05853
Publikováno v:
Networks; Mar2023, Vol. 81 Issue 2, p253-277, 25p
We consider the price-optimal earliest arrival problem in public transit (POEAP) in which we aim to calculate the Pareto-front of journeys with respect to ticket price and arrival time in a public transportation network. Public transit fare structure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::586697916a7dbd3cbd54c2ce4acda7c3
We present an efficient algorithm that finds a globally optimal solution to the 2D Free Flight Trajectory Optimization Problem (aka Zermelo Navigation Problem) up to arbitrary precision in finite time. The algorithm combines a discrete and a continuo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a88f3cb9cca62815d4c490361f2ece8