GEAR: a graph edge attention routing algorithm solving combinatorial optimization problem with graph edge cost.
Yuhei SenumaZhao WangYuusuke NakanoJun OhyaPublished in: BigSpatial@SIGSPATIAL (2022)
Keyphrases
- combinatorial optimization
- weighted graph
- graph theory
- routing algorithm
- undirected graph
- shortest path
- combinatorial optimization problems
- metaheuristic
- simulated annealing
- branch and bound algorithm
- real time
- directed graph
- traveling salesman problem
- approximation algorithms
- network traffic
- search space
- optimal solution