Login / Signup
An intermodal transport network planning algorithm using dynamic programming - A case study: from Busan to Rotterdam in intermodal freight routing.
Jae Hyung Cho
Hyun Soo Kim
Hyung Rim Choi
Published in:
Appl. Intell. (2012)
Keyphrases
</>
dynamic programming
routing problem
transport network
optimal solution
detection algorithm
search space
cost function
worst case
computational complexity
np hard
convergence rate
objective function
k means
simulated annealing
expectation maximization
user satisfaction
routing decisions