Iterated greedy heuristic for the time-dependent prize-collecting arc routing problem.

Vincent F. Yu Shih-Wei Lin

Published in: Comput. Ind. Eng. (2015)

Keyphrases

prize collecting
iterated greedy
greedy algorithm
travel time
scheduling problem
cpu times
optimal solution
tie breaking
road network
objective function
np hard
dynamic programming
worst case
simulated annealing
knapsack problem
traffic flow