The toll plaza optimization problem: Design, operations, and strategies
Seongmoon Kim
Transportation Research Part E: Logistics and Transportation Review, 2009, vol. 45, issue 1, 125-137
Abstract:
This paper presents comprehensive decision-making procedures for designing a new toll plaza with the right initial capacity, then finding the optimal dynamic lane configuration for operations, evaluating the effects of increasing future traffic volume on waiting time by sensitivity analysis, and establishing a long-term quantitative strategy by transferring low-throughput lane users to high-throughput lanes. We develop a non-linear integer programming model integrated with the M/G/1 queueing process. A case study based on actual data demonstrates how effective the model and the strategy are in reducing operating and user-waiting costs and, thus, improving overall system performance at toll plazas.
Keywords: Toll; plaza; Transportation; Optimization; Dynamic; configuration; M/G/1; queueing; process; Non-linear; integer; programming (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (8)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554508000987
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:45:y:2009:i:1:p:125-137
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().