Login / Signup
An exact method for the biobjective shortest path problem for large-scale road networks.
Daniel Duque
Leonardo Lozano
Andrés L. Medaglia
Published in:
Eur. J. Oper. Res. (2015)
Keyphrases
</>
shortest path problem
shortest path
road network
bi objective
minimum cost flow
travel time
routing algorithm
spatial networks
set covering problem
weighted graph
multiple objectives
road segments
k nearest neighbor
neural network
routing problem
cost function
multi objective
moving objects