Full Program »
Minimum Cost Eulerian Cycles In Road Networks
Graph theory may be applied to several fields of study; mobility planning is one of them. This manuscript presents the procedures carried out for the research of the optimal route for a vehicle to traverse every street on a road network, a problem also known as the Chinese Postman Problem. Rather than merely discussing the mathematical resolution method, authors have developed an end-to-end tool that goes from obtaining real-world road network data to computing the optimum route for traversing it. This tool is intended for planning a 3D mapping vehicle data collection strategy.
Martín Bayón-Gutiérrez
Department of Electric, Systems and Automatics Engineering. University of León (ULE)
Spain
Héctor Alaiz-Moretón
Department of Electric, Systems and Automatics Engineering. University of León (ULE)
Spain
Isaías García-Rodríguez
Department of Electric, Systems and Automatics Engineering. University of León (ULE)
Spain
Carmen Benavides
Department of Electric, Systems and Automatics Engineering. University of León (ULE)
Spain
María Teresa García-Ordás
Department of Electric, Systems and Automatics Engineering. University of León (ULE)
Spain
José Alberto Benítez-Andrades
Department of Electric, Systems and Automatics Engineering. University of León (ULE)
Spain
