Literature Database Entry

souza2019better


Allan Mariano de Souza, Torsten Braun, Leonardo C. Botega, Raquel Cabral, Islene C. Garcia and Leandro A. Villas, "Better safe than sorry: a vehicular traffic re-routing based on traffic conditions and public safety issues," Journal of Internet Services and Applications, vol. 10, 2019.

Abstract

Vehicular traffic re-routing is the key to provide better traffic mobility. However, taking into account just traffic-related information to recommend better routes for each vehicle is far from achieving the desired requirements of proper transportation management. In this way, context-aware and multi-objective re-routing approaches will play an important role in traffic management. Yet, most procedures are deterministic and cannot support the strict requirements of traffic management applications, since many vehicles potentially will take the same route, consequently degrading overall traffic efficiency. So, we propose an efficient algorithm named as Better Safe Than Sorry (BSTS), based on Pareto-efficiency. Simulation results have shown that our proposal provides a better trade-off between mobility and safety than state-of-the-art approaches and also avoids the problem of potentially creating different congestion spots.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Allan Mariano de Souza
Torsten Braun
Leonardo C. Botega
Raquel Cabral
Islene C. Garcia
Leandro A. Villas

BibTeX reference

@article{souza2019better,
    author = {Souza, Allan Mariano de and Braun, Torsten and Botega, Leonardo C. and Cabral, Raquel and Garcia, Islene C. and Villas, Leandro A.},
    doi = {10.1186/s13174-019-0116-9},
    issn = {1869-0238},
    journal = {Journal of Internet Services and Applications},
    publisher = {Springer},
    title = {{Better safe than sorry: a vehicular traffic re-routing based on traffic conditions and public safety issues}},
    volume = {10},
    year = {2019},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.