Name
Abstract | ||
|---|---|---|
Road journeys are one of our most frequent daily tasks. Despite we need them, these trips have some associated costs: time, money, pollution, etc. One of the usual ways of modeling the road network is as a graph. The shortest path problem consists in finding the path in a graph that minimizes a certain cost function. However, in real world applications, more than one objective must be optimized simultaneously (e.g. time and pollution) and the data used in the optimization is not precise: it contains errors. In this paper we propose a new mathematical model for the robust bi-objective shortest path problem. In addition, some empirical studies are included to illustrate the utility of our formulation. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-59513-9_13 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
Robustness,Traffic road network,Bi-objective shortest path,Multi-objective optimization | Conference | 10268 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Cintrano | 1 | 0 | 3.38 |
| Francisco Chicano | 2 | 506 | 40.99 |
| Enrique Alba | 3 | 3796 | 242.34 |