Search

This paper considers the minimum toll booth problem (MINTB) for determining a tolling strategy in a transportation network that requires the least number of toll locations, and simultaneously causes the most efficient use of the network. The paper develops a methodology for using the genetic algorithm to solve MINTB and presents the algorithm GAMINTB. The proposed method is tested and validated through a computational study with six example networks. Additional numerical test discovers some interesting properties for the proposed method, and provides guidelines for further application of the GAMINTB. [ABSTRACT FROM AUTHOR]