Login / Signup
An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem.
Matthias Prandtstetter
Günther R. Raidl
Published in:
Eur. J. Oper. Res. (2008)
Keyphrases
</>
variable neighborhood search
metaheuristic
tabu search
traveling salesman problem
neighborhood search
hybrid method
heuristic methods
minimum spanning tree
path relinking
search procedure
vehicle routing problem
routing problem
benchmark instances
single machine scheduling problem
search space
upper bound