Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Doctoral Dissertations
  5. An Optimization Framework for Integrating Variable Capacity and Pavement Thickness Requirements in Highway Cost Allocation
Details

An Optimization Framework for Integrating Variable Capacity and Pavement Thickness Requirements in Highway Cost Allocation

Date Issued
August 1, 2017
Author(s)
Kumar Dubey, Saurav  
Advisor(s)
Alberto Garcia
Additional Advisor(s)
Anahita Khojandi
James L. Simonton
Qiang He
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/25876
Abstract

The objective of Highway Cost Allocation (HCA) is to distribute or allocate in a fair and rational manner the cost of a transportation facility (either a highway or bridge) among all vehicle classes using it. The purpose of this dissertation is to study and enhance a model, known as the least-core model, to include both pavement thickness and traffic capacity requirements for all coalitions formed with a given group of vehicle classes. Considering vehicle classes as players and groups of vehicle classes as coalitions, it is possible to quantify the thickness and width of pavement needed to accommodate the vehicle classes in a coalition. Typically, thickness of the pavement depends upon the traffic load, which is measured in 18,000 lb. Equivalent Single Axle Load (ESAL). Additionally, the width of the pavement is measured in terms of traffic lanes. The cost of the grand coalition (including all players) is allocated using a linear programming (LP) model with constraints defining set of allocations belonging to the core that represent three properties of completeness, marginality and rationality. The right hand side of the LP model is determined for a given coalition with known traffic load (ESAL) and traffic capacity requirements (lanes). The least-core model maximizes the lower bound on savings experienced by all vehicle classes as a result of joining the grand coalition. The resulting optimal solution can be a unique allocation or multiple allocations. If the optimal basic feasible solution is unique, it is known as the nucleolus. Otherwise, the nucleolus is the average of all optimal basic feasible solutions. Since enumeration of all optimal basic feasible solutions is considered inefficient, an existing algorithm -referred to in the literature as the sequential LP approach- is adapted to the HCA problem. The procedure converges to the nucleolus by solving a sequence of LP models using well-known complementary slackness conditions. Finally, necessary conditions are identified for a special case of the least-core model to occur, wherein a closed-form solution can be used to obtain the nucleolus.

Subjects

Transportation

Linear Programming

Cost Optimization

Disciplines
Operations Research, Systems Engineering and Industrial Engineering
Degree
Doctor of Philosophy
Major
Industrial Engineering
Embargo Date
January 1, 2011
File(s)
Thumbnail Image
Name

0-HCADecision.xls

Size

5.61 MB

Format

Microsoft Excel

Checksum (MD5)

f020cfc76e626af2c7bd01eb66864816

Thumbnail Image
Name

1-LCM.ltx

Size

2 KB

Format

Unknown

Checksum (MD5)

a6f963d888f60dcf7fbc316f3d058cf9


University Libraries

1015 Volunteer Boulevard
Knoxville, TN 37996
865-974-4351

Map & Directions
Donate to the Libraries
  • About
  • John C. Hodges Society
  • Speaking Volumes magazine
  • Outreach
  • Directory
  • Employment
  • Policies
  • Library Intranet
University of Tennessee power T logo

The University of Tennessee, Knoxville
Knoxville, Tennessee 37996
865-974-1000

Events
A-Z
Apply
Privacy
Map
Directory
Give to UT
Accessibility

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science