An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation.
José AlbiachJosé María SanchisDavid SolerPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- exact solution
- travel time
- graph transformation
- vehicle routing
- vehicle routing problem
- traveling salesman problem
- travel cost
- vehicle routing and scheduling
- column generation
- optimal solution
- combinatorial optimization
- transportation networks
- exact algorithms
- road network
- lower bound
- routing problem
- ant colony optimization
- metaheuristic
- traffic data
- urban areas
- shortest path
- traffic congestion
- approximate solutions
- traffic flow
- np hard
- search space
- spatial networks
- branch and bound
- benchmark problems
- traffic flows
- tabu search
- optimization problems
- linear programming
- simulated annealing
- emergency services
- prize collecting
- special case
- upper bound
- knapsack problem
- linear program
- orthogonal projection
- particle swarm optimization