Multiple Choice Knapsack Problem: example of planning choice in transportation.
Transportation programming, a process of selecting projects for funding given budget and other constraints, is becoming more complex as a result of new federal laws, local planning regulations, and increased public involvement. This article describes the use of an integer programming tool, Multiple Choice Knapsack Problem (MCKP), to provide optimal solutions to transportation programming problems in cases where alternative versions of projects are under consideration. In this paper, optimization methods for use in the transportation programming process are compared and then the process of building and solving the optimization problems is discussed. The concepts about the use of MCKP are presented and a real-world transportation programming example at various budget levels is provided. This article illustrates how the use of MCKP addresses the modern complexities and provides timely solutions in transportation programming practice. While the article uses transportation programming as a case study, MCKP can be useful in other fields where a similar decision among a subset of the alternatives is required.
Zhong
Tao
T
Department of Civil and Architectural Engineering, University of Wyoming, 1000 E. University Avenue, Laramie, WY 82071, USA.
Young
Rhonda
R
D000465:Algorithms; D002017:Budgets; D002755:Choice Behavior; D005380:Financing, Government; D014186:Transportation / Q000191:economics*; D014481:United States