Zobrazeno 1 - 10
of 475
pro vyhledávání: '"Stefan Voss"'
Autor:
Malek Sarhani, Stefan Voß
Publikováno v:
Multimodal Transportation, Vol 3, Iss 2, Pp 100120- (2024)
The use of public transport data has evolved rapidly over the past decades. Indeed, the availability of diverse data sources and advances in analytics have led to a greater emphasis on utilizing data to enhance public transport services. Rail transit
Externí odkaz:
https://doaj.org/article/460693dbe197417380495817eec78dcd
Publikováno v:
IEEE Access, Vol 12, Pp 122249-122261 (2024)
In recent years, there has been a significant surge in the adoption of electric vehicles (EVs) in public transportation services, particularly in sectors like bus and taxi operations. This paper focuses on the management of EV fleets within the speci
Externí odkaz:
https://doaj.org/article/f0a084cc1d094fae8d34e23458a05670
Publikováno v:
IEEE Access, Vol 11, Pp 38534-38547 (2023)
In recent years, there has been a significant increase in the application of graph neural networks on a wide range of different problems. A specially promising direction of research is on graph convolutional neural networks (GCN). This work focuses o
Externí odkaz:
https://doaj.org/article/5c9fc70c3c99441d94ca05125c23f936
From transocean routes to global networks: a framework for liner companies to build service networks
Autor:
Xiaoning Shi, Stefan Voß
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 3 (2023)
During the previous two decades liner carriers within maritime shipping have broken the barriers from being pure transportation providers towards being logistics service providers. Most of the top 20 liner carriers worldwide have set up spin-offs pro
Externí odkaz:
https://doaj.org/article/7d69d86c031d44fd8d0532614e62d060
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 4 (2023)
The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges. This problem relates to the design of cen
Externí odkaz:
https://doaj.org/article/93ded37d83474cdfb877c679b8133284
Autor:
Yi Ding, Zhichao Zhang, Kaimin Chen, Haoyi Ding, Stefan Voss, Leonard Heilig, Yue Chen, Xiazhong Chen
Publikováno v:
Journal of Advanced Transportation, Vol 2023 (2023)
Digital twins can facilitate high-fidelity representations of container terminals by applying various technologies and methods to better measure, understand, and improve operations. In this paper, a decision support system (DSS) based on digital twin
Externí odkaz:
https://doaj.org/article/1a840e018da9456382c7917c784b4e33
Publikováno v:
Journal of Shipping and Trade, Vol 5, Iss 1, Pp 1-21 (2020)
Abstract The use of shipping containers for the transport of goods has become indispensable and a crucial factor for globalization by providing inexpensive and safe transport opportunities. It is expected that the number of globally operating contain
Externí odkaz:
https://doaj.org/article/bf911c5e4bee45c79398d3baedbaf9e7
Publikováno v:
Maritime Transport Research, Vol 3, Iss , Pp 100066- (2022)
Despite the International Maritime Organization’s ambitious goal to drastically reduce greenhouse gas emissions by 2050 by 50%, a large portion of maritime ports do not publicly provide port air emissions reporting. It is suspected that the lack of
Externí odkaz:
https://doaj.org/article/6268cfd7f655478d996b9e1b74adc54b
Publikováno v:
Energies, Vol 14, Iss 20, p 6610 (2021)
Electrifying public bus transportation is a critical step in reaching net-zero goals. In this paper, the focus is on the problem of optimal scheduling of an electric bus (EB) fleet to cover a public transport timetable. The problem is modelled using
Externí odkaz:
https://doaj.org/article/76eeca468bfb4472ab9263a1e84dd988
Autor:
Alessandro Hill, Stefan Voß
Publikováno v:
EURO Journal on Computational Optimization, Vol 4, Iss 2, Pp 137-166 (2016)
We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees. The objective is th
Externí odkaz:
https://doaj.org/article/e8442715fd204038b9c8ac4b8d93152f