Iterated greedy heuristic for the time-dependent prize-collecting arc routing problem
© 2015 Elsevier Ltd.The time-dependent prize-collecting arc routing problem (TD-PARP) determines a number of full truckload orders and plans a vehicle route to maximize profit, which is calculated as total collected revenue (prizes) minus total travel cost. The travel cost …