Crowdsensing-driven route optimisation algorithms for smart urban mobility

Urban rörlighet anses ofta vara en av de främsta möjliggörarna för en hållbar statsutveckling. Idag skulle det dock kräva ett betydande skifte mot renare och effektivare stadstransporter vilket skulle stödja ökad social och ekonomisk koncentration av resurser i städerna. En viktig prioritet för städer runt om i världen är att stödja medborgarnas rörlighet inom stadsmiljöer medan samtidigt minska trafikstockningar, olyckor och föroreningar. Att utveckla en effektivare och grönare (eller med ett ord; smartare) stadsrörlighet är en av de svåraste problemen att bemöta för stora metropoler. I denna avhandling närmar vi oss problemet från det snabba utvecklingsperspektivet av ITlandskapet i städer vilket möjliggör byggandet av rörlighetslösningar utan stora stora investeringar eller sofistikerad sensortenkik. I synnerhet föreslår vi utnyttjandet av den mobila rörlighetsavkännings, eng. Mobile Crowdsensing (MCS), paradigmen i vilken befolkningen exploaterar sin mobilkommunikation och/eller mobilasensorer med syftet att frivilligt samla, distribuera, lokalt processera och analysera geospecifik information. Rörlighetavkänningssdata (t.ex. händelser, trafikintensitet, buller och luftföroreningar etc.) inhämtad från frivilliga i befolkningen kan ge värdefull information om aktuella rörelsesförhållanden i stad vilka, med adekvata databehandlingsalgoriter, kan användas för att planera människors rörelseflöden inom stadsmiljön. Såtillvida kombineras i denna avhandling två mycket lovande smarta rörlighetsmöjliggörare, eng. Smart Mobility Enablers, nämligen MCS och rese/ruttplanering. Vi kan därmed till viss utsträckning sammanföra forskningsutmaningar från dessa två delar. Vi väljer att separera våra forskningsmål i två delar, dvs forskningssteg: (1) arkitektoniska utmaningar vid design av MCS-system och (2) algoritmiska utmaningar för tillämpningar av MCS-driven ruttplanering. Vi ämnar att visa en logisk forskningsprogression över tiden, med avstamp i mänskligt dirigerade rörelseavkänningssystem som MCS och ett avslut i automatiserade ruttoptimeringsalgoritmer skräddarsydda för specifika MCS-applikationer. Även om vi förlitar oss på heuristiska lösningar och algoritmer för NP-svåra ruttproblem förlitar vi oss på äkta applikationer med syftet att visa på fördelarna med algoritm- och infrastrukturförslagen.La movilidad urbana es considerada una de las principales desencadenantes de un desarrollo urbano sostenible. Sin embargo, hoy en día se requiere una transición hacia un transporte urbano más limpio y más eficiente que soporte una concentración de recursos sociales y económicos cada vez mayor en las ciudades. Una de las principales prioridades para las ciudades de todo el mundo es facilitar la movilidad de los ciudadanos dentro de los entornos urbanos, al mismo tiempo que se reduce la congestión, los accidentes y la contaminación. Sin embargo, desarrollar una movilidad urbana más eficiente y más verde (o en una palabra, más inteligente) es uno de los temas más difíciles de afrontar para las grandes áreas metropolitanas. En esta tesis, abordamos este problema desde la perspectiva de un panorama TIC en rápida evolución que nos permite construir movilidad sin la necesidad de grandes inversiones ni sofisticadas tecnologías de sensores. En particular, proponemos aprovechar el paradigma Mobile Crowdsensing (MCS) en el que los ciudadanos utilizan sus teléfonos móviles y dispositivos, para nosotros recopilar, procesar y analizar localmente información georreferenciada, distribuida voluntariamente. Los datos de movilidad recopilados de ciudadanos que voluntariamente quieren compartirlos (por ejemplo, eventos, intensidad del tráfico, ruido y contaminación del aire, etc.) pueden proporcionar información valiosa sobre las condiciones de movilidad actuales en la ciudad, que con el algoritmo de procesamiento de datos adecuado, pueden utilizarse para enrutar y gestionar el flujo de gente en entornos urbanos. Por lo tanto, en esta tesis combinamos dos prometedoras fuentes de movilidad inteligente: MCS y la planificación de viajes/rutas, uniendo en cierta medida los distintos desafíos de investigación. Hemos dividido nuestros objetivos de investigación en dos etapas: (1) Desafíos arquitectónicos en el diseño de sistemas MCS y (2) Desafíos algorítmicos en la planificación de rutas aprovechando la información del MCS. Nuestro objetivo es demostrar una progresión lógica de la investigación a lo largo del tiempo, comenzando desde los fundamentos de los sistemas de detección centrados en personas, como el MCS, hasta los algoritmos de optimización de rutas diseñados específicamente para la aplicación de estos. Si bien nos centramos en algoritmos y heurísticas para resolver problemas de enrutamiento de clase NP-hard, utilizamos ejemplos de aplicaciones en el mundo real para mostrar las ventajas de los algoritmos e infraestructuras propuestas

Quiet paths for people : developing routing analysis and Web GIS application

Altistuminen saasteille saattaa vähentää merkittävästi aktiivisten liikkumismuotojen, kuten kävelyn ja pyöräilyn terveyshyötyjä. Yksi liikenteestä johtuvista saasteista on melu, joka voi aiheuttaa terveyshaittoja, kuten kohonnutta verenpainetta ja stressiä. Aikaisemmissa tutkimuksissa ja selvityksissä melulle altistumista on arvioutu yleensä kotipaikan suhteen ja liikkumisen aikana tapahtuva altistus on jäänyt vähemmälle huomiolle. Koska liikkumisen aikainen (dynaaminen) melualtistus saattaa muodostaa merkittävän oan kaupunkilaisten päivittäisestä kokonaismelualtistuksesta, tarvitaan kehittyneempiä menetelmiä dynaamisen melualtistuksen arvioimiseen ja vähentämiseen. Tässä tutkielmassa kehitin kävelyn reititysmenetelmän ja sovelluksen, jolla voi 1) etsiä lyhimmän reitin, 2) mallintaa kävelyn aikaisen melualtistuksen ja 3) löytää vaihtoehtoisia, hiljaisempia reittejä. Sovellus hyödyntää OpenStreetMap-tieverkostoaineistoa ja mallinnettua aineistoa tieliikenteen tyypillisistä päiväajan melutasoista. Reitinetsintä perustuu kehittämääni melukustannusfunktioon ja alhaisimman kustannuksen reititysanalyysiin. Melukustannukset lasketaan sovelluksessa lukuisilla eri meluherkkyyskertoimilla, minkä ansiosta sovellus löytää useita vaihtoehtoisia (hiljaisempia) reittejä. Jotta eri reittien meluisuutta (melualtistuksia) voidaan vertailla, kehitin sarjan melualtistusindeksejä. Tapaustutkimuksessa tutkin Helsingistä tehtävien työmatkojen aikaisia melualtistuksia; selvitin rekistereihin perustuvien työmatkojen mukaiset joukkoliikennereitit ja tutkin reittien kävelyosuuksien aikaisia melualtistuksia reitittämällä kävelyreitit uudestaan kehittämälläni reitityssovelluksella. Lisäksi tutkin hiljaisempien reittivaihtoehtojen mahdollistamia vähennyksiä melualtistuksissa tapaustutkimuksessa mallinnetuilla kävelyreiteillä. Tapaustutkimuksen tulokset indikoivat, että tyypilliset dynaamiset melualtistukset vaihtelevat huomattavasti eri asuinpaikkojen välillä. Toisaalta merkittävä osa melulle altistumisesta on mahdollista välttää hiljaisemmilla reittivaihtoehdoilla; tilanteesta riippuen, hiljaisemmat reitit tarjoavat keskimäärin 12–57 % vähennyksen altistuksessa yli 65 dB melutasoille ja 1.6–9.6 dB keskimääräisen vähennyksen reittien keskimääräisessä melutasossa. Altistuksen mahdolliseen vähennykseen näyttäisivät vaikuttavan ainakin 1) melualtistuksen suuruus lyhimmällä (ts. verrokki) reitillä, 2) lyhimmän reitin pituus, eli etäisyys lähtö- ja kohdepisteen välillä reititysgraafissa ja 3) hiljaisemman reitin pituus lyhimpään reittiin verrattuna. Julkaisin hiljaisten kävelyreittien reitityssovelluksen avoimena web-rajapintapalveluna (API - Application Programming Interface) ja kehitin hiljaisten kävelyreittien reittioppaan mobiilioptimoituna web-karttasovelluksena. Kaikki tutkielmassa kehitetyt menetelmät ja lähdekoodit ovat avoimesti saatavilla GitHub-palvelussa. Yksilöiden ja kaupunkisuunnittelijoiden tietoutta dynaamisesta altistuksesta melulle (ja muille saasteille) tulisi lisätä kehittämällä altistusten arviointiin ja vähentämiseen kehittyneempiä analyyseja ja sovelluksia. Tässä tutkielmassa kehitetty web-karttasovellus havainnollistaa hiljaisten reittien reititysmenetelmän toimivuutta tosielämän tilanteissa ja voi näin ollen auttaa jalankulkijoita löytämään hiljaisempia, ja siten terveellisempiä, reittivaihtoehtoja. Kun ympäristöllisiin altistuksiin perustuvaa reitinetsintää kehitetään pidemmälle, tulisi pyrkiä huomioimaan useampia erillisiä altistuksia samanaikaisesti ja siten reitittämään yleisesti ottaen terveellisempiä reittejä.It is likely that journey-time exposure to pollutants limit the positive health effects of active transport modes (e.g. walking and cycling). One of the pollutants caused by vehicular traffic is traffic noise, which is likely to cause various negative health effects such as increased stress levels and blood pressure. In prior studies, individuals’ exposure to community noise has usually been assessed only with respect to home location, as required by national and international policies. However, these static exposure assessments most likely ignore a substantial share of individuals’ total daily noise exposure that occurs while they are on the move. Hence, new methods are needed for both assessing and reducing journey-time exposure to traffic noise as well as to other pollutants. In this study, I developed a multifunctional routing application for 1) finding shortest paths, 2) assessing dynamic exposure to noise on the paths and 3) finding alternative, quieter paths for walking. The application uses street network data from OpenStreetMap and modeled traffic noise data of typical daytime traffic noise levels. The underlying least cost path (LCP) analysis employs a custom-designed environmental impedance function for noise and a set of (various) noise sensitivity coefficients. I defined a set of indices for quantifying and comparing dynamic (i.e. journey-time) exposure to high noise levels. I applied the developed routing application in a case study of pedestrians’ dynamic exposure to noise on commuting related walks in Helsinki. The walks were projected by carrying out an extensive public transport itinerary planning on census based commuting flow data. In addition, I assessed achievable reductions in exposure to traffic noise by taking quieter paths with statistical means by a subset of 18446 commuting related walks (OD pairs). The results show significant spatial variation in average dynamic noise exposure between neighborhoods but also significant achievable reductions in noise exposure by quieter paths; depending on the situation, quieter paths provide 12–57 % mean reduction in exposure to noise levels higher than 65 dB and 1.6–9.6 dB mean reduction in mean dB (compared to the shortest paths). At least three factors seem to affect the achievable reduction in noise exposure on alternative paths: 1) exposure to noise on the shortest path, 2) length of the shortest path and 3) length of the quiet path compared to the shortest path. I have published the quiet path routing application as a web-based quiet path routing API (application programming interface) and developed an accompanying quiet path route planner as a mobile-friendly web map application. The online quiet path route planner demonstrates the applicability of the quiet path routing method in real-life situations and can thus help pedestrians to choose quieter paths. Since the quiet path routing API is open, anyone can query short and quiet paths equipped with attributes on journey-time exposure to noise. All methods and source codes developed in the study are openly available via GitHub. Individuals’ and urban planners’ awareness of dynamic exposure to noise and other pollutants should be further increased with advanced exposure assessments and routing applications. Web-based exposure-aware route planner applications have the potential to help individuals to choose alternative, healthier paths. When developing exposure-based routing analysis further, attempts should be made to enable simultaneously considering multiple environmental exposures in order to find overall healthier paths

A new open-source system for strategic freight logistics planning: the SYNCHRO-NET optimization tools

Globalization and e-commerce facilities have yielded in the recent years an incredibly huge increment of freight movements. Consequently, the underlying supply chains have become more and more complex to manage for the shipping companies, in terms of costs, distances, times, and environmental sustainability. SYNCHRO-NET, a H2020 European research project, aims to de-stress the international supply chains by fostering cost-effective and greener transportation alternatives. Besides other important actions, the SYNCHRO-NET framework provides an optimization and simulation toolset to support decision-making in freight logistics planning at a strategic level. The synchronized use of different transportation modes and the exploitation of smart steaming strategies for ship movements are the two main aspects considered in this innovative optimization system. In this paper, we present the optimization toolset developed, its contribution with respect to the existing platforms, and the experimental set-up implemented to evaluate its performance, usability, and effectiveness. The system is, in fact, currently under evaluation by several world-wide leading companies in freight logistics and transportation. However, the toolset potentialities go beyond the SYNCHRO-NET context, being the system an open-source project that makes use of open data formats and technologies

Crowdsensing-driven route optimisation algorithms for smart urban mobility

Cotutela Universitat Politècnica de Catalunya i KTH Royal Institute of TechnologyUrban rörlighet anses ofta vara en av de främsta möjliggörarna för en hållbar statsutveckling. Idag skulle det dock kräva ett betydande skifte mot renare och effektivare stadstransporter vilket skulle stödja ökad social och ekonomisk koncentration av resurser i städerna. En viktig prioritet för städer runt om i världen är att stödja medborgarnas rörlighet inom stadsmiljöer medan samtidigt minska trafikstockningar, olyckor och föroreningar. Att utveckla en effektivare och grönare (eller med ett ord; smartare) stadsrörlighet är en av de svåraste problemen att bemöta för stora metropoler. I denna avhandling närmar vi oss problemet från det snabba utvecklingsperspektivet av ITlandskapet i städer vilket möjliggör byggandet av rörlighetslösningar utan stora stora investeringar eller sofistikerad sensortenkik. I synnerhet föreslår vi utnyttjandet av den mobila rörlighetsavkännings, eng. Mobile Crowdsensing (MCS), paradigmen i vilken befolkningen exploaterar sin mobilkommunikation och/eller mobilasensorer med syftet att frivilligt samla, distribuera, lokalt processera och analysera geospecifik information. Rörlighetavkänningssdata (t.ex. händelser, trafikintensitet, buller och luftföroreningar etc.) inhämtad från frivilliga i befolkningen kan ge värdefull information om aktuella rörelsesförhållanden i stad vilka, med adekvata databehandlingsalgoriter, kan användas för att planera människors rörelseflöden inom stadsmiljön. Såtillvida kombineras i denna avhandling två mycket lovande smarta rörlighetsmöjliggörare, eng. Smart Mobility Enablers, nämligen MCS och rese/ruttplanering. Vi kan därmed till viss utsträckning sammanföra forskningsutmaningar från dessa två delar. Vi väljer att separera våra forskningsmål i två delar, dvs forskningssteg: (1) arkitektoniska utmaningar vid design av MCS-system och (2) algoritmiska utmaningar för tillämpningar av MCS-driven ruttplanering. Vi ämnar att visa en logisk forskningsprogression över tiden, med avstamp i mänskligt dirigerade rörelseavkänningssystem som MCS och ett avslut i automatiserade ruttoptimeringsalgoritmer skräddarsydda för specifika MCS-applikationer. Även om vi förlitar oss på heuristiska lösningar och algoritmer för NP-svåra ruttproblem förlitar vi oss på äkta applikationer med syftet att visa på fördelarna med algoritm- och infrastrukturförslagen.La movilidad urbana es considerada una de las principales desencadenantes de un desarrollo urbano sostenible. Sin embargo, hoy en día se requiere una transición hacia un transporte urbano más limpio y más eficiente que soporte una concentración de recursos sociales y económicos cada vez mayor en las ciudades. Una de las principales prioridades para las ciudades de todo el mundo es facilitar la movilidad de los ciudadanos dentro de los entornos urbanos, al mismo tiempo que se reduce la congestión, los accidentes y la contaminación. Sin embargo, desarrollar una movilidad urbana más eficiente y más verde (o en una palabra, más inteligente) es uno de los temas más difíciles de afrontar para las grandes áreas metropolitanas. En esta tesis, abordamos este problema desde la perspectiva de un panorama TIC en rápida evolución que nos permite construir movilidad sin la necesidad de grandes inversiones ni sofisticadas tecnologías de sensores. En particular, proponemos aprovechar el paradigma Mobile Crowdsensing (MCS) en el que los ciudadanos utilizan sus teléfonos móviles y dispositivos, para nosotros recopilar, procesar y analizar localmente información georreferenciada, distribuida voluntariamente. Los datos de movilidad recopilados de ciudadanos que voluntariamente quieren compartirlos (por ejemplo, eventos, intensidad del tráfico, ruido y contaminación del aire, etc.) pueden proporcionar información valiosa sobre las condiciones de movilidad actuales en la ciudad, que con el algoritmo de procesamiento de datos adecuado, pueden utilizarse para enrutar y gestionar el flujo de gente en entornos urbanos. Por lo tanto, en esta tesis combinamos dos prometedoras fuentes de movilidad inteligente: MCS y la planificación de viajes/rutas, uniendo en cierta medida los distintos desafíos de investigación. Hemos dividido nuestros objetivos de investigación en dos etapas: (1) Desafíos arquitectónicos en el diseño de sistemas MCS y (2) Desafíos algorítmicos en la planificación de rutas aprovechando la información del MCS. Nuestro objetivo es demostrar una progresión lógica de la investigación a lo largo del tiempo, comenzando desde los fundamentos de los sistemas de detección centrados en personas, como el MCS, hasta los algoritmos de optimización de rutas diseñados específicamente para la aplicación de estos. Si bien nos centramos en algoritmos y heurísticas para resolver problemas de enrutamiento de clase NP-hard, utilizamos ejemplos de aplicaciones en el mundo real para mostrar las ventajas de los algoritmos e infraestructuras propuestas.Postprint (published version

A Metric of Influential Spreading during Contagion Dynamics through the Air Transportation Network

The spread of infectious diseases at the global scale is mediated by long-range human travel. Our ability to predict the impact of an outbreak on human health requires understanding the spatiotemporal signature of early-time spreading from a specific location. Here, we show that network topology, geography, traffic structure and individual mobility patterns are all essential for accurate predictions of disease spreading. Specifically, we study contagion dynamics through the air transportation network by means of a stochastic agent-tracking model that accounts for the spatial distribution of airports, detailed air traffic and the correlated nature of mobility patterns and waiting-time distributions of individual agents. From the simulation results and the empirical air-travel data, we formulate a metric of influential spreading––the geographic spreading centrality––which accounts for spatial organization and the hierarchical structure of the network traffic, and provides an accurate measure of the early-time spreading power of individual nodes

Impact of Interdisciplinary Research on Planning, Running, and Managing Electromobility as a Smart Grid Extension

The smart grid is concerned with energy efficiency and with the environment, being a countermeasure against the territory devastations that may originate by the fossil fuel mining industry feeding the conventional power grids. This paper deals with the integration between the electromobility and the urban power distribution network in a smart grid framework, i.e., a multi-stakeholder and multi-Internet ecosystem (Internet of Information, Internet of Energy, and Internet of Things) with edge computing capabilities supported by cloud-level services and with clean mapping between the logical and physical entities involved and their stakeholders. In particular, this paper presents some of the results obtained by us in several European projects that refer to the development of a traffic and power network co-simulation tool for electro mobility planning, platforms for recharging services, and communication and service management architectures supporting interoperability and other qualities required for the implementation of the smart grid framework. For each contribution, this paper describes the inter-disciplinary characteristics of the proposed approaches

CAMERA – Mobility Report 1

This report is a result of research performed so far in the scope of the CAMERA Coordination and Support Action (CSA). In CAMERA, we investigate research initiatives from the past decade that focus on the European air transport system and its integration with other transport modes, with a special focus on addressing the customer experience and point of view. The focus of this report is the review of the research under FP7 and its successor, H2020, as these have supported a large number of research activities in air mobility in the last decade. Its objective is to analyse 158 selected research initiatives in European mobility research to determine their coverage of mobility challenges, identify potential gaps and form recommendations for future research initiatives. This is the first of four Annual Mobility Reports that CAMERA is planning to publish. It outlines the initial findings and describes the future efforts of this Coordination and Support Action

A Machine Learning Recommender Model for Ride Sharing Based on Rider Characteristics and User Threshold Time

In the present age, human life is prospering incredibly due to the 4th Industrial Revolution or The Age of Digitization and Computing. The ubiquitous availability of the Internet and advanced computing systems have resulted in the rapid development of smart cities. From connected devices to live vehicle tracking, technology is taking the field of transportation to a new level. An essential part of the transportation domain in smart cities is Ride Sharing. It is an excellent solution to issues like pollution, traffic, and the rapid consumption of fuel. Even though Ride Sharing has several benefits, the current usage is significantly low due to limitations like social barriers and long rider waiting times. The thesis proposes a novel Ride Sharing model with two matching layers to eliminate most of the observed issues in the existing Ride Sharing applications like UberPool and LyftLine. The first matching layer matches riders based on specific human characteristics, and the second matching layer provides riders the option to restrict the waiting time by using personalized threshold time. At the end of trips, the system collects user feedback according to five characteristics. Then, at most, two main characteristics that are the most important to riders are determined based on the collected feedback. The registered characteristics and the two main determined characteristics are fed as the inputs to a Machine Learning classification module. For newly registering users, the module predicts the two main characteristics of riders, and that assists in matching with other riders having similar determined characteristics. The thesis includes subjecting the proposed model to an extensive simulation for measuring system efficiency. The model simulations have utilized the real-time New York City Cab traffic data with real-traffic conditions using Google Maps Application Programming Interface (API). Results indicate that the proposed Ride Sharing model is feasible, and efficient as the number of riders increases while maintaining the rider threshold time. The expected outcome of the thesis is to help service providers increase the usage of Ride Sharing, complete the pool for the maximum number of trips in minimal time and perform maximum rider matches based on similar characteristics, thus providing an energy-efficient and a social platform for Ride Sharing

Computationally intensive, distributed and decentralised machine learning: from theory to applications

Machine learning (ML) is currently one of the most important research fields, spanning computer science, statistics, pattern recognition, data mining, and predictive analytics. It plays a central role in automatic data processing and analysis in numerous research domains owing to widely distributed and geographically scattered data sources, powerful computing clouds, and high digitisation requirements. However, aspects such as the accuracy of methods, data privacy, and model explainability remain challenging and require additional research. Therefore, it is necessary to analyse centralised and distributed data processing architectures, and to create novel computationally intensive explainable and privacy-preserving ML methods, to investigate their properties, to propose distributed versions of prospective ML baseline methods, and to evaluate and apply these in various applications. This thesis addresses the theoretical and practical aspects of state-of-the-art ML methods. The contributions of this thesis are threefold. In Chapter 2, novel non-distributed, centralised, computationally intensive ML methods are proposed, their properties are investigated, and state-of-the-art ML methods are applied to real-world data from two domains, namely transportation and bioinformatics. Moreover, algorithms for ‘black-box’ model interpretability are presented. Decentralised ML methods are considered in Chapter 3. First, we investigate data processing as a preliminary step in data-driven, agent-based decision-making. Thereafter, we propose novel decentralised ML algorithms that are based on the collaboration of the local models of agents. Within this context, we consider various regression models. Finally, the explainability of multiagent decision-making is addressed. In Chapter 4, we investigate distributed centralised ML methods. We propose a distributed parallelisation algorithm for the semi-parametric and non-parametric regression types, and implement these in the computational environment and data structures of Apache SPARK. Scalability, speed-up, and goodness-of-fit experiments using real-world data demonstrate the excellent performance of the proposed methods. Moreover, the federated deep-learning approach enables us to address the data privacy challenges caused by processing of distributed private data sources to solve the travel-time prediction problem. Finally, we propose an explainability strategy to interpret the influence of the input variables on this federated deep-learning application. This thesis is based on the contribution made by 11 papers to the theoretical and practical aspects of state-of-the-art and proposed ML methods. We successfully address the stated challenges with various data processing architectures, validate the proposed approaches in diverse scenarios from the transportation and bioinformatics domains, and demonstrate their effectiveness in scalability, speed-up, and goodness-of-fit experiments with real-world data. However, substantial future research is required to address the stated challenges and to identify novel issues in ML. Thus, it is necessary to advance the theoretical part by creating novel ML methods and investigating their properties, as well as to contribute to the application part by using of the state-of-the-art ML methods and their combinations, and interpreting their results for different problem setting