A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs.
Hisafumi KokubugataAyako MoriyamaHironao KawashimaPublished in: SLS (2007)
Keyphrases
- routing problem
- simulated annealing
- directed graph
- shortest path
- global optimization
- special case
- weighted graph
- solution quality
- optimal solution
- strongly connected
- variable neighborhood search
- depth first search
- edge weights
- response time
- evolutionary algorithm
- search strategy
- greedy algorithm
- vehicle routing problem
- routing algorithm
- integer programming
- traveling salesman problem
- travel time
- spanning tree
- tabu search
- cost function
- genetic algorithm