TRB Pubsindex
Text Size:

Title:

Heuristic Algorithms for Minimum Toll Booth Problem

Accession Number:

01025637

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States

Abstract:

As an alternative to the tolls based on marginal social cost pricing (MSCP), this paper addresses the toll pricing problem in which the objective is to minimize the number of toll facilities required to induce drivers to use a network of roads and highways in the most efficient manner. We formulated the problem as a linear optimization problem with binary variables and show that it belongs to a class of problems difficult to solve optimally. To obtain a good solution in a reasonable amount of time, we investigate several heuristic algorithms. Based on the results from randomly generated and real traffic networks, these algorithms generate tolls requiring a substantially less number of toll booths than MSCP.

Monograph Accession #:

01020180

Report/Paper Numbers:

06-1136

Language:

English

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Lawphongpanich, Siriphong

Pagination:

14p

Publication Date:

2006

Conference:

Transportation Research Board 85th Annual Meeting

Location: Washington DC, United States
Date: 2006-1-22 to 2006-1-26
Sponsors: Transportation Research Board

Media Type:

CD-ROM

Features:

Figures (3) ; References (10) ; Tables (7)

Subject Areas:

Administration and Management; Highways; Operations and Traffic Management; Terminals and Facilities; I10: Economics and Administration

Source Data:

Transportation Research Board Annual Meeting 2006 Paper #06-1136

Files:

BTRIS, TRIS, TRB

Created Date:

Mar 3 2006 10:36AM