Computation of best-compromise route for cycling - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Computation of best-compromise route for cycling

Abstract

Today, for environmental reasons, the use of alternative transportation such as cycling is expanding. Communities have initiated several programs to adapt the network to cycling because users are seeking to be able to move along safely. Indeed, for a cyclist, traveling time and distance are not the only criteria to consider: security, difficulty and touristic attraction may be taken into account. We propose methods for designing touristic, safe and short route for cycling. We propose methods both for determining Pareto set, as well as best compromise solution using user's preferences.
No file

Dates and versions

hal-01025729 , version 1 (18-07-2014)

Identifiers

  • HAL Id : hal-01025729 , version 1

Cite

Gaël Sauvanet, Emmanuel Neron, Hervé Baptiste. Computation of best-compromise route for cycling. 24th European Conference on Operational Research, Jul 2010, Lisbone, Portugal. ⟨hal-01025729⟩
62 View
0 Download

Share

Gmail Facebook X LinkedIn More