Abstract
This paper presents a methodology for allocating funds to highway safety improvements. Besides the commonly used binary variables that represent discrete interventions at specific points of a highway, continuous variables are introduced to represent the lengths of a highway over which continuous improvements, such as pavement resurfacing or lighting, are implemented. The problem is formulated as a mixed integer knapsack model with linear multiple choice constraints. Some insight into its solution properties is provided and an efficient branch and bound algorithm is proposed for its solution. A case study that illustrates the application of the model is also presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
