An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times.
Guozhen TanJinghao SunPublished in: COCOON (2011)
Keyphrases
- travel time
- integer programming
- routing problem
- vehicle routing and scheduling
- vehicle routing problem
- vehicle routing
- shortest path
- road network
- np hard
- transportation networks
- traveling salesman problem
- linear programming
- traffic congestion
- set partitioning
- traffic flow
- traffic data
- cutting plane
- urban areas
- constraint programming
- column generation
- network flow
- lagrangian relaxation
- integer program
- valid inequalities
- cutting plane algorithm
- emergency services
- travel cost
- origin destination
- spatial networks
- prize collecting
- fastest path
- optimal solution