Abstract

Interoperability in logistics is a prerequisite for realizing data pipelines and the Physical Internet. Forecasting data, real time data, and actual positions of shipments, containers, and transport means shared via events have to be harmonized and are expected to improve all types of processes, support synchromodal planning, and improve risk analysis from a compliance and resilience perspective. Technically, several solutions are implemented by organizations and innovations have been validated in so-called Living Labs or demonstrators in various projects. These solutions do not yet provide open systems required for a (global) data pipeline. A federation of solutions is required to construct data pipelines and to support sustainable development of applications on smart devices allowing Small and Medium sized Enterprises to collaborate. This paper proposes a set of platform services and so-called platform protocols to allow interoperability of different platforms for constructing a data pipeline. The proposed services and protocols further extend existing interoperability solutions and services for supply and logistics. © IFIP International Federation for Information Processing 2015. Document type: Part of book or chapter of book

Abstract

This paper presents a new practical approach to optimally allocate charging stations in large-scale transportation networks for electric vehicles (EVs). The problem is of particular importance to meet the charging demand of the growing fleet of alternative fuel vehicles. Considering the limited driving range of EVs, there is need to supply EV owners with accessible charging stations to reduce their range anxiety. The aim of the Route Node Coverage (RNC) problem, which is considered in the current paper, is to find the minimum number of charging stations, and their locations in order to cover the most probable routes in a transportation network. We propose an iterative approximation technique for RNC, where the associated Integer Problem (IP) is solved by exploiting a probabilistic random walk route selection, and thereby taking advantage of the numerical stability and efficiency of the standard IP software packages. Furthermore, our iterative RNC optimization procedure is both pertinent and straightforward to implement in computer coding and the design technique is therefore highly applicable. The proposed optimization technique is applied on the Sioux-Falls test transportation network, and in a large-scale case study covering the southern part of Sweden, where the focus is on reaching the maximum coverage with a minimum number of charging stations. The results are promising and show that the flexibility, smart route selection, and numerical efficiency of the proposed design technique, can pick out strategic locations for charging stations from thousands of possible locations w ithout numerical difficulties. ©2019 Hie Authors. Published by Elsevier B.V. "p"open acce

Abstract

Date of Conference: 1-3 Oct. 2003 Conference name: Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) We propose a novel traffic engineering architecture for IP networks with multiprotocol label switching (MPLS) backbones. In this architecture, two (primary and secondary) label switched paths (LSPs) are established among every pair of IP routers located at the edge of an MPLS cloud. Traffic between a source-destination pair is then split between the primary and secondary LSPs using an ABR-like explicit-rate feedback gathered from the network. Taking into consideration the packet reordering effect of packet-based load balancing schemes, we propose a novel traffic splitting mechanism that operates on a per-flow basis. We show, using a variety of scenarios, that deploying flow-based multipath traffic engineering not only provides significantly and consistently better throughput than that of a single path, but is also void of any packet reordering. © 2003 IEEE.