Login / Signup
An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search.
Carlos Contreras Bolton
Víctor Parada
Published in:
Int. Trans. Oper. Res. (2021)
Keyphrases
</>
iterated local search
prize collecting
metaheuristic
multi start
tabu search
vehicle routing problem with time windows
neural network
optimal solution
mathematical model
integer programming
optimization problems
solution space
solution quality
vehicle routing problem
scatter search