The multiple shortest path problem with path deconfliction
Year of publication: |
2021
|
---|---|
Authors: | Hughes, Michael S. ; Lunday, Brian J. ; Weir, Jeffrey D. ; Hopkinson, Kenneth M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 292.2021, 3 (1.8.), p. 818-829
|
Subject: | Multi-agent | Multi-objective optimization | Path deconfliction | Routing | Shortest path problem | Tourenplanung | Vehicle routing problem | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Graphentheorie | Graph theory | Operations Research | Operations research |
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
-
Speeding up Martins' algorithm for multiple objective shortest path problems
Demeyer, Sofie, (2013)
-
Dimensionality reduction in multiobjective shortest path search
Pulido, Francisco-Javier, (2014)
- More ...
-
Hughes, Michael S., (2022)
-
Braziel, Carlos, (2007)
-
The maximal covering location disruption problem
Lunday, Brian J., (2024)
- More ...