Name
Title | ||
|---|---|---|
An exact method for the biobjective shortest path problem for large-scale road networks. |
Abstract | ||
|---|---|---|
•Recursive exact algorithm that implicitly enumerates all solutions.•Fast method that works well on graphs of up to 1.2 million nodes and 2.8 million arcs.•Consistently outperformed a top-performer benchmark algorithm for real road networks.•Easily extensible to the multiobjective shortest path problem with three or more objectives. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejor.2014.11.003 | European Journal of Operational Research |
Keywords | Field | DocType |
Routing,Multiobjective combinatorial optimization (MOCO),Biobjective shortest path,Multiobjective shortest path,Pulse algorithm | Mathematical optimization,Road networks,Shortest path problem,Enumeration,Algorithm,Constrained Shortest Path First,Yen's algorithm,Shortest Path Faster Algorithm,Recursion,Mathematics,K shortest path routing | Journal |
Volume | Issue | ISSN |
242 | 3 | 0377-2217 |
Citations | PageRank | References |
10 | 0.74 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Duque | 1 | 21 | 2.01 |
| Leonardo Lozano | 2 | 59 | 4.52 |
| Andrés L. Medaglia | 3 | 28 | 2.76 |