<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://onlinelibrary.wiley.com/rss/journal/10.1002/(ISSN)2042-3195" xmlns="http://purl.org/rss/1.0/"><title>Journal of Advanced Transportation</title><description> Wiley Online Library : Journal of Advanced Transportation</description><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2F%28ISSN%292042-3195</link><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc</dc:publisher><dc:language xmlns:dc="http://purl.org/dc/elements/1.1/">en</dc:language><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/">© John Wiley &amp; Sons, Ltd.</dc:rights><prism:issn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">0197-6729</prism:issn><prism:eIssn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">2042-3195</prism:eIssn><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-01T00:00:00-05:00</dc:date><prism:coverDisplayDate xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">April 2013</prism:coverDisplayDate><prism:volume xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">47</prism:volume><prism:number xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">3</prism:number><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">247</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">383</prism:endingPage><image rdf:resource="http://onlinelibrary.wiley.com/store/10.1002/atr.v47.3/asset/cover.gif?v=1&amp;s=3f291eabf79e4454308768c15ed0da2b6c06f6a8"/><items><rdf:Seq><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1231"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1232"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1229"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1228"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1227"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1226"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1223"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1224"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1225"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1222"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1218"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1221"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1217"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1219"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1216"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1215"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1214"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1212"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1210"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1208"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1204"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1202"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1201"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.219"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1198"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1191"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1190"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1189"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1182"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.204"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1186"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1181"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1183"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.213"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.200"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.198"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.202"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1180"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.211"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.190"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.218"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.206"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.215"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.196"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.205"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.201"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.181"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.194"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.217"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.191"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.192"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.186"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.188"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.189"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.180"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.182"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.178"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.183"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.185"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.187"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.184"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.179"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.177"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.175"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.174"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.176"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.166"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.173"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.167"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.170"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.162"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1230"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1200"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1188"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.209"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1203"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1207"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1206"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.193"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1213"/></rdf:Seq></items></channel><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1231" xmlns="http://purl.org/rss/1.0/"><title>More robust and better: a multiple kernel support vector machine ensemble approach for traffic incident detection</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1231</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">More robust and better: a multiple kernel support vector machine ensemble approach for traffic incident detection</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jianli Xiao, Xiang Gao, Qing-Jie Kong, Yuncai Liu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-06T07:01:35.680666-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1231</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1231</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1231</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a multiple kernel support vector machine (MKL-SVM) ensemble algorithm to detect traffic incidents. It uses resampling technology to generate training set, test set, and training subset firstly; then uses different training subsets to train individual MKL-SVM classifiers; and finally introduces ensemble methods to construct MKL-SVM ensemble to detect traffic incidents. Extensive experiments have been performed to evaluate the performances of the four algorithms: standard SVM, SVM ensemble, MKL-SVM, and the proposed algorithm (MKL-SVM ensemble). The experimental results show that the proposed algorithm has the best comprehensive performances in traffic incidents detection. To achieve better performances, the proposed algorithm needs less individual classifiers to construct the ensemble than SVM ensemble algorithm. Thus, compared with SVM ensemble algorithm, the complexity of the ensemble classifier of the proposed algorithm is reduced greatly. Conveniently, the proposed algorithm also avoids the burden of selecting the appropriate kernel function and parameters. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper presents a multiple kernel support vector machine (MKL-SVM) ensemble algorithm to detect traffic incidents. It uses resampling technology to generate training set, test set, and training subset firstly; then uses different training subsets to train individual MKL-SVM classifiers; and finally introduces ensemble methods to construct MKL-SVM ensemble to detect traffic incidents. Extensive experiments have been performed to evaluate the performances of the four algorithms: standard SVM, SVM ensemble, MKL-SVM, and the proposed algorithm (MKL-SVM ensemble). The experimental results show that the proposed algorithm has the best comprehensive performances in traffic incidents detection. To achieve better performances, the proposed algorithm needs less individual classifiers to construct the ensemble than SVM ensemble algorithm. Thus, compared with SVM ensemble algorithm, the complexity of the ensemble classifier of the proposed algorithm is reduced greatly. Conveniently, the proposed algorithm also avoids the burden of selecting the appropriate kernel function and parameters. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1232" xmlns="http://purl.org/rss/1.0/"><title>Data mining using regularized adaptive B-splines regression with penalization for multi-regime traffic stream models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1232</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Data mining using regularized adaptive B-splines regression with penalization for multi-regime traffic stream models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Lu Sun, Yiyong Pan, Wenjun Gu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-30T01:14:15.283514-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1232</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1232</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1232</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a new data mining method that integrates adaptive B-spline regression and traffic flow theory to develop multi-regime traffic stream models (TSMs). Parameter estimation is implemented adaptively and optimally through a constrained bi-level programming method. The slave programming determines positions of knots and coefficients of the B-spline by minimizing the error of B-spline regression. The master programming model determines the number of knots through a regularized function, which balances model accuracy and model complexity. This bi-level programming method produces the best fitting to speed–density observations under specific order of splines and possesses great flexibility to accommodate the exhibited nonlinearity in speed–density relationships. Jam density can be estimated naturally using spline TSM, which is sometimes hardly obtainable in many other TSM. Derivative continuity up to one order lower than the highest spline degree can be preserved, a desirable property in some application. A five-regime B-spline model is found to exist for generalized speed–density relationships to accommodate five traffic operating conditions: free flow, transition, synchronized flow, stop and go traffic, and jam condition. A typical two-regime B-spline form is also explicitly given, depending only on free-flow speed, optimal speed, optimal density, and jam density. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper presents a new data mining method that integrates adaptive B-spline regression and traffic flow theory to develop multi-regime traffic stream models (TSMs). Parameter estimation is implemented adaptively and optimally through a constrained bi-level programming method. The slave programming determines positions of knots and coefficients of the B-spline by minimizing the error of B-spline regression. The master programming model determines the number of knots through a regularized function, which balances model accuracy and model complexity. This bi-level programming method produces the best fitting to speed–density observations under specific order of splines and possesses great flexibility to accommodate the exhibited nonlinearity in speed–density relationships. Jam density can be estimated naturally using spline TSM, which is sometimes hardly obtainable in many other TSM. Derivative continuity up to one order lower than the highest spline degree can be preserved, a desirable property in some application. A five-regime B-spline model is found to exist for generalized speed–density relationships to accommodate five traffic operating conditions: free flow, transition, synchronized flow, stop and go traffic, and jam condition. A typical two-regime B-spline form is also explicitly given, depending only on free-flow speed, optimal speed, optimal density, and jam density. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1229" xmlns="http://purl.org/rss/1.0/"><title>Spectral and time-frequency analyses of freeway traffic flow</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1229</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Spectral and time-frequency analyses of freeway traffic flow</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Lu Sun</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-25T03:23:14.285105-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1229</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1229</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1229</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper uses spectral and time-frequency analyses to treat three macroscopic traffic characteristics, namely, time mean speed, volume and occupancy as stochastic processes. Spectral and time-frequency analyses are performed to characterize power spectral density (PSD), cross-PSD, autocorrelation and cross-correlation of these characteristics using <em>TransGuide</em> traffic data collected from four different freeways. It is found that low-frequency components dominate the PSDs of speed, volume and occupancy at all times. The magnitude of PSDs decreases dramatically as frequency increases and remains almost at a constant level in high-frequency regimes. A power law is found to exist, which describes the relationship between the frequency and the PSD of traffic characteristics. It is also found that speed can be properly modeled by a narrowband low-pass stochastic process in a low-frequency regime and by a nonzero mean white noise in a high-frequency regime. Strong periodicities and synchronization are both shown in traffic flow. A variety of frequencies can be excited by congestion, and there is no dominant frequency found in stop-and-go traffic. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper uses spectral and time-frequency analyses to treat three macroscopic traffic characteristics, namely, time mean speed, volume and occupancy as stochastic processes. Spectral and time-frequency analyses are performed to characterize power spectral density (PSD), cross-PSD, autocorrelation and cross-correlation of these characteristics using TransGuide traffic data collected from four different freeways. It is found that low-frequency components dominate the PSDs of speed, volume and occupancy at all times. The magnitude of PSDs decreases dramatically as frequency increases and remains almost at a constant level in high-frequency regimes. A power law is found to exist, which describes the relationship between the frequency and the PSD of traffic characteristics. It is also found that speed can be properly modeled by a narrowband low-pass stochastic process in a low-frequency regime and by a nonzero mean white noise in a high-frequency regime. Strong periodicities and synchronization are both shown in traffic flow. A variety of frequencies can be excited by congestion, and there is no dominant frequency found in stop-and-go traffic. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1228" xmlns="http://purl.org/rss/1.0/"><title>An optimal aircraft fleet management decision model under uncertainty</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1228</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">An optimal aircraft fleet management decision model under uncertainty</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hooi Ling Khoo, Lay Eng Teoh</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-23T00:13:44.169512-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1228</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1228</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1228</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Decision planning for an efficient fleet management is crucial for airlines to ensure a profit while maintaining a good level of service. Fleet management involves acquisition and leasing of aircraft to meet travelers' demand. Accordingly, the methods used in modeling travelers' demand are crucial as they could affect the robustness and accuracy of the solutions. Compared with most of the existing studies that consider deterministic demand, this study proposes a new methodology to find optimal solutions for a fleet management decision model by considering stochastic demand. The proposed methodology comes in threefold. First, a five-step modeling framework, which is incorporated with a stochastic demand index (SDI), is proposed to capture the occurrence of uncertain events that could affect the travelers' demand. Second, a probabilistic dynamic programming model is developed to optimize the fleet management model. Third, a probable phenomenon indicator is defined to capture the targeted level of service that could be achieved satisfactorily by the airlines under uncertainty. An illustrative case study is presented to evaluate the applicability of the proposed methodology. The results show that it is viable to provide optimal solutions for the aircraft fleet management model. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Decision planning for an efficient fleet management is crucial for airlines to ensure a profit while maintaining a good level of service. Fleet management involves acquisition and leasing of aircraft to meet travelers' demand. Accordingly, the methods used in modeling travelers' demand are crucial as they could affect the robustness and accuracy of the solutions. Compared with most of the existing studies that consider deterministic demand, this study proposes a new methodology to find optimal solutions for a fleet management decision model by considering stochastic demand. The proposed methodology comes in threefold. First, a five-step modeling framework, which is incorporated with a stochastic demand index (SDI), is proposed to capture the occurrence of uncertain events that could affect the travelers' demand. Second, a probabilistic dynamic programming model is developed to optimize the fleet management model. Third, a probable phenomenon indicator is defined to capture the targeted level of service that could be achieved satisfactorily by the airlines under uncertainty. An illustrative case study is presented to evaluate the applicability of the proposed methodology. The results show that it is viable to provide optimal solutions for the aircraft fleet management model. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1227" xmlns="http://purl.org/rss/1.0/"><title>Dynamic system-optimal traffic assignment for a city using the continuum modeling approach</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1227</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Dynamic system-optimal traffic assignment for a city using the continuum modeling approach</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Y. Z. Tao, Y. Q. Jiang, J. Du, S. C. Wong, P. Zhang, Y. H. Xia, K. Choi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-17T23:47:37.261845-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1227</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1227</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1227</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a continuum dynamic traffic assignment model for a city in which the total cost of the traffic system is minimized: the travelers in the system are organized to choose the route to their destinations that minimizes the total cost of the system. Combined with the objective function, which defines the total cost and constraints such as certain physical and boundary conditions, a continuum model can be formulated as an optimization scheme with a feasible region in the function space. To obtain an admissible locally optimal solution to this problem, we first reformulate the optimization in discrete form and then introduce a heuristic method to solve it. This method converges rapidly with attractive computational cost. Numerical examples are used to demonstrate the effectiveness of the method. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper presents a continuum dynamic traffic assignment model for a city in which the total cost of the traffic system is minimized: the travelers in the system are organized to choose the route to their destinations that minimizes the total cost of the system. Combined with the objective function, which defines the total cost and constraints such as certain physical and boundary conditions, a continuum model can be formulated as an optimization scheme with a feasible region in the function space. To obtain an admissible locally optimal solution to this problem, we first reformulate the optimization in discrete form and then introduce a heuristic method to solve it. This method converges rapidly with attractive computational cost. Numerical examples are used to demonstrate the effectiveness of the method. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1226" xmlns="http://purl.org/rss/1.0/"><title>Designing Emission Charging Schemes for Transportation Conformity</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1226</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Designing Emission Charging Schemes for Transportation Conformity</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yanni Yang, Yafeng Yin, Huapu Lu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-01T02:14:15.987048-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1226</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1226</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1226</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper designs emission charging schemes to ensure traffic emissions not exceeding the emission budgets in emission regulation areas. In a network where all links are tollable, we prove that, under mild conditions, there exists a non-negative link-based toll scheme that achieves the transportation conformity requirement while minimizing total emissions. We further consider only tolling in the emission regulation areas and formulate a model to determine optimal area-based emission charges to ensure the conformity. The model is formulated as a mathematical program with complementarity constraints. A solution framework is developed to solve the model, leveraging on a derivative-free pattern search algorithm and integrating MOVES to estimate vehicular emissions more accurately. The proposed models are demonstrated on two numerical examples. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper designs emission charging schemes to ensure traffic emissions not exceeding the emission budgets in emission regulation areas. In a network where all links are tollable, we prove that, under mild conditions, there exists a non-negative link-based toll scheme that achieves the transportation conformity requirement while minimizing total emissions. We further consider only tolling in the emission regulation areas and formulate a model to determine optimal area-based emission charges to ensure the conformity. The model is formulated as a mathematical program with complementarity constraints. A solution framework is developed to solve the model, leveraging on a derivative-free pattern search algorithm and integrating MOVES to estimate vehicular emissions more accurately. The proposed models are demonstrated on two numerical examples. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1223" xmlns="http://purl.org/rss/1.0/"><title>Personal space, evasive movement and pedestrian level of service</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1223</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Personal space, evasive movement and pedestrian level of service</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Sangyoup Kim, Jaisung Choi, Sungkyu Kim, Richard Tay</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-08T03:57:55.442707-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1223</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1223</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1223</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This study proposed a behavioral theory-based approach to better assess pedestrian levels of service for sidewalks, using the concepts of personal space and pedestrian evasive movements. Data from pedestrian interviews and video recordings at 28 commercial, residential, and leisure locations were used to analyze the effects of pedestrian movements on pedestrian perceived levels of service. With these results, a new measure of pedestrian level of service was developed. With the use of a separate validation sample, the revised levels of service obtained were found to be more consistent with the pedestrian perceived levels than the levels prescribed by the Korean Highway Capacity Manual. Hence, this research recommended the use of the revised measures for pedestrian level of service in the design and evaluation of pedestrian facilities. We also found that pedestrian evasive movements on sidewalks could better explain pedestrians' perception of the levels of service for a given facility. Moreover, pedestrian evasive movements were found to be sensitive to the width of the sidewalk and pedestrian volume. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This study proposed a behavioral theory-based approach to better assess pedestrian levels of service for sidewalks, using the concepts of personal space and pedestrian evasive movements. Data from pedestrian interviews and video recordings at 28 commercial, residential, and leisure locations were used to analyze the effects of pedestrian movements on pedestrian perceived levels of service. With these results, a new measure of pedestrian level of service was developed. With the use of a separate validation sample, the revised levels of service obtained were found to be more consistent with the pedestrian perceived levels than the levels prescribed by the Korean Highway Capacity Manual. Hence, this research recommended the use of the revised measures for pedestrian level of service in the design and evaluation of pedestrian facilities. We also found that pedestrian evasive movements on sidewalks could better explain pedestrians' perception of the levels of service for a given facility. Moreover, pedestrian evasive movements were found to be sensitive to the width of the sidewalk and pedestrian volume. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1224" xmlns="http://purl.org/rss/1.0/"><title>Optimization of bus routing strategies for evacuation</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1224</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimization of bus routing strategies for evacuation</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hong Zheng</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-02-24T21:47:49.281839-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1224</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1224</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1224</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Efficient transportation of evacuees during an emergency has long been recognized as a challenging issue. This paper investigates emergency evacuation strategies that rely on public transit, where buses run continuously, rather than fixed route, based upon the spatial and temporal information of evacuee needs. We formulated an optimal bus operating strategy that minimizes the exposed casualty time rather than operational cost, as a deterministic mixed-integer program, and investigated the solution algorithm. A Lagrangian-relaxation-based solution algorithm was developed for the proposed model. Numerical experiments with different problem sizes were conducted to evaluate the method. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Efficient transportation of evacuees during an emergency has long been recognized as a challenging issue. This paper investigates emergency evacuation strategies that rely on public transit, where buses run continuously, rather than fixed route, based upon the spatial and temporal information of evacuee needs. We formulated an optimal bus operating strategy that minimizes the exposed casualty time rather than operational cost, as a deterministic mixed-integer program, and investigated the solution algorithm. A Lagrangian-relaxation-based solution algorithm was developed for the proposed model. Numerical experiments with different problem sizes were conducted to evaluate the method. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1225" xmlns="http://purl.org/rss/1.0/"><title>Berth assignment planning for multi-line bus stops</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1225</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Berth assignment planning for multi-line bus stops</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jiyuan Tan, Zhiheng Li, Li Li, Yi Zhang, Lu Lu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-02-19T23:06:09.894748-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1225</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1225</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1225</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we study an important problem that arises with the fast development of public transportation systems: when a large number of bus lines share the same bus stop, a long queue of buses often forms when they wait to get into the stop in rush hours. This causes a significant increase of bus delay and a notable drop of traffic capacity near the bus stop. Various measures had been proposed to relieve the congestions near bus stops. However, all of them require considerable financial budgets and construction time costs. In this paper, with the concept of berth assignment redesign, a simulation-based heuristic algorithm is proposed to make full use of exiting bus berths. In this study, a trustable simulation platform is designed, and the major influencing factors for bus stop operations are considered. The concept of risk control is also introduced to better evaluate the performance of different berth arrangement plans and makes an appropriate trade-off between the system's efficiency and stability. Finally, a heuristic algorithm is proposed to find a sub-optimal berth assignment plan. Tests on a typical bus stop show that this algorithm is efficient and fast. The sub-optimal berth assignment plan obtained by this algorithm could make remarkable improvements to an actual bus stop. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

In this paper, we study an important problem that arises with the fast development of public transportation systems: when a large number of bus lines share the same bus stop, a long queue of buses often forms when they wait to get into the stop in rush hours. This causes a significant increase of bus delay and a notable drop of traffic capacity near the bus stop. Various measures had been proposed to relieve the congestions near bus stops. However, all of them require considerable financial budgets and construction time costs. In this paper, with the concept of berth assignment redesign, a simulation-based heuristic algorithm is proposed to make full use of exiting bus berths. In this study, a trustable simulation platform is designed, and the major influencing factors for bus stop operations are considered. The concept of risk control is also introduced to better evaluate the performance of different berth arrangement plans and makes an appropriate trade-off between the system's efficiency and stability. Finally, a heuristic algorithm is proposed to find a sub-optimal berth assignment plan. Tests on a typical bus stop show that this algorithm is efficient and fast. The sub-optimal berth assignment plan obtained by this algorithm could make remarkable improvements to an actual bus stop. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1222" xmlns="http://purl.org/rss/1.0/"><title>The optimization of lane assignment and signal timing at the tandem intersection with pre-signal</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1222</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">The optimization of lane assignment and signal timing at the tandem intersection with pre-signal</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yaping Zhou, Hongbin Zhuang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-02-15T01:06:08.044979-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1222</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1222</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1222</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents an integrated model for optimizing lane assignment and signal timing at tandem intersection, which is introduced recently. The pre-signal is utilized in the tandem intersection to reorganize the traffic flow; hence, the vehicles, regardless of whether left-turns or through vehicles, can be discharged in all the lanes. However, the previous work does not consider the extra traffic disruption and the associated delay caused by the additional pre-signal. In the paper, the extra delay aroused by the coordination is incorporated in a lane assignment and signal timing optimization model, and the problem is converted into a mixed-integer non-linear programming. A feasible directions method is hence introduced to solve the mixed-integer non-linear programming. The result of the optimization shows that the performance of the tandem intersection is improved and the average delay is minimized. The comparison between the tandem and the conventional configuration is presented, and the results verify that the former shows better performance than the latter. In addition, the optimal sequence corresponding to the turning proportion and the optimal lane assignment at the upstream approach of the pre-signal are presented. Furthermore, if the number of lanes is equal in all arms, the paper proves that the average delay will be reduced if lane assignment is proportional to the turning proportion and the vehicles with low proportion are discharged in advance. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper presents an integrated model for optimizing lane assignment and signal timing at tandem intersection, which is introduced recently. The pre-signal is utilized in the tandem intersection to reorganize the traffic flow; hence, the vehicles, regardless of whether left-turns or through vehicles, can be discharged in all the lanes. However, the previous work does not consider the extra traffic disruption and the associated delay caused by the additional pre-signal. In the paper, the extra delay aroused by the coordination is incorporated in a lane assignment and signal timing optimization model, and the problem is converted into a mixed-integer non-linear programming. A feasible directions method is hence introduced to solve the mixed-integer non-linear programming. The result of the optimization shows that the performance of the tandem intersection is improved and the average delay is minimized. The comparison between the tandem and the conventional configuration is presented, and the results verify that the former shows better performance than the latter. In addition, the optimal sequence corresponding to the turning proportion and the optimal lane assignment at the upstream approach of the pre-signal are presented. Furthermore, if the number of lanes is equal in all arms, the paper proves that the average delay will be reduced if lane assignment is proportional to the turning proportion and the vehicles with low proportion are discharged in advance. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1218" xmlns="http://purl.org/rss/1.0/"><title>A multi-objective approach to the parcel express service delivery problem</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1218</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A multi-objective approach to the parcel express service delivery problem</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Aleksandar Čupić, Dušan Teodorović</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-01-07T22:58:51.593868-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1218</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1218</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1218</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">ABSTRACT</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Parcel express service in many countries assumes door-to-door delivery of parcels and small packages in the fastest possible way. Delivery companies usually organize hub delivery networks, as flows between hubs are characterized by the economy of scale effect. At hubs, parcels are exchanged across vans, trucks, and planes. To organize parcel delivery in a specific region, the parcel delivery company must make appropriate decisions about the total number of parcel delivery hubs, their locations, and the allocation of demand for facilities' services to facilities. These issues are modeled in this paper as a multi-objective problem. The model developed is based on compromise programming and genetic algorithms. We also demonstrate in the paper an interactive manner in which a defined problem can be solved. The proposed model could be implemented in large-scale networks. The paper also shows a case study of parcel delivery service in Serbia. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Parcel express service in many countries assumes door-to-door delivery of parcels and small packages in the fastest possible way. Delivery companies usually organize hub delivery networks, as flows between hubs are characterized by the economy of scale effect. At hubs, parcels are exchanged across vans, trucks, and planes. To organize parcel delivery in a specific region, the parcel delivery company must make appropriate decisions about the total number of parcel delivery hubs, their locations, and the allocation of demand for facilities' services to facilities. These issues are modeled in this paper as a multi-objective problem. The model developed is based on compromise programming and genetic algorithms. We also demonstrate in the paper an interactive manner in which a defined problem can be solved. The proposed model could be implemented in large-scale networks. The paper also shows a case study of parcel delivery service in Serbia. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1221" xmlns="http://purl.org/rss/1.0/"><title>Pick-up locations and bus allocation for transit-based evacuation planning with demand uncertainty</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1221</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Pick-up locations and bus allocation for transit-based evacuation planning with demand uncertainty</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Ashish Kulshrestha, Yingyan Lou, Yafeng Yin</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-12-21T01:50:48.583318-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1221</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1221</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1221</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper develops a decision-support model for transit-based evacuation planning under demand uncertainty. Demand uncertainty refers to the uncertainty associated with the number of transit-dependent evacuees. A robust optimization model is proposed to determine the optimal pick-up points for evacuees to assemble, and allocate available buses to transport the assembled evacuees between the pick-up locations and different public shelters. The model is formulated as a mixed-integer linear program and is solved via a cutting plane scheme. The numerical example based on the Sioux Falls network demonstrates that the robust plan yields lower total evacuation time and is reliable in serving the realized evacuee demand. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper develops a decision-support model for transit-based evacuation planning under demand uncertainty. Demand uncertainty refers to the uncertainty associated with the number of transit-dependent evacuees. A robust optimization model is proposed to determine the optimal pick-up points for evacuees to assemble, and allocate available buses to transport the assembled evacuees between the pick-up locations and different public shelters. The model is formulated as a mixed-integer linear program and is solved via a cutting plane scheme. The numerical example based on the Sioux Falls network demonstrates that the robust plan yields lower total evacuation time and is reliable in serving the realized evacuee demand. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1217" xmlns="http://purl.org/rss/1.0/"><title>Applying multiple kernel learning and support vector machine for solving the multicriteria and nonlinearity problems of traffic flow prediction</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1217</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Applying multiple kernel learning and support vector machine for solving the multicriteria and nonlinearity problems of traffic flow prediction</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chenyun Yu, Ka Chi Lam</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-12-19T23:17:05.461346-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1217</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1217</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1217</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This article proposes to develop a prediction model for traffic flow using kernel learning methods such as support vector machine (SVM) and multiple kernel learning (MKL). Traffic flow prediction is a dynamic problem owing to its complex nature of multicriteria and nonlinearity. Influential factors of traffic flow were firstly investigated; five-point scale and entropy methods were employed to transfer the qualitative factors into quantitative ones and rank these factors, respectively. Then, SVM and MKL-based prediction models were developed, with the influential factors and the traffic flow as the input and output variables. The prediction capability of MKL was compared with SVM through a case study. It is proved that both the SVM and MKL perform well in prediction with regard to the accuracy rate and efficiency, and MKL is more preferable with a higher accuracy rate when under proper parameters setting. Therefore, MKL can enhance the decision-making of traffic flow prediction. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This article proposes to develop a prediction model for traffic flow using kernel learning methods such as support vector machine (SVM) and multiple kernel learning (MKL). Traffic flow prediction is a dynamic problem owing to its complex nature of multicriteria and nonlinearity. Influential factors of traffic flow were firstly investigated; five-point scale and entropy methods were employed to transfer the qualitative factors into quantitative ones and rank these factors, respectively. Then, SVM and MKL-based prediction models were developed, with the influential factors and the traffic flow as the input and output variables. The prediction capability of MKL was compared with SVM through a case study. It is proved that both the SVM and MKL perform well in prediction with regard to the accuracy rate and efficiency, and MKL is more preferable with a higher accuracy rate when under proper parameters setting. Therefore, MKL can enhance the decision-making of traffic flow prediction. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1219" xmlns="http://purl.org/rss/1.0/"><title>Traffic rationing and pricing in a linear monocentric city</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1219</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Traffic rationing and pricing in a linear monocentric city</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Wei Liu, Hai Yang, Yafeng Yin</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-12-17T00:04:43.148897-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1219</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1219</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1219</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a simple spatial equilibrium model for a linear monocentric city to investigate the effects of rationing and pricing on morning commuters' travel cost and modal choice behavior in each location. Under rationing and pricing, every day in the morning peak hour, each commuter is classified as either “free” or “rationed”. “Free” commuters are allowed to use the highway without paying the toll, whereas “rationed” commuters can avoid the toll only if they travel by transit. Each day, a fraction of commuters are rationed in their free use of the highway, and the rationing fractions are determined systematically so that everyone is equally rationed in a given period. It is found that Pareto-improving rationing and pricing scheme might be obtained as a combination of the rationing degree and the toll associated with rationing. Extension to the rationing and pricing scheme with cordon and park-and-ride service has been made. Cordon and park-and-ride might help in improving the efficiency of rationing and pricing strategy although remains its Pareto-improving property. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper presents a simple spatial equilibrium model for a linear monocentric city to investigate the effects of rationing and pricing on morning commuters' travel cost and modal choice behavior in each location. Under rationing and pricing, every day in the morning peak hour, each commuter is classified as either “free” or “rationed”. “Free” commuters are allowed to use the highway without paying the toll, whereas “rationed” commuters can avoid the toll only if they travel by transit. Each day, a fraction of commuters are rationed in their free use of the highway, and the rationing fractions are determined systematically so that everyone is equally rationed in a given period. It is found that Pareto-improving rationing and pricing scheme might be obtained as a combination of the rationing degree and the toll associated with rationing. Extension to the rationing and pricing scheme with cordon and park-and-ride service has been made. Cordon and park-and-ride might help in improving the efficiency of rationing and pricing strategy although remains its Pareto-improving property. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1216" xmlns="http://purl.org/rss/1.0/"><title>An adaptive model for highway travel time prediction</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1216</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">An adaptive model for highway travel time prediction</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xiaobo Liu, Steven I. Chien, Mei Chen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-21T06:52:11.647089-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1216</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1216</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1216</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Traffic congestion caused by either insufficient road capacity or unexpected events has been a major problem in urban transportation networks. To disseminate accurate traveler information and reduce congestion impact, it is desirable to develop an adaptive model to predict travel time. The proposed model is practically implementable to capture dynamic traffic patterns under various conditions, which integrates the features of exponential smoothing and the Kalman filter by utilizing both real-time and historic data. The model is simple in formulation while robust in performance in terms of accuracy and stability. With a constraint or nonconstraint smoothing factor, the proposed model is tested with both real world and simulated data and demonstrated itself a sound model that outperforms others (e.g., Kalman filter and simple exponential smoothing) specifically under recurring and nonrecurring congestion. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Traffic congestion caused by either insufficient road capacity or unexpected events has been a major problem in urban transportation networks. To disseminate accurate traveler information and reduce congestion impact, it is desirable to develop an adaptive model to predict travel time. The proposed model is practically implementable to capture dynamic traffic patterns under various conditions, which integrates the features of exponential smoothing and the Kalman filter by utilizing both real-time and historic data. The model is simple in formulation while robust in performance in terms of accuracy and stability. With a constraint or nonconstraint smoothing factor, the proposed model is tested with both real world and simulated data and demonstrated itself a sound model that outperforms others (e.g., Kalman filter and simple exponential smoothing) specifically under recurring and nonrecurring congestion. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1215" xmlns="http://purl.org/rss/1.0/"><title>Estimating fuel consumption and emissions based on reconstructed vehicle trajectories</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1215</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Estimating fuel consumption and emissions based on reconstructed vehicle trajectories</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Zhong Chen, Chao Yang, Anthony Chen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-20T01:43:58.68456-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1215</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1215</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1215</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Microscopic emission models are widely used in emission estimation and environment evaluation. Traditionally, microscopic traffic simulation models and probe vehicles are two sources of inputs to a microscopic emission model. However, they are not effective in reflecting all vehicles' real-world operating conditions. Using each vehicle's spot speed data recorded by detectors, this paper provides a new method to estimate all vehicles' real-world activities data. These data can then be used as inputs to a microscopic emission model to estimate vehicle fuel consumption and emissions. The main task is to reconstruct trajectory of each vehicle and calculate second-by-second speed and acceleration from the activities data. The Next Generation Simulation dataset and the Comprehensive Modal Emissions Model are used in this study to calculate and analyze the emission results for both lane-level and link-level. The results showed that using the proposed method for estimating vehicle fuel consumption and emissions is promising. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Microscopic emission models are widely used in emission estimation and environment evaluation. Traditionally, microscopic traffic simulation models and probe vehicles are two sources of inputs to a microscopic emission model. However, they are not effective in reflecting all vehicles' real-world operating conditions. Using each vehicle's spot speed data recorded by detectors, this paper provides a new method to estimate all vehicles' real-world activities data. These data can then be used as inputs to a microscopic emission model to estimate vehicle fuel consumption and emissions. The main task is to reconstruct trajectory of each vehicle and calculate second-by-second speed and acceleration from the activities data. The Next Generation Simulation dataset and the Comprehensive Modal Emissions Model are used in this study to calculate and analyze the emission results for both lane-level and link-level. The results showed that using the proposed method for estimating vehicle fuel consumption and emissions is promising. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1214" xmlns="http://purl.org/rss/1.0/"><title>A theoretical foundation for the relationship between generalized origin–destination matrix and flow matrix based on ordinal graph trajectories</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1214</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A theoretical foundation for the relationship between generalized origin–destination matrix and flow matrix based on ordinal graph trajectories</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Kardi Teknomo, Proceso Fernandez</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-10-15T20:28:20.847848-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1214</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1214</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1214</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper shows the relationship between flow, generalized origin–destination (OD), and alternative route flow from a set of ordinal graph trajectories. In contrast to traffic assignment methods that employ OD matrix to produce flow matrix, we use ordinal trajectory on a network graph as input and produce both the generalized OD matrix and the flow matrix, with the alternative and substitute route flow matrices as additional outputs. By using linear algebra-like operations on matrix sets, the relationship between network utilization (in terms of flow, generalized OD, alternative route flow, and desire line) and network structure (in terms of distance matrix and adjacency matrix) are derived. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper shows the relationship between flow, generalized origin–destination (OD), and alternative route flow from a set of ordinal graph trajectories. In contrast to traffic assignment methods that employ OD matrix to produce flow matrix, we use ordinal trajectory on a network graph as input and produce both the generalized OD matrix and the flow matrix, with the alternative and substitute route flow matrices as additional outputs. By using linear algebra-like operations on matrix sets, the relationship between network utilization (in terms of flow, generalized OD, alternative route flow, and desire line) and network structure (in terms of distance matrix and adjacency matrix) are derived. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1212" xmlns="http://purl.org/rss/1.0/"><title>Pruning and ranking the Pareto optimal set, application for the dynamic multi-objective network design problem</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1212</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Pruning and ranking the Pareto optimal set, application for the dynamic multi-objective network design problem</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Luc J.J. Wismans, T. Brands, Eric C. Van Berkum, Michiel C.J. Bliemer</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-10-02T00:59:23.934695-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1212</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1212</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1212</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Solving the multi-objective network design problem (MONDP) resorts to a Pareto optimal set. This set can provide additional information like trade-offs between objectives for the decision making process, which is not available if the compensation principle would be chosen in advance. However, the Pareto optimal set of solutions can become large, especially if the objectives are mainly opposed. As a consequence, the Pareto optimal set may become difficult to analyze and to comprehend. In this case, pruning and ranking becomes attractive to reduce the Pareto optimal set and to rank the solutions to assist the decision maker. Because the method used, may influence the eventual decisions taken, it is important to choose a method that corresponds best with the underlying decision process and is in accordance with the qualities of the data used. We provided a review of some methods to prune and rank the Pareto optimal set to illustrate the advantages and disadvantages of these methods. The methods are applied using the outcome of solving the dynamic MONDP in which minimizing externalities of traffic are the objectives, and dynamic traffic management measures are the decision variables. For this, we solved the dynamic MONDP for a realistic network of the city Almelo in the Netherlands using the non-dominated sorting genetic algorithm II. For ranking, we propose to use a fuzzy outranking method that can take uncertainties regarding the data quality and the perception of decision makers into account; and for pruning, a method that explicitly reckons with significant trade-offs has been identified as the more suitable method to assist the decision making process. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Solving the multi-objective network design problem (MONDP) resorts to a Pareto optimal set. This set can provide additional information like trade-offs between objectives for the decision making process, which is not available if the compensation principle would be chosen in advance. However, the Pareto optimal set of solutions can become large, especially if the objectives are mainly opposed. As a consequence, the Pareto optimal set may become difficult to analyze and to comprehend. In this case, pruning and ranking becomes attractive to reduce the Pareto optimal set and to rank the solutions to assist the decision maker. Because the method used, may influence the eventual decisions taken, it is important to choose a method that corresponds best with the underlying decision process and is in accordance with the qualities of the data used. We provided a review of some methods to prune and rank the Pareto optimal set to illustrate the advantages and disadvantages of these methods. The methods are applied using the outcome of solving the dynamic MONDP in which minimizing externalities of traffic are the objectives, and dynamic traffic management measures are the decision variables. For this, we solved the dynamic MONDP for a realistic network of the city Almelo in the Netherlands using the non-dominated sorting genetic algorithm II. For ranking, we propose to use a fuzzy outranking method that can take uncertainties regarding the data quality and the perception of decision makers into account; and for pruning, a method that explicitly reckons with significant trade-offs has been identified as the more suitable method to assist the decision making process. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1210" xmlns="http://purl.org/rss/1.0/"><title>Taxi services with search frictions and congestion externalities</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1210</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Taxi services with search frictions and congestion externalities</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Teng Yang, Hai Yang, Sze Chun Wong</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-17T02:33:17.891563-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1210</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1210</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1210</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Built upon the previous studies, this paper incorporates both bilateral taxi–customer search frictions and congestion externalities into the economic analyses of the equilibrium properties of taxi markets. We take account of congestion externalities by adopting a realistic distance-based and delay-based taxi fare structure. We first investigate comparative static effects of regulatory variables of taxi fare and fleet size on the market and then examine the properties of the Pareto-efficient solutions for simultaneous maximization of social welfare and taxi profit in the congested market. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Built upon the previous studies, this paper incorporates both bilateral taxi–customer search frictions and congestion externalities into the economic analyses of the equilibrium properties of taxi markets. We take account of congestion externalities by adopting a realistic distance-based and delay-based taxi fare structure. We first investigate comparative static effects of regulatory variables of taxi fare and fleet size on the market and then examine the properties of the Pareto-efficient solutions for simultaneous maximization of social welfare and taxi profit in the congested market. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1208" xmlns="http://purl.org/rss/1.0/"><title>Modeling effects of different air traffic control operational procedures, separation rules, and service disciplines on runway landing capacity</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1208</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Modeling effects of different air traffic control operational procedures, separation rules, and service disciplines on runway landing capacity</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Milan Janic</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-24T01:01:02.144702-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1208</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1208</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1208</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper deals with modeling the possible effects of different advanced procedures, existing, innovative, and new air traffic control (ATC) separation rules, and service disciplines on the ultimate landing capacity of a single runway. The first implies a combination and/or exclusive use of conventional and steeper final approach and landing procedures. The second includes the current horizontal, innovative mixed horizontal/vertical and new vertical distance-based and time-based separation rules. The last embrace the common First Come, First Served and innovative Priority service discipline. Such increasingly complex and challenging applications are assumed to be based on the new technologies on-board the aircraft and at the ATC to be developed in the scope of the current United States Next Generation Air Transport System and European Single European Sky ATM Research programs.</p></div>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The convenient analytical models for calculating the runway landing capacity are developed and applied to the generic case of a single runway according to the “what–if” scenario approach. This enables carrying out the sensitivity analysis of the landing capacity with respect to the most influential factors – the ATC advanced operational procedures, separation rules, service disciplines, and aircraft fleet mix. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper deals with modeling the possible effects of different advanced procedures, existing, innovative, and new air traffic control (ATC) separation rules, and service disciplines on the ultimate landing capacity of a single runway. The first implies a combination and/or exclusive use of conventional and steeper final approach and landing procedures. The second includes the current horizontal, innovative mixed horizontal/vertical and new vertical distance-based and time-based separation rules. The last embrace the common First Come, First Served and innovative Priority service discipline. Such increasingly complex and challenging applications are assumed to be based on the new technologies on-board the aircraft and at the ATC to be developed in the scope of the current United States Next Generation Air Transport System and European Single European Sky ATM Research programs.
The convenient analytical models for calculating the runway landing capacity are developed and applied to the generic case of a single runway according to the “what–if” scenario approach. This enables carrying out the sensitivity analysis of the landing capacity with respect to the most influential factors – the ATC advanced operational procedures, separation rules, service disciplines, and aircraft fleet mix. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1204" xmlns="http://purl.org/rss/1.0/"><title>Novel Methods and the Maximum Likelihood Estimation Technique for Estimating Traffic Critical Gap</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1204</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Novel Methods and the Maximum Likelihood Estimation Technique for Estimating Traffic Critical Gap</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jonathan M. Bunker</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T02:05:19.76253-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1204</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1204</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1204</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Most unsignalised intersection capacity calculation procedures are based on gap acceptance models. Accuracy of critical gap estimation affects accuracy of capacity and delay estimation. Several methods have been published to estimate drivers' sample mean critical gap, the Maximum Likelihood Estimation (MLE) technique regarded as the most accurate. This study assesses three novel methods; Average Central Gap (ACG) method, Strength Weighted Central Gap method (SWCG), and Mode Central Gap method (MCG), against MLE for their fidelity in rendering true sample mean critical gaps. A Monte Carlo event based simulation model was used to draw the maximum rejected gap and accepted gap for each of a sample of 300 drivers across 32 simulation runs. Simulation mean critical gap is varied between 3s and 8s, while offered gap rate is varied between 0.05veh/s and 0.55veh/s. This study affirms that MLE provides a close to perfect fit to simulation mean critical gaps across a broad range of conditions. The MCG method also provides an almost perfect fit and has superior computational simplicity and efficiency to the MLE. The SWCG method performs robustly under high flows; however, poorly under low to moderate flows. Further research is recommended using field traffic data, under a variety of minor stream and major stream flow conditions for a variety of minor stream movement types, to compare critical gap estimates using MLE against MCG. Should the MCG method prove as robust as MLE, serious consideration should be given to its adoption to estimate critical gap parameters in guidelines. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Most unsignalised intersection capacity calculation procedures are based on gap acceptance models. Accuracy of critical gap estimation affects accuracy of capacity and delay estimation. Several methods have been published to estimate drivers' sample mean critical gap, the Maximum Likelihood Estimation (MLE) technique regarded as the most accurate. This study assesses three novel methods; Average Central Gap (ACG) method, Strength Weighted Central Gap method (SWCG), and Mode Central Gap method (MCG), against MLE for their fidelity in rendering true sample mean critical gaps. A Monte Carlo event based simulation model was used to draw the maximum rejected gap and accepted gap for each of a sample of 300 drivers across 32 simulation runs. Simulation mean critical gap is varied between 3s and 8s, while offered gap rate is varied between 0.05veh/s and 0.55veh/s. This study affirms that MLE provides a close to perfect fit to simulation mean critical gaps across a broad range of conditions. The MCG method also provides an almost perfect fit and has superior computational simplicity and efficiency to the MLE. The SWCG method performs robustly under high flows; however, poorly under low to moderate flows. Further research is recommended using field traffic data, under a variety of minor stream and major stream flow conditions for a variety of minor stream movement types, to compare critical gap estimates using MLE against MCG. Should the MCG method prove as robust as MLE, serious consideration should be given to its adoption to estimate critical gap parameters in guidelines. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1202" xmlns="http://purl.org/rss/1.0/"><title>Multicriteria evaluation on accessibility-based transportation equity in road network design problem</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1202</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Multicriteria evaluation on accessibility-based transportation equity in road network design problem</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tao Feng, Junyi Zhang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-08T02:37:42.414847-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1202</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1202</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1202</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper investigates the performance of accessibility-based equity measurements in transportation and proposes a multiobjective optimization model to simulate the trade-offs between equity maximization and cost minimization of network construction. The equity is defined as the spatial distribution of accessibilities across zone areas. Six representative indicators were formulated, including GINI coefficient, Theil index, mean log deviation, relative mean deviation, coefficient of variation, and Atkinson index, and incorporated into an equity maximization model to evaluate the performance sensitivity. A bilevel multiobjective optimization model was proposed to obtain the Pareto-optimal solutions for link capacity enhancement in a stochastic road network design problem. A numerical analysis using the Sioux Falls data was implemented. Results verified that the equity indicators are quite sensitive to the pattern of network scenarios in the sense that the level of equity varies according to the amount of overall capacity enhancement as well as the assignment of improved link segments. The suggested multiobjective model that enables representing the Pareto-optimal solutions can provide multiple options in the decision making of road network design. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper investigates the performance of accessibility-based equity measurements in transportation and proposes a multiobjective optimization model to simulate the trade-offs between equity maximization and cost minimization of network construction. The equity is defined as the spatial distribution of accessibilities across zone areas. Six representative indicators were formulated, including GINI coefficient, Theil index, mean log deviation, relative mean deviation, coefficient of variation, and Atkinson index, and incorporated into an equity maximization model to evaluate the performance sensitivity. A bilevel multiobjective optimization model was proposed to obtain the Pareto-optimal solutions for link capacity enhancement in a stochastic road network design problem. A numerical analysis using the Sioux Falls data was implemented. Results verified that the equity indicators are quite sensitive to the pattern of network scenarios in the sense that the level of equity varies according to the amount of overall capacity enhancement as well as the assignment of improved link segments. The suggested multiobjective model that enables representing the Pareto-optimal solutions can provide multiple options in the decision making of road network design. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1201" xmlns="http://purl.org/rss/1.0/"><title>Microscopic modeling of large-scale pedestrian–vehicle conflicts in the city of Madinah, Saudi Arabia</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1201</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Microscopic modeling of large-scale pedestrian–vehicle conflicts in the city of Madinah, Saudi Arabia</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hossam Abdelgawad, Amer Shalaby, Baher Abdulhai, Adnan Abdul-Aziz Gutub</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-27T05:20:24.358184-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1201</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1201</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1201</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a micro-simulation modeling framework for evaluating pedestrian–vehicle conflicts in crowded crossing areas. The framework adopts a simulation approach that models vehicles and pedestrians at the microscopic level while satisfying two sets of constraints: (1) flow constraints and (2) non-collision constraints. Pedestrians move across two-directional cells as opposed to one-dimensional lanes as in the case of vehicles; therefore, extra caution is considered when modeling the shared space between vehicles and pedestrians. The framework is used to assess large-scale pedestrian–vehicle conflicts in a highly congested ring road in the City of Madinah that carries 20 000 vehicles/hour and crossed by 140 000 pedestrians/hour after a major congregational prayer. The quantitative and visual results of the simulation exhibits serious conflicts between pedestrians and vehicles, resulting in considerable delays for pedestrians crossing the road (9 minutes average delay) and slow traffic conditions (average speed &lt;10 km/hour). The model is then used to evaluate the following three mitigating strategies: (1) pedestrian-only phase; (2) grade separation; and (3) pedestrian mall. A matrix of operational measures of effectiveness for network-wide performance (e.g., average travel time, average speed) and for pedestrian-specific performance (e.g., mean speed, mean density, mean delay, mean moving time) is used to assess the effectiveness of the proposed strategies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper presents a micro-simulation modeling framework for evaluating pedestrian–vehicle conflicts in crowded crossing areas. The framework adopts a simulation approach that models vehicles and pedestrians at the microscopic level while satisfying two sets of constraints: (1) flow constraints and (2) non-collision constraints. Pedestrians move across two-directional cells as opposed to one-dimensional lanes as in the case of vehicles; therefore, extra caution is considered when modeling the shared space between vehicles and pedestrians. The framework is used to assess large-scale pedestrian–vehicle conflicts in a highly congested ring road in the City of Madinah that carries 20 000 vehicles/hour and crossed by 140 000 pedestrians/hour after a major congregational prayer. The quantitative and visual results of the simulation exhibits serious conflicts between pedestrians and vehicles, resulting in considerable delays for pedestrians crossing the road (9 minutes average delay) and slow traffic conditions (average speed &lt;10 km/hour). The model is then used to evaluate the following three mitigating strategies: (1) pedestrian-only phase; (2) grade separation; and (3) pedestrian mall. A matrix of operational measures of effectiveness for network-wide performance (e.g., average travel time, average speed) and for pedestrian-specific performance (e.g., mean speed, mean density, mean delay, mean moving time) is used to assess the effectiveness of the proposed strategies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.219" xmlns="http://purl.org/rss/1.0/"><title>Highway drivers' willingness to pay for speeding violations in Taiwan</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.219</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Highway drivers' willingness to pay for speeding violations in Taiwan</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Rong-Chang Jou, Ke-Hong Chen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-13T23:57:28.559874-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.219</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.219</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.219</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This study investigates the effects of various factors on highway drivers' speeding behaviour and estimates the amount of money that a highway driver is willing to pay for speeding violations in Taiwan. The contingent valuation method is applied to measure drivers' preference and to derive the value function of the amount of money. Logit and probit models are estimated to analyse the significant variables influencing speeding behaviour and to calculate the willingness to pay for speeding violations. The research results show that increasing speeding fines is an effective way to reduce illegal driving behaviour on highways. Significant variables affecting highway drivers' speeding behaviour include gender, engine capacity, past offenders in the previous year, and the risk-seeking characteristics of drivers. Finally, the logit and probit models show that the amounts of money that highway drivers are willing to pay for speeding violations are $US119 and $US116, respectively. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This study investigates the effects of various factors on highway drivers' speeding behaviour and estimates the amount of money that a highway driver is willing to pay for speeding violations in Taiwan. The contingent valuation method is applied to measure drivers' preference and to derive the value function of the amount of money. Logit and probit models are estimated to analyse the significant variables influencing speeding behaviour and to calculate the willingness to pay for speeding violations. The research results show that increasing speeding fines is an effective way to reduce illegal driving behaviour on highways. Significant variables affecting highway drivers' speeding behaviour include gender, engine capacity, past offenders in the previous year, and the risk-seeking characteristics of drivers. Finally, the logit and probit models show that the amounts of money that highway drivers are willing to pay for speeding violations are $US119 and $US116, respectively. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1198" xmlns="http://purl.org/rss/1.0/"><title>Effectiveness of en route traffic information in developing countries using conventional discrete choice and neural-network models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1198</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Effectiveness of en route traffic information in developing countries using conventional discrete choice and neural-network models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Saeed Asadi Bagloee, Avi Ceder, Claire Bozic</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-13T01:47:06.496313-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1198</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1198</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1198</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Providing commuters with traffic information or advising them of alternative routes during traffic incidents can alleviate congestion. For decades, advanced traveler information services (ATIS) have been devised and dedicated to this role. ATIS comprises a wide variety of technologies across the world, including radio traffic information (RTI) advisory service. RTI is common in both developed and developing countries. Although extensive literature and evaluation results of ATISs and RTI are available in developed countries, little attention has been devoted to that in developing countries. This work provides a modeling platform to study drivers' response to en route traffic information provided by Radio-Payam broadcasting service in Tehran, the capital city of the developing country of Iran. The results are compared with counterpart cases in developed countries. Past studies and this study have employed conventional discrete models for drivers' response, such as ordered logit and ordered probit. This work evaluates the accuracy level of these conventional models in comparison with a developed neural-network (NN) model, because it has been widely proven that NN models are highly precise. It has also been found that, apart from reliability, the conventional models are within an acceptable level of prediction accuracy compared with the NN models. The results show a high degree of similarities between the case of Tehran and its counterparts in the developing countries. The results also deliver some insights on how to improve or better implement the ATIS technologies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Providing commuters with traffic information or advising them of alternative routes during traffic incidents can alleviate congestion. For decades, advanced traveler information services (ATIS) have been devised and dedicated to this role. ATIS comprises a wide variety of technologies across the world, including radio traffic information (RTI) advisory service. RTI is common in both developed and developing countries. Although extensive literature and evaluation results of ATISs and RTI are available in developed countries, little attention has been devoted to that in developing countries. This work provides a modeling platform to study drivers' response to en route traffic information provided by Radio-Payam broadcasting service in Tehran, the capital city of the developing country of Iran. The results are compared with counterpart cases in developed countries. Past studies and this study have employed conventional discrete models for drivers' response, such as ordered logit and ordered probit. This work evaluates the accuracy level of these conventional models in comparison with a developed neural-network (NN) model, because it has been widely proven that NN models are highly precise. It has also been found that, apart from reliability, the conventional models are within an acceptable level of prediction accuracy compared with the NN models. The results show a high degree of similarities between the case of Tehran and its counterparts in the developing countries. The results also deliver some insights on how to improve or better implement the ATIS technologies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1191" xmlns="http://purl.org/rss/1.0/"><title>A study of economic efficiency in port security inspection</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1191</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A study of economic efficiency in port security inspection</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Daegwun Yoon, Jingoo Gim</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-08T02:27:55.088399-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1191</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1191</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1191</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The purpose of this paper is to study an economic efficiency for the prediction of additional truck turnaround time and for determining the number of the port security inspection equipment required at a terminal inspection station. The economic efficiency with six base models was developed to assist terminal operators' decision-making. In addition, this study developed an optimal procedure that terminal operators could use to optimally run in terms of various statistics processes including exponential, deterministic, and others, seeking a solution that was beneficial for both terminal operators and truckers.</p></div><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>As a result of this research of the additional cargo turnaround time for port security delay, the following conclusion can be drawn and made. The average additional delay time in the inspection station is very dependent on the inspection rate of the lower stage. The higher weighted inspection time based on raising security level allows less number of trucks to be inspected, which will derive high delay in the inspection station. Increase of rate of Green Lane usage will allow a decrease in the arrival rate, which may derive improvement of inspection equipment efficiency and average delay time at the inspection station. In multiple stage model, total number of trucks and delay time very closely follow those of low inspection stage rate and number of inspection units. Free Lane is to be followed by Customs-Trade Partnership Against Terrorism and standardization of customs, packing, loading and unloading, documents, procedure, and exchange working in each country. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The purpose of this paper is to study an economic efficiency for the prediction of additional truck turnaround time and for determining the number of the port security inspection equipment required at a terminal inspection station. The economic efficiency with six base models was developed to assist terminal operators' decision-making. In addition, this study developed an optimal procedure that terminal operators could use to optimally run in terms of various statistics processes including exponential, deterministic, and others, seeking a solution that was beneficial for both terminal operators and truckers.As a result of this research of the additional cargo turnaround time for port security delay, the following conclusion can be drawn and made. The average additional delay time in the inspection station is very dependent on the inspection rate of the lower stage. The higher weighted inspection time based on raising security level allows less number of trucks to be inspected, which will derive high delay in the inspection station. Increase of rate of Green Lane usage will allow a decrease in the arrival rate, which may derive improvement of inspection equipment efficiency and average delay time at the inspection station. In multiple stage model, total number of trucks and delay time very closely follow those of low inspection stage rate and number of inspection units. Free Lane is to be followed by Customs-Trade Partnership Against Terrorism and standardization of customs, packing, loading and unloading, documents, procedure, and exchange working in each country. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1190" xmlns="http://purl.org/rss/1.0/"><title>Optimization of mixed cycle length traffic signals</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1190</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimization of mixed cycle length traffic signals</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Khewal Bhupendra Kesur</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-05-07T00:39:11.702507-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1190</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1190</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1190</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Mixed cycle length operation has been recommended for networks where individual intersections process considerably different traffic volumes. The signals to operate at lower or higher cycle lengths are determined heuristically. This paper demonstrates that the use of mixed cycle lengths as given by the heuristic is inferior to operation under a common cycle length. This contradicts findings in earlier studies, and the difference in conclusion is due to the use of updated optimization methodology. A procedure for incorporating the allocation of mixed cycle lengths into the global optimization of all signal timing variables by a genetic algorithm is proposed. The mixed cycle length timing plans obtained from this procedure are an improvement over those determined heuristically. Mixed cycle length operation is found to be of a more limited application than indicated in previous studies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Mixed cycle length operation has been recommended for networks where individual intersections process considerably different traffic volumes. The signals to operate at lower or higher cycle lengths are determined heuristically. This paper demonstrates that the use of mixed cycle lengths as given by the heuristic is inferior to operation under a common cycle length. This contradicts findings in earlier studies, and the difference in conclusion is due to the use of updated optimization methodology. A procedure for incorporating the allocation of mixed cycle lengths into the global optimization of all signal timing variables by a genetic algorithm is proposed. The mixed cycle length timing plans obtained from this procedure are an improvement over those determined heuristically. Mixed cycle length operation is found to be of a more limited application than indicated in previous studies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1189" xmlns="http://purl.org/rss/1.0/"><title>Examination of factors affecting freeway incident clearance times: a comparison of the generalized F model and several alternative nested models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1189</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Examination of factors affecting freeway incident clearance times: a comparison of the generalized F model and several alternative nested models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Indrajit Ghosh, Peter T. Savolainen, Timothy J. Gates</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-23T05:21:10.382509-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1189</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1189</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1189</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">ABSTRACT</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Traffic incidents are a principal cause of congestion on urban freeways, reducing capacity and creating risks for both involved motorists and incident response personnel. As incident durations increase, the risk of secondary incidents or crashes also becomes problematic. In response to these issues, many road agencies in metropolitan areas have initiated incident management programs aimed at detecting, responding to, and clearing incidents to restore freeways to full capacity as quickly and safely as possible. This study examined those factors that impact the time required by the Michigan Department of Transportation Freeway Courtesy Patrol to clear incidents that occurred on the southeastern Michigan freeway network. These models were developed using traffic flow data, roadway geometry information, and an extensive incident inventory database. A series of parametric hazard duration models were developed, each assuming a different underlying probability distribution for the hazard function. Although each modeling framework provided results that were similar in terms of the direction of factor effects, there was significant variability in terms of the estimated magnitude of these impacts. The generalized <em>F</em> distribution was shown to provide the best fit to the incident clearance time data, and the use of poorer fitting distributions was shown to result in severe over-estimation or under-estimation of factor effects. Those factors that were found to impact incident clearance times included the time of day and month when the incident occurred, the geometric and traffic characteristics of the freeway segment, and the characteristics of each incident. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Traffic incidents are a principal cause of congestion on urban freeways, reducing capacity and creating risks for both involved motorists and incident response personnel. As incident durations increase, the risk of secondary incidents or crashes also becomes problematic. In response to these issues, many road agencies in metropolitan areas have initiated incident management programs aimed at detecting, responding to, and clearing incidents to restore freeways to full capacity as quickly and safely as possible. This study examined those factors that impact the time required by the Michigan Department of Transportation Freeway Courtesy Patrol to clear incidents that occurred on the southeastern Michigan freeway network. These models were developed using traffic flow data, roadway geometry information, and an extensive incident inventory database. A series of parametric hazard duration models were developed, each assuming a different underlying probability distribution for the hazard function. Although each modeling framework provided results that were similar in terms of the direction of factor effects, there was significant variability in terms of the estimated magnitude of these impacts. The generalized F distribution was shown to provide the best fit to the incident clearance time data, and the use of poorer fitting distributions was shown to result in severe over-estimation or under-estimation of factor effects. Those factors that were found to impact incident clearance times included the time of day and month when the incident occurred, the geometric and traffic characteristics of the freeway segment, and the characteristics of each incident. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1182" xmlns="http://purl.org/rss/1.0/"><title>A probabilistic approach to calculate capacity of signalized intersections with a red light camera</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1182</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A probabilistic approach to calculate capacity of signalized intersections with a red light camera</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Manoj K. Jha, Yohannes Weldegiorgis</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-16T06:38:21.723908-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1182</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1182</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1182</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In recent years, red light cameras (RLCs) have been installed at many signalized intersections. The main reason behind installing RLCs is to reduce intersection-related accidents caused because of a driver's behavior to cross the intersection when the signal turns red. By nature, if the driver is aware of the presence of RLC his or her driving behavior is bound to change. This behavioral change, however, may be intentional or unintentional. This may influence the utilization of yellow intervals resulting in a possible increase in dilemma zone, which in turn, may reduce the service capacity of the intersection. To accurately capture this capacity reduction, we present a probabilistic approach to modify the saturation flow rate formula in the Highway Capacity Manual that is currently used to calculate the capacity of signalized intersections. We introduce a new factor in the saturation flow rate calculation called red light reduction factor, to account for the capacity reduction owing to RLCs. Using field data from Baltimore, Maryland, we establish a relationship for the red light reduction factor. We then show that capacity of RLC-equipped intersections is generally lower than that without RLCs. Although the percentage reduction in capacity of a single intersection may not seem significant, the cumulative impact of such reduction in a heavily traveled road network may be quite significant, resulting in significant loss in travel time. In future works, the systemwide capacity reduction owing to the presence of RLCs can be studied in congested transportation networks. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In recent years, red light cameras (RLCs) have been installed at many signalized intersections. The main reason behind installing RLCs is to reduce intersection-related accidents caused because of a driver's behavior to cross the intersection when the signal turns red. By nature, if the driver is aware of the presence of RLC his or her driving behavior is bound to change. This behavioral change, however, may be intentional or unintentional. This may influence the utilization of yellow intervals resulting in a possible increase in dilemma zone, which in turn, may reduce the service capacity of the intersection. To accurately capture this capacity reduction, we present a probabilistic approach to modify the saturation flow rate formula in the Highway Capacity Manual that is currently used to calculate the capacity of signalized intersections. We introduce a new factor in the saturation flow rate calculation called red light reduction factor, to account for the capacity reduction owing to RLCs. Using field data from Baltimore, Maryland, we establish a relationship for the red light reduction factor. We then show that capacity of RLC-equipped intersections is generally lower than that without RLCs. Although the percentage reduction in capacity of a single intersection may not seem significant, the cumulative impact of such reduction in a heavily traveled road network may be quite significant, resulting in significant loss in travel time. In future works, the systemwide capacity reduction owing to the presence of RLCs can be studied in congested transportation networks. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.204" xmlns="http://purl.org/rss/1.0/"><title>Comparative performance analysis of European airports by means of extended data envelopment analysis</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.204</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Comparative performance analysis of European airports by means of extended data envelopment analysis</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Soushi Suzuki, Peter Nijkamp, Eric Pels, Piet Rietveld</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-02T00:27:14.826638-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.204</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.204</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.204</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Data envelopment analysis (DEA) has become an established approach for analyzing and comparing efficiency results of corporate organizations or economic agents. It has also found wide application in comparative studies on airport efficiency. The standard DEA approach to comparative airport efficiency analysis has two feeble elements, viz. a methodological weakness and a substantive weakness. The methodological weakness originates from the choice of uniform efficiency improvement assessment, whereas the substantive weakness in airport efficiency analysis concerns the insufficient attention for short-term and long-term adjustment possibilities in the production inputs determining airport efficiency.</p></div><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The present paper aims to address both flaws by doing the following: (i) designing a data-instigated distance friction minimization (DFM) model as a generalization of the standard Banker–Charnes–Cooper model with a view to the development of a more appropriate efficiency improvement projection model in the Banker–Charnes–Cooper version of DEA and (ii) including as factor inputs also lumpy or rigid factors that are characterized by short-term indivisibility or inertia (and hence not suitable for short-run flexible adjustment in new efficiency stages), as is the case for runways of airports. This so-called fixed factor case will be included in the DFM submodel of the DEA. This extended DEA—with a DFM and a fixed factor component—will be applied to a comparative performance analysis of several major airports in Europe. Finally, our comparative study on airport efficiency analysis will be extended by incorporating also the added value of the presence of shopping facilities at airports for their relative economic performance. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Data envelopment analysis (DEA) has become an established approach for analyzing and comparing efficiency results of corporate organizations or economic agents. It has also found wide application in comparative studies on airport efficiency. The standard DEA approach to comparative airport efficiency analysis has two feeble elements, viz. a methodological weakness and a substantive weakness. The methodological weakness originates from the choice of uniform efficiency improvement assessment, whereas the substantive weakness in airport efficiency analysis concerns the insufficient attention for short-term and long-term adjustment possibilities in the production inputs determining airport efficiency.The present paper aims to address both flaws by doing the following: (i) designing a data-instigated distance friction minimization (DFM) model as a generalization of the standard Banker–Charnes–Cooper model with a view to the development of a more appropriate efficiency improvement projection model in the Banker–Charnes–Cooper version of DEA and (ii) including as factor inputs also lumpy or rigid factors that are characterized by short-term indivisibility or inertia (and hence not suitable for short-run flexible adjustment in new efficiency stages), as is the case for runways of airports. This so-called fixed factor case will be included in the DFM submodel of the DEA. This extended DEA—with a DFM and a fixed factor component—will be applied to a comparative performance analysis of several major airports in Europe. Finally, our comparative study on airport efficiency analysis will be extended by incorporating also the added value of the presence of shopping facilities at airports for their relative economic performance. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1186" xmlns="http://purl.org/rss/1.0/"><title>Alternatives in assigning short-term counts to seasonal adjustment factor groupings</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1186</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Alternatives in assigning short-term counts to seasonal adjustment factor groupings</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Ioannis Tsapakis, William H. Schneider, Andrew P. Nichols, James Haworth</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-27T04:34:03.616398-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1186</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1186</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1186</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The precise estimation of the annual average daily traffic (AADT) is a task of significant interest for many transportation authorities and Departments of Transportation. In this study, three methods are developed to improve the assignment of short-term counts to seasonal adjustment factor (SAF) groupings: the traditional functional classification, a discriminant analysis (DA), and a new statistical approach based on a weighted coefficient of variation (WCV). The data analyzed within this study are generated from all available continuous counters within the State of Ohio between 2002 and 2006. The analysis is conducted using SAFs that are separately calculated for the total volume and the directional specific volumes of a site. The results show that the directionally based assignment errors are statistically lower at a 95% confidence interval when compared with those generated by the total volume analysis. It is also found that the hourly time-of-day factors are more important in the assignment process than the average daily traffic. The directionally based WCV produces a decline in the average mean absolute percentage error (MAPE) over the roadway functional classification by 58% and in the standard deviation of the absolute error (SDAE) by 70%. On the contrary, the directionally based DA lowers the MAPE and the SDAE by 35% and 60%, respectively. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The precise estimation of the annual average daily traffic (AADT) is a task of significant interest for many transportation authorities and Departments of Transportation. In this study, three methods are developed to improve the assignment of short-term counts to seasonal adjustment factor (SAF) groupings: the traditional functional classification, a discriminant analysis (DA), and a new statistical approach based on a weighted coefficient of variation (WCV). The data analyzed within this study are generated from all available continuous counters within the State of Ohio between 2002 and 2006. The analysis is conducted using SAFs that are separately calculated for the total volume and the directional specific volumes of a site. The results show that the directionally based assignment errors are statistically lower at a 95% confidence interval when compared with those generated by the total volume analysis. It is also found that the hourly time-of-day factors are more important in the assignment process than the average daily traffic. The directionally based WCV produces a decline in the average mean absolute percentage error (MAPE) over the roadway functional classification by 58% and in the standard deviation of the absolute error (SDAE) by 70%. On the contrary, the directionally based DA lowers the MAPE and the SDAE by 35% and 60%, respectively. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1181" xmlns="http://purl.org/rss/1.0/"><title>Safety modeling for two-way left-turn lanes and a procedure to identify two-way left-turn lane segments with safety concerns</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1181</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Safety modeling for two-way left-turn lanes and a procedure to identify two-way left-turn lane segments with safety concerns</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jian John Lu, Shengdi Chen, Juan C. Pernia, Linjun Lu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-23T11:13:40.172569-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1181</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1181</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1181</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In the past, two-way left-turn lane (TWLTL) median treatments have been frequently used in Florida to inexpensively improve traffic and safety performances. In order to identify factors that may have significant impacts on safety operations in TWLTL sections and to identify TWLTL locations that present existing and future safety concerns, a research project was carried out and results are summarized in the paper. In the research, a three-year crash history database with crashes and section characteristics from a total of 1688 TWLTL sections all over Florida was developed and used. A negative binomial regression model was developed to determine the statistical relationship between the number of crashes per mile per year and several variables such as traffic volume, access density, posted speed, and number of lanes. In regard to the methodology, in order to identify locations with safety concerns, several steps are needed: development of real crash data distribution, determination of statistical distribution models that better represent the actual crash data, determination of percentile values for the average number of crashes, estimation of crash rates for sections with the same characteristics, estimation of critical values for the variables corresponding to the percentile values for average number of crashes, calculation of tables of critical average annual daily traffic values, and generation of a list of TWLTL locations with critical safety concerns. Results presented in the paper have been used in real applications. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In the past, two-way left-turn lane (TWLTL) median treatments have been frequently used in Florida to inexpensively improve traffic and safety performances. In order to identify factors that may have significant impacts on safety operations in TWLTL sections and to identify TWLTL locations that present existing and future safety concerns, a research project was carried out and results are summarized in the paper. In the research, a three-year crash history database with crashes and section characteristics from a total of 1688 TWLTL sections all over Florida was developed and used. A negative binomial regression model was developed to determine the statistical relationship between the number of crashes per mile per year and several variables such as traffic volume, access density, posted speed, and number of lanes. In regard to the methodology, in order to identify locations with safety concerns, several steps are needed: development of real crash data distribution, determination of statistical distribution models that better represent the actual crash data, determination of percentile values for the average number of crashes, estimation of crash rates for sections with the same characteristics, estimation of critical values for the variables corresponding to the percentile values for average number of crashes, calculation of tables of critical average annual daily traffic values, and generation of a list of TWLTL locations with critical safety concerns. Results presented in the paper have been used in real applications. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1183" xmlns="http://purl.org/rss/1.0/"><title>Solving train formation problem using simulated annealing algorithm in a simplex framework</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1183</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Solving train formation problem using simulated annealing algorithm in a simplex framework</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Masoud Yaghini, Mohsen Momeni, Mohammadreza Sarmadi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-21T01:00:40.290835-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1183</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1183</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1183</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The train formation plan (TFP) determines the train services and their frequencies and assigns the demands. The TFP models are often formulated as a capacitated service network design problem, and the optimal solution is normally difficult to find. In this paper, a hybrid algorithm of the Simplex method and simulated annealing is proposed for the TFP problem. The basic idea of the proposed algorithm is to use a simulated annealing algorithm to explore the solution space, where the revised Simplex method evaluates, selects, and implements the moves. In the proposed algorithm, the neighborhood structure is based on the pivoting rules of the Simplex method that provides an efficient method to reach the neighbors of the current solution. A state-of-the-art method is applied for parameters tuning by using the design of experiments approach. To evaluate the proposed model and the solution method, 25 test problems have been simulated and solved. The results show the efficiency and the effectiveness of the proposed approach. The proposed approach is implemented to develop the TFP in the Iranian railway as a case study. It is possible to save significant time and cost through solving the TFP problem by using the proposed algorithm and developing the efficient TFP plan in the railway networks. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The train formation plan (TFP) determines the train services and their frequencies and assigns the demands. The TFP models are often formulated as a capacitated service network design problem, and the optimal solution is normally difficult to find. In this paper, a hybrid algorithm of the Simplex method and simulated annealing is proposed for the TFP problem. The basic idea of the proposed algorithm is to use a simulated annealing algorithm to explore the solution space, where the revised Simplex method evaluates, selects, and implements the moves. In the proposed algorithm, the neighborhood structure is based on the pivoting rules of the Simplex method that provides an efficient method to reach the neighbors of the current solution. A state-of-the-art method is applied for parameters tuning by using the design of experiments approach. To evaluate the proposed model and the solution method, 25 test problems have been simulated and solved. The results show the efficiency and the effectiveness of the proposed approach. The proposed approach is implemented to develop the TFP in the Iranian railway as a case study. It is possible to save significant time and cost through solving the TFP problem by using the proposed algorithm and developing the efficient TFP plan in the railway networks. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.213" xmlns="http://purl.org/rss/1.0/"><title>Scheduling highway work zones with genetic algorithm considering the impact of traffic diversion</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.213</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Scheduling highway work zones with genetic algorithm considering the impact of traffic diversion</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Steven I-Jy Chien, Yimin Tang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-19T22:30:58.394323-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.213</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.213</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.213</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Highway work zones caused excessive delay to road users. To reduce user and maintenance costs, work zones shall be designed and scheduled accordingly. An analytical model is developed to jointly optimize work zone lengths and schedule as well as diverted traffic volume for highway maintenance projects, considering time-varying demand, variable maintenance cost, and various production rates of maintenance crew. With a genetic algorithm, an iterative procedure is developed to search for the optimal solution. A numerical example is illustrated, in which various traffic mitigation plans for a highway maintenance project are evaluated. A sensitivity analysis is conducted, and results indicate the threshold volumes for various conditions (e.g., maintenance crews and capacity of the work zone) at which diverting traffic is desirable. This study demonstrates an effective approach to search for the optimal work zone schedule, which is also applicable to evaluate the effectiveness of traffic diversion plans for a pre-planned work zone schedule. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Highway work zones caused excessive delay to road users. To reduce user and maintenance costs, work zones shall be designed and scheduled accordingly. An analytical model is developed to jointly optimize work zone lengths and schedule as well as diverted traffic volume for highway maintenance projects, considering time-varying demand, variable maintenance cost, and various production rates of maintenance crew. With a genetic algorithm, an iterative procedure is developed to search for the optimal solution. A numerical example is illustrated, in which various traffic mitigation plans for a highway maintenance project are evaluated. A sensitivity analysis is conducted, and results indicate the threshold volumes for various conditions (e.g., maintenance crews and capacity of the work zone) at which diverting traffic is desirable. This study demonstrates an effective approach to search for the optimal work zone schedule, which is also applicable to evaluate the effectiveness of traffic diversion plans for a pre-planned work zone schedule. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.200" xmlns="http://purl.org/rss/1.0/"><title>Attribute-based perceptual mapping using discriminant analysis in a public sector passenger bus transport company: A case study</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.200</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Attribute-based perceptual mapping using discriminant analysis in a public sector passenger bus transport company: A case study</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">M. Vetrivel Sezhian, C. Muralidharan, T. Nambirajan, S. G. Deshmukh</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-19T01:23:05.087163-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.200</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.200</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.200</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This study aims at evaluating the customer expectations in a public sector passenger transport company, a crucial sector in developing countries like India. A questionnaire containing 18 quality characteristics was administered to various customers of three bus depots of one division of a state road transport undertaking in South India. Attribute-based perceptual mapping using discriminant analysis was done to position the three depots and to identify their strengths and weaknesses. The findings would help prioritize different parameters and also provide guidelines for managers to focus on and to improve. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This study aims at evaluating the customer expectations in a public sector passenger transport company, a crucial sector in developing countries like India. A questionnaire containing 18 quality characteristics was administered to various customers of three bus depots of one division of a state road transport undertaking in South India. Attribute-based perceptual mapping using discriminant analysis was done to position the three depots and to identify their strengths and weaknesses. The findings would help prioritize different parameters and also provide guidelines for managers to focus on and to improve. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.198" xmlns="http://purl.org/rss/1.0/"><title>Measuring production and consumption efficiencies using the slack-based measure network data envelopment analysis approach: the case of low-cost carriers</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.198</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Measuring production and consumption efficiencies using the slack-based measure network data envelopment analysis approach: the case of low-cost carriers</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yu-Chun Chang, Ming-Miin Yu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-14T01:38:28.614804-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.198</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.198</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.198</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>One of the most important outcomes of the deregulation of air transportation policy is the emergence of low-cost carriers (LCCs) around the world. Although LCC airlines have been in operation for more than 30 years, not every LCC is successful. In order to reduce the inefficiencies of LCCs, this paper measures the performance of LCCs by using slack-based measure network data envelopment analysis. This model combines both the production process with input orientation and the consumption process with output orientation into a unified model. Furthermore, envelopment map analysis LCCs are performed to determine the reasons for the LCCs' inefficiency and how improvements can be made. A sample of 16 low-cost airlines from Europe, the USA, and Asia were selected for operational performance analysis. The results show that the main reason for easyJet's, US Airways', and Virgin Blue's inefficiency is production inefficiency, so these LCCs should reduce their input quantities to increase efficiency. Jet2, Aer Lingus, and JetBlue were, by contrast, found to be consumption inefficient; these LCCs should increase their output quantities in order to enhance performance. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>One of the most important outcomes of the deregulation of air transportation policy is the emergence of low-cost carriers (LCCs) around the world. Although LCC airlines have been in operation for more than 30 years, not every LCC is successful. In order to reduce the inefficiencies of LCCs, this paper measures the performance of LCCs by using slack-based measure network data envelopment analysis. This model combines both the production process with input orientation and the consumption process with output orientation into a unified model. Furthermore, envelopment map analysis LCCs are performed to determine the reasons for the LCCs' inefficiency and how improvements can be made. A sample of 16 low-cost airlines from Europe, the USA, and Asia were selected for operational performance analysis. The results show that the main reason for easyJet's, US Airways', and Virgin Blue's inefficiency is production inefficiency, so these LCCs should reduce their input quantities to increase efficiency. Jet2, Aer Lingus, and JetBlue were, by contrast, found to be consumption inefficient; these LCCs should increase their output quantities in order to enhance performance. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.202" xmlns="http://purl.org/rss/1.0/"><title>A reliability-based traffic assignment model for multi-modal transport network under demand uncertainty</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.202</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A reliability-based traffic assignment model for multi-modal transport network under demand uncertainty</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xiao Fu, William H. K. Lam, Bi Yu Chen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-13T05:38:57.099547-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.202</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.202</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.202</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In densely populated and congested urban areas, the travel times in congested multi-modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day-to-day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on-time arrival. In view of these, this paper presents a reliability-based user equilibrium traffic assignment model for congested multi-modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state-augmented multi-modal transport network is adopted in this paper to effectively model probable transfers and non-linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In densely populated and congested urban areas, the travel times in congested multi-modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day-to-day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on-time arrival. In view of these, this paper presents a reliability-based user equilibrium traffic assignment model for congested multi-modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state-augmented multi-modal transport network is adopted in this paper to effectively model probable transfers and non-linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1180" xmlns="http://purl.org/rss/1.0/"><title>Fleet size determination for a truckload distribution center</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1180</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Fleet size determination for a truckload distribution center</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Shan-Huen Huang, Ta-Hui Yang, Ching-Hui Tang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-12T23:24:50.512432-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1180</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1180</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1180</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This work presents an analysis of the fleet size determination problem for a truckload distribution center in which each customer requests multi-truckload services. A transformation is made to define this problem as a cutting stock problem which can be resolved by finding the proper set of patterns beneficial for an NP-hard (non-deterministic polynomial-time hard) problem. The genetic algorithm (GA) is combined with cutting stock techniques to solve the problem. Experiments are carried out testing two types of problems, with and without time-window constraints. To verify the solution quality obtained with the proposed approach, the problem is also solved using only GA. It is shown that the proposed approach can significantly improve the GA solution by 14.68%. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This work presents an analysis of the fleet size determination problem for a truckload distribution center in which each customer requests multi-truckload services. A transformation is made to define this problem as a cutting stock problem which can be resolved by finding the proper set of patterns beneficial for an NP-hard (non-deterministic polynomial-time hard) problem. The genetic algorithm (GA) is combined with cutting stock techniques to solve the problem. Experiments are carried out testing two types of problems, with and without time-window constraints. To verify the solution quality obtained with the proposed approach, the problem is also solved using only GA. It is shown that the proposed approach can significantly improve the GA solution by 14.68%. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.211" xmlns="http://purl.org/rss/1.0/"><title>Rear-end crash potential estimation in the work zone merging areas</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.211</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Rear-end crash potential estimation in the work zone merging areas</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jinxian Weng, Qiang Meng</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-09T01:43:28.323201-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.211</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.211</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.211</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposed a methodology to estimate rear-end crash potential of the merging vehicles traveling in the merge lane, on the basis of the traffic data extracting from the available videotapes. First, we developed a binary logit model to identify drivers' merging behavior in the work zone merging area. Subsequently, the occurrence potential of rear-end crash based on time-to-collision was computed between the merging vehicle and its neighboring vehicles. The overall crash potential of the merging vehicle was finally determined. It was found that the crash potential decreases with the remaining distance to work zone. Moreover, there will be a rear-end crash potential of 4.0% if the merging vehicle fails to complete merging at the end of work zone merging area. If the merging vehicle takes an early merge, there will be a lower rear-end crash potential (1.2%). These findings suggest that we should encourage merging vehicles to take early merges for improving the traffic safety in the work zone merging areas. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper proposed a methodology to estimate rear-end crash potential of the merging vehicles traveling in the merge lane, on the basis of the traffic data extracting from the available videotapes. First, we developed a binary logit model to identify drivers' merging behavior in the work zone merging area. Subsequently, the occurrence potential of rear-end crash based on time-to-collision was computed between the merging vehicle and its neighboring vehicles. The overall crash potential of the merging vehicle was finally determined. It was found that the crash potential decreases with the remaining distance to work zone. Moreover, there will be a rear-end crash potential of 4.0% if the merging vehicle fails to complete merging at the end of work zone merging area. If the merging vehicle takes an early merge, there will be a lower rear-end crash potential (1.2%). These findings suggest that we should encourage merging vehicles to take early merges for improving the traffic safety in the work zone merging areas. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.190" xmlns="http://purl.org/rss/1.0/"><title>A programmable calculation procedure for number of traffic conflict points at highway intersections</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.190</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A programmable calculation procedure for number of traffic conflict points at highway intersections</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jian John Lu, Shengdi Chen, Xing Ge, Fuquan Pan</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-07T04:44:42.731287-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.190</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.190</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.190</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Traffic movement conflict points at intersections are the points at which traffic movements intersect (including crossing, merging, and diverging). Numbers and distribution of different types of conflict points are used to evaluate intersection access management designs and safety performance. Traditionally, the determination of the numbers of conflict points for different traffic movements is based on manual methods, which causes the difficulty for computerized procedures to evaluate safety performance of different access management designs. Sometimes, a programmable calculation procedure may provide more effective solutions as compared with manual methods. This paper presents a programmable calculation procedure for the determination of the numbers of conflict points, which could be used as a basis for a computerized procedure. Concepts of virtual movement lanes and intersection quadrants are introduced to specify types of intersections, traffic lane configurations, and traffic movement regulations. Calculation models, based on such concepts, for traffic movement conflict points at signalized and unsignalized intersections can be obtained. In support of the procedure, case studies are presented in the paper. The procedure presented in the paper can be programmed into a computer program for the purpose of a computerized evaluation of intersection safety and design performance of different access management or control approaches. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Traffic movement conflict points at intersections are the points at which traffic movements intersect (including crossing, merging, and diverging). Numbers and distribution of different types of conflict points are used to evaluate intersection access management designs and safety performance. Traditionally, the determination of the numbers of conflict points for different traffic movements is based on manual methods, which causes the difficulty for computerized procedures to evaluate safety performance of different access management designs. Sometimes, a programmable calculation procedure may provide more effective solutions as compared with manual methods. This paper presents a programmable calculation procedure for the determination of the numbers of conflict points, which could be used as a basis for a computerized procedure. Concepts of virtual movement lanes and intersection quadrants are introduced to specify types of intersections, traffic lane configurations, and traffic movement regulations. Calculation models, based on such concepts, for traffic movement conflict points at signalized and unsignalized intersections can be obtained. In support of the procedure, case studies are presented in the paper. The procedure presented in the paper can be programmed into a computer program for the purpose of a computerized evaluation of intersection safety and design performance of different access management or control approaches. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.218" xmlns="http://purl.org/rss/1.0/"><title>Risk-based stochastic equilibrium assignment model in augmented urban railway network</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.218</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Risk-based stochastic equilibrium assignment model in augmented urban railway network</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Wu Jianjun, Sun Huijun, Gao Ziyou, Han Linghui, Si Bingfeng</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-06T23:14:43.787324-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.218</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.218</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.218</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This study developed a methodology to model the passenger flow stochastic assignment in urban railway network (URN) with the considerations of risk attitude. Through the network augmentation technique, the urban railway system is represented by an augmented network in which the common traffic assignment method can be used directly similar to a generalized network form. Using the analysis of different cases including deterministic travel state, emergent event, peak travel, and completely stochastic state, we developed a stochastic equilibrium formulation to capture these stochastic considerations and give effects of risk aversion level on the URN performance, the passenger flow at transfer stations through numerical studies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This study developed a methodology to model the passenger flow stochastic assignment in urban railway network (URN) with the considerations of risk attitude. Through the network augmentation technique, the urban railway system is represented by an augmented network in which the common traffic assignment method can be used directly similar to a generalized network form. Using the analysis of different cases including deterministic travel state, emergent event, peak travel, and completely stochastic state, we developed a stochastic equilibrium formulation to capture these stochastic considerations and give effects of risk aversion level on the URN performance, the passenger flow at transfer stations through numerical studies. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.206" xmlns="http://purl.org/rss/1.0/"><title>A fuzzy stochastic approach to the multicriteria selection of an aircraft for regional chartering</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.206</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A fuzzy stochastic approach to the multicriteria selection of an aircraft for regional chartering</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Luiz Flavio Autran Monteiro Gomes, Joao Erick Mattos Fernandes, João Carlos C. B. Soares Mello</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-06T07:50:53.952792-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.206</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.206</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.206</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This article deals with the problem of decision support for the selection of an aircraft. This is a problem faced by an airline company that is investing in regional charter flights in Brazil. The company belongs to an economic group whose core business is logistics. The problem has eight alternatives to be evaluated under 11 different criteria, whose measurements can be exact, stochastic, or fuzzy. The technique chosen for analyzing and then finding a solution to the problem is the multicriteria decision aiding method named NAIADE (Novel Approach to Imprecise Assessment and Decision Environments). The method used allows tackling the problems by working with quantitative as well as qualitative criteria under uncertainty and imprecision. Another considerable advantage of NAIADE over other multicriteria methods relies in its characteristics of not requiring a prior definition of the weights by the decision maker. As a conclusion, it can be said that the use of NAIADE provided for consistent results to that aircraft selection problem. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This article deals with the problem of decision support for the selection of an aircraft. This is a problem faced by an airline company that is investing in regional charter flights in Brazil. The company belongs to an economic group whose core business is logistics. The problem has eight alternatives to be evaluated under 11 different criteria, whose measurements can be exact, stochastic, or fuzzy. The technique chosen for analyzing and then finding a solution to the problem is the multicriteria decision aiding method named NAIADE (Novel Approach to Imprecise Assessment and Decision Environments). The method used allows tackling the problems by working with quantitative as well as qualitative criteria under uncertainty and imprecision. Another considerable advantage of NAIADE over other multicriteria methods relies in its characteristics of not requiring a prior definition of the weights by the decision maker. As a conclusion, it can be said that the use of NAIADE provided for consistent results to that aircraft selection problem. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.215" xmlns="http://purl.org/rss/1.0/"><title>A macro model for traffic flow on road networks with varying road conditions</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.215</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A macro model for traffic flow on road networks with varying road conditions</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tie-Qiao Tang, Lou Caccetta, Yong-Hong Wu, Hai-Jun Huang, Xiao-Bao Yang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-06T07:43:44.945647-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.215</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.215</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.215</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we develop a macro traffic flow model with consideration of varying road conditions. Our analytical and numerical results illustrate that good road condition can enhance the speed and flow of uniform traffic flow whereas bad road condition will reduce the speed and flow. The numerical results also show that good road condition can smooth shock wave and improve the stability of traffic flow whereas bad road condition will lead to steeper shock wave and reduce the stability of traffic flow. Our results are also qualitatively accordant with empirical results, which implies that the proposed model can qualitatively describe the effects of road conditions on traffic flow. These results can guide traffic engineers to improve the road quality in traffic engineering. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In this paper, we develop a macro traffic flow model with consideration of varying road conditions. Our analytical and numerical results illustrate that good road condition can enhance the speed and flow of uniform traffic flow whereas bad road condition will reduce the speed and flow. The numerical results also show that good road condition can smooth shock wave and improve the stability of traffic flow whereas bad road condition will lead to steeper shock wave and reduce the stability of traffic flow. Our results are also qualitatively accordant with empirical results, which implies that the proposed model can qualitatively describe the effects of road conditions on traffic flow. These results can guide traffic engineers to improve the road quality in traffic engineering. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.196" xmlns="http://purl.org/rss/1.0/"><title>Effect of road width and traffic volume on vehicular interactions in heterogeneous traffic</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.196</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Effect of road width and traffic volume on vehicular interactions in heterogeneous traffic</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Karuppanagounder Krishnamurthy, Venkatachalam Thamizh Arasan</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-02T03:24:48.197727-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.196</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.196</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.196</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Highway traffic flow phenomena involve several complex and stochastic variables with high interdependencies. The variations in roadway, traffic and environmental factors influence the traffic flow quality significantly. Capacity analysis of road sections under different traffic and geometric conditions need to quantify the vehicles of widely varying characteristics to a common and universally acceptable unit. Passenger car unit (PCU) is the universally adopted unit of traffic volume, keeping the passenger car as the ‘standard vehicle’ with reference to its static and dynamic characteristics; other vehicles are expressed to its equivalent number in terms of PCUs. The studies carried out in this aspect represent the dynamic nature of impedance caused by a vehicle while moving through a traffic stream. The PCU values recommended by the Highway Capacity Manual are widely applied in many countries; however, their applicability is highly under debate because of the variations in prevailing local traffic conditions. There are several factors that influence the PCU values such as traffic, roadway, vehicle, environmental and control conditions, etc. Apart from vehicular characteristics, the other two major factors that influence the PCU of vehicles are the following: (i) road width and (ii) traffic volume. In this study, estimation of PCU values for the different types of vehicles of a highly heterogeneous traffic on 7.5- and 11.0-m-wide roads, using micro-simulation technique, has been dealt with. It has been found that the PCU value of a vehicle type varies significantly with variation in road width and traffic volume. The results of the study indicate that the PCU values are significantly influenced by the said two factors. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Highway traffic flow phenomena involve several complex and stochastic variables with high interdependencies. The variations in roadway, traffic and environmental factors influence the traffic flow quality significantly. Capacity analysis of road sections under different traffic and geometric conditions need to quantify the vehicles of widely varying characteristics to a common and universally acceptable unit. Passenger car unit (PCU) is the universally adopted unit of traffic volume, keeping the passenger car as the ‘standard vehicle’ with reference to its static and dynamic characteristics; other vehicles are expressed to its equivalent number in terms of PCUs. The studies carried out in this aspect represent the dynamic nature of impedance caused by a vehicle while moving through a traffic stream. The PCU values recommended by the Highway Capacity Manual are widely applied in many countries; however, their applicability is highly under debate because of the variations in prevailing local traffic conditions. There are several factors that influence the PCU values such as traffic, roadway, vehicle, environmental and control conditions, etc. Apart from vehicular characteristics, the other two major factors that influence the PCU of vehicles are the following: (i) road width and (ii) traffic volume. In this study, estimation of PCU values for the different types of vehicles of a highly heterogeneous traffic on 7.5- and 11.0-m-wide roads, using micro-simulation technique, has been dealt with. It has been found that the PCU value of a vehicle type varies significantly with variation in road width and traffic volume. The results of the study indicate that the PCU values are significantly influenced by the said two factors. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.205" xmlns="http://purl.org/rss/1.0/"><title>A multi-class mean-excess traffic equilibrium model with elastic demand</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.205</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A multi-class mean-excess traffic equilibrium model with elastic demand</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xiangdong Xu, Anthony Chen, Zhong Zhou, Lin Cheng</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-01T10:41:36.700491-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.205</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.205</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.205</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Recent empirical studies have revealed that travel time variability plays an important role in travelers' route choice decisions. To simultaneously account for both reliability and unreliability aspects of travel time variability, the concept of mean-excess travel time (METT) was recently proposed as a new risk-averse route choice criterion. In this paper, we extend the mean-excess traffic equilibrium model to include heterogeneous risk-aversion attitudes and elastic demand. Specifically, this model explicitly considers (1) multiple user classes with different risk-aversions toward travel time variability when making <em>route choice</em> decisions under uncertainty and (2) the elasticity of travel demand as a function of METT when making <em>travel choice</em> decisions under uncertainty. This model is thus capable of modeling travelers' heterogeneous risk-averse behaviors with both travel choice and route choice considerations. The proposed model is formulated as a variational inequality problem and solved via a route-based algorithm using the modified alternating direction method. Numerical analyses are also provided to illustrate the features of the proposed model and the applicability of the solution algorithm. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Recent empirical studies have revealed that travel time variability plays an important role in travelers' route choice decisions. To simultaneously account for both reliability and unreliability aspects of travel time variability, the concept of mean-excess travel time (METT) was recently proposed as a new risk-averse route choice criterion. In this paper, we extend the mean-excess traffic equilibrium model to include heterogeneous risk-aversion attitudes and elastic demand. Specifically, this model explicitly considers (1) multiple user classes with different risk-aversions toward travel time variability when making route choice decisions under uncertainty and (2) the elasticity of travel demand as a function of METT when making travel choice decisions under uncertainty. This model is thus capable of modeling travelers' heterogeneous risk-averse behaviors with both travel choice and route choice considerations. The proposed model is formulated as a variational inequality problem and solved via a route-based algorithm using the modified alternating direction method. Numerical analyses are also provided to illustrate the features of the proposed model and the applicability of the solution algorithm. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.201" xmlns="http://purl.org/rss/1.0/"><title>Bayesian imputation of non-chosen attribute values in revealed preference surveys</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.201</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Bayesian imputation of non-chosen attribute values in revealed preference surveys</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Simon Washington, Srinath Ravulaparthy, John M. Rose, David Hensher, Ram Pendyala</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-02-28T07:58:59.838029-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.201</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.201</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.201</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Obtaining attribute values of non-chosen alternatives in a revealed preference context is challenging because non-chosen alternative attributes are unobserved by choosers, chooser perceptions of attribute values may not reflect reality, existing methods for imputing these values suffer from shortcomings, and obtaining non-chosen attribute values is resource intensive. This paper presents a unique Bayesian (multiple) Imputation Multinomial Logit model that imputes unobserved travel times and distances of non-chosen travel modes based on random draws from the conditional posterior distribution of missing values. The calibrated Bayesian (multiple) Imputation Multinomial Logit model imputes non-chosen time and distance values that convincingly replicate observed choice behavior. Although network skims were used for calibration, more realistic data such as supplemental geographically referenced surveys or stated preference data may be preferred. The model is ideally suited for imputing variation in intrazonal non-chosen mode attributes and for assessing the marginal impacts of travel policies, programs, or prices within traffic analysis zones. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Obtaining attribute values of non-chosen alternatives in a revealed preference context is challenging because non-chosen alternative attributes are unobserved by choosers, chooser perceptions of attribute values may not reflect reality, existing methods for imputing these values suffer from shortcomings, and obtaining non-chosen attribute values is resource intensive. This paper presents a unique Bayesian (multiple) Imputation Multinomial Logit model that imputes unobserved travel times and distances of non-chosen travel modes based on random draws from the conditional posterior distribution of missing values. The calibrated Bayesian (multiple) Imputation Multinomial Logit model imputes non-chosen time and distance values that convincingly replicate observed choice behavior. Although network skims were used for calibration, more realistic data such as supplemental geographically referenced surveys or stated preference data may be preferred. The model is ideally suited for imputing variation in intrazonal non-chosen mode attributes and for assessing the marginal impacts of travel policies, programs, or prices within traffic analysis zones. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.181" xmlns="http://purl.org/rss/1.0/"><title>Operational performance comparison of four unconventional intersection designs using micro-simulation</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.181</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Operational performance comparison of four unconventional intersection designs using micro-simulation</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jarvis Autey, Tarek Sayed, Mohamed El Esawey</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-02-20T15:00:59.718824-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.181</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.181</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.181</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Several unconventional intersection designs have been proposed as an innovative approach to mitigate congestion at heavily congested at-grade signalized intersections. Many of these unconventional designs were shown to outperform conventional intersections in terms of the average control delay and the overall intersection capacity. Little research has been conducted to compare the performance of these unconventional intersections to each other under different volume conditions. This study evaluated and compared the operational performance of four unconventional intersection schemes: the crossover displaced left-turn (XDL), the upstream signalized crossover (USC), the double crossover intersection (DXI) (i.e., half USC), and the median U-turn (MUT). The micro-simulation software <span class="smallCaps">vissim</span> (PTV Planung Transport Verkehr AG, Karlsruhe, Germany) was used to model and analyze the four unconventional intersections as well as a counterpart conventional one. The results showed that the XDL intersection constantly exhibited the lowest delays at nearly all tested balanced and unbalanced volume levels. The operational performance of both the USC and the DXI was similar in most volume conditions. The MUT design, on the other hand, was unable to accommodate high approach volumes and heavy left-turn traffic. The capacity of the XDL intersection was found to be 99% higher than that of the conventional intersection, whereas the capacity of the USC and the DXI intersections was about 50% higher than that of the conventional intersection. The results of this study can provide guidance on choosing among alternative unconventional designs according to the prevailing traffic conditions at an intersection. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Several unconventional intersection designs have been proposed as an innovative approach to mitigate congestion at heavily congested at-grade signalized intersections. Many of these unconventional designs were shown to outperform conventional intersections in terms of the average control delay and the overall intersection capacity. Little research has been conducted to compare the performance of these unconventional intersections to each other under different volume conditions. This study evaluated and compared the operational performance of four unconventional intersection schemes: the crossover displaced left-turn (XDL), the upstream signalized crossover (USC), the double crossover intersection (DXI) (i.e., half USC), and the median U-turn (MUT). The micro-simulation software vissim (PTV Planung Transport Verkehr AG, Karlsruhe, Germany) was used to model and analyze the four unconventional intersections as well as a counterpart conventional one. The results showed that the XDL intersection constantly exhibited the lowest delays at nearly all tested balanced and unbalanced volume levels. The operational performance of both the USC and the DXI was similar in most volume conditions. The MUT design, on the other hand, was unable to accommodate high approach volumes and heavy left-turn traffic. The capacity of the XDL intersection was found to be 99% higher than that of the conventional intersection, whereas the capacity of the USC and the DXI intersections was about 50% higher than that of the conventional intersection. The results of this study can provide guidance on choosing among alternative unconventional designs according to the prevailing traffic conditions at an intersection. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.194" xmlns="http://purl.org/rss/1.0/"><title>Travel demand estimation risk for high-speed railway transport considering travel price competition</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.194</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Travel demand estimation risk for high-speed railway transport considering travel price competition</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Kenetsu Uchida, Nao Sugiki</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-02-20T15:00:50.784178-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.194</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.194</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.194</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">ABSTRACT</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The Hokkaido Shinkansen (HS) bullet train line is under consideration to open in 2020. In this study, travel demand is estimated for the HS. Because some explanatory variables that are used for such estimation can have estimation errors, travel demand estimation risk is also calculated. In addition, because the HS can compete with airlines for modal share, the impacts of travel price competition (TPC) on the travel demand and the demand estimation risk are also estimated. In this study, the travel demand estimation risk is measured as the variance or the SD of the stochastic travel demand. The analysis reveals the following: the modal share of HS is 16% less when TPC is considered than when it is not considered; TPC causes the travel demand estimation risk to decrease; the probabilities of the HS operating at a deficit with and without consideration of TPC are calculated as 31.2% and 1.25%, respectively, and the increase in the mean consumer surplus accruing from the HS is calculated as JPY 47bn/year ($US588m/year) without TPC and as JPY 66bn/year ($US825m/year) with TPC. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The Hokkaido Shinkansen (HS) bullet train line is under consideration to open in 2020. In this study, travel demand is estimated for the HS. Because some explanatory variables that are used for such estimation can have estimation errors, travel demand estimation risk is also calculated. In addition, because the HS can compete with airlines for modal share, the impacts of travel price competition (TPC) on the travel demand and the demand estimation risk are also estimated. In this study, the travel demand estimation risk is measured as the variance or the SD of the stochastic travel demand. The analysis reveals the following: the modal share of HS is 16% less when TPC is considered than when it is not considered; TPC causes the travel demand estimation risk to decrease; the probabilities of the HS operating at a deficit with and without consideration of TPC are calculated as 31.2% and 1.25%, respectively, and the increase in the mean consumer surplus accruing from the HS is calculated as JPY 47bn/year ($US588m/year) without TPC and as JPY 66bn/year ($US825m/year) with TPC. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.217" xmlns="http://purl.org/rss/1.0/"><title>Trip generation modeling using data collected in single and repeated cross-sectional surveys</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.217</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Trip generation modeling using data collected in single and repeated cross-sectional surveys</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Judith L. Mwakalonge, Daniel A. Badoe</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-02-20T14:59:36.211055-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.217</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.217</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.217</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The majority of US metropolitan regions still use the four-step urban transportation modeling system to develop their travel forecasts. Trip generation, the first step of this system, has as objective of predicting the expected total travel demand in a region. The commonly used methods in planning practice for predicting this expected total travel demand typically use only the most recent cross-sectional data available from a study region for model development, which ties the resulting travel-forecast model to the economic environment prevailing at the time of data collection. Applying such models to generate forecasts of travel in economic environments significantly different from those embodied in the estimated model parameters could result in greater errors than would otherwise be the case.</p></div><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>To address the aforementioned problem, this paper proposes the development of trip generation models estimated on multiple independent cross-sectional datasets collected in the same urban region but at different times representing different economic environments. Data used in the research were collected in cross-sectional household travel behavior surveys undertaken in the Greater Toronto Area, Canada in 1986, 1996, 2001, and 2006.</p></div><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The results lead to the conclusion that well-specified models, estimated on pooled multiple cross-sectional datasets, yield travel predictions in the base and horizon years, respectively, that have smaller error compared with corresponding travel predictions generated with single cross-sectional models. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The majority of US metropolitan regions still use the four-step urban transportation modeling system to develop their travel forecasts. Trip generation, the first step of this system, has as objective of predicting the expected total travel demand in a region. The commonly used methods in planning practice for predicting this expected total travel demand typically use only the most recent cross-sectional data available from a study region for model development, which ties the resulting travel-forecast model to the economic environment prevailing at the time of data collection. Applying such models to generate forecasts of travel in economic environments significantly different from those embodied in the estimated model parameters could result in greater errors than would otherwise be the case.To address the aforementioned problem, this paper proposes the development of trip generation models estimated on multiple independent cross-sectional datasets collected in the same urban region but at different times representing different economic environments. Data used in the research were collected in cross-sectional household travel behavior surveys undertaken in the Greater Toronto Area, Canada in 1986, 1996, 2001, and 2006.The results lead to the conclusion that well-specified models, estimated on pooled multiple cross-sectional datasets, yield travel predictions in the base and horizon years, respectively, that have smaller error compared with corresponding travel predictions generated with single cross-sectional models. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.191" xmlns="http://purl.org/rss/1.0/"><title>A new lost time estimation method for right-turn traffic in Japan considering signal phasing and sneakers</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.191</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A new lost time estimation method for right-turn traffic in Japan considering signal phasing and sneakers</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Keshuang Tang, Takeshi Ono, Masao Kuwahara, Shinji Tanaka</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-01-26T07:52:49.028556-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.191</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.191</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.191</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Precise estimation of the capacity for right-turn traffic (comparable to left-turn traffic in the USA) is of great importance to determine signal phasing schemes at signalized intersections in Japan, where the left-hand driving rule is valid. However, in most signal timing procedures across the world, the lost time of right-turn traffic is simply determined by the duration of intergreen intervals and thus lacks considerations of various signal phasing and driver behavior. Meanwhile, sneakers per cycle are usually applied to account for the number of drivers completing right turns during the effective red portion of the clearance-and-change intervals. As a result, an initial cycle length must be hypothesized in order to assess the total number of sneakers within the analysis period. Consequently, a time-consuming iterative calculation process often becomes necessary. Therefore, the present study aims to develop a new lost time estimation method for right-turn traffic to overcome the aforementioned drawbacks. Lost times of right-turn traffic under three conventional phasing plans are theoretically formulated on the basis of a time–space diagram and shock-wave theory. The new method is validated using field data, with case studies of its application in the signal timing procedure. Results indicated that the proposed method is capable of offering more accurate estimation than conventional approaches, which leads to shorter cycle length and simplifies signal timing process by eliminating an iterative check to determine the number of sneakers. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Precise estimation of the capacity for right-turn traffic (comparable to left-turn traffic in the USA) is of great importance to determine signal phasing schemes at signalized intersections in Japan, where the left-hand driving rule is valid. However, in most signal timing procedures across the world, the lost time of right-turn traffic is simply determined by the duration of intergreen intervals and thus lacks considerations of various signal phasing and driver behavior. Meanwhile, sneakers per cycle are usually applied to account for the number of drivers completing right turns during the effective red portion of the clearance-and-change intervals. As a result, an initial cycle length must be hypothesized in order to assess the total number of sneakers within the analysis period. Consequently, a time-consuming iterative calculation process often becomes necessary. Therefore, the present study aims to develop a new lost time estimation method for right-turn traffic to overcome the aforementioned drawbacks. Lost times of right-turn traffic under three conventional phasing plans are theoretically formulated on the basis of a time–space diagram and shock-wave theory. The new method is validated using field data, with case studies of its application in the signal timing procedure. Results indicated that the proposed method is capable of offering more accurate estimation than conventional approaches, which leads to shorter cycle length and simplifies signal timing process by eliminating an iterative check to determine the number of sneakers. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.192" xmlns="http://purl.org/rss/1.0/"><title>Distributions of travel time variability on urban roads</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.192</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Distributions of travel time variability on urban roads</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Susilawati Susilawati, Michael A. P. Taylor, Sekhar V. C. Somenahalli</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:32:28.658447-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.192</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.192</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.192</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Reliability is an important factor in route, mode and also departure time choice analysis and is a key performance indicator for transport systems. However, the current metrics used to measure travel time variability may be not sufficient to fully represent reliability. Better understanding of the distributions of travel times is needed for the development of improved metrics for reliability. A comprehensive data analysis involving the assessment of longitudinal travel time data for two urban arterial road corridors in Adelaide, Australia, demonstrates that the observed distributions are more complex than previously assumed. The data sets demonstrate strong positive skew, very long upper tails, and sometimes bimodality. This paper proposes the use of alternative statistical distributions for travel time variability, with the Burr Type XII distribution emerging as an appropriate model for both links and routes. This statistical distribution has some attractive properties that make it suitable for explicit definition of many travel time reliability metrics. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Reliability is an important factor in route, mode and also departure time choice analysis and is a key performance indicator for transport systems. However, the current metrics used to measure travel time variability may be not sufficient to fully represent reliability. Better understanding of the distributions of travel times is needed for the development of improved metrics for reliability. A comprehensive data analysis involving the assessment of longitudinal travel time data for two urban arterial road corridors in Adelaide, Australia, demonstrates that the observed distributions are more complex than previously assumed. The data sets demonstrate strong positive skew, very long upper tails, and sometimes bimodality. This paper proposes the use of alternative statistical distributions for travel time variability, with the Burr Type XII distribution emerging as an appropriate model for both links and routes. This statistical distribution has some attractive properties that make it suitable for explicit definition of many travel time reliability metrics. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.186" xmlns="http://purl.org/rss/1.0/"><title>Visco-elastic traffic flow model</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.186</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Visco-elastic traffic flow model</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Zuojin Zhu, Chun Yang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:32:14.621562-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.186</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.186</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.186</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>To increase our understanding of the operations of traffic system, a visco-elastic traffic model was proposed in analogy of non-Newtonian fluid mechanics. The traffic model is based on mass and momentum conservations, and includes a constitutive relation similar to that of linear visco-elastic fluids. The further inclusion of the elastic effect allows us to describe a high-order traffic model more comprehensively because the use of relaxation time indicates that vehicle drivers adjust their time headway in a reasonable and safe range. The self-organizing behaviour is described by introducing the effects of pressure and visco-elasticity from the point of view in fluid mechanics. Both the viscosity and elasticity can be determined by using the relaxation time and the traffic sound speed. The sound speed can be approximately represented by the road operational parameters including the free-flow speed, the jam density, and the density of saturation if the jam pressure in traffic flows is identical to the total pressure at the flow saturation point. A linear stability analysis showed that the traffic flow should be absolutely unstable for disturbances with short spatial wavelengths. There are two critical points of regime transition in traffic flows. The first point happens at the density of saturation, and the second point occurs at a density relating on the sound speed and the fundamental diagram of traffic flows. By using a triangular form flow–density relation, a numerical test based on the new model is carried out for congested traffic flows on a loop road without ramp effect. The numerical results are discussed and compared with the result of theoretical analysis and observation data of traffic flows. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>To increase our understanding of the operations of traffic system, a visco-elastic traffic model was proposed in analogy of non-Newtonian fluid mechanics. The traffic model is based on mass and momentum conservations, and includes a constitutive relation similar to that of linear visco-elastic fluids. The further inclusion of the elastic effect allows us to describe a high-order traffic model more comprehensively because the use of relaxation time indicates that vehicle drivers adjust their time headway in a reasonable and safe range. The self-organizing behaviour is described by introducing the effects of pressure and visco-elasticity from the point of view in fluid mechanics. Both the viscosity and elasticity can be determined by using the relaxation time and the traffic sound speed. The sound speed can be approximately represented by the road operational parameters including the free-flow speed, the jam density, and the density of saturation if the jam pressure in traffic flows is identical to the total pressure at the flow saturation point. A linear stability analysis showed that the traffic flow should be absolutely unstable for disturbances with short spatial wavelengths. There are two critical points of regime transition in traffic flows. The first point happens at the density of saturation, and the second point occurs at a density relating on the sound speed and the fundamental diagram of traffic flows. By using a triangular form flow–density relation, a numerical test based on the new model is carried out for congested traffic flows on a loop road without ramp effect. The numerical results are discussed and compared with the result of theoretical analysis and observation data of traffic flows. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.188" xmlns="http://purl.org/rss/1.0/"><title>Random regret minimization or random utility maximization: an exploratory analysis in the context of automobile fuel choice</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.188</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Random regret minimization or random utility maximization: an exploratory analysis in the context of automobile fuel choice</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">David A. Hensher, William H. Greene, Caspar G. Chorus</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:31:16.863872-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.188</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.188</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.188</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Interest in alternative behavioural paradigms to random utility maximization (RUM) has existed ever since the dominance of the RUM formulation. One alternative is known as random regret minimization (RRM), which suggests that when choosing between alternatives, decision makers aim to minimize anticipated regret. Although the idea of regret is not new, its incorporation into the same discrete choice framework of RUM is very recent. This paper is the first to apply the RRM-model framework to model choice amongst durable goods. Specifically, we estimate and compare the RRM and RUM models in a stated choice context of choosing amongst vehicles fuelled with petrol, diesel and hybrid (associated with specific levels of fuel efficiency and engine capacity). The RRM model is found to achieve a marginally better fit (using a non-nested test of differences) than its equally parsimonious RUM counterpart. As a second contribution, we derive a formulation for regret-based elasticities and compare utility-based and regret-based elasticities in the context of stated vehicle type choices. We find that in the context of our choice data, mean estimates of elasticities are different for many of the attributes and alternatives. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Interest in alternative behavioural paradigms to random utility maximization (RUM) has existed ever since the dominance of the RUM formulation. One alternative is known as random regret minimization (RRM), which suggests that when choosing between alternatives, decision makers aim to minimize anticipated regret. Although the idea of regret is not new, its incorporation into the same discrete choice framework of RUM is very recent. This paper is the first to apply the RRM-model framework to model choice amongst durable goods. Specifically, we estimate and compare the RRM and RUM models in a stated choice context of choosing amongst vehicles fuelled with petrol, diesel and hybrid (associated with specific levels of fuel efficiency and engine capacity). The RRM model is found to achieve a marginally better fit (using a non-nested test of differences) than its equally parsimonious RUM counterpart. As a second contribution, we derive a formulation for regret-based elasticities and compare utility-based and regret-based elasticities in the context of stated vehicle type choices. We find that in the context of our choice data, mean estimates of elasticities are different for many of the attributes and alternatives. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.189" xmlns="http://purl.org/rss/1.0/"><title>About the possibilities of using the renewable energy power sources on railway transport</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.189</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">About the possibilities of using the renewable energy power sources on railway transport</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Pavel Vorobiev, Yuri Vorobiev</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:31:06.829469-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.189</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.189</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.189</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Several electrification systems based on renewable energy power sources (first of all, solar energy) are discussed in respect to their applicability to railway transport and, in particular, to suburban electric trains. Two systems are considered with basic technical details and economic estimation, both including the onboard bank of batteries and the photovoltaic converters (PVC) of solar energy for compensation of energy expenses, which could be positioned either on stations or on wagon's roofs. Sun-tracking systems and their effect on the solar energy conversion efficiency are discussed in application to stationary and moving PVC platforms. An analysis made shows that introduction of the “green” systems discussed will not only have positive ecological impact, but also can bring a notable economical effect even with today's components, while it could be considerably greater with the usage of new PVCs, which are being developed by the authors. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Several electrification systems based on renewable energy power sources (first of all, solar energy) are discussed in respect to their applicability to railway transport and, in particular, to suburban electric trains. Two systems are considered with basic technical details and economic estimation, both including the onboard bank of batteries and the photovoltaic converters (PVC) of solar energy for compensation of energy expenses, which could be positioned either on stations or on wagon's roofs. Sun-tracking systems and their effect on the solar energy conversion efficiency are discussed in application to stationary and moving PVC platforms. An analysis made shows that introduction of the “green” systems discussed will not only have positive ecological impact, but also can bring a notable economical effect even with today's components, while it could be considerably greater with the usage of new PVCs, which are being developed by the authors. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.180" xmlns="http://purl.org/rss/1.0/"><title>Practical approach for travel time estimation from point traffic detector data</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.180</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Practical approach for travel time estimation from point traffic detector data</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Luou Shen, Mohammed Hadi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:31:01.813949-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.180</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.180</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.180</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Accurate estimation of travel time is critical to the success of advanced traffic management systems and advanced traveler information systems. Travel time estimation also provides basic data support for travel time reliability research, which is being recognized as an important performance measure of the transportation system. This paper investigates a number of methods to address the three major issues associated with travel time estimation from point traffic detector data: data filling for missing or error data, speed transformation from time-mean speed to space-mean speed, and travel time estimation that converts the speeds recorded at detector locations to travel time along the highway segment. The case study results show that the spatial and temporal interpolation of missing data and the transformation to space-mean speed improve the accuracy of the estimates of travel time. The results also indicate that the piecewise constant-acceleration-based method developed in this study and the average speed method produce better results than the other three methods proposed in previous studies. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Accurate estimation of travel time is critical to the success of advanced traffic management systems and advanced traveler information systems. Travel time estimation also provides basic data support for travel time reliability research, which is being recognized as an important performance measure of the transportation system. This paper investigates a number of methods to address the three major issues associated with travel time estimation from point traffic detector data: data filling for missing or error data, speed transformation from time-mean speed to space-mean speed, and travel time estimation that converts the speeds recorded at detector locations to travel time along the highway segment. The case study results show that the spatial and temporal interpolation of missing data and the transformation to space-mean speed improve the accuracy of the estimates of travel time. The results also indicate that the piecewise constant-acceleration-based method developed in this study and the average speed method produce better results than the other three methods proposed in previous studies. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.182" xmlns="http://purl.org/rss/1.0/"><title>Heavy commercial vehicles-following behavior and interactions with different vehicle classes</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.182</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Heavy commercial vehicles-following behavior and interactions with different vehicle classes</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Majid Sarvi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:30:51.101145-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.182</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.182</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.182</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This work investigates the effect of heavy commercial vehicles on the capacity and overall performance of congested freeway sections. Furthermore, the following behaviors of heavy commercial vehicles and its comparison with passenger cars are presented. Freeways are designed to facilitate the flow of traffic including passenger cars and trucks. The impact of these different vehicle types is not uniform, creating problems in freeway operations and safety particularly under heavy demand with a high proportion of heavy vehicles. There have been very few studies concerned with the traffic behavior and characteristics of heavy vehicles in these situations. This study draws on extensive data collected over a long stretch of freeway using videotaping and surveys at several sites. The collected data were firstly used to study the interaction between heavy vehicles and passenger cars. Through a detailed trajectory analysis, the following behaviors of 120 heavy vehicles were then analyzed to provide a thorough understanding of heavy vehicles-following behavior mechanism. The results showed a significant difference in the following behavior of heavy vehicles compared with other vehicles. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This work investigates the effect of heavy commercial vehicles on the capacity and overall performance of congested freeway sections. Furthermore, the following behaviors of heavy commercial vehicles and its comparison with passenger cars are presented. Freeways are designed to facilitate the flow of traffic including passenger cars and trucks. The impact of these different vehicle types is not uniform, creating problems in freeway operations and safety particularly under heavy demand with a high proportion of heavy vehicles. There have been very few studies concerned with the traffic behavior and characteristics of heavy vehicles in these situations. This study draws on extensive data collected over a long stretch of freeway using videotaping and surveys at several sites. The collected data were firstly used to study the interaction between heavy vehicles and passenger cars. Through a detailed trajectory analysis, the following behaviors of 120 heavy vehicles were then analyzed to provide a thorough understanding of heavy vehicles-following behavior mechanism. The results showed a significant difference in the following behavior of heavy vehicles compared with other vehicles. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.178" xmlns="http://purl.org/rss/1.0/"><title>An improved car-following model for railway traffic</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.178</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">An improved car-following model for railway traffic</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">KePing Li, ZiYou Gao</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:30:18.282561-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.178</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.178</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.178</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we propose an improved traffic model for simulating train movement in railway traffic. The proposed model is based on optimal velocity car-following model. In order to test the proposed model, we use it to simulate the train movement with fixed-block system. In simulations, we analyze and discuss the space–time diagram of railway traffic flow and the trajectories of train movement. Simulation results demonstrate that the proposed model can be successfully used for simulating the train movement in railway traffic. From the space–time diagram, we find some complex phenomena of train flow, which are observed in real railway traffic, such as train delays. By analyzing the trajectories of train movement, some dynamic characteristics of trains can be reproduced. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

In this paper, we propose an improved traffic model for simulating train movement in railway traffic. The proposed model is based on optimal velocity car-following model. In order to test the proposed model, we use it to simulate the train movement with fixed-block system. In simulations, we analyze and discuss the space–time diagram of railway traffic flow and the trajectories of train movement. Simulation results demonstrate that the proposed model can be successfully used for simulating the train movement in railway traffic. From the space–time diagram, we find some complex phenomena of train flow, which are observed in real railway traffic, such as train delays. By analyzing the trajectories of train movement, some dynamic characteristics of trains can be reproduced. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.183" xmlns="http://purl.org/rss/1.0/"><title>Evaluating competitiveness using fuzzy analytic hierarchy process—A case study of Chinese airlines</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.183</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Evaluating competitiveness using fuzzy analytic hierarchy process—A case study of Chinese airlines</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chong Wu, Xin-ying Zhang, I-Cheng Yeh, Fei-yu Chen, Jacob Bender, Tie-nan Wang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-30T09:28:42.007988-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.183</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.183</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.183</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>With the development of a national market economy, the Chinese aviation industry is now confronted with international competition. Therefore, it is necessary to research the competitive status of Chinese national aviation, as well as advice on how to enhance the competitiveness of the Chinese aviation industry. The main objective of this paper is to propose FAHP as an effective solution for resolving the uncertainty and imprecision in the evaluation of airlines' competitiveness. In this paper, we review the research of industrial international aviation competitiveness at both home and abroad, discuss a theoretical framework for the study of aviation competitiveness, establish an index system with five first-order indicators and 17 second-order indicators, set up a Chinese aviation competitiveness model based on simple fuzzy numbers from the fuzzy analytic hierarchy process, and evaluate the competitiveness of five major Chinese airlines. The results showed that this model and these indicators are scientific and practical, with a wide range of application prospects for the purpose of improving and increasing Chinese airline competitiveness in the international market. The effective approach presented in this paper is especially applicable when subjective judgments on performance ratings and attribute weights are not accessible or reliable, or when suitable decision makers are not available. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>With the development of a national market economy, the Chinese aviation industry is now confronted with international competition. Therefore, it is necessary to research the competitive status of Chinese national aviation, as well as advice on how to enhance the competitiveness of the Chinese aviation industry. The main objective of this paper is to propose FAHP as an effective solution for resolving the uncertainty and imprecision in the evaluation of airlines' competitiveness. In this paper, we review the research of industrial international aviation competitiveness at both home and abroad, discuss a theoretical framework for the study of aviation competitiveness, establish an index system with five first-order indicators and 17 second-order indicators, set up a Chinese aviation competitiveness model based on simple fuzzy numbers from the fuzzy analytic hierarchy process, and evaluate the competitiveness of five major Chinese airlines. The results showed that this model and these indicators are scientific and practical, with a wide range of application prospects for the purpose of improving and increasing Chinese airline competitiveness in the international market. The effective approach presented in this paper is especially applicable when subjective judgments on performance ratings and attribute weights are not accessible or reliable, or when suitable decision makers are not available. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.185" xmlns="http://purl.org/rss/1.0/"><title>Integrated smart feeder/shuttle transit service: simulation of new routing strategies</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.185</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Integrated smart feeder/shuttle transit service: simulation of new routing strategies</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Avishai (Avi) Ceder</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-12-14T10:29:54.140863-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.185</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.185</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.185</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The idea of designing an integrated smart feeder/shuttle service stemmed from the need to overcome the problem of using an excessive number of cars arriving and parking at a train station within the same time span. This problem results in high parking demand around the train station. Moreover, some potential train riders will, instead, use their cars and hence become a party to increasing the traffic congestion. This work develops a new idea of an integrated and innovative feeder/shuttle system with new operating and routing concepts. The fulfilled objectives are as follows: (i) to construct and examine different operating strategies from both the user and operator perspectives; (ii) to examine different routing models and scenarios; and (iii) to construct a simulation tool for (i) and (ii). Ten different routing strategies are examined, with all the combinations of fixed/flexible routes, fixed/flexible schedules, a unidirectional or bidirectional concept, and shortcut (shortest path) and/or short-turn (turnaround) concepts. These strategies are investigated by employing a simulation model specifically developed and constructed for this purpose. This simulation model is used in a case study of Castro Valley in California in which the feeder/shuttle service is coordinated with the Bay Area Rapid Transit service, and the 10 routing strategies are compared in regard to four fleet-size scenarios. One of the interesting results found is that the fixed-route and flexible-route concepts are comparable in performance measures when applying a combination of operating strategies. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The idea of designing an integrated smart feeder/shuttle service stemmed from the need to overcome the problem of using an excessive number of cars arriving and parking at a train station within the same time span. This problem results in high parking demand around the train station. Moreover, some potential train riders will, instead, use their cars and hence become a party to increasing the traffic congestion. This work develops a new idea of an integrated and innovative feeder/shuttle system with new operating and routing concepts. The fulfilled objectives are as follows: (i) to construct and examine different operating strategies from both the user and operator perspectives; (ii) to examine different routing models and scenarios; and (iii) to construct a simulation tool for (i) and (ii). Ten different routing strategies are examined, with all the combinations of fixed/flexible routes, fixed/flexible schedules, a unidirectional or bidirectional concept, and shortcut (shortest path) and/or short-turn (turnaround) concepts. These strategies are investigated by employing a simulation model specifically developed and constructed for this purpose. This simulation model is used in a case study of Castro Valley in California in which the feeder/shuttle service is coordinated with the Bay Area Rapid Transit service, and the 10 routing strategies are compared in regard to four fleet-size scenarios. One of the interesting results found is that the fixed-route and flexible-route concepts are comparable in performance measures when applying a combination of operating strategies. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.187" xmlns="http://purl.org/rss/1.0/"><title>Inferring origin–destination trip matrices from aggregate volumes on groups of links: a case study using volumes inferred from mobile phone data</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.187</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Inferring origin–destination trip matrices from aggregate volumes on groups of links: a case study using volumes inferred from mobile phone data</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Noelia Caceres, Luis M. Romero, Francisco G. Benitez</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-10-14T02:23:10.127627-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.187</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.187</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.187</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The origin–destination matrix is an important source of information describing transport demand in a region. Most commonly used methods for matrix estimation use link volumes collected on a subset of links in order to update an existing matrix. Traditional volume data collection methods have significant shortcomings because of the high costs involved and the fact that detectors only provide status information at specified locations in the network. Better matrix estimates can be obtained when information is available about the overall distribution of traffic through time and space. Other existing technologies are not used in matrix estimation methods because they collect volume data aggregated on groups of links, rather than on single links. That is the case of mobile systems. Mobile phones sometimes cannot provide location accuracy for estimating flows on single links but do so on groups of links; in contrast, data can be acquired over a wider coverage without additional costs. This paper presents a methodology adapted to the concept of volume aggregated on groups of links in order to use any available volume data source in traditional matrix estimation methodologies. To calculate volume data, we have used a model that has had promising results in transforming phone call data into traffic movement data. The proposed methodology using vehicle volumes obtained by such a model is applied over a large real network as a case study. The experimental results reveal the efficiency and consistency of the solution proposed, making the alternative attractive for practical applications. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The origin–destination matrix is an important source of information describing transport demand in a region. Most commonly used methods for matrix estimation use link volumes collected on a subset of links in order to update an existing matrix. Traditional volume data collection methods have significant shortcomings because of the high costs involved and the fact that detectors only provide status information at specified locations in the network. Better matrix estimates can be obtained when information is available about the overall distribution of traffic through time and space. Other existing technologies are not used in matrix estimation methods because they collect volume data aggregated on groups of links, rather than on single links. That is the case of mobile systems. Mobile phones sometimes cannot provide location accuracy for estimating flows on single links but do so on groups of links; in contrast, data can be acquired over a wider coverage without additional costs. This paper presents a methodology adapted to the concept of volume aggregated on groups of links in order to use any available volume data source in traditional matrix estimation methodologies. To calculate volume data, we have used a model that has had promising results in transforming phone call data into traffic movement data. The proposed methodology using vehicle volumes obtained by such a model is applied over a large real network as a case study. The experimental results reveal the efficiency and consistency of the solution proposed, making the alternative attractive for practical applications. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.184" xmlns="http://purl.org/rss/1.0/"><title>An innovative method for the analysis of vehicle movements in roundabouts based on image processing</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.184</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">An innovative method for the analysis of vehicle movements in roundabouts based on image processing</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Lorenzo Mussone, Matteo Matteucci, Marco Bassani, Davide Rizzi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-10-13T23:01:51.835676-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.184</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.184</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.184</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The objective of this paper is to propose a method, based on the image processing of field survey data, to analyze vehicles movements into roundabouts. This research study consisted of three stages: a field survey to collect vehicular flow images captured by video cameras, the processing of these images using a proprietary software (VeTRA—Vehicle Tracking for Roundabout Analysis), and finally, the analysis of the collected data.</p></div><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The main feature of the software is that it allows the automatic computation of the main variables necessary to rank and evaluate a generic roundabout: the entry/exit (E/E) matrix with classification of vehicles (e.g., heavy, light, and motorbikes), vehicle trajectories, and vehicular speed diagrams along the paths inside the roundabout. The processing system is robust enough to withstand classic problems affecting image processing such as variable wind conditions, cloud cover, shadows, and obstructions. Calibration and error evaluation have been deduced from data collected by a high precision Real Time Kinematic GPS video recording system mounted on a probe vehicle. Data of E/E matrices generated by VeTRA are compared with those manually counted on the corresponding video images.</p></div><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>A case study of an existing roundabout is featured in the paper. The results indicate that the software has a high capability of generating the E/E matrix. The analysis of vehicular trajectories with both the plot of curvature diagrams and the corresponding speed diagrams enable the evaluation of driver behavior relative to the geometric shape of the roundabout. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The objective of this paper is to propose a method, based on the image processing of field survey data, to analyze vehicles movements into roundabouts. This research study consisted of three stages: a field survey to collect vehicular flow images captured by video cameras, the processing of these images using a proprietary software (VeTRA—Vehicle Tracking for Roundabout Analysis), and finally, the analysis of the collected data.The main feature of the software is that it allows the automatic computation of the main variables necessary to rank and evaluate a generic roundabout: the entry/exit (E/E) matrix with classification of vehicles (e.g., heavy, light, and motorbikes), vehicle trajectories, and vehicular speed diagrams along the paths inside the roundabout. The processing system is robust enough to withstand classic problems affecting image processing such as variable wind conditions, cloud cover, shadows, and obstructions. Calibration and error evaluation have been deduced from data collected by a high precision Real Time Kinematic GPS video recording system mounted on a probe vehicle. Data of E/E matrices generated by VeTRA are compared with those manually counted on the corresponding video images.A case study of an existing roundabout is featured in the paper. The results indicate that the software has a high capability of generating the E/E matrix. The analysis of vehicular trajectories with both the plot of curvature diagrams and the corresponding speed diagrams enable the evaluation of driver behavior relative to the geometric shape of the roundabout. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.179" xmlns="http://purl.org/rss/1.0/"><title>Relationships among service quality, corporate image, customer satisfaction, and behavioral intention for the elderly in high speed rail services</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.179</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Relationships among service quality, corporate image, customer satisfaction, and behavioral intention for the elderly in high speed rail services</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chung-Wei Kuo, Mei-Ling Tang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-10-07T04:10:28.874135-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.179</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.179</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.179</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Summary</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Since the Taiwan High Speed Rail operations, Taiwan's transportation market entered into a new era. Because of its competitive service of speed, convenience, environmental concerns and comfort, the High Speed Rail has not only made significant changes but has played a significant role in Taiwan's transportation. However, Taiwan now is an aging society. Due to the physical constraints among the elderly, demands to redesign the traffic system and maintain transportation safety are essential considerations. In the current market, Taiwan's transportation construction is facing fewer barriers; however, it must still improve, especially considering the health of the elderly. Thus, this study investigates elderly passengers' demands and further examined the relationships among service quality, corporate image, customer satisfaction, and behavioral intention. According to empirical analytical results based on structural equation modeling (N = 341), satisfaction directly affected travel behaviors, while service quality and corporate image played indirect roles. In addition, service quality plays a significant role on the effect of satisfaction. This study provides empirical evidence to indicate the quality of the accessible environment affects not only the effectiveness and efficiency of service quality, but also, the corporate image. The results provide valuable references for critically managing the elderly's usage of the high speed rail transportation service. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Since the Taiwan High Speed Rail operations, Taiwan's transportation market entered into a new era. Because of its competitive service of speed, convenience, environmental concerns and comfort, the High Speed Rail has not only made significant changes but has played a significant role in Taiwan's transportation. However, Taiwan now is an aging society. Due to the physical constraints among the elderly, demands to redesign the traffic system and maintain transportation safety are essential considerations. In the current market, Taiwan's transportation construction is facing fewer barriers; however, it must still improve, especially considering the health of the elderly. Thus, this study investigates elderly passengers' demands and further examined the relationships among service quality, corporate image, customer satisfaction, and behavioral intention. According to empirical analytical results based on structural equation modeling (N = 341), satisfaction directly affected travel behaviors, while service quality and corporate image played indirect roles. In addition, service quality plays a significant role on the effect of satisfaction. This study provides empirical evidence to indicate the quality of the accessible environment affects not only the effectiveness and efficiency of service quality, but also, the corporate image. The results provide valuable references for critically managing the elderly's usage of the high speed rail transportation service. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.177" xmlns="http://purl.org/rss/1.0/"><title>Distributed computing approaches for large-scale probit-based stochastic user equilibrium problems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.177</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Distributed computing approaches for large-scale probit-based stochastic user equilibrium problems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Zhiyuan Liu, Qiang Meng</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-05-24T04:43:44.669386-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.177</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.177</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.177</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="atr177-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>Applications of probit-based stochastic user equilibrium (SUE) principle on large-scale networks have been largely limited because of the overwhelming computational burden in solving its stochastic network loading problem. A two-stage Monte Carlo simulation method is recognized to have satisfactory accuracy level when solving this stochastic network loading. This paper thus works on the acceleration of the Monte Carlo simulation method via using distributed computing system. Three distributed computing approaches are then adopted on the workload partition of the Monte Carlo simulation method. Wherein, the first approach allocates each processor in the distributed computing system to solve each trial of the simulation in parallel and in turns, and the second approach assigns all the processors to solve the shortest-path problems in one trial of the Monte Carlo simulation concurrently. The third approach is a combination of the first two, wherein both different trials of the Monte Carlo simulation as well as the shortest path problems in one trial are solved simultaneously. Performances of the three approaches are comprehensively tested by the Sioux-Falls network and then a randomly generated network example. It shows that computational time for the probit-based SUE problem can be largely reduced by any of these three approaches, and the first approach is found out to be superior to the other two. The first approach is then selected to calculate the probit-based SUE problem on a large-scale network example. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Applications of probit-based stochastic user equilibrium (SUE) principle on large-scale networks have been largely limited because of the overwhelming computational burden in solving its stochastic network loading problem. A two-stage Monte Carlo simulation method is recognized to have satisfactory accuracy level when solving this stochastic network loading. This paper thus works on the acceleration of the Monte Carlo simulation method via using distributed computing system. Three distributed computing approaches are then adopted on the workload partition of the Monte Carlo simulation method. Wherein, the first approach allocates each processor in the distributed computing system to solve each trial of the simulation in parallel and in turns, and the second approach assigns all the processors to solve the shortest-path problems in one trial of the Monte Carlo simulation concurrently. The third approach is a combination of the first two, wherein both different trials of the Monte Carlo simulation as well as the shortest path problems in one trial are solved simultaneously. Performances of the three approaches are comprehensively tested by the Sioux-Falls network and then a randomly generated network example. It shows that computational time for the probit-based SUE problem can be largely reduced by any of these three approaches, and the first approach is found out to be superior to the other two. The first approach is then selected to calculate the probit-based SUE problem on a large-scale network example. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.175" xmlns="http://purl.org/rss/1.0/"><title>Airport taxi planning: Lagrangian decomposition</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.175</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Airport taxi planning: Lagrangian decomposition</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Ángel G. Marín</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-05-06T03:11:34.874443-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.175</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.175</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.175</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="atr175-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>The airport taxi planning (TP) module is a decision tool intended to guide airport surface management operations. TP is defined by a flow network optimization model that represents flight ground movements and improves aircraft taxiing routes and schedules during periods of aircraft congestion. TP is not intended to operate as a stand-alone tool for airport operations management: on the contrary, it must be used in conjunction with existing departing and arriving traffic tools and overseen by the taxi planner of the airport, also known as the aircraft ground controller. TP must be flexible in order to accommodate changing inputs while maintaining consistent routes and schedules already delivered from past executions. Within this dynamic environment, the execution time of TP may not exceed a few minutes. Classic methods for solving binary multi-commodity flow networks with side constraints are not efficient enough; therefore, a Lagrangian decomposition methodology has been adapted to solve it. We demonstrate TP Lagrangian decomposition using actual data from the Madrid-Barajas Airport. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The airport taxi planning (TP) module is a decision tool intended to guide airport surface management operations. TP is defined by a flow network optimization model that represents flight ground movements and improves aircraft taxiing routes and schedules during periods of aircraft congestion. TP is not intended to operate as a stand-alone tool for airport operations management: on the contrary, it must be used in conjunction with existing departing and arriving traffic tools and overseen by the taxi planner of the airport, also known as the aircraft ground controller. TP must be flexible in order to accommodate changing inputs while maintaining consistent routes and schedules already delivered from past executions. Within this dynamic environment, the execution time of TP may not exceed a few minutes. Classic methods for solving binary multi-commodity flow networks with side constraints are not efficient enough; therefore, a Lagrangian decomposition methodology has been adapted to solve it. We demonstrate TP Lagrangian decomposition using actual data from the Madrid-Barajas Airport. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.174" xmlns="http://purl.org/rss/1.0/"><title>Optimizing sustainable feeder bus operation considering realistic networks and heterogeneous demand</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.174</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimizing sustainable feeder bus operation considering realistic networks and heterogeneous demand</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Patricia DiJoseph, Steven I-Jy Chien</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-05-02T04:33:27.981219-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.174</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.174</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.174</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>A mathematical model is developed to optimize social and fiscal sustainable operation of a feeder bus system considering realistic network and heterogeneous demand. The objective total profit is a nonlinear, mixed integer function, which is maximized by optimizing the number of stops, headway, and fare. The stops are located which maximize the ridership. The demand elasticity for the bus service is dependent on passengers' access distance, wait time, in-vehicle time, and fare. An optimization algorithm is developed to search for the optimal solution that maximizes the profit. The modeling approach is applied to planning a bus transit system within Woodbridge, New Jersey. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>A mathematical model is developed to optimize social and fiscal sustainable operation of a feeder bus system considering realistic network and heterogeneous demand. The objective total profit is a nonlinear, mixed integer function, which is maximized by optimizing the number of stops, headway, and fare. The stops are located which maximize the ridership. The demand elasticity for the bus service is dependent on passengers' access distance, wait time, in-vehicle time, and fare. An optimization algorithm is developed to search for the optimal solution that maximizes the profit. The modeling approach is applied to planning a bus transit system within Woodbridge, New Jersey. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.176" xmlns="http://purl.org/rss/1.0/"><title>The use of demand correlation in the modeling of air carrier departure delays as first-order autoregressive random processes</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.176</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">The use of demand correlation in the modeling of air carrier departure delays as first-order autoregressive random processes</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">John H. Mott</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-04-28T01:05:30.80378-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.176</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.176</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.176</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="atr176-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>A method for modeling air carrier departure delays at commercial-service airports as autoregressive random processes is presented. This method employs the correlation of <em>a priori</em> demand data to significantly reduce prediction error in the optimal least-squares estimator for additive white noise. The reduction factor of the prediction error is demonstrated to be on the order of 10<sup>2</sup> over that of the unbiased estimator. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>A method for modeling air carrier departure delays at commercial-service airports as autoregressive random processes is presented. This method employs the correlation of a priori demand data to significantly reduce prediction error in the optimal least-squares estimator for additive white noise. The reduction factor of the prediction error is demonstrated to be on the order of 102 over that of the unbiased estimator. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.166" xmlns="http://purl.org/rss/1.0/"><title>Comparison of pedestrian trip generation models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.166</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Comparison of pedestrian trip generation models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Nam Seok Kim, Yusak O. Susilo</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-02-11T03:59:26.456957-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.166</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.166</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.166</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Using Poisson regression and negative binomial regression, this paper presents an empirical comparison of four different regression models for the estimation of pedestrian demand at the regional level and finds the most appropriate model with reference to the National Household Travel Survey (NHTS) 2001 data for the Baltimore (USA) region. The results show that Poisson regression seems to be more appropriate for pedestrian trip generation modeling in terms of <em>χ</em><sup>2</sup> ratio test, Pseudo <em>R</em><sup>2</sup>, and Akaike's information criterion (AIC). However, <em>R</em><sup>2</sup> based on deviance residuals and estimated log-likelihood value at convergence confirmed the empirical studies that negative binomial regression is more appropriate for the over-dispersed dependent variable than Poisson regression. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Using Poisson regression and negative binomial regression, this paper presents an empirical comparison of four different regression models for the estimation of pedestrian demand at the regional level and finds the most appropriate model with reference to the National Household Travel Survey (NHTS) 2001 data for the Baltimore (USA) region. The results show that Poisson regression seems to be more appropriate for pedestrian trip generation modeling in terms of χ2 ratio test, Pseudo R2, and Akaike's information criterion (AIC). However, R2 based on deviance residuals and estimated log-likelihood value at convergence confirmed the empirical studies that negative binomial regression is more appropriate for the over-dispersed dependent variable than Poisson regression. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.173" xmlns="http://purl.org/rss/1.0/"><title>Solving the logistic problems with optimal resource assignment using fuzzy logic methods</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.173</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Solving the logistic problems with optimal resource assignment using fuzzy logic methods</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Miha Moškon, Štefan Novak, Marino Medeot, Iztok Lebar Bajec, Nikolaj Zimic, Miha Mraz</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-02-11T03:54:18.318806-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.173</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.173</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.173</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Fuzzy approach of optimal resource assignment regarding the given demands in the scope of transportation will be presented in the article. The basis of the research is the crisp solution which is also presented in the article. The basic solution was upgraded in order to be able to handle vaguely (i.e. fuzzily) defined requirements and resource properties. The optimal resource configuration is calculated with the aid of Hungarian algorithm which uses the data calculated with the fuzzy methods for its inputs. The approach described is presented on the example of a military convoy formation. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Fuzzy approach of optimal resource assignment regarding the given demands in the scope of transportation will be presented in the article. The basis of the research is the crisp solution which is also presented in the article. The basic solution was upgraded in order to be able to handle vaguely (i.e. fuzzily) defined requirements and resource properties. The optimal resource configuration is calculated with the aid of Hungarian algorithm which uses the data calculated with the fuzzy methods for its inputs. The approach described is presented on the example of a military convoy formation. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.167" xmlns="http://purl.org/rss/1.0/"><title>Integrated fuzzy signal and ramp-metering at a diamond interchange</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.167</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Integrated fuzzy signal and ramp-metering at a diamond interchange</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">V.C. Pham, F. Alam, J. Potgieter, F.C. Fang, W.L. Xu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-02-09T00:04:09.344463-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.167</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.167</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.167</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>We propose a fuzzy logic control for the integrated signal operation of a diamond interchange and its ramp meter, to improve traffic flows on surface streets and motorway. This fuzzy logic diamond interchange (FLDI) comprises of three modules: fuzzy phase timing (FPT) module that controls the green time extension of the current phase, phase logic selection (PLS) module that decides the next phase based on the pre-defined phase sequence or phase logic and, fuzzy ramp-metering (FRM) module that determines the cycle time of the ramp meter based on current traffic volumes and conditions of the surface streets and the motorways. The FLDI is implemented in Advanced Interactive Microscopic Simulator for Urban and Non-Urban Network Version 6 (AIMSUN 6), and compared with the traffic actuated signal control. Simulation results show that the FLDI outperforms the traffic-actuated models with lower system total travel time, average delay, and improvements in downstream average speed and average delay. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>We propose a fuzzy logic control for the integrated signal operation of a diamond interchange and its ramp meter, to improve traffic flows on surface streets and motorway. This fuzzy logic diamond interchange (FLDI) comprises of three modules: fuzzy phase timing (FPT) module that controls the green time extension of the current phase, phase logic selection (PLS) module that decides the next phase based on the pre-defined phase sequence or phase logic and, fuzzy ramp-metering (FRM) module that determines the cycle time of the ramp meter based on current traffic volumes and conditions of the surface streets and the motorways. The FLDI is implemented in Advanced Interactive Microscopic Simulator for Urban and Non-Urban Network Version 6 (AIMSUN 6), and compared with the traffic actuated signal control. Simulation results show that the FLDI outperforms the traffic-actuated models with lower system total travel time, average delay, and improvements in downstream average speed and average delay. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.170" xmlns="http://purl.org/rss/1.0/"><title>Evaluating long-distance travel patterns in Israel by tracking cellular phone positions</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.170</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Evaluating long-distance travel patterns in Israel by tracking cellular phone positions</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Shlomo Bekhor, Yehoshua Cohen, Charles Solomon</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-02-09T00:03:50.861659-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.170</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.170</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.170</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Long-distance trips are generally under-reported in typical household surveys, because of relative low frequency of these trips. This paper proposes to utilize location data from cellular phone systems in order to study long-distance travel patterns. The proposed approach allows passive data collection on many travelers over a long period of time at low costs. The paper presents the results of a study that applies cellular phone technology to assess trips at the national level. The method was specifically designed to capture long distance trips, as part of the development of a national demand model conducted for the Economics and Planning Department of the Israel Ministry of Transport. The method allows the construction of origin–destination tables directly from the cellular phone positions. The paper presents selected results to illustrate the potential of the method for transportation planning and analysis. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Long-distance trips are generally under-reported in typical household surveys, because of relative low frequency of these trips. This paper proposes to utilize location data from cellular phone systems in order to study long-distance travel patterns. The proposed approach allows passive data collection on many travelers over a long period of time at low costs. The paper presents the results of a study that applies cellular phone technology to assess trips at the national level. The method was specifically designed to capture long distance trips, as part of the development of a national demand model conducted for the Economics and Planning Department of the Israel Ministry of Transport. The method allows the construction of origin–destination tables directly from the cellular phone positions. The paper presents selected results to illustrate the potential of the method for transportation planning and analysis. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.162" xmlns="http://purl.org/rss/1.0/"><title>A fuel tankering model applied to a domestic airline network</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.162</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A fuel tankering model applied to a domestic airline network</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">José Alexandre Tavares Guerreiro Fregnani, Carlos Müller, Anderson Ribeiro Correia</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-02-09T00:03:03.627761-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.162</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.162</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.162</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a linear programming model designed to determine the optimum fuel loading quantities along a route network for a Brazilian domestic airline. Assuming that there are no volume purchase or storage capacity restrictions on each station, the analysis is carried out for one aircraft on one day of its schedule. Results are extrapolated for a monthly and yearly basis. Through the proposed model, it is seen that such a fuel tankering technique leads to a 5% economical saving, but produces a 1% additional fuel burn. A discussion on the environmental impact for this procedure is also proposed. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper presents a linear programming model designed to determine the optimum fuel loading quantities along a route network for a Brazilian domestic airline. Assuming that there are no volume purchase or storage capacity restrictions on each station, the analysis is carried out for one aircraft on one day of its schedule. Results are extrapolated for a monthly and yearly basis. Through the proposed model, it is seen that such a fuel tankering technique leads to a 5% economical saving, but produces a 1% additional fuel burn. A discussion on the environmental impact for this procedure is also proposed. Copyright © 2011 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1230" xmlns="http://purl.org/rss/1.0/"><title>Special issue on public transport systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1230</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Special issue on public transport systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">S. C. Wirasinghe</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-03T21:25:47.395566-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1230</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1230</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1230</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Editorial</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">247</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">248</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[]]></content:encoded><description/></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1200" xmlns="http://purl.org/rss/1.0/"><title>A method to estimate the historical US air travel demand</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1200</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A method to estimate the historical US air travel demand</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tao Li, Hojong Baik, Antonio A. Trani</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-28T01:37:34.923149-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1200</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1200</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1200</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">249</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">265</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The complete historical US air travel demand is not available to the general public. In this paper, we propose a route-based optimization model to estimate the historical US air travel demand. We show that the distribution of estimated demand follows a logit model. An iterative solution algorithm is proposed to solve the optimization model. The route utility is designed as a function of route characteristics. A feedback-adjustment scheme is proposed to estimate the model coefficients in the route utility function. In the numerical example, we apply our method to estimate the US air travel demand in the year 1995. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

The complete historical US air travel demand is not available to the general public. In this paper, we propose a route-based optimization model to estimate the historical US air travel demand. We show that the distribution of estimated demand follows a logit model. An iterative solution algorithm is proposed to solve the optimization model. The route utility is designed as a function of route characteristics. A feedback-adjustment scheme is proposed to estimate the model coefficients in the route utility function. In the numerical example, we apply our method to estimate the US air travel demand in the year 1995. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1188" xmlns="http://purl.org/rss/1.0/"><title>Geographic information system-system dynamics procedure for bus rapid transit ridership estimation</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1188</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Geographic information system-system dynamics procedure for bus rapid transit ridership estimation</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Luis David Galicia, Ruey Long Cheu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-23T04:54:36.774361-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1188</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1188</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1188</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">266</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">280</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a two-step procedure for estimating the total daily ridership (TDR) of a new bus rapid transit (BRT) route that runs along a corridor without a competing regular bus service. The first step of the procedure uses the Geographic Information System-Business Analyst desktop to analyze and extract the total population, employed population, housing units within ¼ mile and ¼ to ½ mile from the BRT stations in the base year, and their respective annual growth rates. These values are then used as inputs into the second step. The second step of the procedure uses a simulation model constructed by the system dynamics approach. This simulation model, which embeds the known relationships between the demographic variables and proposed BRT system's infrastructure and operational features, initially estimates the TDR of the base year. Simulation is then performed to estimate the TDR from the base year until a future year defined by the user. The two-step procedure has been validated with actual demographic and ridership data from the Las Vegas MAX BRT line and the Los Angeles Orange Line, respectively. The procedure has also been applied to the proposed BRT route along Mesa St. in El Paso, Texas, as a case study. The two-step procedure offers a new and relatively simple approach that complements the three known BRT ridership estimation methods currently acceptable by the U.S. Federal Transit Administration. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper presents a two-step procedure for estimating the total daily ridership (TDR) of a new bus rapid transit (BRT) route that runs along a corridor without a competing regular bus service. The first step of the procedure uses the Geographic Information System-Business Analyst desktop to analyze and extract the total population, employed population, housing units within ¼ mile and ¼ to ½ mile from the BRT stations in the base year, and their respective annual growth rates. These values are then used as inputs into the second step. The second step of the procedure uses a simulation model constructed by the system dynamics approach. This simulation model, which embeds the known relationships between the demographic variables and proposed BRT system's infrastructure and operational features, initially estimates the TDR of the base year. Simulation is then performed to estimate the TDR from the base year until a future year defined by the user. The two-step procedure has been validated with actual demographic and ridership data from the Las Vegas MAX BRT line and the Los Angeles Orange Line, respectively. The procedure has also been applied to the proposed BRT route along Mesa St. in El Paso, Texas, as a case study. The two-step procedure offers a new and relatively simple approach that complements the three known BRT ridership estimation methods currently acceptable by the U.S. Federal Transit Administration. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.209" xmlns="http://purl.org/rss/1.0/"><title>A stochastic multi-period investment selection model to optimize strategic railway capacity planning</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.209</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A stochastic multi-period investment selection model to optimize strategic railway capacity planning</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yung-Cheng Lai, Mei-Cheng Shih</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-12T23:19:15.433334-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.209</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.209</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.209</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">281</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">296</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>North American Freight Railroads are approaching the limits of practical capacity because of substantial future demand. In this research, we develop a Stochastic Multi-period Investment Selection Model (S-MISM) to assist railroads best allocate their capital investments in the long-term strategic capacity planning process. The novel optimization framework uses stochastic programming and Benders decomposition and provides a means to cope with unfulfilled demand and demand uncertainty in a long-term multi-period investment selection problem. S-MISM can determine which portions of a rail network need to be upgraded with what kind of expansion options at each defined period in the planning horizon. Experimental results show that the inclusion of demand uncertainty results in a better and more robust capacity plan. Using this decision support tool will help railroads maximize their return from capacity expansion projects and minimize the risk in strategic capacity planning subject to demand uncertainty. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

North American Freight Railroads are approaching the limits of practical capacity because of substantial future demand. In this research, we develop a Stochastic Multi-period Investment Selection Model (S-MISM) to assist railroads best allocate their capital investments in the long-term strategic capacity planning process. The novel optimization framework uses stochastic programming and Benders decomposition and provides a means to cope with unfulfilled demand and demand uncertainty in a long-term multi-period investment selection problem. S-MISM can determine which portions of a rail network need to be upgraded with what kind of expansion options at each defined period in the planning horizon. Experimental results show that the inclusion of demand uncertainty results in a better and more robust capacity plan. Using this decision support tool will help railroads maximize their return from capacity expansion projects and minimize the risk in strategic capacity planning subject to demand uncertainty. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1203" xmlns="http://purl.org/rss/1.0/"><title>Development of a transfer-cost-based logit assignment model for the Beijing rail transit network using automated fare collection data</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1203</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Development of a transfer-cost-based logit assignment model for the Beijing rail transit network using automated fare collection data</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bingfeng Si, Ming Zhong, Jianfeng Liu, Ziyou Gao, Jianjun Wu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-12T01:33:16.611833-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1203</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1203</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1203</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">297</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">318</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Literature review indicates that little is known about traveler behavior, such as transfer and route choices, in large transit systems because of the number of alternative routes involved and lack of empirical data. Even though many transit route assignment models have been developed and ample automated fare collection data have been collected, nearly no study has quantified how accurate resulting flow assignments are, especially for transfer flows. However, as a multi-stakeholder system, it is essential to estimate passenger flows over the Beijing rail transit network for revenue sharing and daily management/operation purpose. In this paper, major factors (including total travel time and transfer cost) that influence passenger flow pattern in the Beijing rail transit network are considered in a logit-based network flow assignment model. Specifically, a full transfer cost function, including transfer walking time, vehicle waiting time, and a penalty to additional transfers, is proposed to better simulate passengers' transfer behaviors. A generalized cost function for urban rail transit network is presented, and the corresponding route choice behavior of travelers is analyzed. An improved logit-based model is then presented for solving this network flow assignment problem. The depth-first method is used to search for “effective paths” among all O–D pairs. The average errors of estimated transfer flows from the proposed assignment model, which is proven to be more realistic in searching a set of effective paths, are below 20%. The results indicate that the models being developed in this study are capable of reasonably reproducing passengers' transfer and route choices and thus helpful for understanding the transfer behaviors of passengers of large rail transit networks. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Literature review indicates that little is known about traveler behavior, such as transfer and route choices, in large transit systems because of the number of alternative routes involved and lack of empirical data. Even though many transit route assignment models have been developed and ample automated fare collection data have been collected, nearly no study has quantified how accurate resulting flow assignments are, especially for transfer flows. However, as a multi-stakeholder system, it is essential to estimate passenger flows over the Beijing rail transit network for revenue sharing and daily management/operation purpose. In this paper, major factors (including total travel time and transfer cost) that influence passenger flow pattern in the Beijing rail transit network are considered in a logit-based network flow assignment model. Specifically, a full transfer cost function, including transfer walking time, vehicle waiting time, and a penalty to additional transfers, is proposed to better simulate passengers' transfer behaviors. A generalized cost function for urban rail transit network is presented, and the corresponding route choice behavior of travelers is analyzed. An improved logit-based model is then presented for solving this network flow assignment problem. The depth-first method is used to search for “effective paths” among all O–D pairs. The average errors of estimated transfer flows from the proposed assignment model, which is proven to be more realistic in searching a set of effective paths, are below 20%. The results indicate that the models being developed in this study are capable of reasonably reproducing passengers' transfer and route choices and thus helpful for understanding the transfer behaviors of passengers of large rail transit networks. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1207" xmlns="http://purl.org/rss/1.0/"><title>A methodology for schedule-based paths recommendation in multimodal public transportation networks</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1207</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A methodology for schedule-based paths recommendation in multimodal public transportation networks</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">David Canca, Alejandro Zarzo, Pedro L. González-R, Eva Barrena, Encarnación Algaba</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-10T02:07:14.990639-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1207</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1207</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1207</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">319</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">335</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper analyzes the problem of intermodal itineraries recommendation in interurban networks where different public transportation modes, several companies, time, and capacity constraints, as well as seat booking, are considered. The inherent network optimization problem is first modeled for a generic user request, and then a solving method that makes use of a network graph transformation is proposed. For each request, this solving method is based on pruning the user-specific time–space graph, followed by the application of a <em>k</em>-shortest path algorithm. Moreover, in order to build on-demand real-time itineraries recommendations, the algorithm has been embedded in a Web client–server to which users ask for trip recommendations by Internet or mobile phone. Finally, as an illustration, the proposed approach has been tested on the Andalusia main transportation network. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper analyzes the problem of intermodal itineraries recommendation in interurban networks where different public transportation modes, several companies, time, and capacity constraints, as well as seat booking, are considered. The inherent network optimization problem is first modeled for a generic user request, and then a solving method that makes use of a network graph transformation is proposed. For each request, this solving method is based on pruning the user-specific time–space graph, followed by the application of a k-shortest path algorithm. Moreover, in order to build on-demand real-time itineraries recommendations, the algorithm has been embedded in a Web client–server to which users ask for trip recommendations by Internet or mobile phone. Finally, as an illustration, the proposed approach has been tested on the Andalusia main transportation network. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1206" xmlns="http://purl.org/rss/1.0/"><title>Users' views on current and future real-time bus information systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1206</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Users' views on current and future real-time bus information systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Md. Matiur Rahman, S.C. Wirasinghe, Lina Kattan</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-24T01:11:30.116917-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1206</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1206</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1206</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">336</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">354</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Actual bus arrival times often deviate from the posted schedules due to a variety of factors; hence, providing real-time bus information can improve service quality. This study examined users' views and perceptions towards the possible future availability of real-time bus information systems in Calgary, Alberta, Canada. A face-to-face paper-based survey was conducted to collect the data. Various statistics and methods, such as ANOVA tests, ordinal regression and binary logistic regression, were used to analyse the data. The results showed that 35.5% of the respondents either agreed or strongly agreed that the current information system deterred or discouraged them from using public transport. In addition, a significant portion of respondents (82%) stated that they board the first arriving bus, even though it may take a longer in-vehicle time to complete the trip, because of uncertainty regarding the arrival time of the next alternative bus with a shorter in-vehicle travel time. A majority of the respondents (88%) indicated that real-time transit information would not be necessary if bus headways are less than 10 minutes. As for preferred information content, information on the next bus arrival time received the highest priority. In general, Light Rail Transit (LRT) users showed the least interest in real-time information. Women, younger riders, current car users and infrequent transit users showed a higher interest in real-time information. Display boards at bus stops were perceived to be the most preferred medium to get en-route information, whereas a website/call centre was stated to be the preferred media for pre-trip information. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

Actual bus arrival times often deviate from the posted schedules due to a variety of factors; hence, providing real-time bus information can improve service quality. This study examined users' views and perceptions towards the possible future availability of real-time bus information systems in Calgary, Alberta, Canada. A face-to-face paper-based survey was conducted to collect the data. Various statistics and methods, such as ANOVA tests, ordinal regression and binary logistic regression, were used to analyse the data. The results showed that 35.5% of the respondents either agreed or strongly agreed that the current information system deterred or discouraged them from using public transport. In addition, a significant portion of respondents (82%) stated that they board the first arriving bus, even though it may take a longer in-vehicle time to complete the trip, because of uncertainty regarding the arrival time of the next alternative bus with a shorter in-vehicle travel time. A majority of the respondents (88%) indicated that real-time transit information would not be necessary if bus headways are less than 10 minutes. As for preferred information content, information on the next bus arrival time received the highest priority. In general, Light Rail Transit (LRT) users showed the least interest in real-time information. Women, younger riders, current car users and infrequent transit users showed a higher interest in real-time information. Display boards at bus stops were perceived to be the most preferred medium to get en-route information, whereas a website/call centre was stated to be the preferred media for pre-trip information. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.193" xmlns="http://purl.org/rss/1.0/"><title>Railway passenger train delay prediction via neural network model</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.193</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Railway passenger train delay prediction via neural network model</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Masoud Yaghini, Mohammad M. Khoshraftar, Masoud Seyedabadi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-03T01:54:16.019946-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.193</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.193</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.193</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">355</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">368</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The aim of this paper is to present an artificial neural network model with high accuracy to predict the delay of passenger trains in Iranian Railways. In the proposed model, we use three different methods to define inputs including normalized real number, binary coding, and binary set encoding inputs. One of the great challenges of using neural network is how to design a superior network for a specific task. To find an appropriate architecture, three different strategies called quick method, dynamic method, and multiple method are investigated. To prevent the proposed model from overfitting in modeling, according to cross validation, we divide existing passenger train delays data set into three subsets called training set, validation set, and testing set. To evaluate the proposed model, we compare the results of three different data input methods and three different architectures with each other and with some common prediction methods such as decision tree and multinomial logistic regression. For comparing different neural networks, we consider training time and accuracy of neural networks on test data set and network size. In addition, for comparing neural networks with other well-known prediction methods, we consider training time and the accuracy of neural network on test data sets. To make a fair comparison among all models, we sketch a time-accuracy graph. The results revealed that the proposed model has higher accuracy. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

The aim of this paper is to present an artificial neural network model with high accuracy to predict the delay of passenger trains in Iranian Railways. In the proposed model, we use three different methods to define inputs including normalized real number, binary coding, and binary set encoding inputs. One of the great challenges of using neural network is how to design a superior network for a specific task. To find an appropriate architecture, three different strategies called quick method, dynamic method, and multiple method are investigated. To prevent the proposed model from overfitting in modeling, according to cross validation, we divide existing passenger train delays data set into three subsets called training set, validation set, and testing set. To evaluate the proposed model, we compare the results of three different data input methods and three different architectures with each other and with some common prediction methods such as decision tree and multinomial logistic regression. For comparing different neural networks, we consider training time and accuracy of neural networks on test data set and network size. In addition, for comparing neural networks with other well-known prediction methods, we consider training time and the accuracy of neural network on test data sets. To make a fair comparison among all models, we sketch a time-accuracy graph. The results revealed that the proposed model has higher accuracy. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1213" xmlns="http://purl.org/rss/1.0/"><title>A rule-based model for integrated operation of bus priority signal timings and traveling speed</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1213</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A rule-based model for integrated operation of bus priority signal timings and traveling speed</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Wanjing Ma, Yue Liu, Baoxin Han</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-10-24T02:39:00.912963-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/atr.1213</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/atr.1213</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Fatr.1213</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">369</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">383</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper focuses on integrated operation of signal timings and bus speed to provide priority to buses at isolated intersections when real-time adjustment of bus speed is available (e.g., through Connected Vehicle). Most previous work assumes that the speed of a bus is given as an exogenous input and focuses merely on optimization of signal timings. The bus-passing window and the bus-arriving window are defined with respect to the real-time signal status and bus arrivals to capture explicitly the interaction between bus speed and transit priority signal timings. A set of integrated operational rules is developed on the basis of these windows for buses with and without schedule deviation with the objective of minimizing bus schedule deviation, bus fuel consumption, and emissions. Four subsets are included: impacts of preceding bus analysis rules, priority requests generation rules, priority passing rules, and speed adjustment without priority rules. A VISSIM-based simulation platform was designed and used for simulating and evaluating the proposed method. Extensive experimental analyses have shown that the proposed rule-based integrated operational approach outperforms the no priority and conventional priority strategies (no bus speed adjustment) in terms of reducing bus delays, improving schedule adherence, saving energy, reducing emission, and minimizing the impacts on general traffic. The sensitivity analysis has further demonstrated the potential of the proposed approach to be applied in real-time bus priority control system under different levels of transit and traffic demand. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper focuses on integrated operation of signal timings and bus speed to provide priority to buses at isolated intersections when real-time adjustment of bus speed is available (e.g., through Connected Vehicle). Most previous work assumes that the speed of a bus is given as an exogenous input and focuses merely on optimization of signal timings. The bus-passing window and the bus-arriving window are defined with respect to the real-time signal status and bus arrivals to capture explicitly the interaction between bus speed and transit priority signal timings. A set of integrated operational rules is developed on the basis of these windows for buses with and without schedule deviation with the objective of minimizing bus schedule deviation, bus fuel consumption, and emissions. Four subsets are included: impacts of preceding bus analysis rules, priority requests generation rules, priority passing rules, and speed adjustment without priority rules. A VISSIM-based simulation platform was designed and used for simulating and evaluating the proposed method. Extensive experimental analyses have shown that the proposed rule-based integrated operational approach outperforms the no priority and conventional priority strategies (no bus speed adjustment) in terms of reducing bus delays, improving schedule adherence, saving energy, reducing emission, and minimizing the impacts on general traffic. The sensitivity analysis has further demonstrated the potential of the proposed approach to be applied in real-time bus priority control system under different levels of transit and traffic demand. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item></rdf:RDF>