An integer programming approach for the Chinese postman problem with time-dependent travel time.
Jinghao SunYakun MengGuozhen TanPublished in: J. Comb. Optim. (2015)
Keyphrases
- travel time
- integer programming
- vehicle routing
- road network
- shortest path
- np hard
- traffic data
- transportation networks
- linear programming
- cutting plane
- vehicle routing and scheduling
- lagrangian relaxation
- traffic flow
- public transport
- vehicle routing problem
- column generation
- constraint programming
- travel cost
- traffic congestion
- traffic conditions
- integer program
- routing problem
- network flow
- cutting plane algorithm
- spatial networks
- genetic algorithm
- estimation error
- linear program
- traffic information
- heuristic search
- set partitioning
- scheduling problem
- lower bound