A mixed integer knapsack model for allocating funds to highway safety improvements

Transportation Research Part A: Policy and Practice

Volumn 36, Issue 9, 2002, Pages 789-803

  Melachrinoudis, Emanuel ^a   Kozanidis, George ^a  

^a Northeastern University   (United States)

Author keywords

Budget allocation; Highway safety improvements; Knapsack problem; Mixed integer

Indexed keywords

ACCIDENT PREVENTION; ALGORITHMS; HIGHWAY ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING;

HIGHWAY SAFETY;

MOTOR TRANSPORTATION;

TRANSPORTATION SAFETY;

EID: 0036832858     PISSN: 09658564     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-8564(01)00040-4     Document Type: Article

References (20)

1. Use of dynamic programming in optimally allocating funds for highway safety improvements
2. Safety spending: Usually begrudged, often misallocated
3. Application of incremental benefit-cost analysis for optimal budget allocation to maintenance, rehabilitation and replacement of bridges
4. A note on the knapsack problem with special ordered sets
5. Evaluating the effectiveness of highway safety improvements
6. Optimization approach to highway safety improvement programming
7. Assessment of safety impacts of highway projects
8. Optimal allocation of funds for highway safety improvement projects
9. The multiple choice knapsack problem
10. RRR design standards: Cost effectiveness issues