Login / Signup
Solving the shortest route cut and fill problem using simulated annealing.
Darrall Henderson
Diane E. Vaughan
Sheldon H. Jacobson
Ron R. Wakefield
Edward C. Sewell
Published in:
Eur. J. Oper. Res. (2003)
Keyphrases
</>
simulated annealing
combinatorial optimization
shortest path
genetic algorithm
tabu search
genetic algorithm ga
real time
route planning
metaheuristic
road network
linear programming
mobile robot
reinforcement learning
hybrid algorithm
solution quality
global optimum
simulated annealing algorithm