Methods based on discrete optimization for finding road network rehabilitation strategies
| Autor: | Harald Minken, Geir Dahl |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Structure (mathematical logic)
Mathematical optimization Optimization problem General Computer Science Management Science and Operations Research Dynamic programming symbols.namesake Lagrangian relaxation Modeling and Simulation Discrete optimization Shortest path problem symbols Integer programming Budget constraint Mathematics |
| Zdroj: | Computers & Operations Research. 35:2193-2208 |
| ISSN: | 0305-0548 |
| DOI: | 10.1016/j.cor.2006.10.015 |
| Popis: | We study a dynamic optimization problem arising in the (long-term) planning of road rehabilitation activities. In this area one seeks a pavement resurfacing plan for a road network under budget constraints. Our main approach is to model this as an integer programming problem with underlying dynamic programming structure. We investigate properties of this model and propose a solution method based on Lagrangian relaxation where one gets subproblems that are shortest path problems. Some computational experiences based on realistic data are reported. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect