Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 178651, 11 pages
Research Article

A Compromise Programming Model for Highway Maintenance Resources Allocation Problem

1Department of Transportation Engineering, Beijing Institute of Technology, Beijing 100081, China
2Department of Civil Engineering, Tsinghua University, Beijing 100084, China
3ITS Division, District Department of Transportation, Washington, DC 20003, USA

Received 5 August 2012; Accepted 22 October 2012

Academic Editor: Geert Wets

Copyright © 2012 Hui Xiong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper formulates a bilevel compromise programming model for allocating resources between pavement and bridge deck maintenances. The first level of the model aims to solve the resource allocation problems for pavement management and bridge deck maintenance, without considering resource sharing between them. At the second level, the model uses the results from the first step as an input and generates the final solution to the resource-sharing problem. To solve the model, the paper applies genetic algorithms to search for the optimal solution. We use a combination of two digits to represent different maintenance types. Results of numerical examples show that the conditions of both pavements and bridge decks are improved significantly by applying compromise programming, rather than conventional methods. Resources are also utilized more efficiently when the proposed method is applied.