An exact method for the biobjective shortest path problem for large-scale road networks
Year of publication: |
2015
|
---|---|
Authors: | Duque, Daniel ; Lozano, Leonardo ; Medaglia, Andrés L. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 242.2015, 3 (1.5.), p. 788-797
|
Subject: | Routing | Multiobjective combinatorial optimization (MOCO) | Biobjective shortest path | Multiobjective shortest path | Pulse algorithm | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Netzplantechnik | Project network techniques | Operations Research | Operations research | Graphentheorie | Graph theory |
-
Speeding up Martins' algorithm for multiple objective shortest path problems
Demeyer, Sofie, (2013)
-
Dimensionality reduction in multiobjective shortest path search
Pulido, Francisco-Javier, (2014)
-
The multiple shortest path problem with path deconfliction
Hughes, Michael S., (2021)
- More ...
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
-
Solving the Orienteering Problem with Time Windows via the Pulse Framework
Duque, Daniel, (2015)
-
An exact algorithm for the elementary shortest path problem with resource constraints
Lozano, Leonardo, (2016)
- More ...